Measuring the vulnerability of interconnection networks in embedded systems
Studies of the fault-tolerance of graphs have tended to largely concentrate on classical graph connectivity. This measure is very basic, and conveys very little information for designers to use in selecting a suitable topology for the interconnection network in embedded systems. In this paper, we study the vulnerability of interconnection networks to the failure of individual links, using a set of four measures which, taken together, provide a much fuller characterization of the network. Moreover, while traditional studies typically limit themselves to uncorrelated link failures, our model deals with both uncorrelated and correlated failure modes. This is of practical significance, since quite often, failures in networks are correlated due to physical considerations.
Unable to display preview. Download preview PDF.
- 1.B.W.Arden and H.Lee. “Analysis of Chordal Ring Networks”, IEEE Transactions on Computers C-30, 1981.Google Scholar
- 2.M.Berg and I. Koren, “On Switching Policies for Modular Fault-Tolerant Computing Systems”, IEEE Transactions on Computers Vol. C-36, 1987.Google Scholar
- 3.F. T. Boesch, F. Harary, J. A. Kabell, “Graphs as Models of Communication Network Vulnerability: Connectivity and Persistence,” Networks, Vol. 11, 1981.Google Scholar
- 4.M.Choi and C.M.Krishna, “On Measures of Vulnerability of Interconnection Networks”, Microelectronics and Reliability Vol 29, No. 6, 1989.Google Scholar
- 5.T. Cormen, C. Leiserson and R. Rivest, Introduction to Algorithms, Cambridge: MIT Press, 1990.Google Scholar
- 6.C. M. Krishna and K. G. Shin, Real-Time Systems, New York: McGraw-Hill, 1997.Google Scholar