Non-preemptive priorities and vacations in a multiclass retrial queueing system
From MaRDI portal
Publication:4895650
DOI10.1080/15326349608807394zbMATH Open0858.60086OpenAlexW2038027951MaRDI QIDQ4895650FDOQ4895650
Authors: Evangelos Moutzoukis, Christos Langaris
Publication date: 18 March 1997
Published in: Communications in Statistics. Stochastic Models (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15326349608807394
Recommendations
- PREEMPTIVE RESUME PRIORITIES IN AN N-CLASS STRUCTURED QUEUE WITH SERVER VACATIONS
- scientific article; zbMATH DE number 1180795
- An algorithmic approach for multiserver retrial queues with two customers classes and non-preemptive priority
- Performance evaluation and analysis of a discrete queue system with multiple working vacations and non-preemptive priority
- Analysis of a retrial queueing system with priority service and modified multiple vacations
- A retrial queue with structured batch arrivals, priorities and server vacations
- The M/M/$c$ queueing model with preemptive priority and multiple synchronous working vacation
- A finite capacity multi-queueing system with priorities and with repeated server vacations
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cited In (21)
- Sufficient stability conditions for multi-class constant retrial rate systems
- A retrial queue to model a two-relay cooperative wireless system with simultaneous packet reception
- A queueing model with two classes of retrial customers and paired services
- A retrial system with two input streams and two orbit queues
- AN M/G/1 RETRIAL QUEUE WITH UNRELIABLE SERVER FOR STREAMING MULTIMEDIA APPLICATIONS
- A queueing system with \(n\)-phases of service and (\(n-1\))-types of retrial customers
- Title not available (Why is that?)
- Analysis of a single-server retrial queue with quasi-random input and nonpreemptive priority
- Gated polling models with customers in orbit.
- A two-class queueing system with constant retrial policy and general class dependent service times
- A queueing system with linear repeated attempts, Bernoulli schedule and feedback
- Discrete-time \(\mathrm{GI}/\mathrm{G}/1\) retrial queues with time-controlled vacation policies
- Stationary analysis of a retrial queue with preemptive repeated attempts
- An \(M/M/1\) retrial queue with unreliable server
- Performance analysis of polling systems with retrials and glue periods
- A two-class retrial system with coupled orbit queues
- Single server retrial queues with priority calls.
- The unreliable \(M/M/1\) retrial queue in a random environment
- An algorithmic approach for multiserver retrial queues with two customers classes and non-preemptive priority
- Title not available (Why is that?)
- Colored stochastic Petri nets for modelling and analysis of multiclass retrial systems
This page was built for publication: Non-preemptive priorities and vacations in a multiclass retrial queueing system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4895650)