Conference paper · Book chapter
A Fixpoint-Based Calculus for Graph-Shaped Computational Fields
Coordination is essential for dynamic distributed systems exhibiting autonomous behaviors. Spatially distributed, locally interacting, propagating computational fields are particularly appealing for allowing components to join and leave with little or no overhead. In our approach, the space topology is represented by a graph-shaped field, namely a network with attributes on both nodes and arcs, where arcs represent interaction capabilities between nodes.
We propose a calculus where computation is strictly synchronous and corresponds to sequential computations of fixpoints in the graph-shaped field. Under some conditions, those fixpoints can be computed by synchronised iterations, where in each iteration the attributes of a node is updated based on the attributes of the neighbours in the previous iteration.
Basic constructs are reminiscent of the semiring μ-calculus, a semiring-valued generalisation of the modal μ-calculus, which provides a flexible mechanism to specify the neighbourhood range (according to path formulae) and the way attributes should be combined (through semiring operators). Additional control-How constructs allow one to conveniently structure the fixpoint computations.
We illustrate our approach with a case study based on a disaster recovery scenario, implemented in a prototype simulator that we use to evaluate the performance of a disaster recovery strategy.
Language: | English |
---|---|
Publisher: | Springer |
Year: | 2015 |
Pages: | 101-116 |
Proceedings: | 17th IFIP WG 6.1 International Conference, COORDINATION 2015 |
Series: | Lecture Notes in Computer Science |
Journal subtitle: | Proceedings of the 17th Ifip Wg 6.1 International Conference (coordination 2015) |
ISBN: | 3319192817 , 3319192825 , 9783319192819 and 9783319192826 |
ISSN: | 03029743 and 16113349 |
Types: | Conference paper and Book chapter |
DOI: | 10.1007/978-3-319-19282-6_7 |
ORCIDs: | Lluch Lafuente, Alberto |