Skip to main content

Fluid Analysis of Spatio-Temporal Properties of Agents in a Population Model

  • Conference paper
  • First Online:
Analytical and Stochastic Modelling Techniques and Applications (ASMTA 2016)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 9845))

Abstract

We consider large stochastic population models in which heterogeneous agents are interacting locally and moving in space. These models are very common, e.g. in the context of mobile wireless networks, crowd dynamics, traffic management, but they are typically very hard to analyze, even when space is discretized in a grid. Here we consider individual agents and look at their properties, e.g. quality of service metrics in mobile networks. Leveraging recent results on the combination of stochastic approximation with formal verification, and of fluid approximation of spatio-temporal population processes, we devise a novel mean-field based approach to check such behaviors, which requires the solution of a low-dimensional set of Partial Differential Equation, which is shown to be much faster than simulation. We prove the correctness of the method and validate it on a mobile peer-to-peer network example.

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

Access this chapter

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 EPUB and 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

Institutional subscriptions

References

  1. Abate, A., Prandini, M., Lygeros, J., Sastry, S.S.: Approximation of general stochastic hybrid systems by switching diffusions with random hybrid jumps. In: Egerstedt, M., Mishra, B. (eds.) HSCC 2008. LNCS, vol. 4981, pp. 598–601. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  2. Akyildiz, I.F., Ho, J.S.M., Lin, Y.B.: Movement-based location update and selective paging for PCS networks. IEEE/ACM Trans. Netw. 4(4), 629–638 (1996)

    Article  Google Scholar 

  3. Bar-Noy, A., Kessler, I., Sidi, M.: Mobile users: to uptdate or not to update? In: INFOCOM, pp. 570–576 (1994)

    Google Scholar 

  4. Bortolussi, L.: Limit behavior of the hybrid approximation of stochastic process algebras. In: Al-Begain, K., Fiems, D., Knottenbelt, W.J. (eds.) ASMTA 2010. LNCS, vol. 6148, pp. 367–381. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  5. Bortolussi, L., Hillston, J.: Fluid model checking. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol. 7454, pp. 333–347. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  6. Bortolussi, L., Hillston, J.: Model checking single agent behaviours by fluid approximation. Inf. Comput. 242, 183–226 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  7. Bortolussi, L., Hillston, J., Latella, D., Massink, M.: Continuous approximation of collective system behaviour: a tutorial. Perform. Eval. 70(5), 317–349 (2013)

    Article  Google Scholar 

  8. Boudec, J.Y.L., McDonald, D., Mundinger, J.: A generic mean field convergence result for systems of interacting objects. In: QEST 2007, pp. 3–18 (2007)

    Google Scholar 

  9. Darling, R.W.R., Norris, J.R.: Differential equation approximations for Markov chains. Probab. Surv. [electroninc only] 5, 37–79 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  10. Gamal, A., Mammen, J., Prabhakar, B., Shah, D.: Throughput-delay trade-off in wireless networks. In: INFOCOM (2004)

    Google Scholar 

  11. Gibson, M.A., Bruck, J.: Efficient exact stochastic simulation of chemical systems with many species and many channels. J. Phys. Chem. A 104(9), 1876–1889 (2000)

    Article  Google Scholar 

  12. Ioannidis, S., Marbach, P.: A brownian motion model for last encounter routing. In: INFOCOM (2006)

    Google Scholar 

  13. Kowal, M., Tschaikowski, M., Tribastone, M., Schaefer, I.: Scaling size and parameter spaces in variability-aware software performance models. In: ASE 2015 (2015)

    Google Scholar 

  14. Qiu, D., Srikant, R.: Modeling and performance analysis of BitTorrent-like peer-to-peer networks. In: SIGCOMM (2004)

    Google Scholar 

  15. Ramponi, A.: Mixture dynamics and regime switching diffusions with application to option pricing. Method. Comput. Appl. Probab. 13(2), 349–368 (2009). http://dx.doi.org/10.1007/s11009-009-9155-1

    Article  MathSciNet  MATH  Google Scholar 

  16. Tschaikowski, M., Tribastone, M.: Spatial Fluid Limits for Stochastic Mobile Networks. http://arxiv.org/abs/1307.4566

  17. Tschaikowski, M., Tribastone, M.: A partial-differential approximation for spatial stochastic process algebra. In: VALUETOOLS (2014)

    Google Scholar 

  18. Yin, G., Zhu, C.: Hybrid Switching Diffusions. Springer, New York (2010)

    Book  MATH  Google Scholar 

Download references

Acknowledgement

This work was partially supported by the EU project QUANTICOL, 600708.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Max Tschaikowski .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Bortolussi, L., Tschaikowski, M. (2016). Fluid Analysis of Spatio-Temporal Properties of Agents in a Population Model. In: Wittevrongel, S., Phung-Duc, T. (eds) Analytical and Stochastic Modelling Techniques and Applications. ASMTA 2016. Lecture Notes in Computer Science(), vol 9845. Springer, Cham. https://doi.org/10.1007/978-3-319-43904-4_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-43904-4_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-43903-7

  • Online ISBN: 978-3-319-43904-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics