Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
The interactive multimedia jukebox (IMJ): a new paradigm for the on-demand delivery of audio/video
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Distributed servers architecture for networked video services
IEEE/ACM Transactions on Networking (TON)
Bandwidth constrained placement in a WAN
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Digital TV in the Convergent Environment
IEEE Computer Graphics and Applications
A New Caching Architecture for Efficient Video-on-Demand Services on the Internet
SAINT '03 Proceedings of the 2003 Symposium on Applications and the Internet
Alternate distribution strategies for digital music
Communications of the ACM - Why CS students need math
IEEE Communications Magazine
Efficient and adaptive Web replication using content clustering
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Future entertainment services are expected to be increasingly interactive, on demand and personalized. This paper aims to address the challenge of provisioning network and server resources to support the distribution of these services over the Internet. We propose the Overlay Distribution Network (ODN) as a cost-effective means to deliver these services. Because ODNs are created over shared network and server infrastructure, the provisioning problem becomes significantly complex. The paper formulates this problem as a joint resource provisioning and content replication optimization. The resulting formulation is proved to be NP-complete. We solved this problem with an efficient Lagrangian heuristic. Further, content clustering is employed to improve the heuristic run time. Initial results show that this is efficient. In some cases, clustering allows solutions with very similar quality to be achieved at a 20 times reduction in complexity.