Replication Algorithms in a Remote Caching Architecture
IEEE Transactions on Parallel and Distributed Systems
Dynamic Replica Placement for Scalable Content Delivery
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
A survey of peer-to-peer content distribution technologies
ACM Computing Surveys (CSUR)
Distributed Selfish Replication
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Performance study of peer-to-peer file sharing
Performance study of peer-to-peer file sharing
A Distributed Algorithm for Web Content Replication
NCA '09 Proceedings of the 2009 Eighth IEEE International Symposium on Network Computing and Applications
A Distributed Algorithm for the Replica Placement Problem
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
Peer-to-Peer (P2P) network provides decentralized, self organized, scalable objects in distributed computing system. However such networks suffer from high latency, network traffic and cache update problems. The existing caching and replica placement techniques for placing objects across peer-to-peer network have no complete solution to these problems. This paper proposes a new popularity based QOS(Quality Of Service)-aware smart replica placement algorithm for content distribution in peer-to-peer overlay networks which overcomes the access latency, fault tolerance, network traffic and redundancy problems with low cost. The paper also describes briefly the literature survey of the existing algorithms and their merits and demerits. The new algorithm proposed is based on the outcome of the survey.