The M/G/1/K blocking formula and its generalizations to state-dependent vacation systems and priority systems
From MaRDI portal
Publication:688653
DOI10.1007/BF01153529zbMATH Open0781.60091MaRDI QIDQ688653FDOQ688653
Authors: L. D. Servi, Julian Keilson 
Publication date: 17 February 1994
Published in: Queueing Systems (Search for Journal in Brave)
Recommendations
- Blocking Probability for M/G/1 Vacation Systems with Occupancy Level Dependent Schedules
- scientific article; zbMATH DE number 4092527
- Individual blocking probabilities in the loss system \(G_ 1+\cdot \cdot \cdot +G_ N/M/1/0\)
- The Finite Capacity GI/M/1 Queue with Server Vacations
- Blocking probability, throughput and waiting time in finite capacity polling systems
blocking probabilitypriority systemsstate-dependent schedulessteady state occupancy probability distributionvacation systems
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cites Work
- Queueing systems with vacations - a survey
- Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations
- A distributional form of Little's law
- Queues Subject to Service Interruption
- Blocking Probability for M/G/1 Vacation Systems with Occupancy Level Dependent Schedules
- Title not available (Why is that?)
- Oscillating random walk models for GI/G/1 vacation systems with Bernoulli schedules
- Title not available (Why is that?)
- State Dependence in M/G/1 Server-Vacation Models
- The distributional form of Little's law and the Fuhrmann-Cooper decomposition
- Preemptive Resume Priority Queue
- Time-changing and truncating K-capacity queues from one K to another
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: The \(M/G/1/K\) blocking formula and its generalizations to state-dependent vacation systems and priority systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688653)
