An arrival time approach to \(M/G/1\)-type queues with generalized vacations

DOI10.1023/A:1010876229827zbMath1017.90015OpenAlexW1489638811MaRDI QIDQ5938462

No author found.

Publication date: 19 July 2001

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1010876229827

zbMATH Keywords

priority queue\(M/G/1\)-typearrival time distributionMAP/G/1queue lengthvacation

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items (8)

A UNIFIED QUEUE LENGTH FORMULA FOR BMAP/G/1 QUEUE WITH GENERALIZED VACATIONS ⋮ Transient study of a queueing system with one unreliable server, batch arrivals, two types of verification, loss and vacation ⋮ Discrete-time bulk queueing system with variable service capacity depending on previous service time ⋮ Analysis of the queue-length distribution for the discrete-time batch-service \(Geo/G^{a,Y}/1/k\) queue ⋮ Batch arrival vacation queue with second optional service and random system breakdowns ⋮ Batch arrival queues with vacations and server setup ⋮ Analysis of \(\mathrm{MAP}/\mathrm{PH}_1,\mathrm{PH}_2/1\) queue with vacations and optional secondary services ⋮ On the relationships among queue lengths at arrival, departure, and random epochs in the discrete-time queue with D-BMAP arrivals

This page was built for publication: An arrival time approach to \(M/G/1\)-type queues with generalized vacations