The New Shortest Best Path Tree (SBPT) Algorithm for Dynamic Multicast Trees

This paper presents the new Shortest Best Path Tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the bandwidth to be shared by multiple receivers and simultaneously guarantee the shortest paths for each receiver node. The SBPT algorithm is a distributed algorithm with cost in the same order as the sum of the shortest path tree (SPT) algorithm and the Greedy algorithm. The SBPT algorithm reduces bandwidth consumption by utilizing partial paths already established for other multicast receiver nodes. The SBPT algorithm finds such partial paths when multiple shortest paths exist. Simulation experiments comparing the SBPT and SPT algorithms show that the SBPT algorithm reduces bandwidth consumption by 5% to 17% when node utilization is greater than approximately 25% and always achieves the same shortest path lengths.

• Type: Conference
• Year: 1999
• Where: LCN
• Authors: Hiroshi Fujinoki, Kenneth J. Christensen
• Keywords: Algorithm, Computer Networks, LCN 1999, SBPT Algorithm, Shortest Path