ANALYSIS OF THE M/G/1 QUEUE UNDER A COMBINED PREEMPTIVE NONPREEMPTIVE PRIORITY DISCIPLINE

Cited 39 time in webofscience Cited 47 time in scopus
  • Hit : 490
  • Download : 0
In this paper, we propose a combined preemptive/nonpreemptive priority discipline. When a high-priority job arrives at the system while a low-priority job is being in service, the high-priority job will be served immediately and the low-priority job will go back to the head of the queue of its class, if a discretion rule for preemption is satisfied. Otherwise, the high-priority job waits in queue until the completion of the low-priority job service. As the discretion rule for preemption, we consider three schemes, each based on the parameter of the low-priority job; the elapsed service time, the ratio of elapsed to total service time, and the remaining service time. Using the busy-period analysis technique, we analyze an M/G/1 queueing system with multiple priority classes of jobs. Considered preemptive rules are the preemptive-resume and preemptive-repeat-identical policies. As results, we present the Laplace transforms associated with waiting time and response time, and the z-transform for the number of jobs in the system as well as their expectations. We also show some numerical examples, and consider practical applications of the model.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
1993-01
Language
English
Article Type
Article
Keywords

PACKET SWITCH; PERFORMANCE

Citation

IEEE TRANSACTIONS ON COMMUNICATIONS, v.41, no.1, pp.132 - 141

ISSN
0090-6778
DOI
10.1109/26.212373
URI
http://hdl.handle.net/10203/61669
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 39 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0