Advertisement

A Framework for Structured Peer-to-Peer Overlay Networks

  • Luc Onana Alima
  • Ali Ghodsi
  • Seif Haridi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3267)

Abstract

Structured peer-to-peer overlay networks have recently emerged as good candidate infrastructure for building novel large-scale and robust Internet applications in which participating peers share computing resources as equals. In the past three year, various structured peer-to-peer overlay networks have been proposed, and probably more are to come. We present a framework for understanding, analyzing and designing structured peer-to-peer overlay networks. The main objective of the paper is to provide practical guidelines for the design of structured overlay networks by identifying a fundamental element in the construction of overlay networks: the embedding of k–ary trees. Then, a number of effective techniques for maintaining these overlay networks are discussed. The proposed framework has been effective in the development of the DKS system, whose preliminary design appears in [2].

Keywords

Root Node Overlay Network Distribute Hash Table Virtual Space Adaptive Stabilization 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aberer, K.: P-Grid: A self-organizing access structure for P2P information systems. In: Batini, C., Giunchiglia, F., Giorgini, P., Mecella, M. (eds.) CoopIS 2001. LNCS, vol. 2172, pp. 179–194. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  2. 2.
    Alima, L.O., El-Ansary, S., Brand, P., Haridi, S.: DKS(N, k, f): A Family of Low Communication, Scalable and Fault-Tolerant Infrastructures for P2P Applications. In: The 3rd International workshop CCGRID 2003, Tokyo, Japan (May 2003)Google Scholar
  3. 3.
    Alima, L.O., Ghodsi, A., Brand, P., Haridi, S.: Multicast in DKS(N, k, f) Overlay Networks. In: Papatriantafilou, M., Hunel, P. (eds.) OPODIS 2003. LNCS, vol. 3144, pp. 83–95. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  4. 4.
    Alima, L.O., Ghodsi, A., Brand, P., Haridi, S.: Multicast in DKS(N, k, f) Overlay Networks. In: Papatriantafilou, M., Hunel, P. (eds.) OPODIS 2003. LNCS, vol. 3144, pp. 83–95. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  5. 5.
    Amnefelt, M., Svenningsson, J.: Keso - a scalable, reliable and secure read/write peer-to-peer file system (2004)Google Scholar
  6. 6.
    Castro, M., Druschel, P., Kermarrec, A.-M., Rowstron, A.: SCRIBE: A large-scale and decentralised application-level multicast infrastructure. IEEE Journal on Selected Areas in Communications (JSAC); Special issue on Network Support for Multicast Communications (2002)Google Scholar
  7. 7.
    Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Wide-area cooperative storage with CFS. In: Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP 2001), Chateau Lake Louise, Banff, Canada (October 2001)Google Scholar
  8. 8.
    Dabek, F., Zao, B., Druschel, P., Kubiatowicz, J., Stoica, I.: Towards a common api for structured peer-to-peer overlays. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  9. 9.
    El-Ansary, S., Alima, L.O., Brand, P., Haridi, S.: A Framework for Peer-To-Peer Lookup Services Based on k-ary Search, Tech. Report TR-2002-06, SICS (May 2002)Google Scholar
  10. 10.
    El-Ansary, S., Alima, L.O., Brand, P., Haridi, S.: Efficient Broadcast in Structured P2P Netwoks. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  11. 11.
  12. 12.
    Ghodsi, A., Alima, L.O., Brand, P., Haridi, S.: Increasing Robustness while Minimizing Bandwidth Consumption in Structured Overlay Networks, Tech. Report ISRN KTH/IMIT/LECS/R-03/07–SE, Kista Sweden (2003)Google Scholar
  13. 13.
    Ghodsi, A., Alima, L.O., El-Ansary, S., Brand, P., Haridi, S.: Self-correcting broadcast in distributed hash tables. In: Parallel and Distributed Computing and Systems (PDCS 2003) (Calgary). ACTA Press (2003)Google Scholar
  14. 14.
    Gnutella (2003), http://www.gnutella.com
  15. 15.
    Harvey, N.J., Jones, M.B., Saroiu, S., Theimer, M., Wolman, A.: SkipNet: A Scalable Overlay Network with Practical Locality Properties. In: Fourth USENIX Symposium on Internet Technologies and Systems (USITS), Seattle, USA (March 2003)Google Scholar
  16. 16.
    Kaashoek, F., Karger, D.R.: Koorde: A simple degree-optimal distributed hash table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  17. 17.
    Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.: Oceanstore: An architecture for global-scale persistent storage. In: Proceedings of the Ninth international Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000) (November 2000)Google Scholar
  18. 18.
    Malki, D., Naor, M., Ratajczak, D.: Viceroy: A scalable and dynamic emulation of the butterfly. In: Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (2002)Google Scholar
  19. 19.
    Maymounkov, P., Mazières, D.: Kademlia: A Peer-to-Peer Information System Based on the XOR Metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 53. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  20. 20.
    Miguel, R.M.: Controlling the cost of reliability in peer-to-peer overlays. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735. Springer, Heidelberg (2003)Google Scholar
  21. 21.
    Naor, M., Wieder, U.: A simple fault tolerant distributed hash table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  22. 22.
    Clifford Neumann, B.: Scale in distributed systems, pp. 463–489. IEEE Computer Society, Los Alamitos (1994)Google Scholar
  23. 23.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content Addressable Network, Tech. Report TR-00-010, Berkeley, CA (2000)Google Scholar
  24. 24.
    Rowstron, A., Druschel, P.: Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  25. 25.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: ACM SIGCOMM 2001, San Deigo, CA, August 2001, pp. 149–160 (2001)Google Scholar
  26. 26.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications, Tech. Report TR-819, MIT (January 2002), http://www.pdos.lcs.mit.edu/chord/papers/chord-tn.ps
  27. 27.
    Tel, G.: Introduction to distributed algorithms. Cambridge University Press, Cambridge (1994)CrossRefzbMATHGoogle Scholar
  28. 28.
    Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing, U. C. Berkeley Technical Report UCB//CSD-01-1141 (April 2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Luc Onana Alima
    • 1
  • Ali Ghodsi
    • 1
  • Seif Haridi
    • 1
  1. 1.Swedish Institute of Computer Science (SICS)IMIT-Royal Institute of Technology (KTH)Sweden

Personalised recommendations