Formal analysis techniques for gossiping protocols

Operating Systems Review (ACM)

Volumn 41, Issue 5, 2007, Pages 28-36

  Bakhshi, Rena ^a   Bonnet, Francois ^b   Fokkink, Wan ^a   Haverkort, Boudewijn ^c  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

^b UNIVERSITÉ PARIS SACLAY   (France)

^c UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

Gossiping protocols; Survey; Verification techniques

Indexed keywords

FORMAL ANALYSIS; FORMAL VERIFICATIONS; GOSSIPING PROTOCOLS; VERIFICATION TECHNIQUES;

SURVEYS;

EID: 67650376785     PISSN: 01635980     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1317379.1317385     Document Type: Conference Paper

References (75)

1. A. Allavena, A. Demers, and J. E. Hopcroft. Correctness of a gossip based membership protocol. In Proc. 24th Annu. ACM Symp. on Principles of Distributed Computing (PODC'05), pages 292-301. ACM Press, 2005.
2. T. Andel and A. Yasinsac. On the credibility of MANET simulations. IEEE Computer, 37(7):48-54, 2006.
3. C. Baier, L. Cloth, B. R. Haverkort, M. Kuntz, and M. Siegle. Model checking markov chains with actions and state labels. IEEE Trans. Software Eng., 33(4):209-224, 2007.
4. C. Baier, B. R. Haverkort, H. Hermanns, and J.-P. Katoen. Model Checking Continuous-Time Markov Chains by Transient Analysis. In Proc. 12th Int. Conf. on Computer Aided Verification (CAV'00), volume 1855 of LNCS, pages 358-372. Springer, 2000.
5. C. Baier, B. R. Haverkort, H. Hermanns, and J.-P. Katoen. Model-checking algorithms for continuous-time Markov chains. IEEE Trans. Software Eng., 29(6):524-541, 2003.
6. N. T. Bailey. Mathematical Theory of Infectious Diseases and Its Applications. Griffin, London, second edition, 1975.
7. Z. Bar-Yossef, R. Friedman, and G. Kliot. RaWMS: random walk based lightweight membership service for wireless ad hoc network. In Proc. 7th ACM Int. Symp. on Mobile ad hoc networking and computing (MobiHoc'06), pages 238-249. ACM Press, 2006.
8. G. Behrmann, A. David, and K. G. Larsen. A tutorial on UPPAAL. In Formal Methods for the Design of Real-Time Systems: Proc. 4th Int. School on Formal Methods for the Design of Comput., Commun. and Software Syst. (SFM-RT 2004), number 3185 in LNCS, pages 200-236. Springer, 2004.
9. A. Bell and B. R. Haverkort. Sequential and distributed model checking of Petri nets. Software Tools for Technology Transfer (STTT), 7(1):43-60, 2005. (Pubitemid 40259404)
10. A. Bell and B. R. Haverkort. Distributed disk-based algorithms for model checking very large Markov chains. Formal Methods in System Design, 29(2):177-196, 2006.
11. Y. Bertot and P. Castéran. Interactive Theorem Proving and Program Development Coq'Art: The Calculus of Inductive Constructions, volume XXV of Texts in Theoretical Computer Science: An EATCS Series. Springer, 2004.
12. K. Birman, M. Hayden, O. Ozkasap, Z. Xiao, M. Budiu, and Y. Minsky. Bimodal multicast. ACM Trans. on Comput. Syst., 17(2):41-88, 1999.
13. F. Bonnet. Performance analysis of Cyclon, an inexpensive membership management for unstructured p2p overlays. Master thesis, ENS Cachan Bretagne, University of Rennes, IRISA, 2006.
14. J. Bowen and M. Hinchey. Ten Commandments of Formal Methods...Ten Years Later. Computer, 39(1):40-48, 2006.
15. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Gossip algorithms: Design, analysis and applications. In Proc. 24th Conf. of the IEEE Comput. and Commun. Soc. (INFOCOM 2005), volume 3, pages 1653-1664. IEEE Press, 2005.
16. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Mixing times for random walks on geometric random graphs. In Proc. 7th Workshop on Algorithm Eng. and Experiments and 2nd Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO 2005), pages 240-249. SIAM, 2005.
17. M. Cadilhac, T. Hérault, R. Lassaigne, S. Peyronnet, and S. Tixeuil. Evaluating complex MAC protocols for sensor networks with APMC. In Proc. 6th Int. Workshop on Automated Verification of Critical Syst (AVoCS'06), ENTCS. Elsevier, 2006. To appear.
18. R. Cardell-Oliver. Why flooding is unreliable in multi-hop, wireless networks. Technical Report UWA-CSSE-04-1001, University of Western Australia, 2004.
19. D. Cavin, Y. Sasson, and A. Schiper. On the accuracy of MANET simulators. In Proc. 2nd ACM Int. Workshop on Principles of Mobile Computing (POMC'02), pages 38-43. ACM Press, 2002.
20. A. Clark, S. Gilmore, J. Hillston, and M. Tribastone. Stochastic process algebra. In Formal Methods for the Performance Evaluation: Proc. 7th Int. School on Formal Methods for the Design of Comput., Commun. and Software Syst. (SFM-PE 2007), number 4486 in LNCS, pages 132-179. Springer, 2007.
21. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 2000.
22. P. Dagum, R. Karp, M. Luby, and S. Ross. An optimal algorithm for monte carlo estimation. SIAM J. Comput., 29(5):1484-1496, 2000. (Pubitemid 33768936)
23. S. Deb, M. Médard, and C. Choute. Algebraic gossip: a network coding approach to optimal multiple rumor mongering. IEEE/ACM Trans. Netw., 14(SI):2486-2507, 2006.
24. A. Demaille, S. Peyronnet, and T. Hérault. Probabilistic verification of sensor networks. In Proc. 4th IEEE Int. Conf. on Comput. Sci., Research, Innovation and Vision for the Future (RIVF'06), pages 45-54. IEEE Computer Society, 2006.
25. A. Demaille, S. Peyronnet, and B. Sigoure. Modeling of sensor networks using XRM. In Proc. 2nd Int. Symp. on Leveraging Applications of Formal Methods, Verification and Validation (ISoLA'06), 2006.
26. A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry. Epidemic algorithms for replicated database maintenance. In Proc. 6th Annu. ACM Symp. on Principles of Distributed Computing (PODC'87), pages 1-12. ACM Press, 1987.
27. A. G. Dimakis, A. D. Sarwate, and M. J. Wainwright. Geographic gossip: efficient aggregation for sensor networks. In Proc. 5th Int. Conf. on Inform. processing in sensor networks (IPSN'06), pages 69-76. ACM Press, 2006.
28. N. Drost, E. Ogston, R. van Nieuwpoort, and H. Bal. ARRG: Real-World Gossiping. In Proc. 15th IEEE Int. Symp. on High Performance Distributed Computing (HPDC-15'06). IEEE Computer Society, 2007. To appear.
29. P. Eugster, R. Guerraoui, S. B. Handurukande, P. Kouznetsov, and A.-M. Kermarrec. Lightweight probabilistic broadcast. ACM Trans. on Comput. Syst., 21(4):341-374, 2003.
30. P. Eugster, R. Guerraoui, A.-M. Kermarrec, and L. Massoulié. From epidemics to distributed computing. IEEE Computer, 37(5):60-67, 2004.
31. A. Fehnker and P. Gao. Formal verification and simulation for performance analysis for probabilistic broadcast protocols. In Proc. 5th Conf. on Ad-Hoc, Mobile, and Wireless Networks (ADHOC-NOW'06), volume 4104 of LNCS, pages 121-141. Springer, 2006.
32. U. Feige, D. Peleg, P. Raghavan, and E. Upfal. Randomized broadcast in networks. In SIGAL Int. Symp. on Algorithms, volume 450 of LNCS, pages 128-137. Springer, 1990.
33. G. S. Fishman. Monte Carlo: Concepts, Algorithms, and Applications. Springer Series in Operations Research. Springer, 1996.
34. A. Ganesh, L. Massoulie, and D. Towsley. The effect of network topology on the spread of epidemics. In Proc. 24th of the IEEE Comput. and Commun. Soc. (INFOCOM 2005), volume 2, pages 1455-1466. IEEE Computer Society, 2005.
35. A. J. Ganesh, A.-M. Kermarrec, and L. Massoulie. SCAMP: Peer-to-peer lightweight membership service for large-scale group communication. In Proc. 3rd Int. Workshop on Networked Group Commun. (NGC'01), volume 2233 of LNCS, pages 44-55. Springer, 2001.
36. D. Gavidia, S. Voulgaris, and M. van Steen. A Gossip-based Distributed News Service for Wireless Mesh Networks. In Proc. 3rd IEEE Conf. on Wireless On demand Network Syst. and Services (WONS'06), pages 59-67. IEEE Computer Society, 2006.
37. R. Grosu and S. A. Smolka. Monte carlo model checking. In Proc. 11th Int. Conf. on Tools and Algorithms for Construction and Analysis of Syst. (TACAS'05), volume 3440 of LNCS, pages 271-286. Springer, 2005.
38. G. Guirado, T. Hérault, R. Lassaigne, and S. Peyronnet. Distribution, approximation and probabilistic model checking. ENTCS, 135(2):19-30, 2006.
39. J. M. Hammersley and K. W. Morton. Poor Man's Monte Carlo. J. Royal Statistical Soc. Series B (Methodological), 16(1):23-38, 1954.
40. H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Aspects of Computing, 6(5):512-535, 1994.
41. B. R. Haverkort. Are stochastic process algebras good for performance and dependability evaluation. In Proc. Int. Workshop on Process Algebra and Performance Modeling, volume 1853 of LNCS, pages 501-510. Springer, 2000.
42. B. R. Haverkort. Markovian models for performance and dependability evaluation. In European Educ. Forum: School on Formal Methods and Performance Analysis, volume 2090 of LNCS, pages 38-83. Springer, 2002.
43. B. R. Haverkort, H. Hermanns, and J.-P. Katoen. On the use of model checking techniques for dependability evaluation. In Proc. 19th IEEE Symp. on Reliable Distributed Syst. (SRDS'00), pages 228-237. IEEE Computer Society, 2000.
44. T. Hérault, R. Lassaigne, F. Magniette, and S. Peyronnet. Approximate probabilistic model checking. In Proc. 5th Int. Conf. on Verification, Model Checking and Abstract Interpretation (VMCAI'04), volume 2937 of LNCS, pages 73-84. Springer, 2004.
45. A. Hinton, M. Z. Kwiatkowska, G. Norman, and D. Parker. Prism: A tool for automatic verification of probabilistic systems. In Proc. 2nd Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'06), volume 3920 of LNCS, pages 441-444. Springer, 2006.
46. G. Holzmann. The Spin Model Checker, Primer and Reference Manual. Addison-Wesley, 2003.
47. J. Hromkovic, R. Klasing, B. Monien, and R. Peine. Dissemination of information in interconnection networks (Broadcasting & Gossiping). Combinatorial Network Theory, pages 125-212, 1996.
48. M. Huth and M. Ryan. Logic in Computer Science: Modelling and reasoning about systems. Cambridge University Press, Cambridge, UK, 2004.
49. M. Jelasity, R. Guerraoui, A.-M. Kermarrec, and M. van Steen. The peer sampling service: Experimental evaluation of unstructured gossip-based implementations. In Proc. 5th ACM/IFIP/USENIX Int. Middleware Conf. (Middleware'04), volume 3231 of LNCS, pages 79-98. Springer, 2004.
50. R. Karp, C. Schindelhauer, S. Shenker, and B. Vocking. Randomized rumor spreading. In Proc. 41st Annu. IEEE Symp. on Found. of Comput. Sci. (FOCS'00), pages 565-574. IEEE Computer Society, 2000.
51. J.-P. Katoen, T. Kemna, I. Zapreev, and D. Jansen. Bisimulation minimisation mostly speeds up probabilistic model checking. In Proc. 13th Int. Conf. on Tools and Algorithms for Construction and Analysis of Syst. (TACAS'07), volume 4424 of LNCS, pages 76-92. Springer, 2007.
52. J.-P. Katoen, D. Klink, M. Leucker, and V. Wolf. Three-valued abstraction for continuous-time Markov chains. In Proc. 19th Int. Conf. on Comput. Aided Verification (CAV'07), 2007. To appear.
53. D. Kempe, A. Dobra, and J. Gehrke. Gossip-based computation of aggregate information. In Proc. 44th Annu. IEEE Symp. on Found. of Comput. Sci. (FOCS'03), pages 482-491. IEEE Computer Society, 2003.
54. D. Kempe, J. Kleinberg, and A. Demers. Spatial gossip and resource location protocols. In Proc. 33rd Annu. ACM Symp. on Theory of Computing (STOC'01), pages 163-172. ACM Press, 2001.
55. D. Kempe and J. M. Kleinberg. Protocols and impossibility results for gossip-based communication mechanisms. In Proc. 43rd Annu. IEEE Symp. on Found. of Comput. Sci. (FOCS'02), pages 471-480. IEEE Computer Society, 2002.
56. M. Kwiatkowska, G. Norman, and D. Parker. Game-based abstraction for markov decision processes. In Proc. 3rd Int. Conf. on the Quantitative Evaluation of Syst. (QEST'06), pages 157-166. IEEE Computer Society, 2006.
57. S. Laplante, R. Lassaigne, F. Magniez, S. Peyronnet, and M. de Rougemont. Probabilistic abstraction for model checking: An approach based on property testing. In Proc. 17th IEEE Symp. on Logic in Comput. Sci. (LICS 2002), pages 30-39. IEEE Computer Society, 2002.
58. J. Luo, P. T. Eugster, and J.-P. Hubaux. Route driven gossip: Probabilistic reliable multicast in ad hoc networks. In Proc. 22nd Conf. of the IEEE Comput. and Commun. Soc. (INFOCOM 2003), volume 3, pages 2229-2239. IEEE Computer Society, 2003.
59. A. McIver and A. Fehnker. Formal techniques for the analysis of wireless networks. In Proc. 2nd Int. Symp. on Leveraging Applications of Formal Methods, Verification and Validation (ISoLA'06), 2006.
60. D. Mosk-Aoyama and D. Shah. Computing separable functions via gossip. In Proc. 25th Annu. ACM Symp. on Principles of Distributed Computing (PODC'06), pages 113-122. ACM Press, 2006.
61. T. Nipkow, L. C. Paulson, and M. Wenzel. Isabelle/HOL: A Proof Assistant for Higher-Order Logic, volume 2283 of LNCS. Springer, 2002.
62. G. Norman, D. Parker, M. Z. Kwiatkowska, S. K. Shukla, and R. Gupta. Using probabilistic model checking for dynamic power management. Formal Aspects of Computing, 17(2):160-176, 2005. (Pubitemid 41165027)
63. S. Owre, S. Rajan, J. M. Rushby, N. Shankar, and M. K. Srivas. PVS: Combining Specification, Proof Checking, and Model Checking. In Proc. 8th Int. Conf. on Comput. Aided Verification (CAV'96), volume 1102 of LNCS, pages 411-414. Springer, 1996.
64. J. Pouwelse, P. Garbacki, J. Wang, A. Bakker, J. Yang, A. Iosup, D. Epema, M.Reinders, M. van Steen, and H. Sips. Tribler: A social-based peer-to-peer system. Concurrency and Computation: Practice and Experience, 19:1-11, 2007.
65. M. L. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley & Sons, Inc., New York, NY, USA, 1994.
66. D. Randall. Rapidly Mixing Markov Chains with Applications in Computer Science and Physics. Computing in Sci. and Eng., 8(2):30-41, 2006.
67. P. Schnoebelen. The verification of probabilistic lossy channel systems. In Validation of Stochastic Systems, volume 2925 of LNCS, pages 445-466, 2004.
68. K. Sen, M. Viswanathan, and G. Agha. Statistical model checking of black-box probabilistic systems. In Proc. 16th Int. Conf. on Comput. Aided Verification (CAV'04), volume 3114 of LNCS, pages 202-215. Springer, 2004.
69. R. van Renesse, K. P. Birman, and W. Vogels. Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining. ACM Trans. Comput. Syst., 21(2):164-206, 2003.
70. R. van Renesse, Y. Minsky, and M. Hayden. A gossip-style failure detection service. In Proc. 1st IFIP Conf. on Distributed Syst. Platforms and Open Distributed Processing (Middleware'98), pages 55-70. Springer, 1998.
71. W. Vogels, R. van Renesse, and K. Birman. The power of epidemics: robust communication for large-scale distributed systems. ACM SIGCOMM Comput. Commun. Review, 33(1):131-135, 2003.
72. S. Voulgaris. Epidemic-Based Self-Organization in Peer-to-Peer Systems. Doctoral thesis, Vrije Universiteit Amsterdam, 2006. Appears in Collections: Proefschriften Exacte Wetenschappen.
73. S. Voulgaris, D. Gavidia, and M. van Steen. Cyclon: Inexpensive membership management for unstructured p2p overlays. J. Network and Syst. Manage., 13(2):197-217, 2005.
74. H. Younes, M. Kwiatkowska, G. Norman, and D. Parker. Numerical vs. statistical probabilistic model checking. Software Tools for Technology Transfer (STTT), 8(3):216-228, 2006.
75. H. L. S. Younes and R. G. Simmons. Probabilistic verification of discrete event systems using acceptance sampling. In Proc. 14th Int. Conf. on Comput. Aided Verification (CAV'02), volume 2404 of LNCS, pages 223-235. Springer, 2002.