Juan Marín, Rubén deDecker, HendrikArmendáriz Íñigo, José EnriqueBernabéu Aubán, José M.Muñoz Escoí, Francesc D.2020-09-222020-09-2220161436-505710.1007/s00607-015-0479-0https://academica-e.unavarra.es/handle/2454/38155Many distributed services need to be scalable: internet search, electronic commerce, e-government... In order to achieve scalability those applications rely on replicated components. Because of the dynamics of growth and volatility of customer markets, applications need to be hosted by adaptive systems. In particular, the scalability of the reliable multicast mechanisms used for supporting the consistency of replicas is of crucial importance. Reliable multicast may propagate updates in a predefined order (e.g., FIFO, total or causal). Since total order needs more communication rounds than causal order, the latter appears to be the preferable candidate for achieving multicast scalability, although the consistency guarantees based on causal order are weaker than those of total order. This paper provides a historical survey of different scalability approaches for reliable causal multicast protocols.26 p.application/pdfeng© Springer-Verlag Wien 2015Multicast protocolCausal multicastVersion vectorVector clockInterconnectionScalabilityinfo:eu-repo/semantics/articleinfo:eu-repo/semantics/openAccessAcceso abierto / Sarbide irekia