Adaptive Steiner tree balancing in distributed algorithm for multicast connection setup
暂无分享,去创建一个
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.
[1] Pawel Winter,et al. Steiner problem in networks: A survey , 1987, Networks.
[2] V. J. Rayward-Smith,et al. The computation of nearly minimal Steiner trees in graphs , 1983 .
[3] Joze Rugelj,et al. Distributed multicast routing mechanism for global point-to-point networks , 1994, Proceedings of Twentieth Euromicro Conference. System Architecture and Integration.
[4] Michael Z. Spivey,et al. The Z notation , 1989 .