|Appears in Collections:||Computing Science and Mathematics Journal Articles|
|Peer Review Status:||Refereed|
|Title:||Performance analysis of structured peer-to-peer overlays for mobile networks (Forthcoming/Available Online)|
distributed hash table
|Publisher:||Taylor and Francis|
|Citation:||Chowdhury F, Furness J & Kolberg M Performance analysis of structured peer-to-peer overlays for mobile networks (Forthcoming/Available Online), International Journal of Parallel, Emergent and Distributed Systems.|
|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 paper, 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.|
|Rights:||This item has been embargoed for a period. During the embargo please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study. This is an Accepted Manuscript of an article published by Taylor & Francis Group in International Journal of Parallel, Emergent and Distributed Systems on 20 Jul 2016 available online: http://www.tandfonline.com/10.1080/17445760.2016.1203917|
|Affiliation:||University of Stirling|
University of Stirling
Computing Science - CSM Dept
|Performance evaluation-Journal paper-final.pdf||1.32 MB||Adobe PDF||Under Embargo until 20/7/2017 Request a copy|
Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependant on the depositor still being contactable at their original email address.
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact email@example.com providing details and we will remove the Work from public display in STORRE and investigate your claim.