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

Authors:
Hiroshi Fujinoki;Kenneth J. Christensen
Affiliations:
-;-
Venue:
LCN '99 Proceedings of the 24th Annual IEEE Conference on Local Computer Networks
Year:
1999

Citing 0
Cited 4

A survey of combinatorial optimization problems in multicast routing

Computers and Operations Research
A modified pulse coupled neural network for shortest-path problem

Neurocomputing
The directed reverse path join (DRPJ) protocol: an efficient multicast routing protocol

Computer Communications
A novel neural network method for shortest path tree computation

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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) and Greedy algorithms. 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.