‫باسمه تعالي‬
‫دانشگاه صنعتي شريف‬
‫دانشكده مهندسي كامپيوتر‬
Peer to Peer
‫بررسی و مقايسه الگوريتم های جستجو در شبکه های‬
83700635 ‫عيسی زارع پور‬
[email protected]
‫دراين مقاله ما به بررسی مهمترين روشها و تکنيک های جستجو در شبکه‬
. ‫ می پردازيم‬P2P ‫های‬
‫ ودسته بندی های مختلف مطرح شده‬P2P ‫ابتدا به معرفی شبکه های‬
‫پرداخته و سپس در مورد الگوريتم های جستجو در هر کدام از موارد فوق‬
:‫ دسته کلی تقسيم کرد‬3 ‫ را می توان به‬P2P ‫ شبکه های‬. ‫بحث خواهيم کرد‬
1-Unstructured P2P Networks
2- Strictly structured P2P Networks
3- Loosely structured P2P Networks
‫در مورد آنها بحث خواهد شد به تفکيک دسته بندی‬
1 Searching in unstructured
1.1 Iterative deepening
1.2 k-walker random walk and related schemes
1.3 Directed BFS and intelligent search
1.4 Local indices based search
1.5 Routing indices based search
1.6 Attenuated bloom filter based search
1.7 Adaptive probabilistic search
1.8 Dominating set based search
2 Searching in strictly structured
2.1 Searching in non-hierarchical DHT P2Ps
2.2 Searching in hierarchical DHT P2Ps
2.2.1 Kelips
2.2.2 Coral and related schemes
2.2.3 Other hierarchical DHT P2Ps
2.3 Searching in non-DHT P2Ps
2.3.1 Skip Net and Skip Graph
2.3.2 Terra Dir
3 Searching in loosely structured P2P
3.1 Freenet
3.2 Searching the power-law graph overlay
3.3 Searching the small-world model overlay
‫تکنيک های جستجويی که‬
: ‫فوق عبارتند از‬
References
1. X. Li and J. WuI. “Searching Techniques in Peer-to-Peer Networks”, Department of Computer
Science and Engineering, Florida Atlantic University, 2004.
2. H. Balakrishnan, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica, “Looking up data in
P2P systems”, Communications of ACM , Vol.46, No.2, 2003.
3. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, “Search and replication in unstructured peer-topeer networks”, Proc. of the 16th ACM International Conference on Supercomputing
(ACM ICS’02), 2002.
4. A. Crespo, and H. Garcia -Molina, “Routing indices for peer-to-peer systems”, Proc. of the
22 nd International Conference on Distributed Computing (IEEE ICDCS’02), 2002.
5. D. Tsoumakos, and N. Roussopoulos, “A comparison of peer-to-peer search methods”, Proc.
of 2003 International Workshop on the Web and Databases, 2003.
6. L. A. Adamic, R. M. Lukose, A. R. Puniyani, and B. A. Huberman, “Search in power-law
Networks”, Physical Review, Vol. 64, 046135, 2001.
7. I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, and H.
Balakrishnan, “Chord: A scalable peer-to-peer lookup service for internet applications”, Proc.
of the 2001 ACM Annual Conference of the Special Interest Group on Data Communication
(ACM SIGCOMM’01), 2001.
8. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A scalable content-addressable
network”, Proc. of the 2001 ACM Annual Conference of the Special Interest
Group on Data Communication (ACM SIGCOMM’01), 2001
9. T. Lin, H. Wang, “Search performance analysis in peer-to-peer networks”, Proc. of the 2nd
1