Delay analysis of discrete-time priority queue with structured inputs
From MaRDI portal
This paper is devoted to the investigation of a discrete-time priority queue with multiple customers. Applying a delay-cycle analysis, the authors explicitly derive the probability generating function of a waiting time for an individual class in a geometric batch input queue under preemptive-resume and head-of-the-line priority rules. The conservation law and waiting time characterization for a general class of discrete-time queues are also presented. The results of this paper are generalizations of previous problems.
Recommendations
Cites work
- A Discrete Queueing Problem with Variable Service Times
- Analysis of a Task Oriented Multipriority Queueing System
- scientific article; zbMATH DE number 4041013 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- scientific article; zbMATH DE number 3369604 (Why is no real title available?)
- Letter to the Editor—An Alternative Proof of a Conservation Law for the Queue G/G/1
- On the relationship between work load and waiting time in single server queues with batch inputs
- Priority Queues with Feedback
- Queuing Systems with Enforced Idle Time
- Structured priority queueing systems with applications to packet-radio networks
- Technical Note—Delays in Single-Server Queues with Batch Input
- The Analysis of a Statistical Multiplexer with Nonindependent Arrivals and Errors
- Two competing discrete-time queues with priority
- Waiting time in a preemptive resume system with compound-Poisson input
- Waiting times in discrete-time cyclic-service systems
- Work-conserving priorities
Cited in
(27)- Calculation of output characteristics of a priority queue through a busy period analysis
- Discrete-time queues with discretionary priorities
- Discrete priority queueing systems
- A discrete-time priority queue with two-class customers and bulk services
- Rate conservation principle for discrete-time queues
- Rate conservation laws: A survey
- Discrete-time \(Geo_ 1\), \(Geo_ 2/G/1\) retrial queueing systems with two types of calls
- Performance analysis of a single-server ATM queue with a priority scheduling.
- Single server retrial queues with priority calls.
- Time-dependent analysis of a queue with batch arrivals and n levels of nonpreemptive priority
- Discrete time queues with delayed information
- Delay analysis of a two-class priority queue with external arrivals and correlated arrivals from another node
- Appointments in care pathways: the \(\mathrm{Geo}^x/\mathrm{D}/1\) queue with slot reservations
- Correction to our paper: Delay analysis of discrete-time priority queue with structure inputs
- Analysis of a discrete-time preemptive resume priority buffer
- Analysis of a discrete-time queue with time-limited overtake priority
- Delay analysis of a discrete-timeGI−GI− 1 queue with reservation-based priority scheduling
- Delay analysis of a discrete-time non-preemptive priority queue with priority jumps
- scientific article; zbMATH DE number 5926330 (Why is no real title available?)
- Composite priority single-server queue with structured batch inputs
- Delay analysis of a discrete-time multiclass slot-bound priority system
- Analysis of a discrete-time queue with gated priority
- An Invariance in the Priority Queue with Generalized Server Vacations and Structured Batch Arrivals
- Relationship between queue length and waiting time in a stationary discrete-time queue
- Algorithms for Queueing Systems with Reneging and Priorities Modeled as Quasi-Birth-Death Processes
- Open queueing networks in discrete time -- some limit theorems
- Delay analysis of an \(M/G/1/K\) priority queueing system with push-out scheme
This page was built for publication: Delay analysis of discrete-time priority queue with structured inputs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q803673)
