Details
Original language | English |
---|---|
Title of host publication | Semantic Web and Peer-to-Peer |
Subtitle of host publication | Decentralized Management and Exchange of Knowledge and Information |
Pages | 89-105 |
Number of pages | 17 |
ISBN (electronic) | 978-3-540-28347-8 |
Publication status | Published - 2006 |
Abstract
Static DHT topologies influence important features of DHT systems such as their scalability, communication load balancing properties, routing efficiency and their 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 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.
ASJC Scopus subject areas
- Computer Science(all)
- General Computer Science
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
Semantic Web and Peer-to-Peer: Decentralized Management and Exchange of Knowledge and Information. 2006. p. 89-105.
Research output: Chapter in book/report/conference proceeding › Contribution to book/anthology › Research › peer review
}
TY - CHAP
T1 - Cayley DHTs
T2 - A group-theoretic framework for analyzing DHTs based on cayley graphs
AU - Qu, Changtao
AU - Nejdl, Wolfgang
AU - Kriesell, Matthias
PY - 2006
Y1 - 2006
N2 - Static DHT topologies influence important features of DHT systems such as their scalability, communication load balancing properties, routing efficiency and their 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 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.
AB - Static DHT topologies influence important features of DHT systems such as their scalability, communication load balancing properties, routing efficiency and their 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 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.
UR - http://www.scopus.com/inward/record.url?scp=78149377942&partnerID=8YFLogxK
U2 - 10.1007/3-540-28347-1_5
DO - 10.1007/3-540-28347-1_5
M3 - Contribution to book/anthology
AN - SCOPUS:78149377942
SN - 978-3-540-28346-1
SP - 89
EP - 105
BT - Semantic Web and Peer-to-Peer
ER -