ON FAULT-TOLERANT DISTRIBUTOR COMMUNICATION ARCHITECTURE.

Sumanta Guha, Arunabha Sen

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

A new routing algorithm is proposed for the network architecture developed by D. K. Pradhan and S. M. Reddy (1982). It has been shown that this algorithm gives the shortest path from the source to destination when all the processors and the communication links of the network are nonfaulty. For the situation when some of the processors are faulty, a heuristic function is given which, if used in the routing algorithm, will give the shortest path from the source to destination, if such a path exists.

Original languageEnglish (US)
Pages (from-to)281-283
Number of pages3
JournalIEEE Transactions on Computers
VolumeC-35
Issue number3
StatePublished - Mar 1986
Externally publishedYes

Fingerprint

Routing algorithms
Routing Algorithm
Fault-tolerant
Shortest path
Communication
Network Architecture
Network architecture
Telecommunication links
Heuristics
Path
Architecture

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

ON FAULT-TOLERANT DISTRIBUTOR COMMUNICATION ARCHITECTURE. / Guha, Sumanta; Sen, Arunabha.

In: IEEE Transactions on Computers, Vol. C-35, No. 3, 03.1986, p. 281-283.

Research output: Contribution to journalArticle

@article{a396d318874f45c69d20d0fbaf6eadbb,
title = "ON FAULT-TOLERANT DISTRIBUTOR COMMUNICATION ARCHITECTURE.",
abstract = "A new routing algorithm is proposed for the network architecture developed by D. K. Pradhan and S. M. Reddy (1982). It has been shown that this algorithm gives the shortest path from the source to destination when all the processors and the communication links of the network are nonfaulty. For the situation when some of the processors are faulty, a heuristic function is given which, if used in the routing algorithm, will give the shortest path from the source to destination, if such a path exists.",
author = "Sumanta Guha and Arunabha Sen",
year = "1986",
month = "3",
language = "English (US)",
volume = "C-35",
pages = "281--283",
journal = "IEEE Transactions on Computers",
issn = "0018-9340",
publisher = "IEEE Computer Society",
number = "3",

}

TY - JOUR

T1 - ON FAULT-TOLERANT DISTRIBUTOR COMMUNICATION ARCHITECTURE.

AU - Guha, Sumanta

AU - Sen, Arunabha

PY - 1986/3

Y1 - 1986/3

N2 - A new routing algorithm is proposed for the network architecture developed by D. K. Pradhan and S. M. Reddy (1982). It has been shown that this algorithm gives the shortest path from the source to destination when all the processors and the communication links of the network are nonfaulty. For the situation when some of the processors are faulty, a heuristic function is given which, if used in the routing algorithm, will give the shortest path from the source to destination, if such a path exists.

AB - A new routing algorithm is proposed for the network architecture developed by D. K. Pradhan and S. M. Reddy (1982). It has been shown that this algorithm gives the shortest path from the source to destination when all the processors and the communication links of the network are nonfaulty. For the situation when some of the processors are faulty, a heuristic function is given which, if used in the routing algorithm, will give the shortest path from the source to destination, if such a path exists.

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

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

M3 - Article

AN - SCOPUS:0022690374

VL - C-35

SP - 281

EP - 283

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 3

ER -