Graph-theoretic analysis of structured peer-to-peer systems routing distances and fault resilience.
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 suite...
| Publié dans: | Computer communication review. 33, 4 (2003). |
|---|---|
| Auteur principal: | |
| Format: | Article |
| Langue: | English |
| Sujets: |