| Summary: | 碩士 === 國立中正大學 === 資訊工程研究所 === 87 === In this thesis, 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 call admission function. Therefore, in this thesis, we examined fourapproaches for defining link costs, namely, the Markov Decision Process-based (MDP), the Competitive On-Line (COL) routing-based, the Shortest-Distance-based (SD), and the Linear-based approaches. Three heuristic multicast algorithms, RMA, TMR and MSPF, were developed for investigating the performance of these approaches. 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 both link cost function and call admission function affect the performance of the multicast routing algorithms significantly and the best performance is yielded when using the MDP-based link costs.
|
|---|
