KaydedilenlerDerginizi ekleyin

Dergiler / Istanbul University Journal of Electrical and Electronics Engineering / 2010 / Cilt: 10 - Sayı: 1

Searching for rare resources in unstructured P2P networks

HaiMei XU
XianLiang LU
ShouQing QI
Sayfa
1143–1151
Yayın Tarihi
2022-10-18
DOI
—
🏛️Bu makalenin bibliyografik verileri ve tam metin bağlantısı DergiPark üzerinden sağlanmıştır.
DergiPark Kaydı ↗
✨

Yapay Zeka Hızlı Bakış & Çıkarımlar

AI Insight
⚡ TL;DR(1 Cümlede Hızlı Çıkarım)

Both mathematical analysis and simulation results show that it improves the hit rate for rare resources from less than 1% to more than 90%.

📌 3 Maddede Bu Makale

🎯
Amaç & Hipotez:This paper has presented a novel algorithm for searching for rare resources in unstructured P2P networks.
📊
Temel Bulgular & Veri:Existing protocols such as Flooding and Random Walk can effectively locate popular resources while they are limited by very low hit rate for rare resources.
💡
Sonuç & Katkı:Both mathematical analysis and simulation results show that it improves the hit rate for rare resources from less than 1% to more than 90%.
🔬Tür:Araştırma Makalesi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Alan Parametreleri

Abstract

This paper has presented a novel algorithm for searching for rare resources in unstructured P2P networks. Existing protocols such as Flooding and Random Walk can effectively locate popular resources while they are limited by very low hit rate for rare resources. For users, the utility of getting rare resources is no less than that of getting popular ones. Thus high hit rate for rare resources will improve the system’s efficiency. According to different capability of different nodes, this paper explores a three-grade balanced tree to distribute index replicas of rare resources uniformly across a very small portion of nodes, which is easily deployable and lightweight in overhead. Both mathematical analysis and simulation results show that it improves the hit rate for rare resources from less than 1% to more than 90%.

🔖

Bu Makaleye Atıf Yap

XU, H., LU, X., QI, S. (2022). Searching for rare resources in unstructured P2P networks. Istanbul University Journal of Electrical and Electronics Engineering, Cilt: 10 - Sayı: 1, 1143–1151. https://ajindex.com/articles/543711

📄 Tam Metin PDF Okuyucu

📄

PDF görüntüleyici hazırlanıyor...

Kaynakça (16)

  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
  12. Sun Shi Xin, Combinatorial Mathematics, UESTC Press, 2002
  13. Nima Sarshar, P Oscar Boykin, Vwani P.Roychowdhury. “Scalable percolation in power law networks”. International Conference on P2P computing, pp.2-9, 2004
  14. 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
  15. PeerSim. http://peersim.sourceforge.net/, 28 October 2008
  16. Imen Filali and Fabrice Huet. Dynamic TTL-Based Search in unstructured Peer-to- Peer Network. The 10th IEEE/ACM international Conference