Fault-tolerant routing in irregular MINs

Author

Sengupta, Jyotsna ; Bansal, P.K.

Author_Institution

Dept. of Comput. Sci. & Eng., Punjabi Univ., Patiala, India

Volume

2

fYear

1998

fDate

1998

Firstpage

638

Abstract

Efficient and simple routing algorithms have been developed for two irregular MINs-namely, MFDOT and QT. Static routing provides full access for MFDOT whereas minimal multiple paths to reach the destination are provided through dynamic routing in QT networks. Multiple paths of varying lengths are available to route the data to the destination in irregular MINs. The path length is just 2 for a favourite memory module, as opposed to the identical path lengths used for regular MINs. This makes a marked difference in latency, throughput and cost of the network

Keywords

fault tolerance; multistage interconnection networks; quadtrees; telecommunication network routing; MFDOT; QT networks; dynamic routing; fault-tolerant routing; irregular MIN; memory module; minimal multiple paths; multiprocessor system; multistage interconnection networks; network cost; network latency; network throughput; path length; quad tree network; routing algorithms; static routing; Computer science; Delay; Fault tolerance; Multiprocessor interconnection networks; Routing; Switches; Telecommunication traffic; Throughput; Time measurement; US Department of Transportation;

fLanguage

English

Publisher

ieee

Conference_Titel

TENCON '98. 1998 IEEE Region 10 International Conference on Global Connectivity in Energy, Computer, Communication and Control

Conference_Location

New Delhi

Print_ISBN

0-7803-4886-9

Type

conf

DOI

10.1109/TENCON.1998.798297

Filename

798297