Practical locality-awareness for large scale information sharing

Authors:
Ittai Abraham;Ankur Badola;Danny Bickson;Dahlia Malkhi;Sharad Maloo;Saar Ron
Affiliations:
The Hebrew University of Jerusalem, Jerusalem, Israel;IIT Bombay, India;The Hebrew University of Jerusalem, Jerusalem, Israel;Microsoft Research Silicon Valley and The Hebrew University of Jerusalem, Israel;IIT Bombay, India;The Hebrew University of Jerusalem, Jerusalem, Israel
Venue:
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Year:
2005

Citing 5
Cited 6

Kademlia: A Peer-to-Peer Information System Based on the XOR Metric

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
PlanetLab: an overlay testbed for broad-coverage services

ACM SIGCOMM Computer Communication Review
Compact name-independent routing with minimum stretch

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
One hop lookups for peer-to-peer overlays

HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9

On the topologies formed by selfish peers

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
ROFL: routing on flat labels

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
An application layer multicast approach based on topology-aware clustering

Computer Communications
Scaling all-pairs overlay routing

Proceedings of the 5th international conference on Emerging networking experiments and technologies
Scalable routing on flat names

Proceedings of the 6th International COnference
HAND: an overlay optimization algorithm in peer-to-peer systems

HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications

Quantified Score

Hi-index	0.00

Visualization

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.