Skip to main content
SpringerLink
Log in

PSON: A scalable P2P file sharing system with efficient complex query support

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

Abstract

A desired P2P file sharing system is expected to achieve the following design goals: scalability, routing efficiency and complex query support. In this paper, we propose a powerful P2P file sharing system, PSON, which can satisfy all the three desired properties. PSON is essentially a semantic overlay network of logical nodes. Each logical node represents a cluster of peers that are close to each other. A powerful peer is selected in each cluster to support query routing on the overlay network while the less powerful peers are responsible for the maintenance of shared contents. To facilitate query routing, super peers are organized in form of a balanced binary search tree. By exploiting the concept of semantics, PSON can support complex queries in a scalable and efficient way. In this paper, we present the basic system design such as the semantic overlay construction, query routing and system dynamics. A load balancing scheme is proposed to further enhance the system performance. By simulation experiments, we show that PSON is scalable, efficient and is able to support complex queries.

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
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21

Similar content being viewed by others

Notes

  1. Semantic tree is probably the most popular and useful classification hierarchy. Other hierarchies are also possible as shown in [6]. In our work, we use the tree structure to illustrate the design of PSON.

  2. We have identified the fundamental difference between SSW and PSON in Section 2. Here, we simply compare the average search path length of the two systems.

References

  1. Aberer K, Cudré-Mauroux P, Hauswirth M, Pelt TV (2004) Gridvine: building internet-scale semantic overlay networks. In: International semantic web conference, pp 107–121

  2. Barabasi A-L, Albert R (1999) Emergence of scaling in random networks. Science 286:509–512

    Article  MathSciNet  Google Scholar 

  3. Bharambe AR, Agrawal M, Seshan S (2004) Mercury: supporting scalable multi-attribute range queries. ACM SIGCOMM Comput Commun Rev 34(4):353–366

    Article  Google Scholar 

  4. Chen Y, Xu Z, Zhai C (2005) A scalable semantic indexing framework for peer-to-peer information retrieval. In: SIGIR 2005 workshop: heterogeneous and distributed information retrieval

  5. Cohen E, Fiat A, Kaplan H (2003) Associative search in peer-to-peer networks: harnessing latent semantics. IEEE INFOCOM 2:1261–1271

    Google Scholar 

  6. Crespo A, Garcia-Molina H (2004) Semantic overlay networks for P2P systems. In: International workshop on agents and Peer-to-Peer computing (AP2PC’04), pp 1–13

  7. Doulkeridis C, Norvag K, Vazirgiannis M (2007) Desent: decentralized and distributed semantic overlay generation in P2P networks. IEEE J Sel Areas Commun 25(1):25–34

    Article  Google Scholar 

  8. Huang Y, Fu TZ, Chiu D-M, Lui JC, Huang C (2008) Challenges, design and analysis of a large-scale P2P-VOD system. SIGCOMM Comput Commun Rev 38(4):375–388

    Article  MATH  Google Scholar 

  9. Li M, Lee W-C, Sivasubramaniam A (2004) Semantic small world: an overlay network for Peer-to-Peer search. In: ICNP, pp 228–238

  10. Li Y, Lao L, Cui J-H (2006) SDC: a distributed clustering protocol for Peer-to-Peer networks. In: The fifth IFIP networking conference, vol 3976, pp 1234–1239

  11. Mockapetris PV (1987) Domain names—concepts and facilities. Request for Comments 1034. Internet Engineering Task Force

  12. Mockapetris PV (1987) Domain names—implementation and specification. Request for Comments 1035. Internet Engineering Task Force

  13. Qiu D, Srikant R (2004) Modeling and performance analysis of bittorrent-like Peer-to-Peer networks. SIGCOMM Comput Commun Rev 34(4):367–378

    Article  Google Scholar 

  14. Ramaswamy L, Gedik B, Liu L (2005) A distributed approach to node clustering in decentralized Peer-to-Peer networks. IEEE Trans Parallel Distrib Syst 16(9):814–829

    Article  Google Scholar 

  15. Ratnasamy S, Francis P, Handley M, Karp R, Schenker S (2001) A scalable content-addressable network. In: ACM SIGCOMM, pp 161–172

  16. Ratnasamy S, Handley M, Karp RM, Shenker S (2002) Topologically-aware overlay construction and server selection. In: INFOCOM

  17. Rowstron A, Druschel P (2001) Pastry: scalable, decentralized object location, and routing for large-scale Peer-to-Peer systems. Lect Notes Comput Sci 2218:329–350

    Article  Google Scholar 

  18. Sahin OD, Gulbeden A, Emekci F, Agrawal D, Abbadi AE (2005) Prism: indexing multi-dimensional data in P2P networks using reference vectors. In: MULTIMEDIA ’05: proceedings of the 13th annual ACM international conference on multimedia. ACM, New York, pp 946–955

    Chapter  Google Scholar 

  19. Silaghi B, Bhattacharjee B, Keleher P (2002) Query routing in the terradir distributed directory. In: SPIE ITCOM, vol 4868, pp 299–309

  20. Silaghi B, Gopalakrishnan V, Bhattacharjee B, Keleher P (2004) Hierarchical routing with soft-state replicas in terradir. In: The 18th international parallel and distributed processing symposium

  21. Sripanidkulcha K, Maggs B, Zhang H (2003) Efficient content location using interest-based locality in Peer-to-Peer systems. IEEE INFOCOM 3:2166–2176

    Google Scholar 

  22. 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, pp 149–160

  23. Tang C, Xu Z, Dwarkadas S (2003) Peer-to-Peer information retrieval using self-organizing semantic overlay networks. In: ACM SIGCOMM, pp 175–186

  24. Terpstra WW, Kangasharju J, Leng C, Buchmann AP (2007) Bubblestorm: resilient, probabilistic, and exhaustive Peer-to-Peer search. SIGCOMM Comput Commun Rev 37(4):49–60

    Article  Google Scholar 

  25. Waldvogel M, Rinaldi R (2003) Efficient topology-aware overlay network. SIGCOMM Comput Commun Rev 33(1):101–106

    Article  Google Scholar 

  26. Waxman BM (1988) Routing of multipoint connections. IEEE J Sel Areas Commun 6:1617–1622

    Article  Google Scholar 

  27. Zegura EW, Calvert KL, Bhattacharjee S (1996) How to model an internetwork. IEEE INFOCOM 2:594–602

    Google Scholar 

  28. Zhang R, Hu YC (2005) Assisted Peer-to-Peer search with partial indexing. IEEE INFOCOM 3:1514–1525

    Google Scholar 

  29. Zhao BY, Kubiatowicz JD, Joseph AD (2001) Tapestry: an infrastructure for fault-tolerant wide-area location and routing. UC Berkeley, Tech. Rep. UCB/CSD-01-1141

Download references

Author information

Authors and Affiliations

  1. Computer Science & Engineering, University of Connecticut, Storrs, CT, 06269, USA

    Yan Li & Jun-Hong Cui

  2. Yahoo Software Development India PVt Ltd, Bangalore, 560001, India

    Jyoti Ahuja

  3. Google Santa Monica, 604 Arizona Avenue, Santa Monica, CA, 90401, USA

    Li Lao

  4. Department of CISE, University of Florida, Gainesville, FL, 32611, USA

    Shigang Chen

Authors
  1. Yan Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jyoti Ahuja
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Li Lao
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jun-Hong Cui
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Shigang Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jun-Hong Cui.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, Y., Ahuja, J., Lao, L. et al. PSON: A scalable P2P file sharing system with efficient complex query support. Peer-to-Peer Netw. Appl. 4, 3–22 (2011). https://doi.org/10.1007/s12083-010-0089-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-010-0089-8

Keywords

Search

Navigation