Multicast routing based on genetic algorithms

Ren Hung Hwang, Wei Yuan Do, Shyi Chang Yang

研究成果: Article同行評審

85 引文 斯高帕斯(Scopus)

摘要

Due to the advent of many new multimedia applications in high speed networks, the issue of multicast routing has become more and more important. The multicast routing problem in computer networks is also known as the Steiner tree problem which has been shown to be NP-complete. In this paper, we propose a new multicast routing algorithm based on Genetic Algorithms. To apply this algorithm to real networks, we also propose several methods for reducing the computational complexity. Computer simulations were conducted on a random graph to evaluate the performance of the proposed algorithm. Our numerical results show that the proposed algorithm is able to find a better solution than the RSR algorithm, a very promising heuristic algorithm for the Steiner tree problem proposed by Rayward-Smith. Finally, since many multimedia applications require multiple Quality of Service (QOS) constraints, such as delay, jitter, and loss probability, we also address how to extend the proposed algorithm to obtain multiple constrained multicast trees.

原文English
頁(從 - 到)885-901
頁數17
期刊Journal of Information Science and Engineering
16
發行號6
出版狀態Published - 11月 2000

指紋

深入研究「Multicast routing based on genetic algorithms」主題。共同形成了獨特的指紋。

引用此