DocumentCode
3849596
Title
Applying Low Discrepancy Sequences for Node-ID Assignment in P2PSIP
Author
Ruben Cuevas;Angel Cuevas;Manuel Uruena;Albert Banchs
Author_Institution
Department of Telematic Engineering, University Carlos III Madrid, Av. Universidad 30, 28911 Leganes, Madrid, Spain
Volume
15
Issue
2
fYear
2011
Firstpage
256
Lastpage
258
Abstract
The IETF P2PSIP Working Group is currently designing a standard overlay protocol, named RELOAD, that employs a centralized node identifier (node-id) assignment for security reasons. Given this scenario, we propose the utilization of a Low Discrepancy Sequence (LDS) for the assignment of node-ids in the P2PSIP architecture. We perform an analytical and simulation study considering a Chord DHT that demonstrates that using a LDS-based node-id assignment guarantees a fair distribution of the node´s zone of responsibility, even in high churn scenarios. Previous studies have shown that a fairer distribution of the zones of responsibility sizes leads to a fairer distribution of the storage and routing load. Therefore we conclude that the proposed LDS node-id assignment provides these features without adding any extra overhead.
Keywords
"Peer to peer computing","Servers","Indexes","Routing","Protocols","Security","Topology"
Journal_Title
IEEE Communications Letters
Publisher
ieee
ISSN
1089-7798
Type
jour
DOI
10.1109/LCOMM.2010.121310.101833
Filename
5669630
Link To Document