Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Adaptive heuristics for binary search trees and constant linkage cost
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Randomized algorithms
LH*—a scalable, distributed data structure
ACM Transactions on Database Systems (TODS)
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
Journal of the ACM (JACM)
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
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
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
Censorship resistant peer-to-peer content addressable networks
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Gossip versus Deterministically Constrained Flooding on Small Networks
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Efficient Routing in Networks with Long Range Contacts
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Atomic Data Access in Distributed Hash Tables
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Building Low-Diameter P2P Networks
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Scalable, distributed data structures for internet service construction
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
On name resolution in peer-to-peer networks
Proceedings of the second ACM international workshop on Principles of mobile computing
Caching web services in mobile ad-hoc networks: opportunities and challenges
Proceedings of the second ACM international workshop on Principles of mobile computing
Looking up data in P2P systems
Communications of the ACM
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic construction of Bluetooth scatternets of fixed degree and low diameter
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Open Problems in Data-Sharing Peer-to-Peer Systems
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Butterflies and Peer-to-Peer Networks
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Novel architectures for P2P applications: the continuous-discrete approach
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
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
Scalable and dynamic quorum systems
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Peer-to-peer systems for prefix search
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
Asynchronous resource discovery
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Storm: using P2P to make the desktop part of the web
Proceedings of the fourteenth ACM conference on Hypertext and hypermedia
Overlay Networks: A Scalable Alternative for P2P
IEEE Internet Computing
dBBlue: low diameter and self-routing bluetooth scatternet
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Estimating network size from local information
Information Processing Letters
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The hyperring: a low-congestion deterministic data structure for distributed environments
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
LAND: stretch (1 + ε) locality-aware networks for DHTs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On zone-balancing of peer-to-peer networks: analysis of random node join
Proceedings of the joint international conference on Measurement and modeling of computer systems
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The price of validity in dynamic networks
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Simple efficient load balancing algorithms for peer-to-peer systems
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Geometric generalizations of the power of two choices
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Pagoda: a dynamic overlay network for routing, data management, and multicasting
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Compact routing on euclidian metrics
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Analyzing Kleinberg's (and other) small-world Models
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Balanced binary trees for ID management and load balance in distributed hash tables
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
The design and implementation of a next generation name service for the internet
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Percolation Search in Power Law Networks: Making Unstructured Peer-to-Peer Networks Scalable
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
On de Bruijn Routing in Distributed Hash Tables: There and Back Again
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
ICN: Interest-Based Clustering Network
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Aggregating Information in Peer-to-Peer Systems for Improved Join and Leave
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Implementing aggregation and broadcast over Distributed Hash Tables
ACM SIGCOMM Computer Communication Review
Low traffic overlay networks with large routing tables
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Optimal tradeoffs for location-based routing in large-scale ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Analyzing and characterizing small-world graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient lookup on unstructured topologies
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
A scheme for load balancing in heterogenous distributed hash tables
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Decentralized algorithms using both local and random probes for P2P load balancing
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Awarded Best Student Paper! - Pond: The OceanStore Prototype
FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
IEEE/ACM Transactions on Networking (TON)
Improving lookup latency in distributed hash table systems using random sampling
IEEE/ACM Transactions on Networking (TON)
SCALLOP: A Scalable and Load-Balanced Peer-to-Peer Lookup Protocol
IEEE Transactions on Parallel and Distributed Systems
Scalable percolation search on complex networks
Theoretical Computer Science - Complex networks
D2B: a de Bruijn based content-addressable network
Theoretical Computer Science - Complex networks
Locality in structured peer-to-peer networks
Journal of Parallel and Distributed Computing
Cycloid: a constant-degree and lookup-efficient P2P overlay network
Performance Evaluation - P2P computing systems
Scalable and dynamic quorum systems
Distributed Computing
Century papers at the first quarter-century milestone
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Peer counting and sampling in overlay networks: random walk methods
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Information retrieval in a peer-to-peer environment
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Asynchronous resource discovery
Computer Networks: The International Journal of Computer and Telecommunications Networking - Web dynamics
Chord2: A two-layer Chord for reducing maintenance overhead via heterogeneity
Computer Networks: The International Journal of Computer and Telecommunications Networking
The price of validity in dynamic networks
Journal of Computer and System Sciences
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
Asynchronous resource discovery in peer-to-peer networks
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
Balanced allocations with heterogenous bins
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Beehive: O(1)lookup performance for power-law query distributions in peer-to-peer overlays
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Beehive: O(1)lookup performance for power-law query distributions in peer-to-peer overlays
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
SkipNet: a scalable overlay network with practical locality properties
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Symphony: distributed hashing in a small world
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Availability of multi-object operations
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Novel architectures for P2P applications: The continuous-discrete approach
ACM Transactions on Algorithms (TALG)
On the complexity of greedy routing in ring-based peer-to-peer networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Journal of Systems and Software
Multiple choice tries and distributed hash tables
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Navigation issues in semantic peer to peer network
SADPI '07 Proceedings of the 2007 international workshop on Semantically aware document processing and indexing
AID: A global anti-DoS service
Computer Networks: The International Journal of Computer and Telecommunications Networking
ACM Transactions on Algorithms (TALG)
Load-balancing performance of consistent hashing: asymptotic analysis of random node join
IEEE/ACM Transactions on Networking (TON)
A hybrid query scheme to speed up queries in unstructured peer-to-peer networks
Advances in Multimedia
Exploiting the synergy between gossiping and structured overlays
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Insight into redundancy schemes in DHTs
The Journal of Supercomputing
Efficient file search in non-DHT P2P networks
Computer Communications
Attribute-based access to distributed data over P2P networks
International Journal of Computational Science and Engineering
C2: a new overlay network based on CAN and Chord
International Journal of High Performance Computing and Networking
A Diophantine model of routes in structured P2P overlays
ACM SIGMETRICS Performance Evaluation Review
Evaluation study of a distributed caching based on query similarity in a P2P network
Proceedings of the 2nd international conference on Scalable information systems
Paths to stardom: calibrating the potential of a peer-based data management system
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A randomized algorithm for the joining protocol in dynamic distributed networks
Theoretical Computer Science
Hybrid DHT Design for Mobile Environments
Agents and Peer-to-Peer Computing
P3N: profiling the potential of a peer-based data management system
Proceedings of the VLDB Endowment
Shortest-path routing in randomized DHT-based Peer-to-Peer systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Araneola: A scalable reliable multicast system for dynamic environments
Journal of Parallel and Distributed Computing
Tiara: A Self-stabilizing Deterministic Skip List
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A Practical Approach to Network Size Estimation for Structured Overlays
IWSOS '08 Proceedings of the 3rd International Workshop on Self-Organizing Systems
Degree 3 Suffices: A Large-Scale Overlay for P2P Networks
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
P2P Networking and Applications
P2P Networking and Applications
Investigating the existence and the regularity of Logarithmic Harary Graphs
Theoretical Computer Science
A structured P2P network based on the small world phenomenon
The Journal of Supercomputing
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Proceedings of the 28th ACM symposium on Principles of distributed computing
PeerTIS: a peer-to-peer traffic information system
Proceedings of the sixth ACM international workshop on VehiculAr InterNETworking
A novel approach to improving search efficiency in unstructured peer-to-peer networks
Journal of Parallel and Distributed Computing
EpiChord: Parallelizing the Chord lookup algorithm with reactive routing state management
Computer Communications
On scalability properties of the Hi3 control plane
Computer Communications
Scalable P2P Overlays of Very Small Constant Degree: An Emerging Security Threat
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
On the self-organization of a hybrid peer-to-peer system
Journal of Network and Computer Applications
A small-world DHT built on generalized network coordinates
Proceedings of the 2010 EDBT/ICDT Workshops
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Self-healing in binomial graph networks
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems - Volume Part II
A critical analysis of latest advances in building trusted P2P networks using reputation systems
WISE'07 Proceedings of the 2007 international conference on Web information systems engineering
PHAC: an environment for distributed collaborative applications on P2P networks
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
Improving the dependability of prefix-based routing in DHTs
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
ComNET: a P2P community network
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Building a scalable P2P network with small routing delay
APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development
Future directions in distributed computing
Distributed hash table based ID management optimization for internet of things
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Maintaining the Ranch topology
Journal of Parallel and Distributed Computing
Towards automated detection of peer-to-peer botnets: on the limits of local approaches
LEET'09 Proceedings of the 2nd USENIX conference on Large-scale exploits and emergent threats: botnets, spyware, worms, and more
Theory of communication networks
Algorithms and theory of computation handbook
FISH: a novel peer-to-peer overlay network based on
WAIM'10 Proceedings of the 11th international conference on Web-age information management
Randomized load balancing strategies with churn resilience in peer-to-peer networks
Journal of Network and Computer Applications
HyCube: a DHT routing system based on a hierarchical hypercube geometry
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II
D1HT: a distributed one hop hash table
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
HyPeer: Structured overlay with flexible-choice routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
SkewCCC+: a heterogeneous distributed hash table
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Opportunistic P2P communications in delay-tolerant rural scenarios
EURASIP Journal on Wireless Communications and Networking - Special issue on opportunistic and delay tolerant networks
Deterministic dominating set construction in networks with bounded degree
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Pond: the oceanstore prototype
FAST'03 Proceedings of the 2nd USENIX conference on File and storage technologies
Re-Chord: a self-stabilizing chord overlay network
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Removing uncertainties from overlay network
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
HD Tree: A novel data structure to support multi-dimensional range query for P2P networks
Journal of Parallel and Distributed Computing
Psu: a novel low-latency constant-degree overlay network
Frontiers of Computer Science in China
Scalable Stealth Mode P2P Overlays of Very Small Constant Degree
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Proceedings of the 2nd ACM Symposium on Cloud Computing
Corona: a stabilizing deterministic message-passing skip list
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing De Bruijn networks
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Error-Resilient Routing for Supporting Multi-dimensional Range Query in HD Tree
DS-RT '11 Proceedings of the 2011 IEEE/ACM 15th International Symposium on Distributed Simulation and Real Time Applications
A structured peer-to-peer system with integrated index and storage load balancing
IICS'05 Proceedings of the 5th international conference on Innovative Internet Community Systems
Efficient message flooding on DHT network
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Möbius-deBruijn: The product of Möbius cube and deBruijn digraph
Information Processing Letters
Cactus: a new constant-degree and fault tolerate p2p overlay
PRIMA'06 Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems
SkipTree: a scalable range-queryable distributed data structure for multidimensional data
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
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
Cayley DHTs — a group-theoretic framework for analyzing DHTs based on cayley graphs
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
RAQ: a range-queriable distributed data structure
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Attribute-Based access to distributed data over p2p networks
DNIS'05 Proceedings of the 4th international conference on Databases in Networked Information Systems
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
A framework for structured peer-to-peer overlay networks
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
AESOP: altruism-endowed self-organizing peers
DBISP2P'04 Proceedings of the Second international conference on Databases, Information Systems, and Peer-to-Peer Computing
Self-optimizing DHTs using request profiling
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Towards truthful feedback in p2p data structures
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I
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
On the cost of participating in a peer-to-peer network
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Comparing the performance of distributed hash tables under churn
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Simple efficient load balancing algorithms for peer-to-peer systems
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Tiara: A self-stabilizing deterministic skip list and skip graph
Theoretical Computer Science
The dynamic and-or quorum system
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Improving sender anonymity in a structured overlay with imprecise routing
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
Robust locality-aware lookup networks
Self-star Properties in Complex Information Systems
Dependable peer-to-peer systems withstanding dynamic adversarial churn
Dependable Systems
Theory and network applications of balanced kautz tree structures
ACM Transactions on Internet Technology (TOIT)
A comparison of distributed test generation techniques
VECoS'08 Proceedings of the Second international conference on Verification and Evaluation of Computer and Communication Systems
Mutually independent hamiltonian cycles of binary wrapped butterfly graphs
Mathematical and Computer Modelling: An International Journal
Tide: An effective and practical design for hierarchical-structured P2P model
Computer Communications
A hierarchical approach to improve performance of unstructured peer-to-peer system
International Journal of Communication Networks and Distributed Systems
Efficient and secure decentralized network size estimation
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I
Journal of Network and Computer Applications
CDACAN: a scalable structured P2P network based on continuous discrete approach and CAN
HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
Towards Robust Routing in HD Tree
DS-RT '12 Proceedings of the 2012 IEEE/ACM 16th International Symposium on Distributed Simulation and Real Time Applications
Decentralized monitoring in peer-to-peer systems
Benchmarking Peer-to-Peer Systems
Corona: A stabilizing deterministic message-passing skip list
Theoretical Computer Science
| Hi-index | 0.02 |
We propose a family of constant-degree routing networks of logarithmic diameter, with the additional property that the addition or removal of a node to the network requires no global coordination, only a constant number of linkage changes in expectation, and a logarithmic number with high probability. Our randomized construction improves upon existing solutions, such as balanced search trees, by ensuring that the congestion of the network is always within a logarithmic factor of the optimum with high probability. Our construction derives from recent advances in the study of peer-to-peer lookup networks, where rapid changes require efficient and distributed maintenance, and where the lookup efficiency is impacted both by the lengths of paths to requested data and the presence or elimination of bottlenecks in the network.