Skip to main content
SpringerLink
Log in

P2P resource searching with Cloning Random Walker assisted by Weakly Connected Dominating Set

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Peer-to-peer (P2P) networks feature resource sharing in a distributed network environment. How to efficiently find out target objects (i.e., data, file, etc.) distributed in a P2P network is the remarkable process for resource sharing. The searching efficiency highly depends on the popularity of the target object. However, the popularity varies since peer joining or leaving a P2P network is very dynamic. Many researches aimed at finding a good searching scheme in such a variable environment with a better trade-off among long searching time, a large amount of duplicated query messages and a low successful search hit rate. In this paper, we propose a Cloning Random Walker assisted by Weakly Connected Dominating Set (CloneRW+WCDS) method to adaptively locate the target object in a P2P network. Our simulation results also depict that our proposed scheme can perform a better trade-off among the search delay, message overhead per hit and success rate while conducting resource searching in a P2P network.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Notes

  1. In the rest of the paper, unless otherwise specified, we will use the terms “peer” and “node” interchangeably.

References

  1. Zhou L, Zhang Y, Song K, Jing W, Vasilakos AV (2011) Distributed media-service scheme for P2P-based vehicular networks. IEEE Trans Veh Technol 60(2):692–703

    Article  Google Scholar 

  2. Zhao J, Cao G (May 2008) VADD: vehicle-assisted data delivery in vehicular ad hoc networks. IEEE Trans Veh Technol 57(3):1910–1922

    Google Scholar 

  3. Qu W, Zhou W, Kitsuregawa M (February 2010) Sharable file searching in unstructured peer-to-peer systems. J Supercomput 51(2):149–166

    Google Scholar 

  4. Leu J-S, Tsai C-W, Lin W-H (2011) Resource searching in an unstructured P2P network based on Cloning Random Walker assisted by Dominating Set. Comput Netw 55(3):722–733

    Article  Google Scholar 

  5. Zhong M, Shen K, Seiferas J (2008) The convergence-guaranteed random walk and its applications in peer-to-peer networks. IEEE Trans Comput 57(5):619–633

    Article  MathSciNet  Google Scholar 

  6. Gkantsidis C, Mihail M, Saberi A (2004) Random walks in peer-to-peer networks. In: IEEE INFOCOM, pp 120–130

  7. Jiang S, Guo L, Zhang X, Wang H (2008) LightFlood: minimizing redundant messages and maximizing the scope of peer-to-peer search. IEEE Trans Parallel Distrib Syst 19(5):601–614

    Article  Google Scholar 

  8. Gkantsidis C, Mihail M (2005) Hybrid search schemes for unstructured peer-to-peer network. In: IEEE INFOCOM, vol 3, pp 1526–1537

  9. Chen S, Zhang Z, Chen S, Shi B (2008) Efficient file search in non-DHT P2P networks. Comput Commun 31(2):304–317

    Article  Google Scholar 

  10. Jiang H, Jin S (2005) Exploiting dynamic querying like flooding techniques in unstructured peer-to-peer networks. In: ICNP, pp 10–19

  11. Kalogeraki V, Gunopulos D, Zeinalipour-Yazti D (2002) A local search mechanism for peer-to-peer networks. In: CIKM, pp 300–307

  12. Crespo A, Garcia-Molina H (2002) Routing indices for peer-to-peer systems. In: ICDCS, pp 23–32

  13. Yang B, Garcia-Molina H (2002) Improving search in peer-to-peer networks. In: ICDCS, pp 5–14

  14. Menasce D, Kanchanapalli L (2002) Probabilistic scalable P2P resource location services. SIGMETRICS 30(2):48–58

    Article  Google Scholar 

  15. Tsoumakos D, Roussopoulos N (2003) Adaptive probabilistic search for peer-to-peer networks. In: P2P, pp 102–109

  16. Puttaswamy K, Sala A, Zhao B (2008) Searching for rare objects using index replication. In: INFOCOM, pp 1723–1731

  17. Kumar A, Xu J, Zegura EW (2005) Efficient and scalable query routing for unstructured peer-to-peer networks. In: INFOCOM, vol 2, pp 1162–1173

  18. Chang NB, Liu M (2007) Controlled flooding search in a large network. IEEE/ACM Trans Netw 15(2):436–449

    Article  MathSciNet  Google Scholar 

  19. Lin T, Lin P, Wang H, Chen C (2009) Dynamic search algorithm in unstructured peer-to-peer networks. IEEE Trans Parallel Distrib Syst 20(5):1–5

    Article  MATH  Google Scholar 

  20. Han B, Jia W (2007) Clustering wireless ad hoc networks with weakly connected dominating set. J Parallel Distrib Comput 67(6):727–737

    Article  MATH  Google Scholar 

  21. Chen YZ, Liestman AL (2003) A zonal algorithm for clustering ad hoc networks. Int J Found Comput Sci 14(2):305–322

    Article  MATH  Google Scholar 

  22. Chakchouk N, Hamdaoui B, Frikha M (2009) WCDS-induced routing for data-aggregation in wireless sensor networks. In: First international conference on communications and networking. ComNet 2009, pp 1–6

  23. Jia L, Rajaraman R, Suel T (2002) An efficient distributed algorithm for constructing small dominating sets. Distrib Comput 15(4):193–205

    Article  Google Scholar 

  24. Liang B, Hass Z (2000) Virtual backbone generation and maintenance in ad-hoc network mobility management. In: IEEE INFOCOM, pp 1293–1302

  25. Kuhn F, Wattenhofer R (2003) Constant-time distributed dominating set approximation. In: PODC, pp 25–32

  26. Chen YP, Liestman AL (2002), Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks. In: The third ACM international symposium on mobile ad hoc networking and, computing (MobiHoc’02), pp 165–172

  27. Aiello W, Chung F, Lu L (2000) A random graph model for massive graphs. In: STOC, pp 171–180

  28. Chawathe Y, Ratnasamy S, Breslau L (2003) Making Gnutella-like P2P systems scalable. In: SIGCOMM, pp 407–418

Download references

Author information

Authors and Affiliations

  1. Department of Electronic and Computer Engineering, National Taiwan University of Science and Technology, #43, Sec. 4 Keelung Rd., Taipei 106, Taiwan

    Jenq-Shiou Leu, Wei-Hsiang Lin & Jheng-Huei Chen

Authors
  1. Jenq-Shiou Leu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wei-Hsiang Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jheng-Huei Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jenq-Shiou Leu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Leu, JS., Lin, WH. & Chen, JH. P2P resource searching with Cloning Random Walker assisted by Weakly Connected Dominating Set. J Supercomput 68, 443–458 (2014). https://doi.org/10.1007/s11227-013-1046-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-013-1046-0

Keywords

Search

Navigation