Adaptive Multicast Routing in ATM Ntworks

• Main Authors: Yang, shyi-chang, 楊錫昌
• Other Authors: Ren-Hung Hwang
• Format: Others
• Language: zh-TW
• Published: 1997
• Online Access: http://ndltd.ncl.edu.tw/handle/80600104834616854489

碩士 === 國立中正大學 === 資訊工程學系 === 85 === In this thesis, 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 beenmade for the definition of link costs and evaluating the performance ofmulticast routing algorithm from the network revenue point of view.Therefore, in this thesis, we first proposed two approaches,namely, the MDP and LLR approaches, for defininglink costs. Since the Steiner tree probelm has been shown to be NP-complete,we then developed four heuristic algorithms for finding near optimal multicasttrees. Based on the link costs, we have also combine the call admissionfunction into our routing algorithm. Performace of these routing algorithmsis evaluated via simulations on a 20-node random graph. Our simulationresults indicate that estimating link costs based on the MDP approachyields better performance than based on the LLR approach.Among the four multicast routing algorithms that use MDP approach forestimating link costs, thealgorithm that treats a multicast call as a collection of multiplepoint-to-point calls yields the worse performance while the other threealgorithms yield almost the same performance.