Performance analysis of structured peer-to-peer overlays for mobile networks. Issue 5 (3rd September 2017)

• Record Type: Journal Article
• Authors: Chowdhury, Farida; Furness, Jamie; Kolberg, Mario
• Is Part Of: International journal of parallel, emergent and distributed systems. Volume 32:Issue 5(2017)
• Page Start: 522
• Page End: 548
• Publication Date: 2017-09-03
• Subjects: Peer-to-peer overlay -- distributed hash table -- churn -- mobile networks; Parallel computers -- Periodicals; Electronic data processing -- Distributed processing -- Periodicals; Computer algorithms -- Periodicals; 004.35
• DOI: 10.1080/17445760.2016.1203917
• Languages: English
• ISSNs: 1744-5760

Abstract

Abstract: Distributed Hash Table (DHT) based Peer-to-Peer (P2P) overlays have been widely researched and deployed in many applications such as file sharing, IP telephony, content distribution and media streaming applications. However, their deployment has largely been restricted to fixed, wired networks. This is due to the fact that supporting P2P overlays on wireless networks such as the public mobile data network is more challenging due to constraints in terms of data transmissions on cellular networks, limited battery power of the handsets and increased levels of node churn. However, the proliferation of smartphones makes the use of P2P applications on mobile handsets very desirable. In this article, we have analysed and evaluated the performance and efficiency of five popular DHT based structured P2P overlays (Chord, Pastry, Kademlia, Broose and EpiChord) under conditions as commonly experienced in public mobile data networks. Our results show that the conditions in mobile networks, including a high churn rate and the relatively low bandwidth availability is best matched by Kademlia and EpiChord. These overlays exhibit a high lookup success ratio and low hop count while consuming a moderate amount of bandwidth. These characteristics make these two overlays suitable candidates for use in mobile networks. Graphical Abstract: