Detailed Analysis of the Response Time and Waiting Time in the M/M/m FCFS Preemptive-Resume Priority Queue

Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 383)

Abstract

We present a detail theoretical analysis of the response time and waiting time in the M/M/m FCFS preemptive-resume priority queueing system in the steady state by scrutinizing and extending the previous studies by Brosh (1969), Segal (1970), Buzen and Bondi (1983), Tatashev (1984), and Zeltyn et al. (2009). In particular, we analyze the durations of intermittent waiting times and service times during the response time of a tagged customer of each priority class that is preempted by the arrivals of higher-priority class customers. Numerical examples are shown in order to demonstrate the computation of theoretical formulas.

Keywords

Priority queue Multiserver Preemptive-resume Response time Waiting time First passage time 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Brosh, I.: Preemptive priority assignment in multichannel systems. Operations Research 17(3), 526–535 (1969)CrossRefMATHGoogle Scholar
  2. 2.
    Buzen, J.P., Bondi, A.B.: The response times of priority classes under preemptive resume in M/M/\( m \) queues. Operations Research 31(3), 456–465 (1983)CrossRefMATHGoogle Scholar
  3. 3.
    Fujiki, M.: Fundamental theory and application on communication traffic. 5 queuein theory (part 2). Transactions of the Institute of Electronics and Communication Engineers of Japan 55(9), 1194–1200 (1972). (in Japanese)Google Scholar
  4. 4.
    Segal, M.: A multiserver system with preemptive priorities. Operations Research 18(2), 316–323 (1970)CrossRefMATHGoogle Scholar
  5. 5.
    Tatashev, A.G.: Calculation of the distribution of the waiting time in a multiple-channel queueing system with fixed priorities. Engineering Cybernetics 22(1), 59–62 (1984). (Originally published in Tekhnicheskaya Kibernetika, No.6, pp. 163–166 (1983)MathSciNetGoogle Scholar
  6. 6.
    Zeltyn, S., Feldman, Z., Wasserkrug, S.: Waiting and sojourn times in a multi-server queue with mixed priorities. Queueing Systems 61(4), 305–328 (2009)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Professor EmeritusUniversity of TsukubaTsukuba Science CityJapan

Personalised recommendations