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
id ES_9a873d8cfa92c7cf6b5d511f0bbaf010
oai_identifier_str oai:dspace.networks.imdea.org:20.500.12761/750
network_acronym_str ES
network_name_str España
repository_id_str
spelling Applying Low Discrepancy Sequences for Node-ID Assignment in P2PSIPCuevas, RubénCuevas, ÁngelUrueña, ManuelBanchs, Albert|||0000-0003-3544-8537Q Science::Q Science (General)Q Science::QA Mathematics::QA75 Electronic computers. Computer scienceT Technology::T Technology (General)T Technology::TA Engineering (General). Civil engineering (General)T Technology::TK Electrical engineering. Electronics Nuclear engineeringNode-ID assignmentP2PSIPDHTlow discrepancy sequence—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.TRUEpubIEEE Communications Society20112011-02-10journal articlehttp://purl.org/coar/resource_type/c_6501VoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/articlehttp://hdl.handle.net/20.500.12761/750reponame:IMDEA Networks Institute Digital Repositoryinstname:IMDEA Networks InstituteInglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:dspace.networks.imdea.org:20.500.12761/7502026-06-06T12:35:51Z
dc.title.none.fl_str_mv Applying Low Discrepancy Sequences for Node-ID Assignment in P2PSIP
title Applying Low Discrepancy Sequences for Node-ID Assignment in P2PSIP
spellingShingle Applying Low Discrepancy Sequences for Node-ID Assignment in P2PSIP
Cuevas, Rubén
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
title_short Applying Low Discrepancy Sequences for Node-ID Assignment in P2PSIP
title_full Applying Low Discrepancy Sequences for Node-ID Assignment in P2PSIP
title_fullStr Applying Low Discrepancy Sequences for Node-ID Assignment in P2PSIP
title_full_unstemmed Applying Low Discrepancy Sequences for Node-ID Assignment in P2PSIP
title_sort Applying Low Discrepancy Sequences for Node-ID Assignment in P2PSIP
dc.creator.none.fl_str_mv Cuevas, Rubén
Cuevas, Ángel
Urueña, Manuel
Banchs, Albert|||0000-0003-3544-8537
author Cuevas, Rubén
author_facet Cuevas, Rubén
Cuevas, Ángel
Urueña, Manuel
Banchs, Albert|||0000-0003-3544-8537
author_role author
author2 Cuevas, Ángel
Urueña, Manuel
Banchs, Albert|||0000-0003-3544-8537
author2_role author
author
author
dc.subject.none.fl_str_mv 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
topic 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
description —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.
publishDate 2011
dc.date.none.fl_str_mv 2011
2011-02-10
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv http://hdl.handle.net/20.500.12761/750
url http://hdl.handle.net/20.500.12761/750
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv IEEE Communications Society
publisher.none.fl_str_mv IEEE Communications Society
dc.source.none.fl_str_mv reponame:IMDEA Networks Institute Digital Repository
instname:IMDEA Networks Institute
instname_str IMDEA Networks Institute
reponame_str IMDEA Networks Institute Digital Repository
collection IMDEA Networks Institute Digital Repository
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869414411625562112
score 15,300719

Similares en LA Referencia