Skip to main content
SpringerLink
Log in

A mean-value analysis of slotted-ring network models

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

In this paper, we analyse Stochastic Petri Net (SPN) models of slotted-ring networks. We show that a simple SPN model of a slotted-ring network, which exhibits a product-form solution, yields similar results to a more detailed SPN model that has to be analysed by numerical means. Furthermore, we demonstrate a Mean-Value Analysis (MVA) approach to calculate efficiently the results for the simple model. This MVA approach allows for the movement of groups of tokens (customers) rather than just individual customers, as traditional MVA schemes for queueing network models do. Also, the MVA allows for non-disjoint place invariants, whereas previous MVA schemes addressed disjoint place invariants only. From the MVAs, it can be concluded that slotted-rings have very attractive performance characteristics, even under overload conditions (there is no “thrashing”). Also, we found that the choice of the slot size is a key factor in calibrating slotted-ring systems for optimal performance. Having a fast and reasonably accurate means available to evaluate the performance of slotted-ring systems, such as our proposed MVA, eases this calibration task. The proposed MVA for the product-form SPN models should therefore be regarded as a “quick engineering” tool.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. Ajmone Marsan, S. Donatelli and F. Neri, GSPN models of Markovian multi-server multi-queue systems, Perform. Eval. 11(1990)227–240.

    Article  Google Scholar 

  2. M. Ajmone Marsan, S. Donatelli, F. Neri and U. Rubino, On the construction of abstract GSPNs: An exercise in modelling,Proc. 4th Int. Workshop on Petri Nets and Performance Models (IEEE Computer Society Press, 1991) pp. 2–17.

  3. E. Biagioni, E. Cooper and R. Sansom, Designing a practical ATM LAN, IEEE Network 7(2)(1993)32–39

    Article  Google Scholar 

  4. J.-Y. Le Boudec, The asynchronous transfer mode: A tutorial, Comp. Networks and ISDN Syst. 24(1992)279–309.

    Article  Google Scholar 

  5. G. Ciardo, J. Muppala and K.S. Trivedi, SPNP: Stochastic Petri net package,Proc. 3rd Int. Workshop on Petri Nets and Performance Models (IEEE Computer Society Press, 1989) pp. 142–151.

  6. G. Ciardo and K.S. Trivedi, A decomposition approach for stochastic Petri net models,Proc. 4th Int. Workshop on Petri Nets and Performance Models (IEEE Computer Society Press, 1991) pp. 74–83.

  7. J.A. Couvillion, R. Freire, R. Johnson, W.D. Obal, II, A. Qureshi, M. Rai, W.H. Sanders and J.E. Tvedt, Performability modelling with UltraSAN, IEEE Software (Sept. 1991) 69–80.

  8. A.J. Coyle, W. Henderson and P.G. Taylor, Reduced load approximations for loss networks, Telecom. Syst. 2(1993)21–50.

    Article  Google Scholar 

  9. A.J. Coyle, W. Henderson, C.E.M. Pearce and P.G. Taylor, A general formulation for mean-value analysis in product-form batch-movement queueing networks, Queueing Systems 16(1993)363–372.

    Article  Google Scholar 

  10. N.M. van Dijk,Queueing Networks and Product Forms: A Systems Approach (Wiley, 1993).

  11. S. Donatelli and M. Sereno, On the product form solutions for stochastic Petri nets,Proc. 13th Int. Conf. on Applications and Theory of Petri Nets, Sheffield, UK (1992) pp. 154–172.

  12. R.M. Falconer and J.L. Adams, Orwell, a protocol for an integrated services load network, Brit. Telecom. Tech. J. 3(4)(1985)27–35.

    Google Scholar 

  13. D. Frosch and K. Natarajan, Product-form solutions for closed synchronized systems of stochastic sequential processes,Proc. 1992 Int. Computer Conf., Taichung, Taiwan (1992) pp. 392–402.

  14. B.R. Haverkort, Approximate performability analysis using generalized stochastic Petri nets,Proc. 4th Int. Workshop on Petri Nets and Performance Models (IEEE Computer Society Press, 1991) pp. 300–309.

  15. J.A.F. de Goei, A modelling survey and performance analysis of slotted-ring communication networks, M.Sc. Thesis, Department of Computer Science, University of Twente (1993).

  16. W. Henderson, D. Lucic and P.G. Taylor, A net-level performance analysis of stochastic Petri nets, J. Austral. Math. Soc., Ser. B31(1989)176–187.

    Google Scholar 

  17. W. Henderson and P.G. Taylor, Embedded processes in stochastic Petri nets, IEEE Trans. Software Eng. 17(1991)108–116.

    Article  Google Scholar 

  18. W. Henderson and D. Lucic, Aggregation and disaggregation through insensitivity in stochastic Petri nets, Perform. Eval. 17(1993)91–114.

    Article  Google Scholar 

  19. A. Hopper and R.M. Needham, The Cambridge fast ring networking system, IEEE Trans. Comp. 37(1988)1214–1223.

    Article  Google Scholar 

  20. I.M. Leslie, D.R. McAuley and D.L. Tennenhouse, ATM everywhere?, IEEE Network 7(2)(1993)40–46.

    Article  Google Scholar 

  21. R.F. Onvural,Asynchronous Transfer Mode Networks: Performance Issues (Artech House, 1993).

  22. H.-L. Pasch and I.G. Niemegeers, A performance analysis of a high-speed slotted-ring access mechanism with dynamically adaprive slot sizes,Proc. GLOBECOM '91 (IEEE Computer Society Press, 1991) pp. 1102–1109.

  23. H.-L. Pasch, Design and analysis of a load-adaptive high-speed network, Ph.D. Thesis, Department of Computer Science, University of Twente (1993).

  24. M. Reiser and S.S. Lavenberg, Mean-value analysis of closed multichain queueing networks, J. ACM 27(1980)313–322.

    Article  Google Scholar 

  25. R. Rooholamini, V. Cherkassky and M. Garver, Finding the right ATM switch for the market, IEEE Comp. 27(4)(1994)16–28.

    Google Scholar 

  26. W.H. Sanders and J.F. Meyer, Reduced base model construction methods for stochastic activity networks, IEEE J. Select. Areas Commun. SAC-9(1991)25–36.

    Article  Google Scholar 

  27. S. Temple, The design of the Cambridge ring, in:Ring Tech. Local Area Networks, eds. I.N. Dallas and E.B. Spratt (North-Holland, 1984) pp. 79–88.

  28. M. Zafirovic-Vukotic, Performand modelling and evaluation of high speed serial interconnection structures, Ph.D. Thesis, University of Twente (1988).

  29. M. Zafirovic-Vukotic and I.G. Niemegeers, A performance modeling and evaluation of the Cambridge fast ring, IEEE Trans. Comp. 41(1992)1110–1125.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, The University of Adelaide, 5005, Adelaide, South Australia

    Andrew J. Coyle, William Henderson & Charles E. M. Pearce

  2. Department of Computer Science, Distributed Systems, Rheinisch-Westfälische Technische Hochschule (RWTH-achen), D-52056, Aachen, Germany

    Boudewijn R. Haverkort

Authors
  1. Andrew J. Coyle
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Boudewijn R. Haverkort
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. William Henderson
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Charles E. M. Pearce
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Coyle, A.J., Haverkort, B.R., Henderson, W. et al. A mean-value analysis of slotted-ring network models. Telecommunication Systems 6, 203–227 (1996). https://doi.org/10.1007/BF02114294

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation