Share Email Print

Proceedings Paper

Adaptive multicast routing in broadband networks
Author(s): Ren-Hung Hwang; Youn-Chen Sun
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

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.

Paper Details

Date Published: 7 October 1998
PDF: 11 pages
Proc. SPIE 3530, Performance and Control of Network Systems II, (7 October 1998); doi: 10.1117/12.325880
Show Author Affiliations
Ren-Hung Hwang, National Chung Cheng Univ. (Taiwan)
Youn-Chen Sun, National Chung Cheng Univ. (Taiwan)

Published in SPIE Proceedings Vol. 3530:
Performance and Control of Network Systems II
Wai Sum Lai; Robert B. Cooper, Editor(s)

© SPIE. Terms of Use
Back to Top