OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Erasure Coding Vs. Replication: A Quantitative Comparison
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Peer-to-peer internet telephony using SIP
NOSSDAV '05 Proceedings of the international workshop on Network and operating systems support for digital audio and video
SOSIMPLE: A Serverless, Standards-based, P2P SIP Communication System
AAA-IDEA '05 Proceedings of the First International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications
Transit-Stub Architecture for Peer-to-Peer SIP
EUROMICRO '07 Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
The traditional way to achieve high data availability in structured P2P network is to replicate the data items preserved on the node to its neighbor nodes. However, in some heterogeneous structured P2P networks, the neighbor nodes are always close to each other in locality. Therefore, if some local disaster happened, it is very likely that some data items would be permanent lost. Moreover, this traditional data replication strategy will bring complex data migration when there are nodes join or leave the DHT network. In this paper, we propose a novel data replication strategy in heterogeneous structured P2P networks. It not only guarantee the availability of data items in the situation of large-scale local disaster, but also greatly reduce the complexity of data migration when nodes join or leave the network.