Fault tolerant queries in computer networks

Alan Baratz, Inder Gopal, Adrian Segall

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations


In computer networks with decentralized control, it is necessary to provide a distributed query mechanism whereby a node can dynamically discover the location of a remote resource. In this paper, we propose a query mechanism based on flooding with feedback which uses no more than two messages over any link. We examine the fault tolerant aspects of this distributed query mechanism, operating in a network with potentially faulty links and nodes and show that it achieves a form of fault tolerance. We then construct enhancements to this mechanism to show that with some increase in message complexity, it can satisfy a stronger form of fault tolerance.

Original languageEnglish
Title of host publicationDistributed Algorithms - 2nd International Workshop, Proceedings
EditorsJ. van Leeuwen
PublisherSpringer Verlag
Number of pages11
ISBN (Print)9783540193661
StatePublished - 1988
Externally publishedYes
Event2nd International Workshop on Distributed Algorithms, WDAG 1987 - Amsterdam, Netherlands
Duration: 8 Jul 198710 Jul 1987

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume312 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference2nd International Workshop on Distributed Algorithms, WDAG 1987

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1988.


Dive into the research topics of 'Fault tolerant queries in computer networks'. Together they form a unique fingerprint.

Cite this