Long Range Contacts in Overlay Networks with Unbalanced Node Distribution
Autor(a) principal: | |
---|---|
Data de Publicação: | 2004 |
Outros Autores: | |
Tipo de documento: | Relatório |
Idioma: | por |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/10451/14103 |
Resumo: | A fundamental aspect in the design of overlay networks is the path length/node degree trade-off. Previous research has shown that it is possible to achieve logarithmic path lengths for logarithmic or even constant node degree. While nearby contacts, with nodes that have close identifiers, ensure a connected lattice of nodes, short path lengths demand for the use of long range contacts. In this respect, previous work exhibits limitations in scenarios where node distribution is unbalanced: either short path length properties do not hold or may require node degree and/or signaling to grow with respect to the virtual identification space instead of the number of nodes (which is usually several order of magnitudes smaller). This paper proposes and evaluates a new mechanism to establish long range contacts in unbalanced overlay networks. This mechanism does not need any kind of manual configuration to adapt to different network configurations and is oblivious to the virtual identification space. Experimental comparison with previous work suggests that our mechanism achieves logarithmic path lengths with respect to the number of nodes, but regardless of node distribution in the virtual identification space |
id |
RCAP_2e1480abbd042211e0e15493d8d9bd01 |
---|---|
oai_identifier_str |
oai:repositorio.ul.pt:10451/14103 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
Long Range Contacts in Overlay Networks with Unbalanced Node DistributionPeer-to-peerOverlay networksLong range contactsA fundamental aspect in the design of overlay networks is the path length/node degree trade-off. Previous research has shown that it is possible to achieve logarithmic path lengths for logarithmic or even constant node degree. While nearby contacts, with nodes that have close identifiers, ensure a connected lattice of nodes, short path lengths demand for the use of long range contacts. In this respect, previous work exhibits limitations in scenarios where node distribution is unbalanced: either short path length properties do not hold or may require node degree and/or signaling to grow with respect to the virtual identification space instead of the number of nodes (which is usually several order of magnitudes smaller). This paper proposes and evaluates a new mechanism to establish long range contacts in unbalanced overlay networks. This mechanism does not need any kind of manual configuration to adapt to different network configurations and is oblivious to the virtual identification space. Experimental comparison with previous work suggests that our mechanism achieves logarithmic path lengths with respect to the number of nodes, but regardless of node distribution in the virtual identification spaceDepartment of Informatics, University of LisbonRepositório da Universidade de LisboaAraújo, FilipeRodrigues, Luís2009-02-10T13:11:56Z2004-072004-07-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/reportapplication/pdfhttp://hdl.handle.net/10451/14103porinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-11-08T15:59:42Zoai:repositorio.ul.pt:10451/14103Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T21:35:57.618054Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
Long Range Contacts in Overlay Networks with Unbalanced Node Distribution |
title |
Long Range Contacts in Overlay Networks with Unbalanced Node Distribution |
spellingShingle |
Long Range Contacts in Overlay Networks with Unbalanced Node Distribution Araújo, Filipe Peer-to-peer Overlay networks Long range contacts |
title_short |
Long Range Contacts in Overlay Networks with Unbalanced Node Distribution |
title_full |
Long Range Contacts in Overlay Networks with Unbalanced Node Distribution |
title_fullStr |
Long Range Contacts in Overlay Networks with Unbalanced Node Distribution |
title_full_unstemmed |
Long Range Contacts in Overlay Networks with Unbalanced Node Distribution |
title_sort |
Long Range Contacts in Overlay Networks with Unbalanced Node Distribution |
author |
Araújo, Filipe |
author_facet |
Araújo, Filipe Rodrigues, Luís |
author_role |
author |
author2 |
Rodrigues, Luís |
author2_role |
author |
dc.contributor.none.fl_str_mv |
Repositório da Universidade de Lisboa |
dc.contributor.author.fl_str_mv |
Araújo, Filipe Rodrigues, Luís |
dc.subject.por.fl_str_mv |
Peer-to-peer Overlay networks Long range contacts |
topic |
Peer-to-peer Overlay networks Long range contacts |
description |
A fundamental aspect in the design of overlay networks is the path length/node degree trade-off. Previous research has shown that it is possible to achieve logarithmic path lengths for logarithmic or even constant node degree. While nearby contacts, with nodes that have close identifiers, ensure a connected lattice of nodes, short path lengths demand for the use of long range contacts. In this respect, previous work exhibits limitations in scenarios where node distribution is unbalanced: either short path length properties do not hold or may require node degree and/or signaling to grow with respect to the virtual identification space instead of the number of nodes (which is usually several order of magnitudes smaller). This paper proposes and evaluates a new mechanism to establish long range contacts in unbalanced overlay networks. This mechanism does not need any kind of manual configuration to adapt to different network configurations and is oblivious to the virtual identification space. Experimental comparison with previous work suggests that our mechanism achieves logarithmic path lengths with respect to the number of nodes, but regardless of node distribution in the virtual identification space |
publishDate |
2004 |
dc.date.none.fl_str_mv |
2004-07 2004-07-01T00:00:00Z 2009-02-10T13:11:56Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/report |
format |
report |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10451/14103 |
url |
http://hdl.handle.net/10451/14103 |
dc.language.iso.fl_str_mv |
por |
language |
por |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Department of Informatics, University of Lisbon |
publisher.none.fl_str_mv |
Department of Informatics, University of Lisbon |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799134258165448704 |