A routing algorithm for dynamic multicast trees with end-to-end path length control

The new Path Length Control (PLC) algorithm establishes and maintains multicast trees which maximize the bandwidth to be shared by multiple receivers and which satisfy the maximum path length bounds for each receiver. The PLC algorithm can be implemented as a distributed algorithm, can tradeoff end-to-end delay and bandwidth consumption, and can be implemented for polynomial time execution. Analysis and simulation show that (a) the PLC algorithm generates multicast trees which consume less bandwidth than those generated by the SPT algorithm while guaranteeing the same shortest path length and (b) consume less bandwidth than trees generated by the Greedy algorithm with only a moderate increase in path length. The PLC algorithm is more flexible and has a lower cost than a combined SPT and Greedy algorithm. Key Words Multicast, dynamic multicast, routing algorithm, path length control 

• Type: Journal
• Year: 2000
• Where: COMCOM
• Authors: Hiroshi Fujinoki, Kenneth J. Christensen
• Keywords: Algorithm, COMCOM 2000, Path Length, PLC Algorithm