BYPASS: Topology-aware lookup overlay for DHT-based P2P file locating services

被引:5
作者
Kwon, G [1 ]
Ryu, KD [1 ]
机构
[1] Arizona State Univ, Dept Comp Sci & Engn, Tempe, AZ 85287 USA
来源
TENTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS | 2004年
关键词
D O I
10.1109/ICPADS.2004.1316108
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper we propose a novel peer-to-peer file location system, BYPASS, to enhance the distributed file lookup time in DHT-based P2P systems. BYPASS constructs a secondary overlay in which file location information is distributed considering heterogeneity of peer capabilities and network proximity between requests and results. The secondary overlay in BYPASS allows only high-capability peers to participate in the system-wide file lookup and takes advantage of physical network proximity based on the Autonomous System (AS) network topology. We evaluate effectiveness of BYPASS using a set of large-scale simulations. The results show that BYPASS can significantly reduce file lookup latency at the cost of additional, yet acceptable storage and network resources.
引用
收藏
页码:297 / 304
页数:8
相关论文
共 19 条
[1]  
BRESLAU L, 1998, P INFOCOM
[2]  
Eastlake Donald, 2001, US Secure Hash Algorithm 1 (SHA1), DOI 10.17487/RFC3174
[3]  
GARCESERICE L, 2003, P EUR PAR
[4]  
KWON G, 2003, P INT S APPL INT SAI
[5]  
MIZRAK AT, 2003, P IEEE WORKSH INT AP
[6]  
RATNASAMY S, 2002, P INFOCOM
[7]  
RATNASAMY S, 2001, P ACM SIGCOMM
[8]  
ROWSTRON A, 2001, IFIP ACM INT C DISTR
[9]  
SAROIU PKG, 2002, P MULT COMP NETW 200
[10]  
SEN JWS, 2002, P INT MEAS WORKSH