ACM Computing Surveys (CSUR)
A hierarchical characterization of a live streaming media workload
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Usability and privacy: a study of Kazaa P2P file-sharing
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Comparing Hybrid Peer-to-Peer Systems
Proceedings of the 27th International Conference on Very Large Data Bases
Content Delivery Networks: Status and Trends
IEEE Internet Computing
Insight and perspectives for content delivery networks
Communications of the ACM - Personal information management
Drafting behind Akamai (travelocity-based detouring)
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Enhancing Search Performance in Unstructured P2P Networks Based on Users' Common Interest
IEEE Transactions on Parallel and Distributed Systems
Challenges, design and analysis of a large-scale p2p-vod system
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
An Efficient and Adaptive Decentralized File Replication Algorithm in P2P File Sharing Systems
IEEE Transactions on Parallel and Distributed Systems
On using a CDN’s infrastructure to improve file transfer among peers
MMNS'05 Proceedings of the 8th international conference on Management of Multimedia Networks and Services
Proximity-Aware Superpeer Overlay Topologies
IEEE Transactions on Network and Service Management
Hi-index | 0.00 |
Content delivery networks (CDNs) are so far efficient tools to distribute a fast growing amount of information to the users. To ensure the required Quality of Service (QoS), more and more distributed and even hybrid P2P system architectures are used to cope with the not sufficient bandwidth and capacities of a single server. The proposed algorithm solves the problem to find an optimal position for the server or service nodes in a hybrid P2P system depending on network parameters and especially user activities. Moreover, simulations show that the customer peer assignment to the service nodes results in an almost equal partition of the network. Furthermore, an automatically movement of the service node can be induced in case of significant load changes.