Dpto. Ingeniería Matemática e Informática - Matematika eta Informatika Ingeniaritza Saila

Permanent URI for this community

http://hdl.handle.net/2454/10455

Browse

Browsing Dpto. Ingeniería Matemática e Informática - Matematika eta Informatika Ingeniaritza Saila by Author "Bernabéu Aubán, José M."

Now showing 1 - 2 of 2
  • Thumbnail Image
    PublicationOpen Access
    Eventual consistency: origin and support
    (Slovak Academy of Sciences, Institute of Informatics, 2018) Muñoz Escoí, Francesc D.; García Escrivá, José Ramón; Sendra Roig, Juan Salvador; Bernabéu Aubán, José M.; González de Mendívil Moreno, José Ramón; Ingeniería Matemática e Informática; Matematika eta Informatika Ingeniaritza
    Eventual consistency is demanded nowadays in geo-replicated services that need to be highly scalable and available. According to the CAP constraints, when network partitions may arise, a distributed service should choose between being strongly consistent or being highly available. Since scalable services should be available, a relaxed consistency (while the network is partitioned) is the preferred choice. Eventual consistency is not a common data-centric consistency model, but only a state convergence condition to be added to a relaxed consistency model. There are still several aspects of eventual consistency that have not been analysed in depth in previous works: 1. which are the oldest replication proposals providing eventual consistency, 2. which replica consistency models provide the best basis for building eventually consistent services, 3. which mechanisms should be considered for implementing an eventually consistent service, and 4. which are the best combinations of those mechanisms for achieving different concrete goals. This paper provides some notes on these important topics.
  • Thumbnail Image
    PublicationOpen Access
    Scalability approaches for causal multicast: a survey
    (Springer, 2016) Juan Marín, Rubén de; Decker, Hendrik; Armendáriz Íñigo, José Enrique; Bernabéu Aubán, José M.; Muñoz Escoí, Francesc D.; Ingeniería Matemática e Informática; Matematika eta Informatika Ingeniaritza
    Many 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.