| Zitatschlüssel |
KSW-TWCCRP2PS-10 |
| Autor |
Kuhn, Fabian and Schmid, Stefan and Wattenhofer, Roger |
| Seiten |
249–267 |
| Jahr |
2010 |
| ISSN |
0178-2770 |
| DOI |
http://dx.doi.org/10.1007/s00446-010-0099-z |
| Journal |
Distributed Computing Journal (DC) |
| Jahrgang |
22 |
| Nummer |
4 |
| Monat |
May |
| Verlag |
Springer |
| Zusammenfassung |
Until now, the analysis of fault tolerance of peer-to-peer systems usually only covers random faults of some kind. Contrary to traditional algorithmic research, faults as well as joins and leaves occurring in a worst-case manner are hardly considered. In this article, we devise techniques to build dynamic peer-to-peer systems which remain fully functional in spite of an adversary who continuously adds and removes peers. We exemplify our algorithms on hypercube and pancake topologies and present a system which maintains small peer degree and network diameter. |
