Skip to main content
SpringerLink
Log in

Performance evaluation of polling-based communication systems using SPNs

  • Performance Analysis with Stochastic Petri Nets
  • Chapter
  • First Online:
Application of Petri Nets to Communication Networks

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1605))

Abstract

In this paper we present stochastic Petri nets (SPNs) that can be used for the evaluation of polling mechanisms. Polling mechanisms (or systems) appear in many forms in computer-communication systems: the well-known token-ring and token-bus network communication systems: the well-known token-ring and token-bus network access schemes such as present in IEEE P802.4/5 and in FDDI, and the scheduling mechanisms in switching fabrics, e.g., for ATM systems, operate along the lines of polling systems. Polling systems have been studied for many years now, and many analytical techniques have been developed to study them. It seems, however, that a number of system aspects can not be covered adequately by such analytical approaches. Most notably are time-dependent polling variants where the amount of service a station receives per visit is time-limited, load-dependent polling strategies where the ordering of station visits is dependent on the loading of the stations, as well as non-Poisson arrival processes. Therefore, we present SPN-based models that allow us to cope with these system aspects. The two major problems that appear when taking the SPN approach are the size of the underlying CTMC and the use of non-exponential timing. The latter problem is not really addressed in this paper; rather it is circumvented by employing the well-known method of stages, thus even worsening the state-space size problem. The first problem is coped with, by presenting two decomposition approaches and by presenting a subclass of SPNs that allows for an efficient matrix-geometric solution, thus avoiding the explicit generation of the overall state space.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Ajmone Marsan, G. Conte, G. Balbo, “A Class of Generalized Stochastic Petri Nets for the Performance Evaluation of Multiprocessor Systems”, ACM Transactions on Computer Systems 2(2), pp. 93–122, 1984.

    Article  Google Scholar 

  2. M. Ajmone Marsan, S. Donatelli, F. Neri, “GSPN Models of Markovian Multiserver Multiqueue Systems”, Performance Evaluation 11, pp. 227–240, 1990.

    Article  Google Scholar 

  3. M. Ajmone Marsan, S. Donatelli, F. Neri, U. Rubino, “On the Construction of Abstract GSPNs: An Exercise in Modelling”, Proceedings PNPM91, IEEE Computer Society Press, pp. 2–17, 1991.

    Google Scholar 

  4. M. Ajmone Marsan, S. Donatelli, F. Neri, U. Rubino, “GSPN Models of Random, Cyclic, and Optimal 1-Limited Multisever Multiqueue Systems”, Proceedings ACM Sigcomm, IEEE Computer Society Press, pp. 69–80, 1991.

    Google Scholar 

  5. W. Bux, “Token-Ring Local-Area Networks and Their Performance”, Proceedings of the IEEE 77(2) pp. 238–256, 1989.

    Article  Google Scholar 

  6. H. Choi, K.S. Trivedi, “Approximate Performance Models of Polling Systems using Stochastic Petri Nets”. Proceedings IEEE INFOCOM'92, pp. 2306–2314, 1992.

    Google Scholar 

  7. G. Ciardo, J. Muppala, K.S. Trivedi, “SPNP: Stochastic Petri Net Package”, Proceedings PNPM89, IEEE Computer Society Press, pp. 142–151, 1989.

    Google Scholar 

  8. G. Ciardo, J. K. Muppala, and K. S. Trivedi, “On the Solution of GSPN Reward Models”, Performance Evaluation 12(4), pp. 237–254, 1991.

    Article  MATH  Google Scholar 

  9. J.A. Couvillion, R. Freire, R. Johnson, W.D. Obal II, A. Qureshi, M. Rai, W.H. Sanders, J.E. Tvedt, “Performability Modelling with UltraSAN”, IEEE Software, pp. 69–80, September 1991.

    Google Scholar 

  10. A. Coyle, B. R. Haverkort, W. Henderson, C. Pearce, “A Mean-Value Analysis of Stochastic Petri Net Models of Slotted Rings”, Telecommunication Systems 6(2), pp. 203–227, 1996.

    Article  Google Scholar 

  11. G. Florin, S. Natkin, “One Place Unbouned Stochastic Petri Nets: Ergodicity Criteria and Steady-State Solution”, Journal of Systems and Software 1(2), pp. 103–115, 1986.

    Article  Google Scholar 

  12. G. Florin, S. Natkin, “A Necessary and Sufficient Saturation Condition for Open Synchronized Queueing Networks”, Proc. of the 2nd Int'l Workshop on Petri Nets and Performance Models, pp. 4–13, 1987.

    Google Scholar 

  13. R. German, C. Kelling, A. Zimmermann, G. Hommel, “TimeNET: A Toolkit for Evaluating Non-Markovian Stochastic Petri Nets”, Performance Evaluation 24, pp. 69–87, 1995.

    Article  MATH  Google Scholar 

  14. W.P. Groenendijk, Conservation Laws in Polling Systems, Ph.D. thesis, University of Utrecht, Utrecht, the Netherlands, 1990.

    Google Scholar 

  15. B.R. Haverkort, A.P.A. van Moorsel, D.-J. Speelman, “Xmgm: A Performance Analysis Tool Based on Matrix Geometric Methods”, in: Proceedings of the Second International Workshop on Modelling, Analysis and Simulation of Computer and Telecommunication Systems, IEEE Computer Society Press, pp. 152–157, 1994.

    Google Scholar 

  16. B.R. Haverkort, “Polling Models: Theory and Applications”, ÖCG-Schriftenreihe 73, Oldenbourg Verlag, pp. 237–266, 1994.

    Google Scholar 

  17. B.R. Haverkort, H. Idzenga, B.G. Kim, “Performance Evaluation of ATM Switch Architectures using Stochastic Petri Nets”, in: Performance Modelling and Evaluation of ATM Networks, Editor: D. Kouvatsos, IFIP series, Chapman and Hall, London, pp. 553–572, 1995.

    Google Scholar 

  18. B.R. Haverkort, “Efficient Solution of a Class of Infinite Stochastic Petri Nets: Theory and Applications”, Proceedings of the International Computer Performance and Dependability Symposium, IEEE Computer Sciety Press, pp. 72–81, 1995.

    Google Scholar 

  19. B.R. Haverkort, “SPN2MGM: Tool Support for Matrix Geometric Stochastic Petri Nets”, Proceedings of the 1996 International Computer Performance and Dependability Symposium, IEEE Computer Society Press, pp. 219–228, 1996.

    Google Scholar 

  20. B.R. Haverkort, A. Ost, “Steady-State Analysis of Infinite Stochastic Petri Nets: A Comparison between the Spectral Expansion and the Matrix-Geometric Method”, Proceedings of the Seventh International Workshop on Petri Nets and Performance Models, IEEE Computer Society Press, 1997.

    Google Scholar 

  21. H. Heffes, D.M. Lucantoni, “A Markov Modulated Characterization of Packetized Voice and Data Traffic and Related Statistical Multiplexer Performance”, IEEE Journal on Selected Areas in Communications 4(6), pp. 856–868, 1986.

    Article  Google Scholar 

  22. ITU-T Recommendation I.371, “Integrated Services Digital Network (ISDN), Overall Network Aspects and Functions—Traffic Control and Congestion Control in B-ISDN”, International Telecommunication Union, March 1993.

    Google Scholar 

  23. O.C. Ibe, K.S. Trivedi, “Stochastic Petri Net Models of Polling Systems”, IEEE Journal of Selected Areas in Communications 8(9), pp. 1649–1657 1990.

    Article  Google Scholar 

  24. O.C. Ibe, H. Choi, K.S. Trivedi, “Performance Evaluation of Client-Server Systems”, IEEE Transactions on Parallel and Distributed Systems 4(11), pp. 1217–1229, 1993.

    Article  Google Scholar 

  25. R. Jain, “Performance Analysis of FDDI Token Ring Networks: Effects of Parameters and Guidelines for Setting TTRT”, IEEE Magazine of Lightwave Telecommunication Systems, pp. 16–22, May 1992.

    Google Scholar 

  26. M.J. Johnson, “Proof that the Timing Requirements of the FDDI Token Ring Protocol are Satisfied”, IEEE Transactions on Communications 35(6), pp. 620–625, 1987.

    Article  Google Scholar 

  27. C. Kelling, R. German, A. Zimmermann, G. Hommel, “TimeNET: ein Werkzeug zur modellierung mit zeiterweiterten Petri Netzen”, Informationstechnik unf Technische Informatik 37(3), pp. 21–27, 1995 (in german).

    Google Scholar 

  28. G. Latouche, V. Ramaswami, “A Logarithmic Reduction Algorithm for Quasi Birth and Death Processes”, Journal of Applied Probability 30, pp. 650–674, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  29. D.-S. Lee, B. Sengupta, “Queueing Analysis of a Threshold Based Priority Scheme for ATM Networks”, IEEE/ACM Transactions on Networking 1(6), pp. 709–717, 1993.

    Article  Google Scholar 

  30. H. Levy, M. Sidi, “Polling Systems: Applications Modeling and Optimization”, IEEE Transactions on Communications 38(10), pp. 1750–1760, 1990.

    Article  Google Scholar 

  31. C. Lindemann, “An Improved Numerical Algorithm for Calculating Steady-State Solutions of Deterministic and Stochastic Petri Net Models”, Proceedings PNPM91, IEEE Computer Society Press, pp. 176–185, 1991.

    Google Scholar 

  32. C. Lindemann, R. German, “DSPNexpress: A software Package for Efficiently Solving Deterministic and Stochastic Petri Nets”, in: Computer Performance Evaluation 1992: Modelling Techniques and Tools 1992, Editors: R. Pooley, J. Hillston, Edinburgh University Press Ltd., 1993.

    Google Scholar 

  33. A. Lindeyer, Phase-Type Approximations in Fixed-Point SPN Polling Models, technical report, University of Twente, 1994 (in dutch).

    Google Scholar 

  34. M.F. Neuts, Matrix Geometric Solutions in Stochastic Models—An Algorithmic Approach, The Johns Hopkins University Press, 1981.

    Google Scholar 

  35. H. Saito, Teletraffic Technologies in ATM Networks, Artech House, Boston, 1994.

    Google Scholar 

  36. K.C. Sevcik, M.J. Johnson, “Cycle Time Properties of the FDDI Token Ring Protocol”, IEEE Transactions on Software Engineering 13(3), pp. 376–385, 1987.

    Google Scholar 

  37. E. de Souza e Silva, H.R. Gail, R.R. Muntz, “Polling Systems with Server Timeouts and Their Application to Token Passing Networks”, IEEE/ACM Transactions on Networking 3(5), pp. 560–575, 1995.

    Article  Google Scholar 

  38. H. Takagi, Analysis of Polling Models, MIT Press, 1986.

    Google Scholar 

  39. H. Takagi, “Queueing Analysis of Polling Models”, ACM Computing Surveys 20(1), pp. 5–28, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  40. H. Takagi, “Queueing Analysis of Polling Models: An Update”, in: Stochastic Analysis of Computer and Communication Systems, Eds.: H. Takagi, North-Holland, 267–318, 1990.

    Google Scholar 

  41. A.S. Tanenbaum, Computer Networks, Second Edition, Prentice-Hall, 1989.

    Google Scholar 

  42. M. Tangemann, “Mean waiting Time Approximations for Symmetric and Asymmetric Polling Systems with Time-Limited Service”, in: Messung, Modellierung und Bewertung von Rechen-und Kommunikationssystemen, Eds.: B. Walke, O. Spaniol, Springer-Verlag, pp. 143–158, 1993.

    Google Scholar 

  43. J.A. Weststrate, Analysis and Optimization of Polling Models, Catholic University of Brabant, Tilburg, the Netherlands, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory for Distributed Systems, RWTH-Aachen, D-52056, Aachen, Germany

    Boudewijn R. Haverkort

Authors
  1. Boudewijn R. Haverkort
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jonathan Billington Michel Diaz Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Haverkort, B.R. (1999). Performance evaluation of polling-based communication systems using SPNs. In: Billington, J., Diaz, M., Rozenberg, G. (eds) Application of Petri Nets to Communication Networks. Lecture Notes in Computer Science, vol 1605. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0097777

Download citation

  • DOI: https://doi.org/10.1007/BFb0097777

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65870-2

  • Online ISBN: 978-3-540-48911-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation