Abstract
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.
This work was done while the author was with IBM T. J. Watson Research Center, Yorktown Heights, N.Y. 10598
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baratz, A., Gopal, I., Segall, A. (1988). Fault tolerant queries in computer networks. In: van Leeuwen, J. (eds) Distributed Algorithms. WDAG 1987. Lecture Notes in Computer Science, vol 312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019792
Download citation
DOI: https://doi.org/10.1007/BFb0019792
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19366-1
Online ISBN: 978-3-540-39239-2
eBook Packages: Springer Book Archive