Reaching Scalability in Unstructured P2P Networks Using a Divide and Conquer Strategy
Autor(a) principal: | |
---|---|
Data de Publicação: | 2008 |
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/14150 |
Resumo: | Unstructured peer-to-peer networks have a low maintenance cost, high resilience and tolerance to the continuous arrival and departure of nodes. In these networks search is usually performed by flooding, which is highly inefficient. To improve scalability, unstructured overlays evolved to a two-tiered architecture where regular nodes rely on superpeers to locate resources. While this approach takes advantage of node heterogeneity, it makes the overlay less resilient to accidental and malicious faults, and less attractive to users concerned with the consumption of their resources. In this paper we propose a search algorithm, called FASE, which combines a replication policy and a search space division technique to achieve scalability on unstructured overlays with flat topologies. We present simulation results which validate FASE improved scalability and efficiency |
id |
RCAP_af5e44ec69a06992db7a878aa04b4654 |
---|---|
oai_identifier_str |
oai:repositorio.ul.pt:10451/14150 |
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 |
Reaching Scalability in Unstructured P2P Networks Using a Divide and Conquer Strategyunstructured overlayspeer-to-peersearchUnstructured peer-to-peer networks have a low maintenance cost, high resilience and tolerance to the continuous arrival and departure of nodes. In these networks search is usually performed by flooding, which is highly inefficient. To improve scalability, unstructured overlays evolved to a two-tiered architecture where regular nodes rely on superpeers to locate resources. While this approach takes advantage of node heterogeneity, it makes the overlay less resilient to accidental and malicious faults, and less attractive to users concerned with the consumption of their resources. In this paper we propose a search algorithm, called FASE, which combines a replication policy and a search space division technique to achieve scalability on unstructured overlays with flat topologies. We present simulation results which validate FASE improved scalability and efficiencyDepartment of Informatics, University of LisbonRepositório da Universidade de LisboaFonseca, PedroMiranda, Hugo2009-02-10T13:12:02Z2008-042008-04-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/reportapplication/pdfhttp://hdl.handle.net/10451/14150porinfo: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:47Zoai:repositorio.ul.pt:10451/14150Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T21:35:59.650697Repositó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 |
Reaching Scalability in Unstructured P2P Networks Using a Divide and Conquer Strategy |
title |
Reaching Scalability in Unstructured P2P Networks Using a Divide and Conquer Strategy |
spellingShingle |
Reaching Scalability in Unstructured P2P Networks Using a Divide and Conquer Strategy Fonseca, Pedro unstructured overlays peer-to-peer search |
title_short |
Reaching Scalability in Unstructured P2P Networks Using a Divide and Conquer Strategy |
title_full |
Reaching Scalability in Unstructured P2P Networks Using a Divide and Conquer Strategy |
title_fullStr |
Reaching Scalability in Unstructured P2P Networks Using a Divide and Conquer Strategy |
title_full_unstemmed |
Reaching Scalability in Unstructured P2P Networks Using a Divide and Conquer Strategy |
title_sort |
Reaching Scalability in Unstructured P2P Networks Using a Divide and Conquer Strategy |
author |
Fonseca, Pedro |
author_facet |
Fonseca, Pedro Miranda, Hugo |
author_role |
author |
author2 |
Miranda, Hugo |
author2_role |
author |
dc.contributor.none.fl_str_mv |
Repositório da Universidade de Lisboa |
dc.contributor.author.fl_str_mv |
Fonseca, Pedro Miranda, Hugo |
dc.subject.por.fl_str_mv |
unstructured overlays peer-to-peer search |
topic |
unstructured overlays peer-to-peer search |
description |
Unstructured peer-to-peer networks have a low maintenance cost, high resilience and tolerance to the continuous arrival and departure of nodes. In these networks search is usually performed by flooding, which is highly inefficient. To improve scalability, unstructured overlays evolved to a two-tiered architecture where regular nodes rely on superpeers to locate resources. While this approach takes advantage of node heterogeneity, it makes the overlay less resilient to accidental and malicious faults, and less attractive to users concerned with the consumption of their resources. In this paper we propose a search algorithm, called FASE, which combines a replication policy and a search space division technique to achieve scalability on unstructured overlays with flat topologies. We present simulation results which validate FASE improved scalability and efficiency |
publishDate |
2008 |
dc.date.none.fl_str_mv |
2008-04 2008-04-01T00:00:00Z 2009-02-10T13:12:02Z |
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/14150 |
url |
http://hdl.handle.net/10451/14150 |
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_ |
1799134258562859008 |