Adaptive multicast routing in ATM networks

Shyi Chang Yang*, Ren Hung Hwang

*此作品的通信作者

研究成果: Paper同行評審

摘要

In this paper, we study the multicast routing problem in ATM 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 first proposed two approaches, namely, the Markov Decision Process-based (MDP) and Maximum Free residual Capacity-based (MFC) approaches, for defining link costs. We then developed three heuristic algorithms for finding near optimal multicast trees. Our simulation results indicate algorithms that estimating link costs based on the MDP approach yield better performance than those that based on the MFC approach. Among the three multicast routing algorithms that use MDP approach for estimating link costs, the algorithm that treats a multicast call as a collection of multiple point-to-point calls yields the worst performance while the algorithm that based on the genetic algorithm yields the best performance.

原文English
頁面1018-1023
頁數6
出版狀態Published - 1998
事件Proceedings of the IEEE GLOBECOM 1998 - The Bridge to the Global Integration - Sydney, NSW, Aust
持續時間: 8 11月 199812 11月 1998

Conference

ConferenceProceedings of the IEEE GLOBECOM 1998 - The Bridge to the Global Integration
城市Sydney, NSW, Aust
期間8/11/9812/11/98

指紋

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

引用此