Applying Low Discrepancy Sequences for Node-ID Assignment in P2PSIP

被引:0
作者
Cuevas, Ruben [1 ]
Cuevas, Angel [1 ]
Uruena, Manuel [1 ]
Banchs, Albert [1 ,2 ]
机构
[1] Univ Carlos III Madrid, Dept Telemat Engn, Madrid 28911, Spain
[2] Inst IMDEA Networks, Madrid 28918, Spain
关键词
Node-ID assignment; P2PSIP; DHT; low discrepancy sequence;
D O I
10.1109/LCOMM.2010.121310.101833
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
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.
引用
收藏
页码:256 / 258
页数:3
相关论文
共 11 条
[1]  
[Anonymous], 1998, CoRR
[2]  
[Anonymous], 1974, PURE APPL MATH
[3]  
CUEVAS R, 2010, THESIS U CARLOS 3 MA
[4]  
CUEVAS R, 2009, FP2P HN P2P BASED RO
[5]  
CUEVAS R, 2009, P IEEE INF
[6]  
GODFREY B, 2005, P IEEE INF
[7]  
JENNINGS C, 2010, RESOURCE LOCATION DI
[8]  
JENNINGS C, 2010, SIP USAGE RELOAD
[9]  
MATHY L, 2008, P ACM CONEXT
[10]  
SEEDORF J, 2006, IEEE NETWORK