Stefan Schmid
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Stefan Schmid has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Fabian Kuhn
Microsoft Research
1 shared publication - Joest Smit
Computer Engineering and Networks Laboratory (TIK), ETH Zurich, 8092 Zurich, Switzerland
1 shared publication - Roger Wattenhofer
ETH Zurich, Zurich, Switzerland
1 shared publication
Latest Publications
- 1 June 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 1548615X,p. 12-19
A Blueprint for Constructing Peer-to-Peer Systems Robust to Dynamic Worst-Case Joins and Leaves
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 paper, we devise techniques to build dynamic peer-to-peer systems which remain fully functional in spite of an adversary which continuously adds and removes peers. We exemplify our algorithms on a pancake topology and present a system which maintains peer degree and network diameter O(log n/log log n), where n is the total number of peers in the system
- 1 June 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 1548615X,p. 12-19
A Blueprint for Constructing Peer-to-Peer Systems Robust to Dynamic Worst-Case Joins and Leaves
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 paper, we devise techniques to build dynamic peer-to-peer systems which remain fully functional in spite of an adversary which continuously adds and removes peers. We exemplify our algorithms on a pancake topology and present a system which maintains peer degree and network diameter O(log n/log log n), where n is the total number of peers in the system