Abstract
In this paper, we study the atomic broadcast and multicast problems, two fundamental abstractions for building fault-tolerant systems. As opposed to atomic broadcast, atomic multicast allows messages to be addressed to a subset of the processes in the system, each message possibly being multicast to a different subset. Our study focuses on wide area networks where groups of processes, i.e., processes physically close to each other, are inter-connected through high latency communication links. In this context, we capture the cost of algorithms, denoted latency degree, as the minimum number of inter-group message delays between the broadcasting (multicasting) of a message and its delivery. We present an atomic multicast algorithm with a latency degree of two and show that it is optimal. We then present the first fault-tolerant atomic broadcast algorithm with a latency degree of one. To achieve such a low latency, the algorithm is proactive, i.e., it may take actions even though no messages are broadcast. Nevertheless, it is quiescent: provided that the number of broadcast messages is finite, the algorithm eventually ceases its operation.
The work presented in this paper has been partially funded by the SNSF, Switzerland (project #200021-107824).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aguilera, M.K., Strom, R.E.: Efficient atomic broadcast using deterministic merge. In: PODC 2000. Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing, pp. 209–218. ACM Press, New York (2000)
Birman, K.P., Joseph, T.A.: Reliable communication in the presence of failures. ACM Trans. Comput. Syst. 5(1), 47–76 (1987)
Défago, X., Schiper, A., Urbán, P.: Total order broadcast and multicast algorithms: Taxonomy and survey. ACM Comput. Surv. 36(4), 372–421 (2004)
Delporte-Gallet, C., Fauconnier, H.: Fault-tolerant genuine atomic multicast to multiple groups. In: Proceedings of the 4th International Conference on Principles of Distributed Computing, pp. 107–122 (2000)
Fritzke, U., Ingels, Ph., Mostéfaoui, A., Raynal, M.: Fault-tolerant total order multicast to asynchronous groups. In: Proceedings of the 17th IEEE Symposium on Reliable Distributed Systems, pp. 578–585 (1998)
Frolund, S., Pedone, F.: Ruminations on domain-based reliable broadcast. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol. 2508, pp. 148–162. Springer, Heidelberg (2002)
Guerraoui, R., Schiper, A.: Genuine atomic multicast in asynchronous distributed systems. Theor. Comput. Sci. 254(1-2), 297–316 (2001)
Hadzilacos, V., Toueg, S.: Fault-tolerant broadcasts and related problems. In: Mullender, S.J. (ed.) Distributed Systems, Ch. 5, pp. 97–145. Addison-Wesley, Reading (1993)
Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21(7), 558–565 (1978)
Rodrigues, L., Guerraoui, R., Schiper, A.: Scalable atomic multicast. In: IC3N 1998. Proceedings of the 7th IEEE International Conference on Computer Communications and Networks, Lafayette, Louisiana, USA, pp. 840–847 (1998)
Schiper, A.: Early consensus in an asynchronous system with a weak failure detector. Distributed Computing 10(3), 149–157 (1997)
Schiper, N., Pedone, F.: Optimal atomic broadcast and multicast algorithms for wide area networks. Technical Report 2007/004 Revision 1, University of Lugano (2007)
Sousa, A., Pereira, J., Moura, F., Oliveira, R.: Optimistic total order in wide area networks. In: Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems, pp. 190–199. IEEE CS, Los Alamitos (2002)
Vicente, P., Rodrigues, L.: An indulgent uniform total order algorithm with optimistic delivery. In: Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems, p. 92. IEEE Computer Society, Washington, DC (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schiper, N., Pedone, F. (2007). On the Inherent Cost of Atomic Broadcast and Multicast in Wide Area Networks. In: Rao, S., Chatterjee, M., Jayanti, P., Murthy, C.S.R., Saha, S.K. (eds) Distributed Computing and Networking. ICDCN 2008. Lecture Notes in Computer Science, vol 4904. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77444-0_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-77444-0_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77443-3
Online ISBN: 978-3-540-77444-0
eBook Packages: Computer ScienceComputer Science (R0)