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
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
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
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
Routing networks for distributed hash tables
Proceedings of the twenty-second annual symposium on Principles of distributed computing
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
Ulysses: A Robust, Low-Diameter, Low-Latency Peer-ti-Peer Network
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
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
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
Probability Theory: An Analytic View
Probability Theory: An Analytic View
The capacity of wireless networks
IEEE Transactions on Information Theory
IEEE Journal on Selected Areas in Communications
Routing in multihop packet switching networks: Gb/s challenge
IEEE Network: The Magazine of Global Internetworking
A Diophantine model of routes in structured P2P overlays
ACM SIGMETRICS Performance Evaluation Review
A formal framework for the performance analysis of P2P networks protocols
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
In-degree dynamics of large-scale P2P systems
ACM SIGMETRICS Performance Evaluation Review
CR-Chord: Improving lookup availability in the presence of malicious DHT nodes
Computer Networks: The International Journal of Computer and Telecommunications Networking
Theoretical notes on regular graphs as applied to optimal network design
ICDCIT'10 Proceedings of the 6th international conference on Distributed Computing and Internet Technology
Theory and network applications of balanced kautz tree structures
ACM Transactions on Internet Technology (TOIT)
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
Using the complementary nature of node joining and leaving to handle churn problem in P2P networks
Computers and Electrical Engineering
| Hi-index | 0.00 |
This paper examines graph-theoretic properties of existing peer-to-peer networks and proposes a new infrastructure based on optimal-diameter de Bruijn graphs. Since generalized de Bruijn graphs exhibit very short average distances and high resilience to node failure, they are well suited for distributed hash tables (DHTs). Using the example of Chord, CAN, and de Bruijn, we study the routing performance, graph expansion, clustering properties, and bisection width of each graph. 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 optimal diameter routing infrastructure.