Volume 52, Number 1, January–March 2018
|Page(s)||61 - 77|
|Published online||18 April 2018|
On an M/G/1 queue in random environment with Min(N, V) policy
School of Science, Nanjing University of Science and Technology,
210094, P.R. China
* Corresponding author: firstname.lastname@example.org
Accepted: 14 January 2018
In this paper, we analyze an M∕G∕1 queue operating in multi-phase random environment with Min(N, V) vacation policy. In operative phase i, i = 1, 2, …, n, customers are served according to the discipline of First Come First Served (FCFS). When the system becomes empty, the server takes a vacation under the Min(N, V) policy, causing the system to move to vacation phase 0. At the end of a vacation, if the server finds no customer waiting, another vacation begins. Otherwise, the system jumps from the phase 0 to some operative phase i with probability qi, i = 1, 2, …, n. And whenever the number of the waiting customers in the system reaches N, the server interrupts its vacation immediately and the system jumps from the phase 0 to some operative phase i with probability qi, i = 1, 2, …, n, too. Using the method of supplementary variable, we derive the distribution for the stationary system size at arbitrary epoch. We also obtain mean system size, the results of the cycle analysis and the sojourn time distribution. In addition, some special cases and numerical examples are presented.
Mathematics Subject Classification: 60K25 / 68M20
Key words: M∕G∕1 queue / vacation / sojourn time / Min(N, V) policy / random environment / queueing theory
© EDP Sciences, ROADEF, SMAI 2018
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.