Chakraborty, Avijit and Roy, Rajarshi and Mukherji, Utpal (2003) Delay Differentiation by Optimal-Balancing-of-Queue-Lengths Scheduling. In: Conference on Convergent Technologies for the Asia-Pacific Region: IEEE TENCON 2003, 15-17 October, 2003, Bangalore, India, Vol.3 1219-1223.
Scheduling policies adopted for statistical multiplexing should provide delay differentiation between different traffic classes. where each class represents an aggregate traffic of individual applications having the same target queueing delay requirement. We propose scheduling to optimally balance queue lengths as an approach to delay differentiation. In particular. we assume a discrete-time, two-class, single-server queueing model with unit service time per packet. We find 3 scheduling policy that we show to be discounted cost optimal, for Bernoulli packet anivals using dynamic programming analysis and for i.i.d. batch arrivals using a step-wise cost-dominance analyticalapproach. We then use cumulative queue length state variables in the one-step cost function of the optimization formulation and obtain the next-stage optimal policy. Simulations show that this policy achieves long-term mean queueing delays closer to the respective target delays than the first policy, and also achieves smaller errors in short-term mean queueing delays than the Coffman-Mitrani policy.
|Item Type:||Conference Paper|
|Additional Information:||©2003 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Department/Centre:||Division of Electrical Sciences > Electrical Communication Engineering|
|Date Deposited:||25 Aug 2008|
|Last Modified:||19 Sep 2010 04:13|
Actions (login required)