Skip to main content
SpringerLink
Log in

On index load balancing in scalable P2P media distribution

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

Peer-Peer (P2P) technologies have recently been in the limelight for their disruptive power in particular they have emerged as a powerful multimedia content distribution mechanism. However, the widespread deployment of P2P networks are hindered by several issues, especially the ones that influence end-user satisfaction, including reliability. In this paper, we propose a solution for an efficient and user-oriented keyword lookup service on P2P networks. The proposed mechanism has been designed to achieve reliability via index load balancing and address the scalability issues of extremely popular keywords in the index. The system performance have been analytically derived as well implemented using the OpenDHT framework on PlanetLab.

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

Similar content being viewed by others

Notes

  1. \(Q\) could be different for different nodes

Abbreviations

P2P:

Peer to Peer

DHT:

Distributed Hash Table

References

  1. Aberer K, Datta A, Hauswirth M (2003) The quest for balancing peer load in structured peer-to-peer systems. Technical Report IC/2003/32, EPFL

  2. Aberer K, Datta A, Hauswirth M (2005) Multifaceted simultaneous load balancing in DHT-based P2P systems: A new game with old balls and bins, Self-*Properties in Complex Information Systems, LNCS 3460, Springer

  3. Byers J, Considine J, Mitzenmacher M (2004) Geometric generalizations of the power of two choices. In: Proceedings of the 16th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp 54–63

  4. Castro M, Druschel P, Kermarrec A-M, Rowstron A (2002) Scribe: a large-scale and decentralized application-level multicast infrastructure. IEEE J Sel Areas Commun (JSAC) 20(8)

  5. Jones PE, Eastlake D (2001) US Secure Hash Algorithm 1. Retrieved 2004, July 12, from the Internet Engineering Task Force web site: http://www.ietf.org/rfc/rfc3174

  6. Philip J, Erdelsky PJ (2001) The birthday paradox, http://efgh.com/math/birthday.htm

  7. Godfrey B, Lakshminarayanan K, Surana S, Karp R, Stoica I (2004) Load balancing in dynamic structured P2P systems. In: Proceedings of IEEE INFOCOM 2004, Hongkong, China

  8. Handschuh H, Knudsen LR, Robshaw MJ (2001) Analysis of SHA-1 in encryption mode. In: CT-RSA 2001, vol 2020 of Lecture Notes in Computer Science, pp 70–83

  9. http://bitconjurer.org/BitTorrent/

  10. http://www.napster.com/

  11. http://www.theregister.co.uk/2004/01/27/netflix_the_fly/

  12. Karlin S, Paterson L (2003) PlanetLab: a blueprint for introducing disruptive technology into the internet. In: Presented at the joint Princeton ACM/IEEE Computer Society meeting

  13. Karp B, Ratnasamy S, Rhea S, Shenker S (2003) Spurring adoption of DHTs with OpenHash, a public DHT service. In: Proceedings of the 3rd International Workshop on Peer-to-Peer Systems (IPTPS 2004)

  14. Mondal A, Goda K, Kitsuregawa M (2003) Effective load-balancing of peer-to-peer systems, Data Engineering Workshop

  15. Rowstron A, Druschel P (2001) Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems. In: IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pp 329–350

  16. Rowstron A, Kermarrec A-M, Castro M, Druschel P (2001) Scribe: the design of a large-scale event notification infrastructure. In: Crowcroft J, Hofmann M (eds.), Networked Group Communication, Third International COST264 Workshop (NGC'2001), Vol. 2233 of Lecture Notes in Computer Science, pp 30–43

  17. Saroiu S, Gummadi PK, Gribble SD (2002) A measurement study of peer-to-peer file sharing systems. In: Proceedings of multimedia computing and networking 2002 (MMCN'02)

Download references

Acknowledgments

We are thankful to Georgui Velev and Amir Nader Teherani, for their suggestions, ideas, critics and support. We also would like to acknowledge the efforts of Paolo Bergamo, Dayana Cucchi, Gionata Ercolani, Matteo Morigi and Daniele Pieri for their help in the experiments and code development.

Author information

Authors and Affiliations

  1. Department of Computer Science, University of California, Los Angeles, CA, 90095, USA

    Alok Nandan, Michael G. Parker & Giovanni Pau

  2. Dipartimento di Scienze dell’Informazione, University of Bologna, Bologna, 40126, Italy

    Paola Salomoni

Authors
  1. Alok Nandan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael G. Parker
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Giovanni Pau
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Paola Salomoni
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Giovanni Pau.

Additional information

This work has been partially supported by the Italian Ministry for Research and Education under the E-Grid initiative, FIRB initiative, ex 60%, ex 40% and Interlink Initiatives, by NSF under the Overprobe contract, by the UC Discovery Grant: UC-Core/STM contract.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nandan, A., Parker, M.G., Pau, G. et al. On index load balancing in scalable P2P media distribution. Multimed Tools Appl 29, 325–339 (2006). https://doi.org/10.1007/s11042-006-0015-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-006-0015-5

Keywords

Search

Navigation