A mean-value analysis of slotted-ring network models

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.

[1]  William H. Sanders,et al.  Performability Modeling with UltraSAN , 1991, IEEE Softw..

[2]  Matteo Sereno,et al.  On the Product Form Solution for Stochastic Petri Nets , 1992, Application and Theory of Petri Nets.

[3]  Andy Hopper,et al.  The Cambridge Fast Ring Networking System , 1988, IEEE Trans. Computers.

[4]  Stephen S. Lavenberg,et al.  Mean-Value Analysis of Closed Multichain Queuing Networks , 1980, JACM.

[5]  Nico M. van Dijk Queueing networks and product forms - a systems approach , 1993, Wiley-Interscience series in systems and optimization.

[6]  Kishor S. Trivedi,et al.  SPNP: stochastic Petri net package , 1989, Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89.

[7]  Peter G. Taylor,et al.  Embedded Processes in Stochastic Petri Nets , 1991, IEEE Trans. Software Eng..

[8]  Jean-Yves Le Boudec,et al.  The Asynchronous Transfer Mode: A Tutorial , 1992, Comput. Networks ISDN Syst..

[9]  Marco Ajmone Marsan,et al.  GSPN Models of Markovian Multiserver Multiqueue Systems , 1990, Perform. Evaluation.

[10]  Boudewijn R. Haverkort Approximate performability analysis using generalized stochastic Petri nets , 1991, Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91.

[11]  D.L. Tennenhouse,et al.  ATM everywhere? , 1993, IEEE Network.

[12]  F. Neri,et al.  On the construction of abstract GSPNs: an exercise in modeling , 1991, Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91.

[13]  C. E. M. Pearce,et al.  A general formulation for mean-value analysis in product-form batch-movement queueing networks , 1994, Queueing Syst. Theory Appl..

[14]  Dirk Frosch Product Form Solutions for Closed Synchronized Systems of Stochastic Sequential Processes , 1992, Universität Trier, Mathematik/Informatik, Forschungsbericht.

[15]  R. M. Falconer,et al.  Orwell: a protocol for an integrated services local network , 1985 .

[16]  J. L. Adams,et al.  Orwell , 1994, Comput. Networks ISDN Syst..

[17]  H. L. Pasch,et al.  A performance analysis of a high-speed slotted-ring access mechanism with dynamically adaptive slot sizes , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[18]  Kishor S. Trivedi,et al.  A decomposition approach for stochastic Petri net models , 1991, Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91.

[19]  Raif O. Onvural,et al.  Asynchronous Transfer Mode Networks: Performance Issues, Second Edition , 1993 .

[20]  William H. Sanders,et al.  Reduced base model construction methods for stochastic activity networks , 1989, Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89.

[21]  Peter G. Taylor,et al.  Reduced load approximations for loss networks , 1993, Telecommun. Syst..

[22]  Peter G. Taylor,et al.  A net level performance analysis of stochastic Petri nets , 1989, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.

[23]  Ignas G. Niemegeers,et al.  A Performance Modeling and Evaluation of the Cambridge Fast Ring , 1992, IEEE Trans. Computers.

[24]  William Henderson,et al.  Aggregation and Disaggregation Through Insensitivity in Stochastic Petri Nets , 1993, Perform. Evaluation.

[25]  E. Biagioni,et al.  Designing a practical ATM LAN , 1993, IEEE Network.

[26]  Reza Rooholamini,et al.  Finding the right ATM switch for the market , 1994, Computer.