Feedback queues with preemption-distance priorities
SIGMETRICS '89 Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A queueing network with a single cyclically roving server
Queueing Systems: Theory and Applications - Polling models
Sharing a Processor Among Many Job Classes
Journal of the ACM (JACM)
Journal of the ACM (JACM)
On the M/G/1 Bernoulli feedback queue with multi-class customers
Computers and Operations Research
IP Quality of Service
A survey on discriminatory processor sharing
Queueing Systems: Theory and Applications
ACM SIGMETRICS Performance Evaluation Review
The Foreground-Background queue: A survey
Performance Evaluation
Hi-index | 0.00 |
In this paper, we investigate mean sojourn times in multiclass queues with feedback and their application to packet scheduling in communication networks. We first analyze the feedback queues with J groups of customers and a single server. The server selects a group (station) in a priority order and admits its customers into the service facility according to one of the following rules: 1-limited, gated, or exhaustive. Since there are multiple classes of customers in each group, they are served in either the (local) priority order or the first-come-first-served order. We derive the mean sojourn times for all service stages of customers circulating the system. Then we consider their application to a packet scheduling problem in communication networks where a mission-critical traffic is given some preferential treatment over the other normal traffic. Packets belonging to the normal traffic are allocated the resource capacity in proportion to their assigned weights in a round-robin manner, which we call the "discriminatory round robin (DRR)." We construct some composite scheduling algorithms and compare their performance.