DocumentCode
2793418
Title
Performance Modelling of Peer-to-Peer Routing
Author
Rai, Idris A. ; Brampton, Andrew ; MacQuire, Andrew ; Mathy, Laurent
Author_Institution
Dept. of Comput., Lancaster Univ.
fYear
2007
fDate
26-30 March 2007
Firstpage
1
Lastpage
8
Abstract
We propose several models based on discrete-time Markov chains for the analysis of distributed hash tables (DHTs). Specifically, we examine the Pastry routing protocol, as well as a Stealth DHT adaptation of Pastry to compute their exact expressions for average number of lookup hops. We show that our analytical models match with the protocols´ simulation results almost perfectly, making them ideal for rapid evaluation.
Keywords
Markov processes; file organisation; peer-to-peer computing; routing protocols; table lookup; Pastry routing protocol; Stealth DHT adaptation; discrete-time Markov chains; distributed hash tables; lookup hops; peer-to-peer routing; performance modelling; Analytical models; Computational modeling; Costs; Distributed computing; Mathematical analysis; Mathematical model; Peer to peer computing; Performance analysis; Routing protocols; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing Symposium, 2007. IPDPS 2007. IEEE International
Conference_Location
Long Beach, CA
Print_ISBN
1-4244-0910-1
Electronic_ISBN
1-4244-0910-1
Type
conf
DOI
10.1109/IPDPS.2007.370657
Filename
4228385
Link To Document