Fabian Kuhn
Fabian Kuhn has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Roger Wattenhofer
ETH Zurich, Zurich, Switzerland
3 shared publications - Aaron Zollinger
University of California
1 shared publication - Joest Smit
Computer Engineering and Networks Laboratory (TIK), ETH Zurich, 8092 Zurich, Switzerland
1 shared publication - Maurice Herlihy
Brown University
1 shared publication - Srikanta Tirthapura
Iowa State University 50011 IA USA
1 shared publication - Stefan Schmid
Computer Engineering and Networks Laboratory (TIK), ETH Zurich, 8092 Zurich, Switzerland
1 shared publication
Latest Publications
- 13 July 2007
- Published by Springer Nature in Wireless Networks
- Vol. 14 (5) , 715-729
Ad hoc networks beyond unit disk graphs
- 13 July 2007
- Published by Springer Nature in Wireless Networks
- Vol. 14 (5) , 715-729
Ad hoc networks beyond unit disk graphs
- 25 September 2006
- Published by Springer Nature in Theory of Computing Systems
- Vol. 39 (6) , 875-901
Dynamic Analysis of the Arrow Distributed Protocol
- 25 September 2006
- Published by Springer Nature in Theory of Computing Systems
- Vol. 39 (6) , 875-901
Dynamic Analysis of the Arrow Distributed Protocol
- 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