Advertisement

Practical Locality-Awareness for Large Scale Information Sharing

  • Ittai Abraham
  • Ankur Badola
  • Danny Bickson
  • Dahlia Malkhi
  • Sharad Maloo
  • Saar Ron
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3640)

Abstract

Tulip is an overlay for routing, searching and publish-lookup information sharing. It offers a unique combination of the advantages of both structured and unstructured overlays, that does not co-exist in any previous solution. Tulip features locality awareness (stretch 2) and fault tolerance (nodes can route around failures). It supports under the same roof exact keyed-lookup, nearest copy location, and global information search. Tulip has been deployed and its locality and fault tolerance properties verified over a real wide-area network.

Keywords

Fault Tolerance Failed Node Color Group Random Node Close Node 
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.
    Abraham, I., Gavoille, C., Malkhi, D., Nisan, N., Thorup, M.: Compact name-independent routing with minimum stretch. In: The Sixteenth ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2004) (2004Google Scholar
  2. 2.
    Chun, B., Culler, D., Roscoe, T., Bavier, A., Peterson, L., Wawrzoniak, M., Bowman, M.: Planetlab: an overlay testbed for broad-coverage services. SIGCOMM Comput. Commun. Rev. 33(3), 3–12 (2003)CrossRefGoogle Scholar
  3. 3.
    Gupta, A., Liskov, B., Rodrigues, R.: One hop lookups for peer-to-peer overlays. In: Ninth Workshop on Hot Topics in Operating Systems (HotOS-IX), Lihue, Hawaii, May 2003, pp. 7–12 (2003)Google Scholar
  4. 4.
    Gupta, I., Birman, K., Linga, P., Demers, A., van Renesse, R.: Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  5. 5.
    Maymounkov, P., Mazieres, 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
  6. 6.
    Rhea, S., Geels, D., Roscoe, T., Kubiatowicz, J.: Handling churn in a dht. Technical Report Technical Report UCB//CSD-03-1299, The University of California, Berkeley (December 2003)Google Scholar
  7. 7.
    Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Ittai Abraham
    • 1
  • Ankur Badola
    • 2
  • Danny Bickson
    • 1
  • Dahlia Malkhi
    • 3
  • Sharad Maloo
    • 2
  • Saar Ron
    • 1
  1. 1.The Hebrew University of JerusalemJerusalemIsrael
  2. 2.IIT BombayIndia
  3. 3.Microsoft Research Silicon Valley and The Hebrew University of JerusalemIsrael

Personalised recommendations