Fault tolerant queries in computer networks

Alan Baratz; Inder Gopal; Adrian Segall

doi:10.1007/bfb0019792

Fault tolerant queries in computer networks

Alan Baratz, Inder Gopal, Adrian Segall

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

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.

Original language	English
Title of host publication	Distributed Algorithms - 2nd International Workshop, Proceedings
Editors	J. van Leeuwen
Publisher	Springer Verlag
Pages	30-40
Number of pages	11
ISBN (Print)	9783540193661
DOIs	https://doi.org/10.1007/bfb0019792
State	Published - 1988
Externally published	Yes
Event	2nd International Workshop on Distributed Algorithms, WDAG 1987 - Amsterdam, Netherlands Duration: 8 Jul 1987 → 10 Jul 1987

Publication series

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

Conference

Conference	2nd International Workshop on Distributed Algorithms, WDAG 1987
Country/Territory	Netherlands
City	Amsterdam
Period	8/07/87 → 10/07/87

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1988.

Access to Document

10.1007/bfb0019792

Cite this

Baratz, A., Gopal, I., & Segall, A. (1988). Fault tolerant queries in computer networks. In J. van Leeuwen (Ed.), Distributed Algorithms - 2nd International Workshop, Proceedings (pp. 30-40). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 312 LNCS). Springer Verlag. https://doi.org/10.1007/bfb0019792

@inproceedings{0f9943ec63fc4048867a0b55196feca9,

title = "Fault tolerant queries in computer networks",

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.",

author = "Alan Baratz and Inder Gopal and Adrian Segall",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1988.; 2nd International Workshop on Distributed Algorithms, WDAG 1987 ; Conference date: 08-07-1987 Through 10-07-1987",

year = "1988",

doi = "10.1007/bfb0019792",

language = "אנגלית",

isbn = "9783540193661",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "30--40",

editor = "{van Leeuwen}, J.",

booktitle = "Distributed Algorithms - 2nd International Workshop, Proceedings",

address = "גרמניה",

}

Baratz, A, Gopal, I & Segall, A 1988, Fault tolerant queries in computer networks. in J van Leeuwen (ed.), Distributed Algorithms - 2nd International Workshop, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 312 LNCS, Springer Verlag, pp. 30-40, 2nd International Workshop on Distributed Algorithms, WDAG 1987, Amsterdam, Netherlands, 8/07/87. https://doi.org/10.1007/bfb0019792

Fault tolerant queries in computer networks. / Baratz, Alan; Gopal, Inder; Segall, Adrian.
Distributed Algorithms - 2nd International Workshop, Proceedings. ed. / J. van Leeuwen. Springer Verlag, 1988. p. 30-40 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 312 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Fault tolerant queries in computer networks

AU - Baratz, Alan

AU - Gopal, Inder

AU - Segall, Adrian

PY - 1988

Y1 - 1988

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85035746536&partnerID=8YFLogxK

U2 - 10.1007/bfb0019792

DO - 10.1007/bfb0019792

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85035746536

SN - 9783540193661

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

SP - 30

EP - 40

BT - Distributed Algorithms - 2nd International Workshop, Proceedings

A2 - van Leeuwen, J.

PB - Springer Verlag

T2 - 2nd International Workshop on Distributed Algorithms, WDAG 1987

Y2 - 8 July 1987 through 10 July 1987

ER -

Fault tolerant queries in computer networks

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this