References
[1]. D. Milojicic, V. Kalogeraki, R. Lukose, K. Nagaraja, J.
Pruyne, B. Richard, S. Rollins, and Z. Xu. (2002). Peer-to-
Peer Computing. Technical Report HPL-2002-57.s
[2]. B. Yang and H. Garcia-Molina. (2002). Improving
Search in Peer-to-Peer Networks. Proc. 22nd Int'l Conf.
Distributed Computing Systems (ICDCS '02), pp. 5-14.
[3]. C. Gkantsidis, M. Mihail, and A. Saberi. (2004).
Random Walks in Peer-to-Peer Networks. Proc. IEEE
INFOCOM '04, pp. 120-130.
[4]. C. Gkantsidis, M. Mihail, and A. Saberi. (2005). Hybrid
Search Schemes for Unstructured Peer-to-Peer Networks.
Proc. IEEE INFOCOM '05, pp. 1526-1537.
[5]. Gnutella website. http://www.gnutella.com
[6]. Napster website. http://www.napster.com
[7]. Morpheus website. http://www.morpheus-os.com.
[8]. S. Saroiu, P.K. Gummadi, and S.D. Gribble. (2002), A
Measurement Study of Peer-to-Peer File Sharing Systems.
MMCN.
[9]. D. Tsoumakos and N. Roussopoulos. (2003,
september). Adaptive Probabilistic Search for Peer-to-Peer
Networks. Proc. Third Int'l Conf. Peer-to- Peer Computing
(P2P '03), pp. 102-109.
[10]. Vicent Cholvi, Pascal Felber and Ernst Biersack.
Efficient search in Unstructured peer-to-peer networks.
Eurecom university, pp 1-11.
[11]. Yingwu Zhu and Haiying Shen. (2009). High search
performance, small document Index: P2P search can
have both. IEEE , 978-1-4244-4921-7, pp 312-321.
[12]. Z. Ge, D.R. Figueiredo, S. Jaiswal, J. Kurose, and D.
Towsley, (2003). “Modeling Peer-Peer File Sharing Systems,”
Proc. IEEE INFOCOM '03, pp. 2188-2198.
[13]. S. Saroiu, P.K. Gummadi, and S.D. Gribble. (2002),. A Measurement Study of Peer-to-Peer File Sharing Systems.
MMCN.
[14].George H.L. Fletcher, Hardik A. Sheth, and Katy
Borner. (2005). Unstructured peer-to-peer networks:
Topological properties and search performance.
Springer-Verlag Berlin Heidelberg, AP2PC 2004, LNAI 3601,
pp. 14-27.
