Skip to main content
SpringerLink
Log in
Book cover

International SDL Forum

SDL 2007: SDL 2007: Design for Dependable Systems pp 242–257Cite as

Using Probabilist Models for Studying Realistic Systems: A Case Study of Pastry

  • Conference paper

  • 259 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 4745))

Abstract

Telecommunication services will be in the future built upon peer-to-peer protocols. This implies the need to have strong guarantees of the dependability of those protocols. One building block for such protocols are distributed hash tables (DHT in short), and Pastry is a protocol implementing distributed hash tables. We have designed a probabilist model of Pastry that enabled us to simulate it. In particular, we have studied the performance of the protocol with respect to the number of nodes. We have used for this study probabilistic model checking tools used in the RNTL project Averros. This is a significant application of academic tools to industrial concerns.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Averroes, Analysis and VERification for the Reliability Of Embedded Systems, RNTL, http://www-verimag.imag.fr/AVERROES/

  2. Pastry, A substrate for peer-to-peer applications, Microsoft Research, http://research.microsoft.com/~antr/Pastry/

  3. APMC, Approximate Probabilistic Model Checker, LRI, http://apmc.berbiqui.org/index.php/Accueil

  4. PRISM, PRobabilistIc Symbolic Model checker, University of Birmingham, http://www.cs.bham.ac.uk/~dxp/prism/

  5. Rowstron, A., Druschel, P.: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Castro, M., Druschel, P., Hu, Y.C., Rowstron, A.: Topology-aware routing in structured peer-to-peer overlay networks (2002)

    Google Scholar 

  7. Rowstron, A., Druschel, P.: Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In: Prc. ACM SOSP 2001, Banff, Canada (2001)

    Google Scholar 

  8. Hérault, T., Lassaigne, R., Magniette, F., Peyronnet, S.: Approximate Probabilistic Model Checking. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol. 2937, pp. 73–84. Springer, Heidelberg (2004)

    Google Scholar 

  9. Lassaigne, R., Peyronnet, S.: Approximate verification of probabilistic systems. In: Hermanns, H., Segala, R. (eds.) PROBMIV 2002, PAPM-PROBMIV 2002, and PAPM 2002. LNCS, vol. 2399, pp. 213–214. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  10. Courcoubetis, C., Yannakakis, M., et al.: The complexity of probabilistic verification. Journal of the ACM 24(4), 857–907 (1995)

    Article  MathSciNet  Google Scholar 

  11. Kwiatkowska, M., Norman, G., Parker, D.: PRISM 2.0: A Tool for Probabilistic Model Checking. In: QEST 2004. Proc. 1st International Conference on Quantitative Evaluation of Systems, pp. 322–323. IEEE Computer Society Press, Los Alamitos (2004)

    Chapter  Google Scholar 

  12. Hinton, A., Kwiatkowska, M., Norman, G., Parker, D.: PRISM: A Tool for Automatic Verification of Probabilistic Systems. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006 and ETAPS 2006. LNCS, vol. 3920, pp. 441–444. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  13. Guirado, G., Hérault, T., Lassaigne, R., Peyronnet, S.: Distribution, approximation and probabilistic model checking. In: Proc. of the 4th Parallel and Distributed Methods in Verification (PDMC 05), Lisboa, Portugal. Electronic Notes in Theor. Comp. Sci. (to appear)

    Google Scholar 

  14. Duflot, M., Fribourg, L.: Th. Hérault, R. Lassaigne, F. Magniette, S. Messika, S. Peyronnet, Picaronny, C.: Verification of the CSMA/CD protocol using PRISM and APMC. In: AVoCS, Proc. 4th Int. Workshop on Automated Verification of Critical Systems, London, UK, September 2004, Electronic Notes in Theor. Comp. Sci. (to appear)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. France Telecom, R&D Division, 2 avenue Pierre Marzin, 22300 Lannion, France

    Guillaume Châtelet, Benoit Parreaux & Yves-Marie Quemener

Authors
  1. Guillaume Châtelet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Benoit Parreaux
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yves-Marie Quemener
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Emmanuel Gaudin Elie Najm Rick Reed

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Châtelet, G., Parreaux, B., Quemener, YM. (2007). Using Probabilist Models for Studying Realistic Systems: A Case Study of Pastry. In: Gaudin, E., Najm, E., Reed, R. (eds) SDL 2007: Design for Dependable Systems. SDL 2007. Lecture Notes in Computer Science, vol 4745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74984-4_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74984-4_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74983-7

  • Online ISBN: 978-3-540-74984-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation