By Topic

On the message and time complexity of protocols for reliable broadcasts/multicasts in networks with omission failures

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hong-Yi Tzeng ; AT&T Bell Labs., Holmdel, NJ, USA ; Kai-Yeung Siu

This paper presents a fundamental study on the message and time complexity of reliable broadcast/multicast protocols in point-to-point networks subject to omission failures. We assume a weakly synchronous model in which there is a known upper bound on the delay in delivering a message from one process to another. A faulty process may omit sending or receiving messages; this characterizes a common faulty behavior in networking applications. We focus our study on the number of messages and the maximum amount of time required of any fault-tolerant protocol in failure-free executions. We present protocols that, in an n-process network subject to at most t faulty processes, guarantee the delivery of a message from any process to all other nonfaulty processes. In particular, when no failure occurs in the network, our protocols require (n+t-1) messages and at most (n-1+upper bound [log2(t+1)])·δ units of time, where δ is the maximum time required to deliver a message from a process to another. Moreover, we show that our protocols are optimal with respect to message and time complexity. The new insights provided by the lower bound proofs yield a graph-theoretic characterization of all message and time optimal reliable broadcast/multicast protocols in failure-free executions. We further discuss the implications of our results on the support of multicast services in high-speed switching networks such as ATM

Published in:

Selected Areas in Communications, IEEE Journal on  (Volume:13 ,  Issue: 7 )