Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Space-efficiency for routing schemes of stretch factor three
Journal of Parallel and Distributed Computing
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
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
Finding nearest neighbors in growth-restricted metrics
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
On name resolution in peer-to-peer networks
Proceedings of the second ACM international workshop on Principles of mobile computing
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
Atomic Data Access in Distributed Hash Tables
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Novel architectures for P2P applications: the continuous-discrete approach
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
A Scalable Protocol for Content-Based Routing in Overlay Networks
NCA '03 Proceedings of the Second IEEE International Symposium on Network Computing and Applications
A Generic Scheme for Building Overlay Networks in Adversarial Scenarios
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Symphony: distributed hashing in a small world
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Object location in realistic networks
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
An empirical evaluation of internet latency expansion
ACM SIGCOMM Computer Communication Review
Distance estimation and object location via rings of neighbors
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
Improving lookup latency in distributed hash table systems using random sampling
IEEE/ACM Transactions on Networking (TON)
D2B: a de Bruijn based content-addressable network
Theoretical Computer Science - Complex networks
On the topologies formed by selfish peers
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Optimal-stretch name-independent compact routing in doubling metrics
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
Can ISPS and P2P users cooperate for improved performance?
ACM SIGCOMM Computer Communication Review
Towards fast decentralized construction of locality-aware overlay networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Optimal scale-free compact routing schemes in networks of low doubling dimension
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Recovering the Long-Range Links in Augmented Graphs
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Dynamic Routing and Location Services in Metrics of Low Doubling Dimension
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Araneola: A scalable reliable multicast system for dynamic environments
Journal of Parallel and Distributed Computing
Recovering the long-range links in augmented graphs
Theoretical Computer Science
Magnet: practical subscription clustering for Internet-scale publish/subscribe
Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems
Scalable routing on flat names
Proceedings of the 6th International COnference
Long range contacts in overlay networks
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
A self-repairing peer-to-peer system resilient to dynamic adversarial churn
IPTPS'05 Proceedings of the 4th 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
Robust locality-aware lookup networks
Self-star Properties in Complex Information Systems
Dependable peer-to-peer systems withstanding dynamic adversarial churn
Dependable Systems
On sampling in higher-dimensional peer-to-peer systems
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Distributed and compact routing using spatial distributions in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
| Hi-index | 0.00 |
This paper proposes the first peer-to-peer network and lookup algorithm that for any 0