Practical Locality-Awareness for Large Scale Information Sharing
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.
KeywordsFault Tolerance Failed Node Color Group Random Node Close Node
Unable to display preview. Download preview PDF.
- 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
- 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
- 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