Search algorithms for unstructured peer-to-peer networks

Proceedings - Conference on Local Computer Networks, LCN

Volumn , Issue , 2007, Pages 343-349

  Dorrigiv, Reza ^a   López Ortiz, Alejandro ^a   Prałat, Paweł ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b DALHOUSIE UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC NETWORKS; ALGORITHMS; BOOLEAN FUNCTIONS; CIRCUIT THEORY; COMPUTERS; DISTRIBUTED COMPUTER SYSTEMS; EXPERIMENTS; GRAPH THEORY; INTERNET; LEARNING ALGORITHMS; NUMERICAL ANALYSIS; RANDOM PROCESSES; TELECOMMUNICATION NETWORKS; TOPOLOGY; WELL FLOODING;

FLOODING AND RANDOM WALK (RW); HYBRID ALGORITHM (HA); LOCAL COMPUTER; NUMBER OF NODES; PEER-TO-PEER NETWORKS (P2PN); POWER LAWS; RANDOM GRAPHS; RANDOM WALK (RW); SEARCH ALGORITHMS; UNSTRUCTURED PEER-TO-PEER;

COMPUTER NETWORKS;

EID: 47249112144     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LCN.2007.142     Document Type: Conference Paper

References (12)

1. A. Bonato. A survey of models of the web graph. In Proceedings of the 1st Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN '04), pages 159-172, 2004.
2. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. Graph structure in the web. In Proceedings of the 9th International World Wide Web Conference, pages 309-320, 2000.
3. E. Cohen and S. Shenker. Replication strategies in unstructured peer-to-peer networks. Proceedings of the ACM SIGCOMM 2002 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM '02), 32(4): 177-190, 2002.
4. C. Gkantsidis, M. Mihail, and A. Saberi. Random walks in peer-to-peer networks. In Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '04), volume 1, pages 120-130, 2004.
5. C. Gkantsidis, M. Mihail, and A. Saberi. Hybrid search schemes for unstructured peer-to-peer networks. In Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '05), volume 3, pages 1526-1537, 2005.
6. S. Janson, T. Łuczak, and A. Ruciński. Random Graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons, 2000.
7. T. Łuczak and P. Prałat. Protean graphs. Internet Mathematics, 3(1):21-40, 2006.
8. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and replication in unstructured Peer-to-Peer networks. In Proceedings of the 2002 International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS-02), volume 30, 1, pages 258-259, 2002.
9. P. Prałat. A note on the diameter of protean graphs. Discrete Mathematics, to appear.
10. P. Prałat and N. Wormald. Growing protean graphs. Internet Mathematics, to appear.
11. A. Ruciński and N. C. Wormald. Random graph processes with degree restrictions. Combinatorics, Probability & Computing, 1:169-180, 1992.
12. N. C. Wormald. Models of random regular graphs. In Surveys in Combinatorics, 199S, Walker (Ed.), London Mathematical Society Lecture Note Series 187, Cambridge University Press, volume 276, pages 239-298. 1999.