When Birds Die: Making Population Protocols Fault-Tolerant
In the population protocol model introduced by Angluin et al. , a collection of agents, which are modelled by finite state machines, move around unpredictably and have pairwise interactions. The ability of such systems to compute functions on a multiset of inputs that are initially distributed across all of the agents has been studied in the absence of failures. Here, we show that essentially the same set of functions can be computed in the presence of halting and transient failures, provided preconditions on the inputs are added so that the failures cannot immediately obscure enough of the inputs to change the outcome. We do this by giving a general-purpose transformation that makes any algorithm for the fault-free setting tolerant to failures.
KeywordsMultivalued Function Communication Graph Robustness Condition Correct Group Population Protocol
Unable to display preview. Download preview PDF.
- 2.Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. In: Proc. 23rd ACM Symposium on Principles of Distributed Computing, pp. 290–299 (2004) (Expanded version to appear in Distributed Computing) Google Scholar
- 3.Angluin, D., Aspnes, J., Eisenstat, D.: Stably computable predicates are semilinear. In: Proc. 25th ACM Symposium on Principles of Distributed Computing, July 2006 (to appear)Google Scholar
- 5.Angluin, D., Aspnes, J., Fischer, M.J., Jiang, H.: Self-stabilizing behavior in networks of nondeterministically interacting sensors. In: Proc. 9th International Conference on Principles of Distributed Systems (2005)Google Scholar
- 6.Catullus, G.V.: Carmen 3. In: Carmina. But curse upon you, cursed shades of Orcus, which devour all pretty things! Such a pretty sparrow you have taken away. (Transl. Francis Warre Cornish)Google Scholar
- 7.Delporte-Gallet, C., Fauconnier, H., Guerraoui, R.: What dependability for networks of mobile sensors? In: Proc. First Workshop on Hot Topics in System Dependability (2005)Google Scholar
- 9.Hadzilacos, V.: On the relationship between the atomic commitment and consensus problems. In: Proc. Workshop on Fault-Tolerant Distributed Computing, pp. 201–208 (1990)Google Scholar
- 10.Kahn, J.M., Katz, R.H., Pister, K.S.J.: Next century challenges: Mobile networking for “smart dust”. In: Proc. 5th ACM/IEEE International Conference on Mobile Computing and Networking, pp. 271–278 (1999)Google Scholar
- 11.Madden, S., Franklin, M.J., Hellerstein, J.M., Hong, W.: TAG: a tiny aggregation service for ad-hoc sensor networks. In: Proc. 5th Symposium on Operating Systems Design and Implementation, pp. 131–146 (2002)Google Scholar
- 13.Patt-Shamir, B.: A note on efficient aggregate queries in sensor networks. In: Proc. 23rd ACM Symposium on Principles of Distributed Computing, pp. 283–289 (2004)Google Scholar