Analysis of a single server retrial queue with server vacation and two waiting buffers based on ATM networks
Summary: This paper presents a discrete-time Geo/G/1 retrial queue with two waiting buffers to model an ATM network, in which the server begins a single vacation in cases where the system is empty at the instant of a service completion. New arriving customer who finds the server being on vacation can decide to either enter the retrial buffer with some probability \(p\) or leave the system with complementary probability \(1 - p\). But the new arriving customer can begin its service immediately if he finds the server idle and join the original buffer if he finds the server busy. We first carry out an extensive analysis of the model by using the supplementary variable method and the generating function approach, and give some performance measures, such as server's state probabilities and mean queue lengths in the original buffer, retrial buffer, and in the system. Secondly, we give the generating function of the sojourn time of a customer in the system and prove that Little's law still holds in our model. Sensitivity analysis and cost optimization are finally given for illustrative purposes.
- A single-server retrial queue with server vacations and a finite number of input sources
- Discrete-time Geo/G/1 retrial queues with general retrial time and Bernoulli vacation
- Analysis of a single-server retrial queue with FCFS orbit and Bernoulli vacation
- A discrete-time Geo/G/1 retrial queue with \(J\)-vacation policy and general retrial times
- Queueing performance analysis of ATM network with retrial loss in a random environment
- \(Geo/G/1\) discrete time retrial queue with Bernoulli schedule
- A bibliographical guide to the analysis of retrial queues through matrix analytic techniques
- A classified bibliography of research on retrial queues: Progress in 1990--1999
- A discrete-time Geo/G/1 retrial queue with \(J\)-vacation policy and general retrial times
- A repairable retrial queue under Bernoulli schedule and general retrial policy
- A survey of retrial queueing systems
- A two-class queueing system with constant retrial policy and general class dependent service times
- Accessible bibliography on retrial queues: progress in 2000-2009
- An efficient computation algorithm for a multiserver feedback retrial queue with a large queueing capacity
- An unreliable Geo/G/1 queue with startup and closedown times under randomized finite vacations
- Discrete time geo\(/G/1\) queue with multiple adaptive vacations
- Discrete-time Geo/G/1 retrial queues with general retrial time and Bernoulli vacation
- On multiserver feedback retrial queue with finite buffer
- On the discrete-time \(\mathrm{Geo}/G/1\) queue with randomized vacations and at most \(J\) vacations
- OPTIMAL BERNOULLI ROUTING IN AN UNRELIABLE M/G/1 RETRIAL QUEUE
- Performance analysis of a discrete-time \(Geo/G/1\) queue with randomized vacations and at most \(J\) vacations
- Performance analysis of a single-server ATM queue with a priority scheduling.
- Retrial Queueing Systems
- Retrial Queues
- The \(M / M /1\) retrial queue with retrials due to server failures
- An unreliable discrete-time retrial queue with probabilistic preemptive priority, balking customers and replacements of repair times
- Queueing performance analysis of ATM network with retrial loss in a random environment
- Analysis of two-way communication in M₁^X, M₂/G₁,G₂/1 retrial queue under the constant retrial policy
- Cost scrutiny of discrete-time priority queue with cluster arrival and Bernoulli feedback
This page was built for publication: Analysis of a single server retrial queue with server vacation and two waiting buffers based on ATM networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2298420)
