Stochastic Petri net analysis of finite-population vacation queueing systems
DOI10.1007/BF02412245zbMath0725.60103OpenAlexW2063265159MaRDI QIDQ2277684
Kishor S. Trivedi, Oliver C. Ibe
Publication date: 1991
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02412245
performance analysisqueueing systemsstochastic Petri netfinite-capacity systemvacation of random duration
Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (6)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Queueing systems with vacations - a survey
- Technical Note—A Note on the M/G/1 Queue with Server Vacations
- On the M/G/1 Queue with Rest Periods and Certain Service-Independent Queueing Disciplines
- A note on stochastic decomposition in a GI/G/1 queue with vacations or set-up times
- Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations
- A Queue with Starter and a Queue with Vacations: Delay Analysis by Decomposition
- D/G/1 Queues with Vacations
- M/G/1/N Queue with vacation time and limited service discipline
- A Proof for the Queuing Formula: L = λW
- The M/G/1 Finite Capacity Queue with Delays
- Utilization of Idle Time in an M/G/1 Queueing System
- The T-Policy for the M/G/1 Queue
- M/G/1/N Queue with Vacation Time and Exhaustive Service Discipline
- Optimal Operating Policies for M/G/1 Queuing Systems
- A Priority Queueing System with Server Interference
This page was built for publication: Stochastic Petri net analysis of finite-population vacation queueing systems