Proceedings. Second International Conference on Peer-to-Peer Computing,
DOI: 10.1109/ptp.2002.1046320
|View full text |Cite
|
Sign up to set email alerts
|

Why peer-to-peer (P2P) does scale: an analysis of P2P traffic patterns

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 18 publications
(9 citation statements)
references
References 9 publications
0
9
0
Order By: Relevance
“…Flooding, in which a peer relays a query to every neighboring peer, is a powerful scheme for finding a desired media stream in a P2P network. However, it has been pointed out that the flooding scheme lacks scalability because the number of queries that a peer receives significantly increases with the growth in the number of peers [9]. Especially when a media stream is divided into blocks for efficient use of network bandwidth and cache buffer [10][11][12][13], a block-by-block search by flooding queries apparently introduces much load on the network and causes congestion.…”
Section: Introductionmentioning
confidence: 99%
“…Flooding, in which a peer relays a query to every neighboring peer, is a powerful scheme for finding a desired media stream in a P2P network. However, it has been pointed out that the flooding scheme lacks scalability because the number of queries that a peer receives significantly increases with the growth in the number of peers [9]. Especially when a media stream is divided into blocks for efficient use of network bandwidth and cache buffer [10][11][12][13], a block-by-block search by flooding queries apparently introduces much load on the network and causes congestion.…”
Section: Introductionmentioning
confidence: 99%
“…Correspondingly, a two qubit system has four computational basis states denoted | 00>, | 01>, | 10> and | 11>. A pair of qubits can also exist in a superposition of these four states, which is given as I \f> = «oo I 00> + ao, |01> + aio| 10> + aii | 11> (2) The logic that can be implemented with qubits [6].…”
Section: Quantum Computationmentioning
confidence: 99%
“…Thus, an exponential increase in parallelism requires only a linear increase in the amount of physical space. This property is called quantum parallelism [6][2] [5].…”
Section: Quantum Algorithmsmentioning
confidence: 99%
See 1 more Smart Citation
“…Resource discovery can be classified into three categories: mechanisms with specialized index nodes (centralized search), mechanisms without any index (flooding search), mechanism with indices at super peers (distributed search), and mechanism with a Distributed Hash Table (DHT). (Schollmeier & Schollmeier, 2002) …”
Section: Topology Overviewmentioning
confidence: 99%