Abstract. 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 grouptheoretic 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. 1 DHTs and Static DHT Topologies Two important characteristics of distributed hash tables (DHTs) are network degree and
|
2113
|
Chord: A scalable peer-to-peer lookup service for internet applications
– Stoica, Morris, et al.
|
|
1749
|
A scalable content-addressable network
– Ratnasamy, Francis, et al.
- 2001
|
|
1137
|
Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems
– Rowstron, Druschel
- 2001
|
|
298
|
Search and replication in unstructured peer-to-peer networks
– Lv, Cao, et al.
- 2002
|
|
216
|
Tapestry: A resilient global-scale overlay for service deployment
– ZHAO, AL
- 2004
|
|
214
|
Viceroy: A scalable and dynamic emulation of the butterfly
– Malkhi, Naor, et al.
|
|
194
|
A group-theoretic model for symmetric interconnection networks
– Akers, Krishnamurthy
- 1989
|
|
152
|
The impact of DHT routing geometry on resilience and proximity
– Gummadi, Gummadi, et al.
- 2003
|
|
102
|
Novel Architectures for P2P Applications: the Continuous-Discrete Approach
– Naor, Wieder
- 2003
|
|
87
|
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
– Nejdl, Wolpers, et al.
- 2003
|
|
86
|
Looking Up Data in p2p systems
– BALAKRISHNAN, KARGER
- 2003
|
|
76
|
A VLSI Architecture for Concurrent Data Structures
– Dally
- 1986
|
|
70
|
Group action graphs and parallel architectures
– Annexstein, Baumslag, et al.
- 1990
|
|
60
|
Graph-Theoretic Analysis of Structured Peer-to-Peer Systems: Routing Distances and Fault Resilience
– Loguinov
|
|
39
|
Circulants and their connectivities
– Boesch, Tindell
- 1984
|
|
39
|
The ContentAddressable Network D2B
– Fraigniaud, Gauron
- 2003
|
|
38
|
Cayley graphs and interconnection networks
– Heydemann
- 1997
|
|
32
|
Routing networks for distributed hash tables
– Manku
- 2003
|
|
31
|
Exploiting network proximity in distributed hash tables
– Castro, Druschel, et al.
- 2002
|
|
29
|
HyperCuP – Hypercubes, Ontologies, and Efficient Search on Peer-to-Peer Networks
– Schlosser, Sintek, et al.
- 2002
|
|
24
|
Connectivity of transitive graphs
– Watkins
- 1970
|
|
20
|
Hamiltonian cycles and paths in Cayley graphs and digraphs - a survey
– Curran, Gallian
- 1996
|
|
18
|
Optimal routing in Chord
– Ganesan, Manku
- 2004
|
|
13
|
The composition of graphs
– Sabidussi
- 1964
|
|
12
|
Optimal information dissemination in star and pancake networks
– Berthom'e, Ferreira, et al.
- 1996
|
|
11
|
Butterflies and peer-to-peer networks
– Datar
- 2002
|
|
10
|
Point-symmetric graphs with a prime number of points
– Turner
- 1967
|
|
9
|
Cayley graphs with optimal fault tolerance
– Alspach
- 1992
|
|
7
|
J.D.: Tapestry: A resilient global-scale overlay for service deployment
– Zhao, Huang, et al.
- 2004
|
|
5
|
Fault-tolerant ring embedding in de bruijn networks
– Rowley, Bose
- 1993
|
|
5
|
Cycloid: a constantdegree and lookup-efficient P2P overlay network
– Shen, Xu, et al.
|
|
4
|
Cayley graph connected cycles: a new class of fixed-degree interconnection networks
– Ohring, Sarkar, et al.
- 1995
|
|
3
|
Connectivity and symmetry in graphs
– Boesch, Tindell
- 1984
|
|
3
|
Über den Zusammenhang symmetrischer Graphen
– Mader
- 1970
|
|
3
|
Eine Eigenschaft der Atome endlicher Graphen
– Mader
- 1971
|
|
2
|
Connectivity and symmetry in graphs. Graphs and Applications
– Boesch, Tindell
- 1982
|
|
1
|
Koorde: A simple degree optimal distributed hash table
– F, Karger
- 2003
|
|
1
|
The hyper-de bruijn networks: Scalable versatile architecture
– Ganesan, Pradhan
- 1993
|
|
1
|
21, “Peer-to-Peer-Systems and Applications”. In: P-Grid: Dynamics of self-organization in structured P2P systems
– Aberer, Datta, et al.
- 2004
|
