Coupling from the Past in Hybrid Models for File Sharing Peer to Peer Systems

  • Bruno Gaujal
  • Florence Perronnin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4416)


In this paper we show how file sharing peer to peer systems can be modeled by hybrid systems with a continuous part corresponding to a fluid limit of files and a discrete part corresponding to customers. Then we show that this hybrid system is amenable to perfect simulations (i.e. simulations providing samples of the system states which distributions have no bias from the asymptotic distribution of the system). An experimental study is carried to show the respective influence that the different parameters (such as time-to-live, rate of requests, connection time) play on the behavior of large peer to peer systems, and also to show the effectiveness of this approach for numerical solutions of stochastic hybrid systems.


Markov Chain Hybrid System Hybrid Model Continuous Time Markov Chain Coupling Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Dai, J.: On positive harris recurrence of multiclass queueing networks: a unified approach via fluid limit models. Annals of Applied Probability 5, 49–77 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    David, R., Alla, H.: Discrete, Continuous, and Hybrid Petri Nets. Springer, Heidelberg (2004)Google Scholar
  3. 3.
    Asarin, E., Maler, O., Pnueli, A.: Reachability analysis of dynamical systems having piecewise-constant derivatives. Theoretical Computer Science 138, 35–65 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Propp, D., Wilson, J.: Exact sampling with coupled Markov chains and application to statistical mechanics. Random Structures and Algorithms 9(1), 223–252 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Gaujal, B., Perronnin, F., Bertin, R.: Perfect simulation of stochastic hybrid systems with an application to peer to peer systems. Technical report, INRIA (2006)Google Scholar
  6. 6.
  7. 7.
  8. 8.
    Press, W.H., et al.: Numerical Recipes in C. Cambridge University Press, Cambridge (1992)zbMATHGoogle Scholar
  9. 9.
    Meyn, S.P., Tweedy, R.L.: Markov chains and stochastic stability. Springer, Heidelberg (1993)zbMATHGoogle Scholar
  10. 10.
    Foss, S.G., Tweedy, R.L.: Perfect simulation and backward coupling. Stochastic Models 14, 187–204 (1998)zbMATHCrossRefGoogle Scholar
  11. 11.
    Baccelli, F., Brémaud, P.: Elements of queueing theory. Springer, Heidelberg (1994)zbMATHGoogle Scholar
  12. 12.
    Walker, A.: An efficient method for generating random variables with general distributions. ACM Trans. Math. Software, 253–256 (1974)Google Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Bruno Gaujal
    • 1
  • Florence Perronnin
    • 2
  1. 1.INRIA and Lab. ID-IMAG (CNRS, INPG, INRIA, UJF) 51, Av. J. Kunztmann, MontbonnotFrance
  2. 2.UJF and Lab. ID-IMAG (CNRS, INPG, INRIA, UJF) 51, Av. J. Kunztmann, MontbonnotFrance

Personalised recommendations