Much Ado About Nothing?

Fuzzati, Rachele; Nestmann, Uwe

doi:10.1016/j.entcs.2005.12.082

Cited by 3 publications

(4 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Among the existing non-FSM formalisms and languages, such as those based on CSP [13], most are too weak to express semantics such as atomicity and agreement [9]. The same is true of the more recent work on declarative networking (P2) [19], based on a version of the Datalog language; it can be hard to capture strong semantics without concepts such as consistent aggregation and membership built into the model.…”

Section: Related Workmentioning

confidence: 94%

“…For each event e ∈ F , its value ν(e) is a set of pairs (y, i), where y is the destination that x should forward the packet to, and i is the identif er of the packet to be forwarded. 9), (c, 3)}) ∈ F , if means that at time t, the core logic layer at node x has requested that the lower layers forward packet 5 to node a, packet 9 to node b, and packet 3 to node c. In general, f ow F will not be consistent: different nodes usually forward different sets of packets to different peers and their forwarding decisions are made in a highly decentralized fashion.…”

Section: Distributed Flowsmentioning

confidence: 98%

See 1 more Smart Citation

Implementing reliable event streams in large systems via distributed data flows and recursive delegation

Ostrowski

Birman

Dolev

et al. 2009

Proceedings of the Third ACM International Conference on Distributed Event-Based Systems

View full text Add to dashboard Cite

Strong reliability properties, such as state machine replication and virtual synchrony, are hard to implement in a scalable manner. They are typically expressed in terms of global membership views. However, global membership is non-scalable. We propose a new way of modeling protocols that does not rely on global membership. Our approach is based on the concept of a distributed data f ow, a set of events distributed in space and time. We model protocols as networks of such f ows, constructed through recursive delegation. The resulting system uses multiple small membership services instead of a single global service while still supporting stronger properties. This paper focuses on the theoretical model and its base properties; in particular, on the concept of monotonic aggregation. We present a high-level architecture overview and initial performance results.

show abstract

Section: Related Workmentioning

confidence: 94%

Section: Distributed Flowsmentioning

confidence: 98%

Implementing reliable event streams in large systems via distributed data flows and recursive delegation

Ostrowski

Birman

Dolev

et al. 2009

Proceedings of the Third ACM International Conference on Distributed Event-Based Systems

View full text Add to dashboard Cite

show abstract

“…This results in compact code, but operating at this level, without tools such as consistent aggregations or membership that are built into our language, it would be hard or impossible to achieve stronger semantics; indeed, P2 has been used primarily with overlays, DHTs, and routing. The same is true for languages based on process calculi; they cannot express strong semantics [10]. In contrast to all these approaches, our language supports aggregation, recursion, batched processing, and essential object-oriented (OO) features, such as encapsulation.…”

Section: Related Workmentioning

confidence: 99%

Distributed data flow language for multi-party protocols

Ostrowski

Birman

Dolev

2009

Proceedings of the Fifth Workshop on Programming Languages and Operating Systems

View full text Add to dashboard Cite

This paper presents a new object-oriented (OO) approach to modeling the semantics of distributed multi-party protocols such as leader election, distributed locks or reliable multicast, and a programming language that supports it. The approach extends our live distributed objects (LO) model with the new concept of a distributed flow (DF), a stream of events that flow concurrently at multiple locations. DFs correspond to local variables, private fields,and method parameters in Java-like languages; they're means by which one stores and communicates state. Protocol instances correspond to Java objects; they consume and output flows; their internal states are encapsulated as internal flows, and their internal logic is represented as operations on flows. Our language provides a new type of concern separation: the semantic structure of protocols is decoupled from implementation details such as construction and maintenance of overlays, trees, and other structures used for scalability. These can be generated by the compiler or at deployment time. This can be done differently in different parts of the network, to match the local environment.

show abstract

“…Indeed, recently, concerns are being raised with regards to the potentials of formal methodologies towards the verification of today's complex protocols and environments, see e.g. [4].…”

Section: Introductionmentioning

confidence: 99%

On the Application of Formal Methods for Specifying and Verifying Distributed Protocols

Gelastou

Georgiou

Philippou

2008

2008 Seventh IEEE International Symposium on Network Computing and Applications

View full text Add to dashboard Cite

In this paper we consider the frameworks of Process Algebra and I/O Automata and we apply both towards the verification of a distributed leader-election protocol. Based on the two experiences we evaluate the approaches and draw initial conclusions with respect to their relative capabilities, strengths and usability. To the best of our knowledge, this is the first hands-on evaluation of the two models, and we view it as the cornerstone for a wider investigation of the strengths and weaknesses of the two methodologies in specifying and verifying (distributed) protocols.

show abstract

Much Ado About Nothing?

Cited by 3 publications

References 1 publication

Implementing reliable event streams in large systems via distributed data flows and recursive delegation

Implementing reliable event streams in large systems via distributed data flows and recursive delegation

Distributed data flow language for multi-party protocols

On the Application of Formal Methods for Specifying and Verifying Distributed Protocols

Contact Info

Product

Resources

About