Building TMR-based reliable servers despite bounded input lifetimes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2150, Issue , 2001, Pages 482-486

  Ezhilchelvan, Paul ^a   Hélary, Jean Michel ^b   Raynal, Michel ^b  

^a NEWCASTLE UNIVERSITY   (United Kingdom)

^b CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84937427249     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44681-8_70     Document Type: Conference Paper

References (6)

1. Cristian F., Aghili H., Strong H. R. andD olev D., Atomic Broadcast: From Simple Message Diffusion to Byzantine Agreement. Proc. 15th Int. Symposium on Fault-Tolerant Computing, Ann Arbor (MI), ieee Computer Society Press, pp. 200-206, 1985.
2. Ezhilchelvan P., Hélary J.-M. and R aynal M., Building TMR-Based Reliable Servers with Arbitrary Large Number of Clients. Research Report # 1398, IRISAIFSIC, Université de Rennes 1, May 2001. http://www.irisa. fr/EXTERNE/bibli/pi/1398/1398.html.
3. Hadzilacos V. andT oueg S., Reliable Broadcast andR elatedProb lems. In Distributed Systems, acm Press (S. Mullender Ed.), New-York, pp. 97-145, 1993.
4. Schneider F. B., Implementing Fault-Tolerant Services Using the State Machine Approach: a Tutorial. ACM Computing Surveys, 22(4):299-319, 1990.
5. Shrivastava S., Ezhilchelvan P., Speirs N. A., Tao S. andT ully A., Principle Features of the Voltan Family of Reliable System Architectures for DistributedSys-tems. IEEE Transactions on Computers, 41(5):542-549, 1992.
6. Veríssimo P. and Raynal M., Time in DistributedSys tems: Models andAl gorithms. In Advances in Distributed Systems, Springer-Verlag, LNCS 1752, pp. 1-32, 2000.