Peer-to-Peer Networking and Applications

, Volume 2, Issue 2, pp 98–108 | Cite as

Efficient and scalable search on scale-free P2P networks

  • Lu Liu
  • Jie Xu
  • Duncan Russell
  • Paul Townend
  • David Webster
Article

Abstract

Unstructured peer-to-peer (P2P) systems (e.g. Gnutella) are characterized by uneven distributions of node connectivity and file sharing. The existence of “hub” nodes that have a large number of connections and “generous” nodes that share many files significantly influences performance of information search over P2P file-sharing networks. In this paper, we present a novel Scalable Peer-to-Peer Search (SP2PS) method with low maintenance overhead for resource discovery in scale-free P2P networks. Different from existing search methods which employ one heuristic to direct searches, SP2PS achieves better performance by considering both of the number of shared files and the connectivity of each neighbouring node. SP2PS enables peer nodes to forward queries to the neighbours that are more likely to have the requested files and also can help in finding the requested files in the future hops. The proposed method has been simulated in different power-law networks with different forwarding degrees and distances. From our analytic and simulation results, SP2PS achieves better performance when compared to other related methods.

Keywords

Peer-to-peer Search Scale-free networks Simulation 

References

  1. 1.
    Adamic LA, Lukose RM, Puniyani AR, Huberman BA (2001) Search in power law networks. Phys Rev 64:046135–046131–046135-046138Google Scholar
  2. 2.
    Yang B, Garcia-Molina H (2002) Efficient search in peer-to-peer networks. International Conference on Distributed Computing Systems, ViennaGoogle Scholar
  3. 3.
    Li X, Wu J (2005) A hybrid searching scheme in unstructured P2P networks. International Conference on Parallel Processing, OsloGoogle Scholar
  4. 4.
    Lv Q, Cao P, Cohen E, Li K, Shenker S (2002) Search and replication in unstructured peer-to-peer networks. ACM SIGMETRICS, Marina Del ReyGoogle Scholar
  5. 5.
    Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H (2001) Chord: A scalable peer-to-peer lookup service for internet applications. ACM SIGCOMM, San DiegoGoogle Scholar
  6. 6.
    Antonopoulos N, Exarchakos G (2007) G-ROME: A semantic driven model for capacity sharing among P2P networks. J Internet Res 17:7–20CrossRefGoogle Scholar
  7. 7.
    Salter J, Antonopoulos N (2007) An optimised 2-Tier P2P architecture for contextualised keyword searches. Future Gener Comp Sy 23:241–251CrossRefGoogle Scholar
  8. 8.
    Rowstron A, Druschel P (2001) Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. IFIP/ACM International Conference on Distributed Systems Platforms, HeidelbergGoogle Scholar
  9. 9.
    Ratnasamy S, Francis P, Handley M, Karp R, Shenker S (2001) A scalable content-addressable network. ACM SIGCOMM, San DiegoGoogle Scholar
  10. 10.
    Li J, Stribling J, Morris R, Kaashoek MF (2005) Bandwidth-efficient management of DHT routing tables. 2nd Symposium on Networked Systems Design and Implementation, BostonGoogle Scholar
  11. 11.
    Maymounkov P, Mazi`eres D (2002) Kademlia: A peer to peer information system based on the XOR metric. Internation Workshop on Peer-to-Peer Systems, CambridgeGoogle Scholar
  12. 12.
    Rhea S, Geels D, Roscoe T, Kubiatowicz J (2004) Handling churn in a DHT. USENIX Annual Technical Conference, BostonGoogle Scholar
  13. 13.
    Vuong S, Li J (2003) Efa: an Efficient content routing algorithm in large peer-to-peer overlay networks. International Conference on Peer-to-Peer Computing, LinköpingGoogle Scholar
  14. 14.
    Liu L, Antonopoulos N, Mackin S (2007) Fault-tolerant peer-to-peer search on small-world networks. Future Gener Comp Sy 23:921–931CrossRefGoogle Scholar
  15. 15.
    Liu L, Antonopoulos N, Mackin S (2007) Small world peer-to-peer for resource discovery. International Conference on Information Networking, Lecture Notes in Computer Science, Estoril, PortugalGoogle Scholar
  16. 16.
    Li J, Vuong S (2004) An efficient clustered architecture for P2P networks. 18th International Conference on Advanced Information Networking and Application, FukuokaGoogle Scholar
  17. 17.
    Chawathe Y, Ratnasamy S, Breslau L, Lanham N, Shenker S (2003) Making gnutella-like P2P system scalable. ACM SIGCOMM, KarlsruheGoogle Scholar
  18. 18.
    Xiao L, Liu Y, Ni LM (2005) Improving unstructured peer-to-peer systems by adaptive connection establishment. IEEE Trans Comp 54:176–184CrossRefGoogle Scholar
  19. 19.
    Liu Y, Xiao L, Liu X, Ni LM, Zhang X (2005) Location awareness in unstructured peer-to-peer systems. IEEE Trans Parallel and Distrib Syst 16:163–174CrossRefGoogle Scholar
  20. 20.
    Crespo A, Garcia-Molina H (2002) Routing indices for peer-to-peer systems. International Conference on Distributed Computing Systems, ViennaGoogle Scholar
  21. 21.
    Sripanidkulchai K, Maggs B, Zhang H (2003) Efficient content location using interest-based locality in peer-to-peer systems. IEEE Infocom, San FranciscoGoogle Scholar
  22. 22.
    Liu L, Antonopoulos N, Mackin S, Xu J, Russell D (2009) Efficient resource discovery in self-organized unstructured peer-to-peer networks, Concurrency Computat: Pract Exper 23(2):159–183, FebruaryGoogle Scholar
  23. 23.
    Liu L, Antonopoulos N, Mackin S (2007) Social peer-to-peer for resource discovery. 15th Euromicro International Conference on Parallel, Distributed and Network-based Processing, NaplesGoogle Scholar
  24. 24.
    Marti S, Garcia-Molina H (2004) Limited reputation sharing in P2P systems. ACM Conference on Electronic Commerce, New YorkGoogle Scholar
  25. 25.
    Barabasi AL, Albert R (1999) Emergence of scaling in random networks. Science 286:509–512CrossRefMathSciNetGoogle Scholar
  26. 26.
    Robb J (2004) Scale-free networks. Global Guerrillas. http://globalguerrillas.typepad.com/globalguerrillas/2004/05/scalefree_terro.html
  27. 27.
    Saroiu S, Gummadi PK, Gribble SD (2002) A measurement study of peer-to-peer file sharing systems. International Conference on Multimedia Networking and Computing, Santa BarbaraGoogle Scholar
  28. 28.
    Gummadi KP, Dunn RJ, Saroiu S, Gribble SD, Levy HM, Zahorjan J (2003) Measurement, modelling and analysis of a P2P file-sharing workload. ACM Symposium on Operating Systems Principles, Bolton Landing, New YorkGoogle Scholar
  29. 29.
    Pauli C, Shepperd M (2005) An empirical investigation into P2P file-sharing user behaviour. Americas Conference on Information Systems, OmahaGoogle Scholar
  30. 30.
    Perera G, Christensen K, Roginsky A (2005) Targeted search: Reducing the time and cost for searching for objects in multiple-server networks. International Performance Computing and Communications Conference, PhoenixGoogle Scholar
  31. 31.
    Liu L, Antonopoulos N, Mackin S (2006) Directed information search and retrieval over unstructured peer-to-peer networks. The International Computer Engineering Conference, CairoGoogle Scholar
  32. 32.
    Banaei-Kashani F, Shahabi C (2003) Criticality-based analysis and design of unstructured peer-to-peer networks as complex systems. IEEE/ACM International Symposium on Cluster Computing and Grid, TokyoGoogle Scholar
  33. 33.
    Liu L, Antonopoulos N, Mackin S (2008) Managing peer-to-peer networks with human tactics in social interactions. J Supercomput 44(3):217–236, JuneGoogle Scholar

Copyright information

© Springer Science + Business Media, LLC 2009

Authors and Affiliations

  • Lu Liu
    • 1
  • Jie Xu
    • 1
  • Duncan Russell
    • 1
  • Paul Townend
    • 1
  • David Webster
    • 1
  1. 1.School of ComputingUniversity of LeedsLeedsUK

Personalised recommendations