Preserving Causality in a Scalable Message-Oriented Middleware

Laumay, Philippe; Bruneton, Eric; Palma, Noël De; Krakowiak, Sacha

doi:10.1007/3-540-45518-3_17

Cited by 8 publications

(7 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the other hand, when total-order interconnection is intended, both [68,49] show that an intrusive interconnecting protocol is necessary; i.e., a multicast message cannot be locally delivered in the sending subgroup until the forwarder process has propagated the message and a global total order has been decided. Formal proofs of the impossibility of achieving total-order interconnection in a non-intrusive way were later given by Laumay et al (2001) [39] andÁlvarez et al (2008) [6].…”

Section: Interconnection Approachmentioning

confidence: 99%

Scalability approaches for causal multicast: a survey

et al. 2015

View full text Add to dashboard Cite

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 pre-defined 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.

show abstract

Section: Interconnection Approachmentioning

confidence: 99%

Scalability approaches for causal multicast: a survey

et al. 2015

View full text Add to dashboard Cite

show abstract

“…As a consequence of this theorem, if we want to interconnect causally ordered systems we are forced to use only one IS process per system (there are multiple samples of such protocols [3,2,4,9,6]), or to coordinate in some way such IS processes. Let us explore this second alternative.…”

Section: Call Such a Process Isp(p)mentioning

confidence: 99%

“…The usage of FIFO interconnecting links in order to implement interconnection protocols for two causal and/or FIFO broadcast systems have been previously proposed in several papers [3,4,6]. Note also that the daisy architecture described in [2] also becomes a single FIFO link when only two causal systems need to be interconnected.…”

Section: Performance Analysis For Causal-ordered Systemsmentioning

confidence: 99%

“…There have been multiple papers [1,2,3,4,5,6] that had devoted their attention to the interconnection of message broadcast systems. Some of them [1,2,3,4,5] were focused on causal-ordered systems, thus reducing both the size of the vector clocks [7] being used in the broadcast protocols and the amount of needed messages (since smaller groups were used).…”

Section: Introductionmentioning

confidence: 99%

“…Some of them [1,2,3,4,5] were focused on causal-ordered systems, thus reducing both the size of the vector clocks [7] being used in the broadcast protocols and the amount of needed messages (since smaller groups were used). Most of them have relied on either FIFO This work has been partially supported by EU FEDER and the Spanish MEC under grant TIN2006-14738-C02, by EU FEDER and the Spanish MICINN under grant TIN2009-14460-C03, by IMPIVA under grant IMIDIC/2007/68, by CICYT under grant TIN2008-03687, by Bancaixa under grant P1-1B2007-44, by Comunidad de Madrid under grant S-0505/TIC-0285, and by the Spanish MEC under grant TIN2007-67353-C02-01.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Parallel Interconnection of Broadcast Systems with Multiple FIFO Channels

Marín

Cholvi

Jiménez

et al. 2009

On the Move to Meaningful Internet Systems: OTM 2009

View full text Add to dashboard Cite

Abstract. This paper proposes new protocols for the interconnection of FIFO-and causal-ordered broadcast systems, thus increasing their scalability. They use several interconnection links between systems, which avoids bottleneck problems due to the network traffic, since messages are not forced to go throughout a single link but instead through the several links we establish. General architectures to interconnect FIFOand causal-ordered systems are proposed. Failure management is also discussed and a performance analysis is given, detailing the benefits introduced by these interconnection approaches that are able to easily increase the resulting interconnection bandwidth.

show abstract

Specification and Verification of a Dynamic Reconfiguration Protocol for Agent-based Applications

Cornejo

Garavel

Mateescu

et al. 2002

IFIP International Federation for Information Processing

Self Cite

View full text Add to dashboard Cite

INTRODUCTIONAs computing resources become decentralized, the development of distributed applications receives increasing attention from the software engineering community. These applications are often complex and must satisfy strong reliability and availability constraints. To avoid stopping an entire distributed application for maintenance operations (e.g., repair, upgrade, etc.), it is essential to provide mechanisms allowing distributed applications to be reconfigured at run-time. Such mechanisms should ensure a proper functioning of the application regardless of run-time changes (e.g., creation or deletion of agents, replacement of agents, migration of agents across execution sites, modification of communication routes, etc). Moreover, these mechanisms should not induce heavy penalties on applications during maintenance operations. * This author was partially supported by CONACYT-SFERE and UAM Iztapalapa, Mexico. AbstractDynamic reconfiguration increases the availability of distributed applications by allowing them to evolve at run-time. This paper deals with the formal specification and model-checking verification of a dynamic reconfiguration protocol used in industrial agent-based applications. Starting from a reference implementation in JAVA, we produced a specification of the protocol using the Formal Description Technique LOTOS. We also specified a set of temporal logic formulas characterizing the correct behaviour of each protocol primitive. Finally, we studied various finite state configurations of the protocol, on which we verified these requirements using the CADP protocol engineering tool set.

show abstract

Preserving Causality in a Scalable Message-Oriented Middleware

Cited by 8 publications

References 18 publications

Scalability approaches for causal multicast: a survey

Scalability approaches for causal multicast: a survey

Parallel Interconnection of Broadcast Systems with Multiple FIFO Channels

Specification and Verification of a Dynamic Reconfiguration Protocol for Agent-based Applications

Contact Info

Product

Resources

About