On Deadlock-free Multicasting in Hypercubes with Faulty Links
نویسندگان
چکیده
This paper presents a deadlock-free algorithm for multicast routing in a faulty hypercube when some of the links have failed. Wormhole routing is assumed for message communication and the number of faulty links is assumed to be fewer than the dimension of the hypercube to ensure the faulty network is not segmented. The performance of the algorithm is analyzed through simulation experiments which shows a marginal degradation in communication delay because of faults in the network.
منابع مشابه
A Trip-based Multicasting Model in Wormhole-routed Networks with Virtual Channels
This paper focuses on eecient multicasting in wormhole-routed networks. A trip-based model is proposed to support adaptive, distributed, and deadlock-free multiple multicast on any network with arbitrary topology using at most two virtual channels per physical channel. This model signiicantly generalizes the path-based model proposed earlier 21, 22], which works only for Hamiltonian networks an...
متن کاملA Trip-Based Multicasting Model for Wormhole-Routed Networks with Virtual Channels
| This paper focuses on eecient multicasting in wormhole-routed networks. A trip-based model is proposed to support adaptive, distributed, and deadlock-free multiple multicast on any network with arbitrary topology using at most two virtual channels per physical channel. This model signiicantly generalizes the path-based model proposed earlier 21], 22], which works only for Hamiltonian networks...
متن کاملAdaptive Fault-Tolerant Deadlock-Free Routing in Meshes and Hypercubes
We present an adaptive deadlock-free routing algorithm which decomposes a given network into two virtual interconnection networks, V IN 1 and V IN 2. V IN 1 supports deterministic deadlock-free routing, and V IN 2 supports fully-adaptive routing. Whenever a channel in V IN 1 or V IN 2 is available, it can be used to route a message. Each node is identiied to be in one of three states: safe, uns...
متن کاملAn Euler Path Based Technique for Deadlock-free Multicasting
The existing algorithms for deadlock-free multicasting in interconnection networks assume the Hamiltonian property in the networks topology. However, these networks fail to be Hamiltonian in the presence of faults. This paper investigates the use of Euler circuits in deadlock-free multicasting. Not only are Euler circuits known to exist in all connected networks, a fast polynomial-time algorith...
متن کاملA Fault-Tolerant Deadlock-Free Multicast Algorithm for Wormhole Routed Hypercubes
In this paper, we propose a novel fault-tolerant multicast algorithm for n-dimensional wormhole routed hypercubes. The multicast algorithm will remain functional if the number of faulty nodes in an n-dimensional hypercube is less than n. Multicast is the delivery of the same message from one source node to an arbitrary number of destination nodes. Recently, wormhole routing has become one of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007