Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Fault-tolerant routing in DeBruijn communication networks
Esfahanian A., Hakimi S. IEEE Transactions on Computers34 (9):777-788,1985.Type:Article
Date Reviewed: Jun 1 1986

A class of communication networks which is suitable for “multiple processor systems” was studied by Pradhan and Reddy. The underlying graph (to be called Shift and Replace graph or SRG) is based on DeBruijn digraphs and is a function of two parameters r and m. Pradhan and Reddy have shown that the node-connectivity of SRG is at least r. The same authors give a routing algorithm which generally requires 2m hops if the number of node failures is ≤r − 1). In this paper we show that the node connectivity of SRG is 2r − 2. This would immediately imply that the system can tolerate up to (2r − 3) node failures. We then present routing methods for situations with a certain number of node failures. When this number is ≤r − 2) our routing algorithm requires at most m + 3 + logr m hops if 3 + logr m:9- T≤9Tm. When the number of node failures is ≤2r − 3) our routing algorithm requires at most m + 5 + logr m hops if 4 + logr m ≤9Tm. In all the other situations our routing algorithm requires no more than 2m hops. The routing algorithms are shown to be computationally efficient.

--Authors’ Abstract

This is a research paper that deals with a class of fault-tolerant interconnect- ion networks called the Shift and Replace Graph (SRG). Some general properties regarding the node-connectivity and routing algorithm of this class of network has already been reported in [1]. The present paper improves upon these theoretical results and, hence, can be considered a sequel to the previous study. The Abstract quoted above provides a nice summary of what has been done.

With these achievements, the authors have certainly made a useful contribution to the state of the art. Furthermore, they have provided some useful insight into the construction and properties of the SRG topology in Section II. However, the rest of the paper is full of symbols and not easy to read.

The paper would be more comprehensible had it been organized in such a way that the main text gives only the major results and highlights the key steps of the proofs. The detailed development should have been left to a series of appendices, so that the flow of the presentation would not be interrupted and the reader would not be buried in a myriad of technicalities.

Reviewer:  W. S. Lai Review #: CR109963
1) Pradhan, D. K.; and Reddy, S. M.A fault-tolerant communication architecture for distributed systems, IEEE Trans. Comput. C-31 (1982), 863–870.
Bookmark and Share
 
Distributed Networks (C.2.1 ... )
 
 
Performance of Systems (C.4 )
 
Would you recommend this review?
yes
no
Other reviews under "Distributed Networks": Date
Data communications and distributed networks (2nd ed.)
Black U., Prentice-Hall, Inc., Upper Saddle River, NJ, 1987. Type: Book (9789780835913416)
Sep 1 1988
SAA/LU6.2: distributed networks and applications
Edmunds J., McGraw-Hill, Inc., New York, NY, 1992. Type: Book (9780070190221)
Jan 1 1994
The coordination of distributed active messages in a dynamic network topology
Geesink L. The Computer Journal 34(6): 542-550, 1991. Type: Article
Sep 1 1993
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy