A note on distributed multicast routing in point-to-point networks

Winter, 1987, Steiner problem in networks: a survey, Networks, 17, 129, 10.1002/net.3230170203 Hwang, 1992, Steiner tree problems, Networks, 22, 55, 10.1002/net.3230220105 Jaffe, 1985, Distributed multi-destination routing: the constraints of local information, SIAM Journal of Computing, 14, 875, 10.1137/0214062 Rugelj, 1997, Distributed multicast routing in point-to-point networks, Computers and Operations Research, 24, 521, 10.1016/S0305-0548(96)00074-3 Rugelj J. Distributed multicast routing mechanism for global point-to-point networks. Proceedings of the 20th Euromicro Conference, Liverpool, UK, 1994. p. 388–95. Novak, 1994, Adaptive Steiner tree balancing in distributed algorithm for multicast connection setup, Microprocessing and Microprogramming, 40, 795, 10.1016/0165-6074(94)90042-6 Diot, 1997, Multipoint communication: a survey of protocols, functions, and mechanisms, IEEE Journal on Selected Areas in Communications, 15, 277, 10.1109/49.564128 Deering, 1996, The PIM architecture for wide-area multicast routing, IEEE/ACM Transactions on Networking, 4, 153, 10.1109/90.490743 Gelenbe, 1997, Improved neural heuristics for multicast routing, IEEE Journal on Selected Areas in Communications, 15, 147, 10.1109/49.552065 Bauer, 1996, Distributed algorithms for multicast path setup in data networks, IEEE/ACM Transactions on Networking, 4, 181, 10.1109/90.490746 Shaikh, 1997, Destination-driven routing for low-cost multicast, IEEE Journal on Selected Areas in Communications, 15, 373, 10.1109/49.564135 Sriram, 1998, Algorithms for delay-constrained low-cost multicast tree construction, Computer Communications, 21, 1693, 10.1016/S0140-3664(98)00208-4 Jia, 1999, A distributed multicast routing protocol for real-time multicast applications, Computer Networks, 31, 101, 10.1016/S0169-7552(98)00234-7 Voss, 1993, Worst-case performance of some heuristics for Steiner's problem in directed graphs, Information Processing Letters, 48, 99, 10.1016/0020-0190(93)90185-C Karp RM. Reducibility among combinatorial problems. In: Complexity of computer computations. New York: Plenum Press, 1972. p. 85–104. Voss, 1992, Steiner's problem in Graphs: Heuristic methods, Discrete Applied Mathematics, 40, 45, 10.1016/0166-218X(92)90021-2 Kompella, 1996, Optimal multicast routing with quality of service constraints, Journal of Network and Systems Management, 4, 107, 10.1007/BF02139130 Yonjun-Im, Yanghee-Choi. A distributed multicast routing algorithm for delay-sensitive applications. Proceedings of ICPADS’98 – International Conference on Parallel and Distributed Systems, 1998. p. 232–9. Takahashi, 1980, An approximate solution for the Steiner problem in graphs, Math. Japon., 24, 573 Waxman, 1988, Routing of multipoint connections, IEEE Journal on Selected Areas in Communications, 6, 1617, 10.1109/49.12889 Doar M, Leslie I. How bad is naive multicast routing. Proceedings of IEEE INFOCOM’93, 1993. p. 82–9. Spivey, 1992 Jacky, 1996