Simulation and Analysis of Routing Schemes in Structured P2P System

Author

Cheng, Yinbo ; Wen, Xiangming ; Sun, Yong

Author_Institution

Inst. of Commun. Network Integrated Tech., Beijing Univ. of Posts & Telecommun., Beijing

Volume

1

fYear

2008

fDate

3-4 Aug. 2008

Firstpage

524

Lastpage

527

Abstract

A number of routing schemes have been proposed to improve the lookup performance of distributed hash table (DHT). There are three representative routing schemes among existing DHTs: recursive routing, semi-recursive routing and iterative routing. To know which routing scheme is more efficient, this paper takes one of the most important DHTs -- Chord as an example to simulate the three representative routing schemes and discusses the effectiveness of them from the aspects of lookup latency, effect of churn and difficulty of NAT traversal. The simulations and analysis show that they have advantages in different situations.

Keywords

peer-to-peer computing; telecommunication network routing; NAT traversal; churn effect; distributed hash table; iterative routing; lookup latency; semirecursive routing; structured P2P system; Analytical models; Communication system control; Computer networks; Delay; Distributed computing; Network address translation; Peer to peer computing; Routing; Strontium; Telecommunication computing; DHT; P2P; Routing Schemes;

fLanguage

English

Publisher

ieee

Conference_Titel

Computing, Communication, Control, and Management, 2008. CCCM '08. ISECS International Colloquium on

Conference_Location

Guangzhou

Print_ISBN

978-0-7695-3290-5

Type

conf

DOI

10.1109/CCCM.2008.241

Filename

4609566