A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Cayley Graphs With Optimal Fault Tolerance
IEEE Transactions on Computers
Hamiltonian cycles and paths in Cayley graphs and digraphs—a survey
Discrete Mathematics
Optimal Information Dissemination in Star and Pancake Networks
IEEE Transactions on Parallel and Distributed 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
A VLSI Architecture for Concurrent Data Structures
A VLSI Architecture for Concurrent Data Structures
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed 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
Butterflies and Peer-to-Peer Networks
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Cayley graph connected cycles: A new class of fixed-degree interconnection networks
HICSS '95 Proceedings of the 28th Hawaii International Conference on System Sciences
The impact of DHT routing geometry on resilience and proximity
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
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
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
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
P3N: profiling the potential of a peer-based data management system
Proceedings of the VLDB Endowment
P2P Networking and Applications
P2P Networking and Applications
Echo: A peer-to-peer clustering framework for improving communication in DHTs
Journal of Parallel and Distributed Computing
ComNET: a P2P community network
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
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
| Hi-index | 0.00 |
Static DHT topologies influence important features of such DHTs such as scalability, communication load balancing, routing efficiency and fault tolerance. While obviously dynamic DHT algorithms which have to approximate these topologies for dynamically changing sets of peers play a very important role for DHT networks, important insights can be gained by clearly focussing on the static DHT topology as well. In this paper we analyze and classify current DHTs in terms of their static topologies based on the Cayley graph group-theoretic model and show that most DHT proposals use Cayley graphs as static DHT topologies, thus taking advantage of several important Cayley graph properties such as vertex/edge symmetry, decomposability and optimal fault tolerance. Using these insights, Cayley DHT design can directly leverage algebraic design methods to generate high-performance DHTs adopting Cayley graph based static DHT topologies, extended with suitable dynamic DHT algorithms.