Abstract
A prioritized atomic multicast protocol allows an application to tag messages with a priority that expresses their urgency and tries to deliver first those with a higher priority. For instance, such a service can be used in a database replication context, to reduce the transaction abort rate when integrity constraints are used. We present a study of the three most important and well-known classes of atomic multicast protocols in which we evaluate the cost imposed by the prioritization mechanisms, in terms of additional latency overhead, computational cost and memory use. This study reveals that the behavior of the protocols depends on the particular properties of the setting (number of nodes, message sending rates, etc.) and that the extra work done by a prioritized protocol does not introduce any additional latency overhead in most of the evaluated settings. This study is also a performance comparison of these classes of total order protocols and can be used by system designers to choose the proper prioritized protocol for a given deployment.
This work has been partially supported by EU FEDER and Spanish MEC under grant TIN2006-14738-C02-01, by EU FEDER and Spanish MICINN under grant TIN2009-14460-C03 and by IMPIVA under grant IMIDIC/2007/68.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chockler, G., Keidar, I., Vitenberg, R.: Group communication specifications: a comprehensive study. ACM Computing Surveys 33(4), 427–469 (2001)
Défago, X., Schiper, A., Urbán, P.: Total order broadcast and multicast algorithms: Taxonomy and survey. ACM Computing Surveys 36(4), 372–421 (2004)
Birman, K.P., Joseph, T.A.: Reliable communication in the presence of failures. ACM Transactions on Computer Systems 5(1), 47–76 (1987)
Dolev, D., Malki, D.: The Transis approach to high availability cluster communication. Communications of the ACM 39(4), 64–70 (1996)
Moser, L.E., Melliar-Smith, P.M., Agarwal, D.A., Budhia, R., Apadopoulos, C.L.P.: Totem: a fault-tolerant multicast group communication system. Comm. of the ACM 39(4), 54–63 (1996)
Amir, Y., Danilov, C., Stanton, J.R.: A low latency, loss tolerant architecture and protocol for wide area group communication. In: DSN, pp. 327–336 (2000)
Tully, A., Shrivastava, S.K.: Preventing state divergence in replicated distributed programs. In: 9th Symposium on Reliable Distributed Systems, pp. 104–113 (1990)
Nakamura, A., Takizawa, M.: Priority-based total and semi-total ordering broadcast protocols. In: 12th Intl. Conf. on Dist. Comp. Sys (ICDCS 1992), pp. 178–185 (1992)
Rodrigues, L., Veríssimo, P., Casimiro, A.: Priority-based totally ordered multicast. In: 3rd IFAC/IFIP workshop on Algorithms and Architectures for Real-Time Control (1995)
Wiesmann, M., Schiper, A., Pedone, F., Kemme, B., Alonso, G.: Database replication techniques: A three parameter classification. In: SRDS, pp. 206–215 (2000)
Irún-Briz, L., de Juan-Marín, R., Castro-Company, F., Armendáriz-Iñigo, E., Muñoz-Escoí, F.D.: MADIS: A slim middleware for database replication. In: Cunha, J.C., Medeiros, P.D. (eds.) Euro-Par 2005. LNCS, vol. 3648, pp. 349–359. Springer, Heidelberg (2005)
Nakamura, A., Takizawa, M.: Starvation-prevented priority based total ordering broadcast protocol on high-speed single channel network. In: 2nd Intl. Symp. on High Performance Dist. Comp., pp. 281–288 (1993)
Baker, T.: Stack-based scheduling of real-time processes. Journal of Real-Time Systems 3(1), 67–99 (1991)
Wang, Y., Brasileiro, F., Anceaume, E., Greve, F., Hurfin, M.: Avoiding priority inversion on the processing of requests by active replicated servers. In: Dependable Systems and Networks, pp. 97–106. IEEE Computer Society, Los Alamitos (2001)
Miedes, E., Muñoz, F.D., Decker, H.: Reducing transaction abort rates with prioritized atomic multicast protocols. In: Luque, E., Margalef, T., Benítez, D. (eds.) Euro-Par 2008. LNCS, vol. 5168, pp. 394–403. Springer, Heidelberg (2008)
Défago, X., Schiper, A., Urbán, P.: Comparative performance analysis of ordering strategies in atomic broadcast algorithms. IEICE Trans. on Information and Systems E86-D(12) , 2698–2709 (2003)
Kaashoek, M.F., Tanenbaum, A.S.: An evaluation of the Amoeba group communication system. In: 16th IEEE International Conference on Distributed Computing Systems (ICDCS 1996), pp. 436–448. IEEE Computer Society, Los Alamitos (1996)
Miedes, E., Muñoz-Escoí, F.D.: On the cost of prioritized atomic multicast protocols. Technical Report ITI-SIDI-2009/002, Instituto Tecnológico de Informática, Universidad Politécnica de Valencia (February 2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miedes, E., Muñoz-Escoí, F.D. (2009). On the Cost of Prioritized Atomic Multicast Protocols. In: Meersman, R., Dillon, T., Herrero, P. (eds) On the Move to Meaningful Internet Systems: OTM 2009. OTM 2009. Lecture Notes in Computer Science, vol 5870. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05148-7_43
Download citation
DOI: https://doi.org/10.1007/978-3-642-05148-7_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05147-0
Online ISBN: 978-3-642-05148-7
eBook Packages: Computer ScienceComputer Science (R0)