Skip to main content
SpringerLink
Log in

Shortcoming, problems and analytical comparison for flooding-based search techniques in unstructured P2P networks

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

Peer-to-Peer networks attracted a significant amount of interest because of their capacity for resource sharing and content distribution. Content distribution applications allow personal computers to function in a coordinated manner as a distributed storage medium by contributing, searching, and obtaining digital content. Searching in unstructured P2P networks is an important problem, which has received considerable research attention. Acceptable searching techniques must provide large coverage rate, low traffic load, and optimum latency. This paper reviews flooding-based search techniques in unstructured P2P networks. It then analytically compares their coverage rate, and traffic overloads. Our simulation experiments have validated analytical results.

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
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  1. Elena M, Janne R, Marina P, Petri, M (2008) A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks. Comput Networks 52:2097–2128

    Article  Google Scholar 

  2. Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for internet applications. In: Acm Sigcomm 2001, vol 31, pp 149–160

  3. Ratnasamy S, Francis P, Handley M, Karp R, Shenker S (2001) A scalable content-addressable network. In: Acm Sigcomm 2001, vol 31, pp 161–172

  4. Napster. http://music.napster.com/napsterhomemain.htm. Last visited on 18 January 2011

  5. Yang B, Garcia-Molina H (2002) Improving search in peer-to-peer networks. In: International conference on distributed computing systems, vol 22, pp 5–14

  6. kaza. http://www.kazaa.com/us/index.htm. Last visited on 18 January 2011

  7. Cohen B (2003) Incentives build robustness in bittorrent. In: 1st workshop on economics of peer-to-peer systems, pp 251–260

  8. Stauffer AO, Barbosa VC (2007) Probabilistic heuristics for disseminating information in networks. IEEE Trans Netw 15:425–435

    Article  Google Scholar 

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

    Article  Google Scholar 

  10. Yingwu Z (2005) Enhancing search performance in peer-to-peer networks. PhD thesis, University of Cincinati Departement of Electronic & Computer Engineering and Computer Science

  11. Lua EK, Crowcroft J, Pias, MSRLS (2005) A survey and comparison of peer-to-peer overlay network schemes. IEEE Communications Surveys & Tutorials 7:72–93

    Article  Google Scholar 

  12. Chen S, Shi B (2008) Efficient file search in non-dht p2p networks. Comput Commun 31:304–317

    Article  Google Scholar 

  13. Oliveira L, Siqueira I, Macedo D, Loureiro A, Wong HC, Nogueira J (2005) Evaluation of peer-to-peer network content discovery techniques over mobile ad hoc networks. In: WoWMoM. Sixth IEEE international symposium on a multimedia networks, pp 51–56

  14. Baryshnikov Y, Coffman E, Jelenkovic P, Momcilovic P, Rubenstein D (2004) Flood search under the california split rule. Oper Res Lett 32:199–206

    Article  MathSciNet  MATH  Google Scholar 

  15. Jiang S, Zhang X (2003) Floodtrail: an efficient file search technique in unstructured peer-to-peer systems. In: Global telecommunications conference. Globecom, vol 5, pp 2891–2895

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

    Article  Google Scholar 

  17. Sripanidkulchai K, Maggs B, Zhang H (2003) Efficient content location using interest-based locality in peer-to-peer systems. In: IEEE Infocom, vol 3, pp 2166–2176

  18. Lv Q, Ratnasamy S, Shenker S (2002) Can heterogeneity make gnutella scalable? In: Proc first int workshop peer-to-peer systems (IPTPS ’02), vol 2429, pp 94–103

  19. Aberer K, Hauswirth M (2002) An overview on peer-to-peer information systems. In: WDAS, pp 171–188

  20. Zhu Z, Kalnis P, Bakiras S (2008) Dcmp: a distributed cycle minimization protocol for peer-to-peer networks. IEEE Trans Parallel Distrib Syst 19:363–377

    Article  Google Scholar 

  21. Hsiao HC, Liao H, Huang CC (2009) Resolving the topology mismatch problem in unstructured peer-to-peer networks. IEEE Trans Parallel Distrib Syst 20(11):1668–1681

    Article  Google Scholar 

  22. Medina A, Byers J, Matta I (2000-005) Brite: a flexible generator of internet topologies. Tech. Rep., Boston, MA, USA

  23. Chang N, Liu M (2004) Revisiting the ttl-based controlled flooding search: optimality and randomization. In: Mobile computing and networking, pp 85–99

  24. Jahan Hassan SJ (2005) On the optimization trade-offs of expanding ring search. LNCS, vol 3326. Springer, pp 489–494

  25. Chou CC (2007) Techniques for peer-to-peer content distribution over mobile ad hoc networks. PhD thesis, University of Southern California Department of Electrical Engineering

  26. Pu IM, Shen Y (2009) Enhanced blocking expanding ring search in mobile ad hoc networks. In: 3rd international conference on new technologies, mobility and security (NTMS), pp 1–5

  27. Tsoumakos D, Roussopoulos N (2003) A comparison of peer-to-peer search methods. In: Proceedings of the sixth international workshop on the web and databases, San Diego, USA

  28. Lv Q, Cao P, Cohen E, Li K, Shenker S (2002) Search and replication in unstructured peer-to-peer networks. In: Proceedings of the 16th international conference on supercomputing, vol 30, pp 84–95

  29. Kalogeraki V, Zeinalipour-Yazti D, Gunopulos D (2002) A local search mechanism for peer-to-peer networks. In: Conference on information and knowledge management, CIKM 2002. Association for Computing Machinery, pp 300–307

  30. Vassilios V, Dimakopoulos EP (2006) On the performance of flooding-based resource discovery. IEEE Trans Parallel Distrib Syst 17(11):1242–1252

    Article  Google Scholar 

  31. Bloom BH (1970) Space/time trade-offs in hash coding with allowable errors. In: Communications of the ACM, vol 13, pp 422–426

  32. Fan L, Cao P, Almeida J, Broder AZ (1998) Summary cache: a scalable wide-area web cache sharing protocol. In: Proceedings of the ACM conference on applications, technologies, architectures, and protocols for computer communications (SIGCOMM), pp 291–293

  33. Rhea SC, Kubiatowicz J (2002) Probabilistic location and routing. In: Proc. IEEE Infocom‘02, vol 3, pp 1248–1257

  34. Kumar A, Xu J, Zegura EW (2005) Efficient and scalable query routing for unstructure peer-to-peer networks. In: Proc. IEEE Infocom‘05, vol 2, pp 1162–1173

  35. Broder A, Mitzenmacher M (2002) Network applications of bloom filters: a survey. In: Proceedings of the annual allerton conference on communication control and computing, vol 40, pp 636–646

  36. Donnet B, Baynat B, Friedman T (2010) Improving retouched bloom filter for trading off selected false positives against false negatives. Comput Netw Elsevier 54:3373–3378

    Article  Google Scholar 

  37. Chawathe Y, Ratnasamy S, Breslau L, Lanham N, Shenker S (2003) Making gnutella-like p2p systems scalable. In: Computer communication review, vol 33, pp 407–418

  38. Zeinalipour-Yazti D, Vana Kalogeraki DG (2007) pfusion: A p2p architecture for internet-scale content-based search and retrieval. IEEE Trans Parallel Distrib Syst 18:804–817

    Article  Google Scholar 

  39. Jin S, Jiang H (2007) Novel approaches to efficient flooding search in peer-to-peer networks. Comput Networks 51(10):2818–2832

    Article  MATH  Google Scholar 

  40. Clip2 (2007) http://www.clip2.com

Download references

Acknowledgement

The research was supported by the Research University Grant Scheme, Universiti Putra Malaysia (RUGS Number: 05/03/10/1038RU).

Author information

Authors and Affiliations

  1. Department of Communication Technology and Networks, University Putra Malaysia, 43400 UPM Serdang, Selangor D.E., Malaysia

    Hassan Barjini, Mohamed Othman, Hamidah Ibrahim & Nur Izura Udzir

  2. Lab of Computational Science and Informatics, Institute of Mathematical Research (INSPEM), Universiti Putra Malaysia, Serdang, Selangor, Malaysia

    Mohamed Othman

Authors
  1. Hassan Barjini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohamed Othman
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hamidah Ibrahim
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Nur Izura Udzir
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hassan Barjini.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Barjini, H., Othman, M., Ibrahim, H. et al. Shortcoming, problems and analytical comparison for flooding-based search techniques in unstructured P2P networks. Peer-to-Peer Netw. Appl. 5, 1–13 (2012). https://doi.org/10.1007/s12083-011-0101-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-011-0101-y

Keywords

Search

Navigation