On the message and time complexity of protocols for reliable broadcasts

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 proce...

Full beskrivning

Bibliografiska uppgifter
I publikationen:	IEEE Journal on selected areas in communications 13, 7 (1995).
Huvudupphovsman:	Hong-Yi Tzeng
Materialtyp:	Artikel
Språk:	English
Ämnen:	ATM. LAN. Delay. Failure-free executions. Fault-tolerant protocol. Faulty behavior. Graph-theoretic characterization. High-speed switching networks. Lower bound. Message complexity. N-process network. Omission failures. Point-to-point networks. Reliable broadcast/multicast protocols. Time complexity. Upper bound. Weakly synchronous model.