Designing cost-effective content distribution networks
Computers and Operations Research
Layered Access Control Schemes on Watermarked Scalable Media
Journal of VLSI Signal Processing Systems
Computers and Operations Research
Equipment allocation in video-on-demand network deployments
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Server selection in large-scale video-on-demand systems
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Video-on-demand server selection and placement
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Computer Communications
Combined encryption and watermarking approaches for scalable multimedia coding
PCM'04 Proceedings of the 5th Pacific Rim conference on Advances in Multimedia Information Processing - Volume Part III
Designing content distribution networks for optimal cost and performance
Information Technology and Management
Minimizing server throughput for low-delay live streaming in content delivery networks
Proceedings of the 22nd international workshop on Network and Operating System Support for Digital Audio and Video
Optimal content placement for peer-to-peer video-on-demand systems
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
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.