Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Fault-Tolerant Networks Based on the de Bruijn Graph
IEEE Transactions on Computers
Lightwave networks based on de Bruijn graphs
IEEE/ACM Transactions on Networking (TON)
Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Bisecting de Bruijn and Kautz graphs
Discrete Applied Mathematics
SIAM Journal on Computing
Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination
NOSSDAV '01 Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video
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
Distributed object location in a dynamic network
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Fault-tolerant routing in peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Analysis of the evolution of peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
On connectivity of consecutive-d digraphs
Discrete Mathematics - Kleitman and combinatorics: a celebration
Efficient Peer-to-Peer Lookup Based on a Distributed Trie
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Dynamically Fault-Tolerant Content Addressable Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Routing Algorithms for DHTs: Some Open Questions
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
A Better Upper Bound on the Bisection Width of de Bruijn Networks (Extended Abstract)
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
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
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
Brief announcement: an overview of the content-addressable network D2B
Proceedings of the twenty-second annual symposium on Principles of distributed computing
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
Symphony: distributed hashing in a small world
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
HyperCuP: hypercubes, ontologies, and efficient search on peer-to-peer networks
AP2PC'02 Proceedings of the 1st international conference on Agents and peer-to-peer computing
IEEE Journal on Selected Areas in Communications
Routing in multihop packet switching networks: Gb/s challenge
IEEE Network: The Magazine of Global Internetworking
The impact of DHT routing geometry on resilience and proximity
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Efficient, Self-Contained Handling of Identity in Peer-to-Peer Systems
IEEE Transactions on Knowledge and Data Engineering
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
Pagoda: a dynamic overlay network for routing, data management, and multicasting
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
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
ICN: Interest-Based Clustering Network
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
The peer sampling service: experimental evaluation of unstructured gossip-based implementations
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Analyzing and enhancing the resilience of structured peer-to-peer systems
Journal of Parallel and Distributed Computing
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
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
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
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
IEEE/ACM Transactions on Networking (TON)
SCALLOP: A Scalable and Load-Balanced Peer-to-Peer Lookup Protocol
IEEE Transactions on Parallel and Distributed Systems
Random walk based node sampling in self-organizing networks
ACM SIGOPS Operating Systems Review
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
Empirical study of tolerating denial-of-service attacks with a proxy network
SSYM'05 Proceedings of the 14th conference on USENIX Security Symposium - Volume 14
ACM Transactions on Computer Systems (TOCS)
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
IEEE/ACM Transactions on Networking (TON)
Load-balancing performance of consistent hashing: asymptotic analysis of random node join
IEEE/ACM Transactions on Networking (TON)
Stochastic maintenance of overlays in structured P2P systems
Computer Communications
Resilience of structured P2P systems under churn: The reachable component method
Computer Communications
Dcell: a scalable and fault-tolerant network structure for data centers
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
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
Computer Networks: The International Journal of Computer and Telecommunications Networking
Multi-ring Infrastructure for Content Addressable Networks
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems:
On static and dynamic partitioning behavior of large-scale P2P networks
IEEE/ACM Transactions on Networking (TON)
Overlay networks: implementation by specification
Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware
P2P Networking and Applications
P2P Networking and Applications
Investigating the existence and the regularity of Logarithmic Harary Graphs
Theoretical Computer Science
Optimal node-selection algorithm for parallel download in overlay content-distribution networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Towards address privacy in mobile ad hoc networks
Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
Employing Data Driven Random Membership Subset Algorithm for QoS-Aware Peer-to-Peer Streaming
FMN '09 Proceedings of the 2nd International Workshop on Future Multimedia Networking
Proceedings of the 28th ACM symposium on Principles of distributed computing
Navigable Small-World networks with few random bits
Theoretical Computer Science
Echo: A peer-to-peer clustering framework for improving communication in DHTs
Journal of Parallel and Distributed Computing
On Address Privacy in Mobile Ad Hoc Networks
Mobile Networks and Applications
A locality aware cache diffusion system
The Journal of Supercomputing
Combining Hilbert SFC and bruijn graphs for searching computing markets in a P2P system
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
BotGrep: finding P2P bots with structured graph analysis
USENIX Security'10 Proceedings of the 19th USENIX conference on Security
A Fully Distributed Lagrangean Solution for a Peer-to-Peer Overlay Network Design Problem
INFORMS Journal on Computing
Scalable and cost-effective interconnection of data-center servers using dual server ports
IEEE/ACM Transactions on Networking (TON)
A computing resource discovery mechanism over a P2P tree topology
VECPAR'10 Proceedings of the 9th international conference on High performance computing for computational science
A tight unconditional lower bound on distributed randomwalk computation
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Self-stabilizing De Bruijn networks
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
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
Survive under high churn in structured P2P systems: evaluation and strategy
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
Dynamic zone-balancing of topology-aware peer-to-peer networks
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
Hybrid overlay structure based on random walks
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
A specification-to-deployment architecture for overlay networks
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 II
Structure-Based resilience metrics for service-oriented networks
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
On the cost of participating in a peer-to-peer network
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Caching indices for efficient lookup in structured overlay networks
AP2PC'05 Proceedings of the 4th international conference on Agents and Peer-to-Peer Computing
How much independent should individual contacts be to form a small–world?
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Overlay networks – implementation by specification
Middleware'05 Proceedings of the ACM/IFIP/USENIX 6th international conference on Middleware
A peer-to-peer expressway over Chord
Mathematical and Computer Modelling: An International Journal
Efficient computation of distance sketches in distributed networks
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Journal of the ACM (JACM)
Building a reliable and high-performance content-based publish/subscribe system
Journal of Parallel and Distributed Computing
Resilience of dynamic overlays through local interactions
Proceedings of the 22nd international conference on World Wide Web companion
Analyzing locality over a P2P computing architecture
Journal of Network and Computer Applications
| Hi-index | 0.00 |
This paper examines graph-theoretic properties of existing peer-to-peer architectures and proposes a new infrastructure based on optimal diameter de Bruijn graphs. Since generalized de Bruijn graphs possess very short average routing distances and high resilience to node failure, they are well suited for structured peer-to-peer networks. Using the example of Chord, CAN, and de Bruijn, we first study routing performance, graph expansion, and clustering properties of each graph. We then examine bisection width, path overlap, and several other properties that affect routing and resilience of peer-to-peer networks. Having confirmed that de Bruijn graphs offer the best diameter and highest connectivity among the existing peer-to-peer structures, we offer a very simple incremental building process that preserves optimal properties of de Bruijn graphs under uniform user joins/departures. We call the combined peer-to-peer architecture ODRI -- Optimal Diameter Routing Infrastructure.