Publication
Reaching Scalability in Unstructured P2P Networks Using a Divide and Conquer Strategy
| dc.contributor.author | Fonseca, Pedro | por |
| dc.contributor.author | Miranda, Hugo | por |
| dc.date.accessioned | 2009-02-10T13:12:02Z | por |
| dc.date.accessioned | 2014-11-14T16:23:55Z | |
| dc.date.available | 2009-02-10T13:12:02Z | por |
| dc.date.available | 2014-11-14T16:23:55Z | |
| dc.date.issued | 2008-04 | por |
| dc.description.abstract | 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 | por |
| dc.identifier.uri | http://hdl.handle.net/10451/14150 | por |
| dc.identifier.uri | http://repositorio.ul.pt/handle/10455/3042 | por |
| dc.language.iso | por | por |
| dc.publisher | Department of Informatics, University of Lisbon | por |
| dc.relation.ispartofseries | di-fcul-tr-08-12 | por |
| dc.subject | unstructured overlays | por |
| dc.subject | peer-to-peer | por |
| dc.subject | search | por |
| dc.title | Reaching Scalability in Unstructured P2P Networks Using a Divide and Conquer Strategy | por |
| dc.type | report | |
| dspace.entity.type | Publication | |
| rcaap.rights | openAccess | por |
| rcaap.type | report | por |
Files
Original bundle
1 - 1 of 1