Optimization Problems in Multicast Tree Construction

Multicasting is a technique for data routing in networks that allows multiple destinations to be addressed simultaneously. The implementation of multicasting requires, however, the solution of difficult combinatorial optimization problems. In this chapter, we discuss combinatorial issues occurring in the implementation of multicast routing, including multicast tree construction, minimization of the total message delay, center-based routing, and multicast message packing. Optimization methods for these problems are discussed and the corresponding literature reviewed. Mathematical programming as well as graph models for these problems are discussed.

[1]  Gang Feng,et al.  Efficient setup for multicast connections using tree-caching , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[2]  Sean R Eddy,et al.  What is dynamic programming? , 2004, Nature Biotechnology.

[3]  Clarence A. Ellis,et al.  Groupware: some issues and experiences , 1991, CACM.

[4]  Jon Crowcroft,et al.  Building shared trees using a one-to-many joining mechanism , 1997, CCRV.

[5]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[6]  Mikael Prytz.  On Optimization in Design of Telecommunications Networks with Multicast and Unicast Traffic , 2002 .

[7]  Stephen E. Deering,et al.  Multicast routing in datagram internetworks and extended LANs , 1990, TOCS.

[8]  Oktay Günlük,et al.  Optimal packing of group multicastings , 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.

[9]  Deborah Estrin,et al.  The PIM architecture for wide-area multicast routing , 1996, TNET.

[10]  Paul Francis,et al.  Core based trees (CBT) , 1993, SIGCOMM 1993.

[11]  Victor O. K. Li,et al.  Minimum-weight vertex cover problem for two-class resource connection graphs , 1993, Inf. Sci..

[12]  Xiaohua Jia,et al.  A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks , 1998, TNET.

[13]  Vorawut Priwan.  The Multicast Tree Based Routing for The Complete Broadcast Multipoint-to-Multipoint Communications , 1995 .

[14]  Rong-Hong Jan,et al.  Heuristic algorithms for packing of multiple-group multicasting , 2002, Comput. Oper. Res..

[15]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[16]  Robert Metcalfe,et al.  Reverse path forwarding of broadcast packets , 1978, CACM.

[17]  Mauricio G. C. Resende.  “Mobile Networks and Computing,” , 2001, J. Comb. Optim..

[18]  George C. Polyzos,et al.  The multimedia multicasting problem , 1998, Multimedia Systems.

[19]  Anujan Varma,et al.  ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm , 1997, IEEE J. Sel. Areas Commun..

[20]  Sriram Raghavan,et al.  A rearrangeable algorithm for the construction delay-constrained dynamic multicast trees , 1999, TNET.

[21]  Dana S. Richards,et al.  Steiner tree problems , 1992, Networks.

[22]  Madan Natu.  Network loading and connection problems , 1996 .

[23]  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.

[24]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[25]  Panos M. Pardalos,et al.  A parallel implementation of an asynchronous team to the point-to-point connection problem , 2003, Parallel Comput..

[26]  Quan Sun,et al.  An efficient delay-constrained multicast routing algorithm , 1998, J. High Speed Networks.

[27]  Mauricio G. C. Resende.  Multichannel Optical Networks: Theory and Practice , 2001, J. Comb. Optim..

[28]  Anees Shaikh,et al.  Destination-Driven Routing for Low-Cost Multicast , 1997, IEEE J. Sel. Areas Commun..

[29]  Carlos A. S. Oliveira,et al.  Asynchronous organizations for solving the point-to-point connection problem , 1998, Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160).

[30]  Yanghee Choi,et al.  Delay constrained distributed multicast routing algorithm , 1997, Comput. Commun..

[31]  P. M. Pardalos,et al.  Construction algorithms and approximation bounds for the streaming cache placement problem in multicast networks , 2005 .

[32]  Pawel Winter,et al.  Path-distance heuristics for the Steiner problem in undirected networks , 1992, Algorithmica.

[33]  Panos M. Pardalos,et al.  An Exact Branch and Bound Algorithm for the Steiner Problem in Graphs , 1995, COCOON.

[34]  Douglas S. Reeves,et al.  Shared multicast trees and the center selection problem: A survey , 1996 .

[35]  Ian M. Leslie,et al.  How bad is naive multicast routing? , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[36]  Jon Crowcroft,et al.  Core Based Trees (CBT) An Architecture for Scalable Inter-Domain Multicast Routing , 1993, SIGCOMM 1993.

[37]  George C. Polyzos,et al.  Multicast routing for multimedia communication , 1993, TNET.

[38]  Yoram Ofek,et al.  Adaptive real-time group multicast , 1997, Proceedings of INFOCOM '97.

[39]  Hans Eriksson,et al.  MBONE: the multicast backbone , 1994, CACM.

[40]  Panos M. Pardalos,et al.  A heuristic for the Steiner problem in graphs , 1996, Comput. Optim. Appl..

[41]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[42]  Stephen E. Deering,et al.  Distance Vector Multicast Routing Protocol , 1988, RFC.

[43]  Panos M. Pardalos,et al.  Network Design: Connectivity and Facilities Location , 1998 .

[44]  Anujan Varma,et al.  Multicast routing in point-to-point networks under constraints , 1996 .

