ANALYSIS OF MULTICLASS FEEDBACK QUEUES AND ITS APPLICATION TO A PACKET SCHEDULING PROBLEM

作者：Hirayama Tetsuji^*

来源：Journal of Industrial and Management Optimization, 2010, 6(3): 541-568.

DOI：10.3934/jimo.2010.6.541

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 other normal traffic. Packets belonging to 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.

• 出版日期2010-8