DocumentCode
1596819
Title
Pie: scalable routing in peer-to-peer networks
Author
Lichodzijewski, Peter ; Wetmore, Leigh ; Zincir-Heywood, A.N.
Author_Institution
Dalhousie Univ., Halifax, NS, Canada
Volume
1
fYear
2004
Firstpage
51
Abstract
Distributed hash tables (DHTs) are a class of algorithms used to store and retrieve information in peer-to-peer (P2P) systems in a scalable and robust fashion. Pie, a routing protocol for a new DHT framework, is presented. The performance of this algorithm is empirically compared to an existing DHT framework, Chord. Results show that Pie performs better than Chord with respect to the number of logical hops. It also yields a smaller delay and better load balancing. The results are supported by a paired t-test at an alpha level of 0.01.
Keywords
routing protocols; wide area networks; Chord routing protocol; P2P networks; Pie routing protocol; alpha level; delay; distributed hash tables; load balancing; logical hops; paired t-test; peer-to-peer networks; Costs; Delay; Fingers; Information retrieval; Intelligent networks; Load management; Partitioning algorithms; Peer to peer computing; Robustness; Routing protocols;
fLanguage
English
Publisher
ieee
Conference_Titel
Electrical and Computer Engineering, 2004. Canadian Conference on
ISSN
0840-7789
Print_ISBN
0-7803-8253-6
Type
conf
DOI
10.1109/CCECE.2004.1344956
Filename
1344956
Link To Document