A non-redundant fault-tolerant broadcasting algorithm in a faulty k-ary n-cube is designed. The algorithm can adapt up to 2n,2 node failures. Compared to the optimal algorithm in a...
Abstract. In this paper we study Perfectly Secure Message Transmission (PSMT) between a sender S and a receiver R, connected in a directed synchronous network through multiple para...
Manycast is a group communication primitive wherein the source is required to send data packets to a certain number of a given set of destinations. In this article, we design faul...
For hypercube networks which have faulty nodes, a few ecient dynamic routing algorithms have been proposed by allowing each node to hold the status of neighbors. We propose two im...
Abstract. We have investigated the adaptation of AI-based search techniques as topologyindependent fault-tolerant routing strategies on multiprocessor networks [9]. The results sho...