A tradeoff between space and efficiency for routing tables
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Concurrent online tracking of mobile users
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Routing with polynomial communication-space trade-off
SIAM Journal on Discrete Mathematics
Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Nearest neighbor queries in metric spaces
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Integrating content-based access mechanisms with hierarchical file systems
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
Compact routing with minimum stretch
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Finding nearest neighbors in growth-restricted metrics
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Peer-to-Peer: Harnessing the Power of Disruptive Technologies
Peer-to-Peer: Harnessing the Power of Disruptive Technologies
Routing in distributed networks: overview and open problems
ACM SIGACT News
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
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
On name resolution in peer-to-peer networks
Proceedings of the second ACM international workshop on Principles of mobile computing
Extracting guarantees from chaos
Communications of the ACM
Looking up data in P2P systems
Communications of the ACM
Internet indirection infrastructure
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
SCAN: A Dynamic, Scalable, and Efficient Content Distribution Network
Pervasive '02 Proceedings of the First International Conference on Pervasive Computing
Compact routing with name independence
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
The intrinsic dimensionality of graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Neighbor Table Construction and Update in a Dynamic Peer-to-Peer Network
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
The impact of DHT routing geometry on resilience and proximity
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Compact roundtrip routing with topology-independent node names
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Routing networks for distributed hash tables
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Feature-based distributed object search using signatures in Peer-to-Peer environments
Proceedings of the 2004 ACM symposium on Applied computing
A note on the nearest neighbor in growth-restricted metrics
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Internet indirection infrastructure
IEEE/ACM Transactions on Networking (TON)
Efficient, Self-Contained Handling of Identity in Peer-to-Peer Systems
IEEE Transactions on Knowledge and Data Engineering
Failure recovery for structured P2P networks: protocol design and performance evaluation
Proceedings of the joint international conference on Measurement and modeling of computer systems
Object location in realistic networks
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Dependability in Peer-to-Peer Systems
IEEE Internet Computing
The design of PaMaNet the Paderborn mobile ad-hoc network
Proceedings of the second international workshop on Mobility management & wireless access protocols
The robustness of content-based search in hierarchical peer to peer networks
Proceedings of the thirteenth ACM international conference on Information and knowledge management
A Self-Organizing Storage Cluster for Parallel Data-Intensive Applications
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
An Efficient Data Location Protocol for Self.organizing Storage Clusters
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
A mediation framework for multimedia delivery
Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia
Denial-of-service resilience in peer-to-peer file sharing systems
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Distributed approaches to triangulation and embedding
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On hierarchical routing in doubling metrics
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A scheme for load balancing in heterogenous distributed hash tables
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Name independent routing for growth bounded networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Weighted distributed hash tables
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Meridian: a lightweight network location service without virtual coordinates
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Awarded Best Student Paper! - Pond: The OceanStore Prototype
FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies
Improving lookup latency in distributed hash table systems using random sampling
IEEE/ACM Transactions on Networking (TON)
Securing distributed storage: challenges, techniques, and systems
Proceedings of the 2005 ACM workshop on Storage security and survivability
Efficient heartbeats and repair of softstate in decentralized object location and routing systems
EW 10 Proceedings of the 10th workshop on ACM SIGOPS European workshop
P2P Common API for Structured Overlay Networks: A Cross-Layer Extension
WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
D2B: a de Bruijn based content-addressable network
Theoretical Computer Science - Complex networks
End-host controlled multicast routing
Computer Networks: The International Journal of Computer and Telecommunications Networking - Overlay distribution structures and their applications
Consistency maintenance in dynamic peer-to-peer overlay networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Overlay distribution structures and their applications
Load balancing in dynamic structured peer-to-peer systems
Performance Evaluation - P2P computing systems
Distributed random digraph transformations for peer-to-peer networks
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
XYZ: A Scalable, Partially Centralized Lookup Service for Large-Scale Peer-to-Peer Systems
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Failure recovery for structured p2p networks: protocol design and performance under churn
Computer Networks: The International Journal of Computer and Telecommunications Networking
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
Georoy: A location-aware enhancement to Viceroy peer-to-peer algorithm
Computer Networks: The International Journal of Computer and Telecommunications Networking
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Symphony: distributed hashing in a small world
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
ACM Transactions on Algorithms (TALG)
Approximating TSP on metrics with bounded global growth
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Ranged hash functions and the price of churn
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
C2: a new overlay network based on CAN and Chord
International Journal of High Performance Computing and Networking
Distributed databases and peer-to-peer databases: past and present
ACM SIGMOD Record
Compact roundtrip routing with topology-independent node names
Journal of Computer and System Sciences
Decentralized access control in distributed file systems
ACM Computing Surveys (CSUR)
On the difficulty of finding the nearest peer in p2p systems
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
Reverse-query diffusion over unstructured overlay network for content delivery
International Journal of Computer Applications in Technology
Popularity adaptive search in hybrid P2P systems
Journal of Parallel and Distributed Computing
Query Message Delivery over Community-Based Overlay Network
KES '07 Knowledge-Based Intelligent Information and Engineering Systems and the XVII Italian Workshop on Neural Networks on Proceedings of the 11th International Conference
A method to reduce waiting time for P2P streaming systems
Proceedings of the 6th International Conference on Advances in Mobile Computing and Multimedia
Approximate object location and spam filtering on peer-to-peer systems
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
An Efficient Index Dissemination in Unstructured Peer-to-Peer Networks
IEICE - Transactions on Information and Systems
P2P Networking and Applications
P2P Networking and Applications
Classifying peer-to-peer network coding schemes
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Consistency maintenance in dynamic peer-to-peer overlay networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Overlay distribution structures and their applications
End-host controlled multicast routing
Computer Networks: The International Journal of Computer and Telecommunications Networking - Overlay distribution structures and their applications
PIAX: toward a framework for sensor overlay network
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
A study on managing the performance requirements of a distributed service delivery software system
Information and Software Technology
Distance-based bloom filter for an efficient search in mobile ad hoc networks
Proceedings of the 2007 conference on Human interface: Part I
Tree network coding for peer-to-peer networks
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia
Communications of the ACM
Maintaining the Ranch topology
Journal of Parallel and Distributed Computing
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Pond: the oceanstore prototype
FAST'03 Proceedings of the 2nd USENIX conference on File and storage technologies
Reverse-query mechanism for contents delivery management over unstructured overlay network
ICCOM'06 Proceedings of the 10th WSEAS international conference on Communications
A scheduling method to reduce waiting time for P2P streaming systems
Journal of Mobile Multimedia
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Computer Communications
International Journal of Grid and Utility Computing
Efficient stream delivery over unstructured overlay network by reverse-query propagation
KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part II
Proposal of social internetworking
HSI'05 Proceedings of the 3rd international conference on Human Society@Internet: web and Communication Technologies and Internet-Related Social Issues
Dynamic load balancing in distributed hash tables
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Discovery and routing in the HEN heterogeneous peer-to-peer network
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
A scalable and robust qos architecture for wifi p2p networks
ICDCIT'04 Proceedings of the First international conference on Distributed Computing and Internet Technology
A suite of testbeds for the realistic evaluation of peer-to-peer information retrieval systems
ECIR'05 Proceedings of the 27th European conference on Advances in Information Retrieval Research
Resource and service discovery in the igrid information service
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
Rapid mobility via type indirection
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Distributed transactional memory for metric-space networks
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Bounding communication cost in dynamic load balancing of distributed hash tables
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Robust locality-aware lookup networks
Self-star Properties in Complex Information Systems
NGITS'06 Proceedings of the 6th international conference on Next Generation Information Technologies and Systems
Ant-Based data traffic splitting for application-based routing
IICS'04 Proceedings of the 4th international conference on Innovative Internet Community Systems
Controlling incoming connections using certificates and distributed hash tables
NEW2AN'07 Proceedings of the 7th international conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking
| Hi-index | 0.05 |
Modern networking applications replicate data and services widely, leading to a need for location-independent routing -- the ability to route queries directly to objects using names independent of the objects' physical locations. Two important properties of a routing infrastructure are routing locality and rapid adaptation to arriving and departing nodes. We show how these two properties can be efficiently achieved for certain network topologies. To do this, we present a new distributed algorithm that can solve the nearest-neighbor problem for these networks. We describe our solution in the context of Tapestry, an overlay network infrastructure that employs techniques proposed by Plaxton, Rajaraman, and Richa [14].