Using the complementary nature of node joining and leaving to handle churn problem in P2P networks

Authors:
Xianfu Meng;Xiaoling Chen;Yalin Ding
Affiliations:
School of Computer Science and Technology, Dalian University of Technology, No. 2, Linggong Road, Dalian 116024, China;School of Computer Science and Technology, Dalian University of Technology, No. 2, Linggong Road, Dalian 116024, China;School of Computer Science and Technology, Dalian University of Technology, No. 2, Linggong Road, Dalian 116024, China
Venue:
Computers and Electrical Engineering
Year:
2013

Citing 18
Cited 1

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
Measuring and analyzing the characteristics of Napster and Gnutella hosts

Multimedia Systems
Analyzing peer-to-peer traffic across large networks

IEEE/ACM Transactions on Networking (TON)
PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electronic Communities

IEEE Transactions on Knowledge and Data Engineering
Performance and Dependability of Structured Peer-to-Peer Overlays

DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Predicting node availability in peer-to-peer networks

SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Bandwidth and Latency Model for DHT Based Peer-to-Peer Networks under Variable Churn

ICW '05 Proceedings of the 2005 Systems Communications
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience

IEEE/ACM Transactions on Networking (TON)
Minimizing churn in distributed systems

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Handling churn in a DHT

ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Modeling Churn in P2P Networks

ANSS '07 Proceedings of the 40th Annual Simulation Symposium
Modeling Heterogeneous User Churn and Local Resilience of Unstructured P2P Networks

ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Improving stability for peer-to-peer multicast overlays by active measurements

Journal of Systems Architecture: the EUROMICRO Journal
Designing less-structured P2P systems for the expected high churn

IEEE/ACM Transactions on Networking (TON)
InstantLeap: fast neighbor discovery in P2P VoD streaming

Proceedings of the 18th international workshop on Network and operating systems support for digital audio and video
Design of packet-based block codes with shift operators

EURASIP Journal on Wireless Communications and Networking
An experimental study of peer behavior in a pure P2P network

Journal of Systems and Software
Comparing the performance of distributed hash tables under churn

IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems

Distributed caching in unstructured peer-to-peer file sharing networks

Computers and Electrical Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Churn is a basic and inherent problem in P2P networks. A lot of relevant studies have been carried out, but all lack versatility. In this paper, a general solution is proposed which makes a peer-to-peer (P2P) network need not pay much attention to churn problem by introducing a logic layer named Dechurn, and most of churn could be eliminated in the Dechurn layer. For utilizing the complementary nature of node joining and leaving, a network scheme, named Constellation, for handling churn is designed on the Dechurn layer through which the resources cached in a node for its spouse node who has left network would be succeeded by a node in latent period. The simulation results indicate that the proposed solution is effective and efficient in handling churn and easy to put into practice.