Performance Evaluation of Structured Peer-to-Peer Overlays for Use on Mobile Networks

被引:7
作者
Chowdhury, Farida [1 ]
Kolberg, Mario [1 ]
机构
[1] Univ Stirling, Comp Sci & Math, Stirling, Scotland
来源
2013 SIXTH INTERNATIONAL CONFERENCE ON DEVELOPMENTS IN ESYSTEMS ENGINEERING (DESE) | 2014年
关键词
Peer-to-Peer overlay; Distributed Hash Table; churn; Mobile Networks;
D O I
10.1109/DeSE.2013.19
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Peer-to-Peer (P2P) overlay networks are typically deployed on fixed wired networks. Distributed Hash Table (DHT) based structured P2P overlay networks offer scalability, fault tolerance and a self-managing infrastructure which does not exhibit single points of failure. Deploying DHT based overlays on mobile networks is a natural next step to make DHT based systems more widely available. However, supporting P2P on mobile networks poses a number of challenges, such as restrictions in terms of data transmissions on cellular networks, limited battery power of the handsets, high levels of churn due to variations in signal strength and placing or receiving voice calls which suspend the data link. While comparative studies of overlay algorithms for wired networks have been reported, there are a very few studies on the suitability of different existing DHT based overlays for mobile networks. This paper evaluates the performance and efficiency of five popular DHT based structured P2P overlays: Chord, Pastry, Kademlia, Broose and EpiChord, taking into account the conditions as seen in mobile networks. Our experimentation has shown that Kademlia and EpiChord are good candidates for use in high churn mobile environments.
引用
收藏
页码:57 / 62
页数:6
相关论文
共 17 条
[1]  
Baumgart I., 2012, P 8 EUR NF C NEXT GE
[2]  
Chan Hung Nguyen, ICCE 2008
[3]  
Chowdhury F., 2013, 8 ACM PM2HW2N WORKSH
[4]  
Furness J., 2013, 5 INT C NETCOM 2013
[5]  
Furness J., 2013, EUR MOD S EMS2013 MA
[6]  
Gai T., 2004, 4 INT C PEER PEER CO, P167
[7]  
Harjula E., 2011, WIR COMM NETW C MARC
[8]  
Heep B., 2007, 10 IEEE GLOB INT S C
[9]  
Jani H., 2007, 6 INT C MOB UB MULT
[10]  
Leong B., COMPUTER COMMUNICATI, V29, P1243