Home > Research > Publications & Outputs > Performance Modelling of Peer-to-Peer Routing

Research

Electronic data

Keywords

View graph of relations

Performance Modelling of Peer-to-Peer Routing

Research output: Contribution to conference - Without ISBN/ISSN › Conference paper › peer-review

Published

Standard

Performance Modelling of Peer-to-Peer Routing. / Rai, Idris; Brampton, Andrew; MacQuire, Andrew et al.
2007. Paper presented at 4th International Workshop on Peer-to-Peer Systems (HOTP2P'07), Long Beach, California, USA.

Research output: Contribution to conference - Without ISBN/ISSN › Conference paper › peer-review

Harvard

Rai, I, Brampton, A, MacQuire, A & Mathy, L 2007, 'Performance Modelling of Peer-to-Peer Routing', Paper presented at 4th International Workshop on Peer-to-Peer Systems (HOTP2P'07), Long Beach, California, USA, 1/01/00.

APA

Rai, I., Brampton, A., MacQuire, A., & Mathy, L. (2007). Performance Modelling of Peer-to-Peer Routing. Paper presented at 4th International Workshop on Peer-to-Peer Systems (HOTP2P'07), Long Beach, California, USA.

Vancouver

Rai I, Brampton A, MacQuire A, Mathy L. Performance Modelling of Peer-to-Peer Routing. 2007. Paper presented at 4th International Workshop on Peer-to-Peer Systems (HOTP2P'07), Long Beach, California, USA.

Author

Rai, Idris ; Brampton, Andrew ; MacQuire, Andrew et al. / Performance Modelling of Peer-to-Peer Routing. Paper presented at 4th International Workshop on Peer-to-Peer Systems (HOTP2P'07), Long Beach, California, USA.

Bibtex

@conference{46ef6ea2816244578ec46a3ebebad79e,
title = "Performance Modelling of Peer-to-Peer Routing",
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{\textquoteright} simulation results almost perfectly, making them ideal for rapid evaluation.",
keywords = "cs_eprint_id, 1344 cs_uid, 1",
author = "Idris Rai and Andrew Brampton and Andrew MacQuire and Laurent Mathy",
year = "2007",
month = mar,
language = "English",
note = "4th International Workshop on Peer-to-Peer Systems (HOTP2P'07) ; Conference date: 01-01-1900",

}

RIS

TY - CONF

T1 - Performance Modelling of Peer-to-Peer Routing

AU - Rai, Idris

AU - Brampton, Andrew

AU - MacQuire, Andrew

AU - Mathy, Laurent

PY - 2007/3

Y1 - 2007/3

N2 - 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.

AB - 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.

KW - cs_eprint_id

KW - 1344 cs_uid

KW - 1

M3 - Conference paper

T2 - 4th International Workshop on Peer-to-Peer Systems (HOTP2P'07)

Y2 - 1 January 1900

ER -