Discrete-time Geo/G/1/∞ LIFO queue with resampling policy

Consideration is given to the problem of estimation of the true stationary mean response time in the discrete-time single-server queue of infinite capacity, with Bernoulli input, round-robin scheduling, and inaccurate information about the service time distribution which is considered to be general arithmetic. It is shown that the upper bound for the true value may be provided by the mean response time in the discrete-time single-server queue with LIFO (last in, first out) service discipline and resampling policy. The latter implies that a customer arriving to the nonidle system assigns new remaining service time for the customer in the server. For the case when the true service time distribution is geometric and the error in the service times is of multiplicative type, conditions are provided which, when satisfied, guarantee that the proposed method yields the upper bound across all possible values of the system's load. © 2019 Federal Research Center "Computer Science and Control" of Russian Academy of Sciences. All rights reserved.

Publisher
Федеральный исследовательский центр "Информатика и управление" РАН
Number of issue
4
Language
Russian
Pages
60-67
Status
Published
Volume
13
Year
2019
Organizations
  • 1 Financial University under the Government of the Russian Federation, 49 Leningradsky Prosp., Moscow, 125993, Russian Federation
  • 2 Institute of Informatics Problems, Federal Research Center 'Computer Science and Control', Russian Academy of Sciences, 44-2 Vavilov Str., Moscow, 119333, Russian Federation
  • 3 Peoples' Friendship University of Russia, RUDN University, 6 Miklukho-Maklaya Str., Moscow, 117198, Russian Federation
Keywords
Discrete time; Inaccurate service time; Inverse service order; Resampling policy; Round robin scheduling
Date of creation
02.11.2020
Date of change
02.11.2020
Short link
https://repository.rudn.ru/en/records/article/record/65810/