2010
DOI: 10.1007/978-0-387-09751-0
|View full text |Cite
|
Sign up to set email alerts
|

Handbook of Peer-to-Peer Networking

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 78 publications
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…In unstructured P2P networks, there is no relationship between any one node and any distributed network resource. Retrieving any network resource generally involves random walks and/or flooding approaches, which are inefficient and do not guarantee the discovery of a resource [18]. This is addressed in structured P2P systems, which provide efficient search strategies that guarantee content location within a small number of hops.…”
Section: P2p Overlaysmentioning
confidence: 99%
See 1 more Smart Citation
“…In unstructured P2P networks, there is no relationship between any one node and any distributed network resource. Retrieving any network resource generally involves random walks and/or flooding approaches, which are inefficient and do not guarantee the discovery of a resource [18]. This is addressed in structured P2P systems, which provide efficient search strategies that guarantee content location within a small number of hops.…”
Section: P2p Overlaysmentioning
confidence: 99%
“…Systems who support such an approach arrange these peers in various topologies to help limit the number of routing messages exchanged to access the resource. Some protocols generate a ring structure, as in Chord [17] [21], others generate a mesh, as seen in Pastry [18] [22]. For all these structured P2P overlays, the established logical topologies need to be maintained as the P2P system experiences churn (peers joining and leaving), resulting in a potentially significant amount of maintenance traffic.…”
Section: P2p Overlaysmentioning
confidence: 99%