Using P2P Techniques for Content Distribution Internetworking: A Research Proposal
P2P '02 Proceedings of the Second International Conference on Peer-to-Peer Computing
Distributed Replica Placement Algorithms for Peer-to-Peer Content Distribution Networks
EUROMICRO '03 Proceedings of the 29th Conference on EUROMICRO
Choosing Replica Placement Heuristics for Wide-Area Systems
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Evaluation of a Monitoring-Based Architecture for Delivery of High Quality Multimedia Content
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
Object replication strategies in content distribution networks
Computer Communications
Proxy caching for media streaming over the Internet
IEEE Communications Magazine
Computers and Operations Research
Semantic partitioning of peer-to-peer search space
Computer Communications
Towards transparent personal content storage in multi-service access networks
EUC'07 Proceedings of the 2007 international conference on Embedded and ubiquitous computing
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Computer Communications
A framework for network aware caching for video on demand systems
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
| Hi-index | 0.24 |
The recent introduction of Content Distribution Networks (CDNs) enhances the delivery of high quality multimedia content to end users. In a CDN architecture, the content is replicated to so-called surrogate servers, generally at the edge of the transport network, to improve the quality of service (QoS) of streaming multimedia delivery services. By using peer-to-peer (P2P) technologies, these edge servers can co-operate and provide a more scalable and robust service in a self-organizing CDN. In this paper, we propose a set of distributed replica placement algorithms (RPAs), based on an Integer Linear Programming (ILP) formulation of the centralized content placement problem. These algorithms further enhance the CDN performance by optimizing the network and server load, reducing network delays and avoiding congestion. Although the proposed algorithms are designed for and tested on different network topologies, we focus on robust ring based CDNs in this study. Content placement on such a network topology can be calculated analytically and can be used for comparison.