Fault-Tolerant distributed system design

Abhijit Sengupta; Arunabha Sen; Subir Bandyopadhyay

doi:10.1109/31.1718

Fault-Tolerant distributed system design

Abhijit Sengupta, Arunabha Sen, Subir Bandyopadhyay

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

Abstract

The problem of ensuring reliable communication in a computer network is becoming increasingly important. A number of network architectures have been proposed which guarantees a path between any two good nodes in a network. In this paper, an architecture has been proposed with a suitable communication protocol. It is shown that, for a fault-free network, the communication delay between any two nodes in the network is m where the number of nodes in the network is rm. In the presence of up to r -2 faults, the delay is m +1.

Original language	English (US)
Pages (from-to)	168-172
Number of pages	5
Journal	IEEE transactions on circuits and systems
Volume	35
Issue number	2
DOIs	https://doi.org/10.1109/31.1718
State	Published - Feb 1988

Keywords

De Bruijn graph
Distributed systems
Index Terms
computer communication
diameter of a graph
fault-tolerant communication

ASJC Scopus subject areas

Engineering(all)

Access to Document

10.1109/31.1718

Cite this

@article{8a903f2425fd4021a2cc15b775795e2d,

title = "Fault-Tolerant distributed system design",

abstract = "The problem of ensuring reliable communication in a computer network is becoming increasingly important. A number of network architectures have been proposed which guarantees a path between any two good nodes in a network. In this paper, an architecture has been proposed with a suitable communication protocol. It is shown that, for a fault-free network, the communication delay between any two nodes in the network is m where the number of nodes in the network is rm. In the presence of up to r -2 faults, the delay is m +1.",

keywords = "De Bruijn graph, Distributed systems, Index Terms, computer communication, diameter of a graph, fault-tolerant communication",

author = "Abhijit Sengupta and Arunabha Sen and Subir Bandyopadhyay",

note = "Funding Information: Manuscript received July 21, 1986; revised May 15, 1987. This work was supported in part by an operating grant awarded by the Natural Sciences and En 'neering Research Council of the Government of Canada to S. Bandyopagyay. This paper was recommended by Associate Editor M. N. S. Swamy.",

year = "1988",

month = feb,

doi = "10.1109/31.1718",

language = "English (US)",

volume = "35",

pages = "168--172",

journal = "IEEE Transactions on Circuits and Systems",

issn = "0098-4094",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "2",

}

TY - JOUR

T1 - Fault-Tolerant distributed system design

AU - Sengupta, Abhijit

AU - Sen, Arunabha

AU - Bandyopadhyay, Subir

N1 - Funding Information: Manuscript received July 21, 1986; revised May 15, 1987. This work was supported in part by an operating grant awarded by the Natural Sciences and En 'neering Research Council of the Government of Canada to S. Bandyopagyay. This paper was recommended by Associate Editor M. N. S. Swamy.

PY - 1988/2

Y1 - 1988/2

N2 - The problem of ensuring reliable communication in a computer network is becoming increasingly important. A number of network architectures have been proposed which guarantees a path between any two good nodes in a network. In this paper, an architecture has been proposed with a suitable communication protocol. It is shown that, for a fault-free network, the communication delay between any two nodes in the network is m where the number of nodes in the network is rm. In the presence of up to r -2 faults, the delay is m +1.

AB - The problem of ensuring reliable communication in a computer network is becoming increasingly important. A number of network architectures have been proposed which guarantees a path between any two good nodes in a network. In this paper, an architecture has been proposed with a suitable communication protocol. It is shown that, for a fault-free network, the communication delay between any two nodes in the network is m where the number of nodes in the network is rm. In the presence of up to r -2 faults, the delay is m +1.

KW - De Bruijn graph

KW - Distributed systems

KW - Index Terms

KW - computer communication

KW - diameter of a graph

KW - fault-tolerant communication

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

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

U2 - 10.1109/31.1718

DO - 10.1109/31.1718

M3 - Article

AN - SCOPUS:0023964825

SN - 0098-4094

VL - 35

SP - 168

EP - 172

JO - IEEE Transactions on Circuits and Systems

JF - IEEE Transactions on Circuits and Systems

IS - 2

ER -

Fault-Tolerant distributed system design

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this