Heuristics for the Design and Optimization of Streaming Content Distribution Networks

The design of efficient and scalable streaming Content Distribution Networks (CDNs) is an open problem of great economic interest. A key decision is the number of replica servers to use and their location to balance network bandwidth and server costs. This problem is highly complex, since it is interrelated to the streaming media delivery protocols, client redirecting decisions, and the content delivery routing problem. To address this design problem, we develop heuristics for the server placement, the server selection, and the routing problem. In contrast to previous work, we study both periodic broadcast and hierarchical merging protocols using multiple media files with different request rates. The heuristics lead to highly accurate and fast approximations. We also analyze the relationship between the start-up delay caused by some delivery protocols, the bandwidth consumption, and the number of replica servers, providing complete and fully implementable solutions to the design of streaming CDNs.

[1]  George Kingsley Zipf,et al.  Human behavior and the principle of least effort , 1949 .

[2]  Lili Qiu,et al.  On the placement of Web server replicas , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[3]  Mary K. Vernon,et al.  Minimizing Bandwidth Requirements for On-Demand Data Delivery , 2001, IEEE Trans. Knowl. Data Eng..

[4]  Jussara M. Almeida,et al.  STREAMING CONTENT DISTRIBUTION NETWORKS WITH MINIMUM DELIVERY COST , 2003 .

[5]  Bo Li,et al.  On the optimal placement of web proxies in the Internet , 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).

[6]  Pavlin Radoslavov,et al.  Topology-informed Internet replica placement , 2002, Comput. Commun..

[7]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[8]  P. Krishnan,et al.  The cache location problem , 2000, TNET.

[9]  Ailan Hu,et al.  Video-on-demand broadcasting protocols: a comprehensive study , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[11]  Magnus Karlsson,et al.  A Framework for Evaluating Replica Placement Algorithms , 2002 .

[12]  Mary K. Vernon,et al.  Network bandwidth requirements for scalable on-demand streaming , 2007, TNET.

[13]  Hui Zhang,et al.  A case for end system multicast (keynote address) , 2000, SIGMETRICS '00.

[14]  Srinivasan Seshan,et al.  A case for end system multicast , 2002, IEEE J. Sel. Areas Commun..

[15]  Pierluigi Crescenzi,et al.  A compendium of NP optimization problems , 1994, WWW Spring 1994.

[16]  Yuval Shavitt,et al.  Constrained mirror placement on the Internet , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[18]  Ellen W. Zegura,et al.  How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[19]  Ellen W. Zegura,et al.  Multicast server selection: problems, complexity, and solutions , 2002, IEEE J. Sel. Areas Commun..

[20]  Yuval Shavitt,et al.  Constrained mirror placement on the Internet , 2002, IEEE J. Sel. Areas Commun..

[21]  Yuval Shavitt,et al.  Approximation and heuristic algorithms for minimum delay application-layer multicast trees , 2004, INFOCOM 2004.

[22]  David R. Cheriton,et al.  IP multicast channels: EXPRESS support for large-scale single-source applications , 1999, SIGCOMM '99.