Premium
Tighter time bounds on fault‐tolerant broadcasting and gossiping
Author(s) -
Gargano Luisa
Publication year - 1992
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230220505
Subject(s) - gossip , broadcasting (networking) , computer science , fault tolerance , task (project management) , node (physics) , distributed computing , process (computing) , computer network , hypercube , parallel computing , psychology , social psychology , management , structural engineering , engineering , economics , operating system
Abstract Consider a network in which n processors are connected by unreliable lines and are allowed to communicate with at most one other processor at a time. In this paper, the problems of broadcasting and gossiping are considered. Broadcast is the task of transmitting a message, originated at one node, to all other nodes in the network. Gossiping refers to the process of information dissemination when each processor knows a unique item of information and must transmit it to all the other processors in the network. In this paper, new bounds on fault‐tolerant broadcasting and gossiping times are obtained. The given bounds improve on previously known results. In particular, if n is a power of two, the given broadcast and gossiping schemes require minimum time and are supported by a network having the minimum possible number of edges.