Tree-based fault-tolerant multicast in multicomputer networks

Author

Wang, Honge ; Blough, Douglas M.

Author_Institution

Dept. of Electr. & Comput. Eng., California Univ., Irvine, CA, USA

fYear

1998

fDate

19-24 Jul 1998

Firstpage

44

Lastpage

49

Abstract

A tree-based fault-tolerant multicast algorithm built on top of pipelined circuit switching is presented. The algorithm is provably deadlock-free and livelock-free, requires only a single message startup, and guarantees messages are delivered over shortest paths in the fault-free and traffic-free case. Simulation results in two-dimensional mesh networks show that the algorithm produces significantly shorter average communication latency than previous fault-tolerant multicast algorithms over a range of network loads and fault conditions

Keywords

circuit switching; computer networks; distributed memory systems; fault tolerant computing; multicast communication; network topology; pipeline processing; telecommunication network routing; average communication latency; deadlock-free algorithm; distributed multi-header routing; distributed-memory multicomputer systems; fault conditions; livelock-free algorithm; message startup; multicast algorithm; multicomputer networks; network loads; pipelined circuit switching; shortest path message delivery; simulation results; tree-based fault-tolerant multicast algorithm; two-dimensional mesh networks; Circuit faults; Circuit simulation; Communication switching; Fault tolerance; Mesh networks; Multicast algorithms; Switching circuits; System recovery; Telecommunication traffic; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 1998. Proceedings. Sixth International Symposium on

Conference_Location

Montreal, Que.

Print_ISBN

0-8186-8566-2

Type

conf

DOI

10.1109/MASCOT.1998.693673

Filename

693673