Streaming cache placement problems: complexity and algorithms

Multicast networks are used to distribute live content, such as video or audio streams, to a potentially large number of destinations. Streaming caches are deployed in these multicast systems to allow content distribution without network overload. We consider two related problems that arise in multicast networks: the tree cache placement and the flow cache placement problems. These problems are shown to be NP-hard, and we give a proof of hardness of approximation using a gap-preserving reduction. We also present approximation algorithms, as well as special cases where these problems can be solved in polynomial time.

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

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

[3]  Jussi Kangasharju,et al.  Object replication strategies in content distribution networks , 2002, Comput. Commun..

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

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

[6]  Panos M. Pardalos,et al.  Optimization problems in telecommunications and the internet , 2004 .

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

[8]  Panos M. Pardalos,et al.  Steiner Tree Problems , 2009, Encyclopedia of Optimization.

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

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

[11]  Magnus Karlsson,et al.  Do We Need Replica Placement Algorithms in Content Delivery Networks , 2002 .

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

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

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

[15]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

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

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

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

[19]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

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

[21]  William J. Cook,et al.  Combinatorial optimization , 1997 .

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

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

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

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

[26]  Jonathan S. Turner,et al.  Placing Servers in Overlay Networks , 2002 .

[27]  Panos M. Pardalos,et al.  A survey of combinatorial optimization problems in multicast routing , 2005, Comput. Oper. Res..

[28]  M. R. Rao,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

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

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

[31]  Jonathan S. Turner,et al.  Routing in overlay multicast networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[32]  Carsten Lund,et al.  Hardness of approximations , 1996 .

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