Analysis of a single server retrial queue with server vacation and two waiting buffers based on ATM networks (Q2298420): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2019/4193404 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2991266552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance analysis of a single-server ATM queue with a priority scheduling. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Retrial Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Retrial Queueing Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A classified bibliography of research on retrial queues: Progress in 1990--1999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accessible bibliography on retrial queues: progress in 2000-2009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bibliographical guide to the analysis of retrial queues through matrix analytic techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of retrial queueing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A repairable retrial queue under Bernoulli schedule and general retrial policy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-class queueing system with constant retrial policy and general class dependent service times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete time geo\(/G/1\) queue with multiple adaptive vacations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete-time \(Geo/G/1\) retrial queues with general retrial time and Bernoulli vacation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the discrete-time \(\mathrm{Geo}/G/1\) queue with randomized vacations and at most \(J\) vacations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete-time Geo/G/1 retrial queue with \(J\)-vacation policy and general retrial times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance analysis of a discrete-time \(Geo/G/1\) queue with randomized vacations and at most \(J\) vacations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An unreliable Geo/G/1 queue with startup and closedown times under randomized finite vacations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multiserver feedback retrial queue with finite buffer / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient computation algorithm for a multiserver feedback retrial queue with a large queueing capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(M / M /1\) retrial queue with retrials due to server failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: OPTIMAL BERNOULLI ROUTING IN AN UNRELIABLE <i>M</i>/<i>G</i>/1 RETRIAL QUEUE / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(Geo/G/1\) discrete time retrial queue with Bernoulli schedule / rank
 
Normal rank

Latest revision as of 21:11, 21 July 2024

scientific article
Language Label Description Also known as
English
Analysis of a single server retrial queue with server vacation and two waiting buffers based on ATM networks
scientific article

    Statements

    Analysis of a single server retrial queue with server vacation and two waiting buffers based on ATM networks (English)
    0 references
    0 references
    0 references
    0 references
    20 February 2020
    0 references
    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.
    0 references
    0 references
    0 references
    0 references