Data networks
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Routing Algorithms for DHTs: Some Open Questions
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Updates in Highly Unreliable, Replicated Peer-to-Peer Systems
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Zoned federation of game servers: a peer-to-peer approach to scalable multi-player online games
Proceedings of 3rd ACM SIGCOMM workshop on Network and system support for games
Analyzing and enhancing the resilience of structured peer-to-peer systems
Journal of Parallel and Distributed Computing
Dynamic Quorums for DHT-based P2P Networks
NCA '05 Proceedings of the Fourth IEEE International Symposium on Network Computing and Applications
File Consistency Maintenance Through Virtual Servers in P2P Systems
ISCC '06 Proceedings of the 11th IEEE Symposium on Computers and Communications
Exploiting Geographical and Temporal Locality to Boost Search Efficiency in Peer-to-Peer Systems
IEEE Transactions on Parallel and Distributed Systems
Small-world overlay P2P networks: construction, management and handling of dynamic flash crowds
Computer Networks: The International Journal of Computer and Telecommunications Networking
Enhancing Search Performance on Gnutella-Like P2P Systems
IEEE Transactions on Parallel and Distributed Systems
HRing: A Structured P2P Overlay Based on Harmonic Series
IEEE Transactions on Parallel and Distributed Systems
SSW: A Small-World-Based Overlay for Peer-to-Peer Search
IEEE Transactions on Parallel and Distributed Systems
Enhancing Search Performance in Unstructured P2P Networks Based on Users' Common Interest
IEEE Transactions on Parallel and Distributed Systems
LightFlood: Minimizing Redundant Messages and Maximizing Scope of Peer-to-Peer Search
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
Because of the frequent changes of participant peers and their demands in a P2P network, the topological structure of peers and contents is always in change. These changes lead to some difficulties in object lookup and object update. We present a system called stable content distribution network (SCDN) to form a stable double-layer structure based on peers' demands. In this structure, (1) the efficiency of object lookup can be improved even under frequent arrival and departure of participant peers by using the long-distance connections provided by object update, (2) all contents and their replicas can keep consistency after object update by forming a hierarchy structure, while the stability of the network can be monitored and fixed during object update. We use both theoretical and experimental analysis and compare SCDN with other P2P networks. Results show that SCDN is efficient in object lookup and object update, and can provide consistency and robustness.