A rearrangeable algorithm for the construction delay-constrained dynamic multicast trees
暂无分享,去创建一个
[1] Anujan Varma,et al. Distributed algorithms for multicast path setup in data networks , 1996, TNET.
[2] Anees Shaikh,et al. Destination-Driven Routing for Low-Cost Multicast , 1997, IEEE J. Sel. Areas Commun..
[3] Bernard M. Waxman,et al. Performance evaluation of multipoint routing algorithms , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.
[4] Anujan Varma,et al. ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm , 1997, IEEE J. Sel. Areas Commun..
[5] Makoto Imase,et al. Dynamic Steiner Tree Problem , 1991, SIAM J. Discret. Math..
[6] Dana S. Richards,et al. Steiner tree problems , 1992, Networks.
[7] Stephen E. Deering,et al. Multicast routing in datagram internetworks and extended LANs , 1990, TOCS.
[8] V. J. Rayward-Smith,et al. The computation of nearly minimal Steiner trees in graphs , 1983 .
[9] Heesang Lee,et al. An efficient multicast routing algorithm for delay-sensitive applications with dynamic membership , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.
[10] Walid Dabbous,et al. Multipoint Communication: A Survey of Protocols, Functions, and Mechanisms , 1997, IEEE J. Sel. Areas Commun..
[11] George C. Polyzos,et al. Multicast routing for multimedia communication , 1993, TNET.
[12] Ian M. Leslie,et al. How bad is naive multicast routing? , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.
[13] Jon Crowcroft,et al. Core Based Trees (CBT) An Architecture for Scalable Inter-Domain Multicast Routing , 1993, SIGCOMM 1993.
[14] Deborah Estrin,et al. The PIM architecture for wide-area multicast routing , 1996, TNET.
[15] Paul Francis,et al. Core based trees (CBT) , 1993, SIGCOMM 1993.
[16] Jeffery R. Westbrook,et al. Greedy Algorithms for the On-Line Steiner Tree and Generalized Steiner Problems , 1993, WADS.
[17] BERNARD M. WAXMAN,et al. Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..
[18] Hwa-Chun Lin,et al. VTDM-a dynamic multicast routing algorithm , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.
[19] Pawel Winter,et al. Steiner problem in networks: A survey , 1987, Networks.
[20] K. Bharath-Kumar,et al. Routing to Multiple Destinations in Computer Networks , 1983, IEEE Trans. Commun..
[21] C. Siva Ram Murthy,et al. Preferred link based delay-constrained least-cost routing in wide area networks , 1998, Comput. Commun..
[22] S. Ramanathan,et al. Multicast tree generation in networks with asymmetric links , 1996, TNET.
[23] Graham Knight,et al. Comparison of dynamic multicast routing algorithms for wide-area packet switched (asynchronous transfer mode) networks , 1995, Proceedings of INFOCOM'95.
[24] C. Siva Ram Murthy,et al. Algorithms for delay-constrained low-cost multicast tree construction , 1998, Comput. Commun..
[25] C. Siva Ram Murthy,et al. A rearrangeable algorithm for the construction of delay-constrained dynamic multicast trees , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).
[26] Douglas S. Reeves,et al. A distributed algorithm for delay-constrained unicast routing , 2000, TNET.
[27] C. Edward Chow,et al. On multicast path finding algorithms , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.
[28] Douglas S. Reeves,et al. A distributed algorithm for delay-constrained unicast routing , 1997, Proceedings of INFOCOM '97.
[29] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .