Minimizing delivery cost in scalable streaming content distribution systems

Recent scalable multicast streaming protocols for on-demand delivery of media content offer the promise of greatly reduced server and network bandwidth. However, a key unresolved issue is how to design scalable content distribution systems that place replica servers closer to various client populations and route client requests and response streams so as to minimize the total server and network delivery cost. This issue is significantly more complex than the design of distribution systems for traditional Web files or unicast on-demand streaming, for two reasons. First, closest server and shortest path routing does not minimize network bandwidth usage; instead, the optimal routing of client requests and server multicasts is complex and interdependent. Second, the server bandwidth usage increases with the number of replicas. Nevertheless, this paper shows that the complex replica placement and routing optimization problem, in its essential form, can be expressed fairly simply, and can be solved for example client populations and realistic network topologies. The solutions show that the optimal scalable system can differ significantly from the optimal system for conventional delivery. Furthermore, simple canonical networks are analyzed to develop insights into effective heuristics for near-optimal placement and routing. The proposed new heuristics can be used for designing large and heterogeneous systems that are of practical interest. For a number of example networks, the best heuristics produce systems with total delivery cost that is within 16% of optimality.

[1]  David Kendrick,et al.  GAMS, a user's guide , 1988, SGNM.

[2]  Pascal Frossard,et al.  Joint server scheduling and proxy caching for video delivery , 2002, Comput. Commun..

[3]  kc claffy,et al.  Internet topology: connectivity of IP graphs , 2001, SPIE ITCom.

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

[5]  Michael Barbehenn,et al.  A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted Vertices , 1998, IEEE Trans. Computers.

[6]  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).

[7]  Mary K. Vernon,et al.  Optimized caching in systems with heterogeneous client populations , 2000, Performance evaluation (Print).

[8]  Mary K. Vernon,et al.  Analysis of educational media server workloads , 2001, NOSSDAV '01.

[9]  Kien A. Hua,et al.  Skyscraper broadcasting: a new broadcasting scheme for metropolitan video-on-demand systems , 1997, SIGCOMM '97.

[10]  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).

[11]  Donald F. Towsley,et al.  Supplying instantaneous video-on-demand services using controlled multicast , 1999, Proceedings IEEE International Conference on Multimedia Computing and Systems.

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

[13]  John G. Apostolopoulos,et al.  On multiple description streaming with content delivery networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[15]  Donald F. Towsley,et al.  Optimal proxy cache allocation for efficient streaming media distribution , 2002, IEEE Transactions on Multimedia.

[16]  Mary K. Vernon,et al.  Scalable on-demand media streaming with packet loss recovery , 2001, SIGCOMM.

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

[18]  Richard E. Ladner,et al.  Competitive on-line stream merging algorithms for media-on-demand , 2001, SODA '01.

[19]  Mary K. Vernon,et al.  Abstract--this Paper Develops Simple Cost Models for Provisioning Content Distribution Networks That Use the Simple and Highly Scalable Bandwidth Skimming Protocol for Streaming. New Insight , 2002 .

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

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