Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
A survey of peer-to-peer content distribution technologies
ACM Computing Surveys (CSUR)
Streaming XML with Jabber/XMPP
IEEE Internet Computing
Analytical Study on Improving DHT Lookup Performance under Churn
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Minimizing churn in distributed systems
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Energy consumption and conservation in mobile peer-to-peer systems
MobiShare '06 Proceedings of the 1st international workshop on Decentralized resource sharing in mobile computing and networking
Understanding churn in peer-to-peer networks
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
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
Revealing skype traffic: when randomness plays with you
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Implementation and Performance Evaluation of a P2PSIP Distributed Proxy/Registrar
NGMAST '07 Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies
Performance evaluation of replication strategies in DHTs under churn
Proceedings of the 6th international conference on Mobile and ubiquitous multimedia
Building a reliable P2P system out of unreliable P2P clients: the case of KAD
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
P2PNS: A Secure Distributed Name Service for P2PSIP
PERCOM '08 Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications
Enabling Global Multimedia Distributed Services Based on Hierarchical DHT Overlay Networks
NGMAST '08 Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies
NGMAST '08 Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies
Feasibility evaluation of a communication-oriented P2P system in mobile environments
Mobility '09 Proceedings of the 6th International Conference on Mobile Technology, Application & Systems
Comparing the performance of distributed hash tables under churn
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
On credibility of simulation studies of telecommunication networks
IEEE Communications Magazine
Adaptive link recovery scheme for structured peer-to-peer networks under churn
Proceedings of the 2011 ACM Symposium on Applied Computing
Performance evaluation of EpiChord under high churn
Proceedings of the 8th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Hi-index | 0.00 |
The phenomenon of churn has a significant effect on the performance of Peer-to-Peer (P2P) networks, especially in mobile environments that are characterized by intermittent connections and unguaranteed network bandwidths. A number of proposals have been put forward to deal with this problem; however, we have so far not seen any thorough analysis to guide the optimal design choices and parameter configurations for structured P2P networks. In this article, we present a performance evaluation of a structured communication-oriented P2P system in the presence of churn. The evaluation is conducted using both simulation models and a real-life prototype implementation. In both evaluation environments, we utilize Kademlia with some modifications as the underlying distributed hash table (DHT) algorithm, and Peer-to-Peer Protocol (P2PP) as the signaling protocol. The results from the simulation models created using Nethawk EAST (a telecommunication simulator software) suggest that, in most situations, a lookup parallelism degree of 3 and resource replication degree of 3 are enough for guaranteeing a high resource lookup success ratio. We also notice that, with the parallel lookup mechanism, a good success ratio is achieved even without the KeepAlive traffic that is used for detecting the aliveness of nodes. A prototype system that works in mobile environment is implemented to evaluate the feasibility of mobile nodes acting as full-fledged peers. The measurements made using the prototype show that, from the viewpoints of CPU load and network traffic load, it is feasible for the mobile nodes to take part in the overlay. Through energy consumption measurements, we draw the conclusion that in general the UMTS access mode consumes slightly more power than the WLAN access mode. Protocol packets with sizes of 200bytes or less are observed to be the most energy efficient in the UMTS access mode.