Open access
Date
2001Type
- Report
ETH Bibliography
yes
Altmetrics
Abstract
We propose a distributed dictionary that tolerates arbitrary single server crashes. The distinctive feature of our model is that the crash of a server cannot be detected. This is in contrast to all other proposals of distributed fault tolerant search structures presented thus far. It reflects the real situation in the internet more accurately, and is in general more suitable to complex overall conditions. This makes our solution fundamentally dierent from all previous ones, but also more complicated. We present in detail the algorithms for searching, insertion, and graceful recovery of crashed servers. Show more
Permanent link
https://doi.org/10.3929/ethz-a-006654423Publication status
publishedJournal / series
Technical Report / ETH Zurich, Department of Computer ScienceVolume
Publisher
ETH, Eidgenössische Technische Hochschule, Departement of Computer Science, Institute of Theoretical Computer ScienceSubject
SEARCH THEORY (OPERATIONS RESEARCH); SUCHTHEORIE (OPERATIONS RESEARCH); TREES (GRAPH THEORY); PROGRAMS AND ALGORITHMS FOR THE SOLUTION OF SPECIAL PROBLEMS; PROGRAMME UND ALGORITHMEN ZUR LÖSUNG SPEZIELLER PROBLEME; BÄUME (GRAPHENTHEORIE)Organisational unit
02150 - Dep. Informatik / Dep. of Computer Science
Notes
Technical Reports D-INFK.More
Show all metadata
ETH Bibliography
yes
Altmetrics