Adaptive Steiner tree balancing in distributed algorithm for multicast connection setup

Abstract

An algorithm for multicast connection setup based on the distributed Takahashi-Matsuyama algorithm is reviewed. Additional level of unexplored parallelism that allows better time performance has been identified. The described improvement is based on the adaptive balancing of the growing Steiner tree during the connection construction process. A simulation study on the time complexity indicates a speedup with regard to the original algorithm as well as to our earlier improvement.