Paper Info
Title
Relaxed-2-Chord: Efficiency, flexibility and provable stretch
Abstract
Several proposals have been presented to supplement the traditional measure of routing efficiency in P2P networks, i.e. the (average) number of hops for lookup operations, with measures of the latency incurred in the underlying network. So far, no solution has been presented to this ``latency'' problem without incurring in extra and heavy management costs. We propose Relaxed-2-Chord, a new design of the traditional Chord protocol, that is able to fit the routing tables with low latency nodes, doing a parasitic measurement of nodes' latency without adding any overhead. The solution that we present is a Distributed Hash Table system whose aim is to combine the routing efficiency and flexibility of the Chord protocol -- i.e. a good degree/diameter tradeoff �- and a provable optimal hop by hop latency. Our work is inspired by the recent Lookup-parasitic random sampling (LPRS) strategies which allow to improve the network stretch, that is, the ratio between the latency of two nodes on the overlay network and the unicast latency between those nodes. Relaxed-2-Chord reaches the same results as LPRS without introducing any overhead.
Year
DOI
Venue
2009
10.1109/IPDPS.2009.5160951
IPDPS
Keywords
Field
DocType
routing efficiency,network stretch,unicast latency,underlying network,p2p network,hop latency,chord protocol,routing table,overlay network,provable stretch,low latency node,sampling methods,data mining,protocols,routing,routing tables,routing protocols,economic indicators,estimation,unicast
Latency (engineering),Computer science,Computer network,Latency (engineering),Chord (music),Routing table,Overlay network,Chord (peer-to-peer),Distributed hash table,Routing protocol,Distributed computing
Conference
ISSN
Citations 
PageRank 
1530-2075
1
0.36
References 
Authors
15
5
Name
Order
Citations
PageRank
Gennaro Cordasco134447.06
Francesca Della Corte210.36
Alberto Negro37411.67
Alessandra Sala482642.49
Vittorio Scarano560971.49