[45]  Ellen W. Zegura,et al.  Core selection methods for multicast routing , 1995, Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95.

[46]  Deborah Estrin,et al.  An architecture for wide-area multicast routing , 1994, SIGCOMM.

[47]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[48]  Gang Feng,et al.  Efficient multicast routing with delay constraints , 1999, Int. J. Commun. Syst..

[49]  D. W. Wall.  Mechanisms for broadcast and selective broadcast , 1980 .

[50]  Rama Akkiraju,et al.  Asynchronous Teams , 2003, Handbook of Metaheuristics.

[51]  Prasant Mohapatra,et al.  QMBF: a QoS-aware multicast routing protocol , 2003, Comput. Commun..

[52]  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.

[53]  S. V. Raghavan,et al.  Survey of multicast routing algorithms and protocols , 2002 .

[54]  Thomas M. Thomas,et al.  OSPF Network Design Solutions , 2003 .

[55]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.

[56]  K. Bharath-Kumar,et al.  Routing to Multiple Destinations in Computer Networks , 1983, IEEE Trans. Commun..

[57]  Sung-Pil Hong,et al.  A fast multicast routing algorithm for delay-sensitive applications , 1997, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record.

[58]  Lin Han,et al.  Secure multicast software delivery , 2000, Proceedings IEEE 9th International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (WET ICE 2000).

[59]  H. T. Lau.  Steiner Tree Problem , 1986 .

[60]  Fouad A. Tobagi,et al.  Optimum routing of multicast streams , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[61]  Jacobus Van der Merwe,et al.  Efficient and robust streaming provisioning in VPNs , 2003, WWW '03.

[62]  C. Siva Ram Murthy,et al.  Algorithms for delay-constrained low-cost multicast tree construction , 1998, Comput. Commun..

[63]  Yoshikuni Onozato,et al.  A copy network with shared buffers for large-scale multicast ATM switching , 1993, TNET.

[64]  Anujan Varma,et al.  Degree-constrained multicasting in point-to-point networks , 1995, Proceedings of INFOCOM'95.

[65]  L. Wei,et al.  The trade-offs of multicast trees and algorithms , 1994 .

[66]  Chung-Lun Li,et al.  The point-to-point delivery and connection problems: complexity and algorithms , 1992, Discret. Appl. Math..

[67]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[68]  Leslie T. M. Berry.  Graph Theoretic Models for Multicast Communications , 1990, Comput. Networks ISDN Syst..

[69]  I. Keidar,et al.  Multimedia Multicast Transport Service for Groupware , 1996 .

[70]  S. Sabri,et al.  Video conferencing systems , 1985, Proceedings of the IEEE.

[71]  Niki Pissinou,et al.  A real-time multicast routing algorithm for multimedia applications , 1997, Comput. Commun..

[72]  Panos M. Pardalos,et al.  Subset Interconnection Designs: Generalizations of Spanning Trees and Steiner Trees , 1993 .

[73]  J. J. Garcia-Luna-Aceves,et al.  An architecture for a multimedia teleconferencing system , 1986, SIGCOMM '86.

[74]  George C. Polyzos,et al.  Optimal multicast routing with quality of service constraints , 2005, Journal of Network and Systems Management.

[75]  Panos M. Pardalos,et al.  Streaming cache placement problems: complexity and algorithms , 2007, Int. J. Comput. Sci. Eng..

[76]  Xiaofeng Jiang.  Routing broadband multicast streams , 1992, Comput. Commun..

[77]  Anders Forsgren,et al.  Dimensioning multicast-enabled communications networks , 2002, Networks.

[78]  Gregory Gutin,et al.  An approximate algorithm for combinatorial optimization problems with two parameters , 1995, Australas. J Comb..

[79]  Panos M. Pardalos,et al.  A test problem generator for the Steiner problem in graphs , 1993, TOMS.

[80]  Chuck Semeria,et al.  Introduction to IP Multicast Routing , 1997 .

[81]  George C. Polyzos,et al.  Multicasting for multimedia applications , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[82]  Lixia Zhang,et al.  Adaptive shared tree multicast in mobile wireless networks , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).

[83]  David P. Williamson,et al.  A general approximation technique for constrained forest problems , 1992, SODA '92.

[84]  S. Ramanathan,et al.  Multicast tree generation in networks with asymmetric links , 1996, TNET.

[85]  George N. Rouskas,et al.  Multicast Routing with End-to-End Delay and Delay Variation Constraints , 1997, IEEE J. Sel. Areas Commun..

[86]  Gen-Huey Chen,et al.  The steiner problem in distributed computing systems , 1993, Inf. Sci..

[87]  Douglas S. Reeves,et al.  The delay-constrained minimum spanning tree problem , 1997, Proceedings Second IEEE Symposium on Computer and Communications.

[88]  Larry D. Wittie,et al.  Multicast Communication on Network Computers , 1985, IEEE Software.

[89]  Chang-Hyeon Park,et al.  Development of a multiuser and multimedia game engine based on TCP/IP , 1997, 1997 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, PACRIM. 10 Years Networking the Pacific Rim, 1987-1997.

[90]  Panos M. Pardalos,et al.  A Branch-and-Cut to the Point-to-Point Connection Problem on Multicast Networks , 2005 .