SEARCHING FOR RARE RESOURCES IN UNSTRUCTURED P2P NETWORKS

Yıl 2010, Cilt: 10 Sayı: 1, 1143 - 11151, 20.01.2012

HaiMei Xu ShouQing Qı XianLiang Lu

https://izlik.org/JA47XY99YA

Öz

SEARCHING FOR RARE RESOURCES IN UNSTRUCTURED P2P NETWORKS

Anahtar Kelimeler

Debt Relationship , Non-cooperation Game , Pareto Efficiency , Social Utility , Individual Utility

Kaynakça

• 1] Tathagata Das, Subrata Nandi, Niloy Ganguly. “Community based search on Power Law Networks”. In Proc. of IEEE communication Systems Software and middleware workshops, pp. 279-282, 2008.
• [2] Nima Sarshar, Oscar Boykin, VWani Roychowdhury. “Scalable percolation search on complex networks”. ELSEVIER Theoretical Computer Science, Vol.355, No.1, pp. 48-64, 2006.
• [3] Krishna P N Puttaswamy, Alessandra Sala and Ben Y Zhao. “Searching for rare objects using index replication”. In Proc. of the IEEE INFOCOM, pp.1723- 1731, 2008.
• [4] Sarshar N, Roychowdhury V P. “Multiple power-law structures in heterogeneous complex networks”. Physics Review E, Vol 72(020101), 2005.
• [5] Barabasi A L, Albert R, Jeong H, et al. “Power-law distribution of the world wide web”. Science, 287:2115, 2000.
• [6] Boon Thau Loo, Joseph M Hellerstein, Ryan Hubsch, et al. “Enhancing P2P filesharing with an internet-scale query processor”. In Proc. Of 30th VLDB, Toronto, Canada, pp. 432-443, 2004.
• [7] Edith Cohen, Scott Shenker. “Replication strategies in unstructured peer-to-peer Networks”. In Proc. of SIGCOMM, ACM, Pittsburgh, Pennsylvania, pp. 697- 702, 2002.
• [8] Zhang Yi-Ming, Lu Xi-Cheng, Zheng Qian-Bing, et al. “An efficient search algorithm for Large-scale P2P systems”. Journal of Software, Vol.19, No.2, pp.1473-1480, 2008.
• [9] Lerthirunwong S, Maruyama N, Matsuoka S. “Index distribution technique for efficient search on unstructured peer-to-peer networks”. In Proc of IEEE ECTI-CON, Vol 1, pp. 97- 100, 2008.
• [10] Rongmei Zhang and Y.Charlie HU. “Assited peer-to-peer search with partial indexing”. IEEE Transactions on Parallel and Distributed Systems, Vol.18, No 8, pp. 1146-1158, 2007.
• [11] R.Motwani and P.Raghavan. Randomized Algorithms. Cambridge University Press,Cambridge,1995 [12] Marshall Hall, JR., Combinatorial Theory, John Wiley&sons Press, 1986.
• [13] Sun Shi Xin, Combinatorial Mathematics, UESTC Press, 2002.
• [14] Nima Sarshar, P Oscar Boykin, Vwani P.Roychowdhury. “Scalable percolation in power law networks”. International Conference on P2P computing, pp.2-9, 2004.
• [15] Xucheng Luo, Zhiguang Qin, Jinsong Han, Hanhua Chen. “DHT-assisted probability exhaustive search in unstructured P2P networks”. IEEE International Symposium on Parallel and Distributed Processing, pp.1-9, 2008.
• [16] PeerSim. http://peersim.sourceforge.net/, 28 October 2008.
• [17] Imen Filali and Fabrice Huet. Dynamic TTL-Based Search in unstructured Peer-toPeer Network. The 10th IEEE/ACM international Conference on Cluster, Cloud and Grid Computing, pp.438-447, 2010.
• [18] Aya Takekawa, Naohiko Imaeda, Tsuyoshi Kitagawa. The study of how to reduce the content delivery time and the sysytem load in P2P system. IEEE International Conference on Complex Intelligent and Software Intensive Systems, pp.1123-1128, 2010.
• [19] Hiroaki Yamanaka, Toru Fujiwara, Shingo Okamura. A metric of search efficiency and preventability of polluted contents for unstructured overlay. The 10th IEEE annual international symposium on applications and the internet, pp.181-184, 2010