Adaptive multicast routing in broadband networks

Ren Hung Hwang*, Youn Chen Sun

*此作品的通信作者

研究成果: Conference article同行評審

2 引文 斯高帕斯(Scopus)

摘要

In this paper, we study the multicast routing problem in broadband networks. The multicast routing problem, also known as the Steiner tree problem, has been well studied in the literature. However, less attention has been made for the definition of link costs and evaluating the performance of multicast routing algorithm from the network revenue point of view. Therefore, in this paper, we examined three approaches for defining link costs, namely, the Markov Decision Process-based (MDP), the Competitive On-Line (COL) routing-based and the Linear-based approaches. Two heuristic multicast algorithms, TMR and MSPF, were developed for investigating the performance of these approaches. We proposed a new performance metric, referred to as the fractional reward loss, to evaluate the multicast routing algorithm. Performance of the multicast algorithms under different link cost functions was evaluated via simulations on a 20-node random graph. Our simulation results indicated that the way of defining link costs affects the performance of the multicast routing algorithms significantly and the best performance is yielded when using the MDP-based link costs.

原文English
頁(從 - 到)369-379
頁數11
期刊Proceedings of SPIE - The International Society for Optical Engineering
3530
DOIs
出版狀態Published - 1998
事件Performance and Control of Network Systems II - Boston, MA, United States
持續時間: 2 11月 19984 11月 1998

指紋

深入研究「Adaptive multicast routing in broadband networks」主題。共同形成了獨特的指紋。

引用此