A Fast Low-Cost Shortest Path Tree Algorithm

Low-Cost Shortest Path Tree is a commonly-used multicast tree type, which can minimize the end-to-end delay and at the same time reduce the bandwidth requirement if possible. Based on the low-cost shortest path tree algorithm DDSP (destination-driven shortest path) and through improving on the search procedure, a Fast Low-cost Shortest Path Tree (FLSPT) algorithm is presented in this paper. The Shortest Path Tree constructed by the FLSPT algorithm is the same as that constructed by the DDSP algorithm, but its computation complexity is lower than that of the DDSP algorithm. The simulation results with random network models show that FLSPT algorithm is

[1]  Wang Ming.  Strategy of Constructing Minimum Cost Multicast Routing Tree with Delay and Delay Variation Bounds , 2002 .

[2]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[3]  Kenneth J. Christensen,et al.  The new shortest best path tree (SBPT) algorithm for dynamic multicast trees , 1999, Proceedings 24th Conference on Local Computer Networks. LCN'99.

[4]  Anees Shaikh,et al.  Destination-Driven Routing for Low-Cost Multicast , 1997, IEEE J. Sel. Areas Commun..

[5]  H. T. Mouftah,et al.  A destination-driven shortest path tree algorithm , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[6]  Changjia Chen,et al.  A fast delay-constrained multicast routing algorithm , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[7]  Walid Dabbous,et al.  Multipoint Communication: A Survey of Protocols, Functions, and Mechanisms , 1997, IEEE J. Sel. Areas Commun..

[8]  Yang Ming.  A FAST ROUTING ALGORITHM FOR DELAY-CONSTRAINED LOW-COST MULTICAST , 2000 .