A LCFS finite buffer model with batch input and non-exponential services
A single server can hold at most N jobs in service or waiting. Randomly sized batches of jobs arrive at Poisson times. A batch of size k is accepted at its time of arrival if k places are free, lost otherwise. An accepted batch starts getting served at once, interrupting the service (if any) going on at the time of acceptance. For each job a service time is drawn from a general distribution. When all jobs of a batch are completely served, the service of the batch last interrupted (if any), is resumed. A job departs once its service is completed. Using a phase-type approximation of the service time distribution, the author computes the steady-state distribution of the queue length, which turns out to depend only on the mean and not on any other parameters of the service time distribution.
- An LCFS finite buffer model with finite source batch input
- Benes's formula for M/G/1–FIFO ‘explained' by preemptive-resume LIFO
- Blocking and Delays in M(x)/M/c Bulk Arrival Queueing Systems
- Continuity of Generalized Semi-Markov Processes
- Exponential expansion for the tail of the waiting-time probability in the single-server queue with batch arrivals
- scientific article; zbMATH DE number 3938204 (Why is no real title available?)
- scientific article; zbMATH DE number 3967618 (Why is no real title available?)
- scientific article; zbMATH DE number 3656855 (Why is no real title available?)
- scientific article; zbMATH DE number 3740516 (Why is no real title available?)
- scientific article; zbMATH DE number 3755546 (Why is no real title available?)
- scientific article; zbMATH DE number 3797466 (Why is no real title available?)
- scientific article; zbMATH DE number 3892339 (Why is no real title available?)
- INVARIANCE RELATIONS OF GI/G/1 QUEUEING SYSTEMS WITH PREEMPTIVE-RESUME LAST-COME-FIRST-SERVED QUEUE DISCIPLINE
- Networks of queues and the method of stages
- On a single-server queue with group arrivals
- ON G/G/1 QUEUES WITH LIFO-P SERVICE DISCIPLINE
- Practical approximations for finite-buffer queueing models with batch arrivals
- Technical Note—Delays in Single-Server Queues with Batch Input
- The insensitivity of stationary probabilities in networks of queues
- The multiple phase service network with generalized processor sharing
- Waiting-Time Percentiles in the Multi-server Mx/G/c Queue with Batch Arrivals
- Weak convergence for generalized semi-Markov processes
This page was built for publication: A LCFS finite buffer model with batch input and non-exponential services
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582714)