Applying Low Discrepancy Sequences for Node-ID Assignment in P2PSIP

—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 nodeids in t...

Descripción completa

Detalles Bibliográficos
Autores: Cuevas, Rubén, Cuevas, Ángel, Urueña, Manuel, Banchs, Albert|||0000-0003-3544-8537
Tipo de recurso: artículo
Fecha de publicación:2011
País:España
Institución:IMDEA Networks Institute
Repositorio:IMDEA Networks Institute Digital Repository
Idioma:inglés
OAI Identifier:oai:dspace.networks.imdea.org:20.500.12761/750
Acceso en línea:http://hdl.handle.net/20.500.12761/750
Access Level:acceso abierto
Palabra clave:Q Science::Q Science (General)
Q Science::QA Mathematics::QA75 Electronic computers. Computer science
T Technology::T Technology (General)
T Technology::TA Engineering (General). Civil engineering (General)
T Technology::TK Electrical engineering. Electronics Nuclear engineering
Node-ID assignment
P2PSIP
DHT
low discrepancy sequence
Descripción
Sumario:—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 nodeids 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.