Chakraborty, Avijit and Mukherji, Utpal (2004) Achieving Delay Differentiation by Scheduling Based on Optimal Balancing of Weighted Instantaneous and Cumulative Queue Lengths. In: International Conference on Signal Processing and Communications: SPCOM '04, 11-14 December, Bangalore, India, pp. 383-387.
Restricted to Registered users only
Download (727Kb) | Request a copy
Scheduling policies for statistical multiplexing should provide delay differentiation between different trafic classes, where each class represents an aggregate traffic of individual applications having the same target queueing delay requirements. we propose scheduling to optimally balance weighted queue lengths as an approach to delay differentiation, class weights being set inversely proportional to the respective products of target delays and packet arrival rates. We fomulate the problem in the framework of Markov decision theory, assuming a discrete-time, two-class, single server queueing model with unit service time per packet. We first find a scheduling policy based on weighted instantaneous queue lengths, for the case of Bernoulli packet arrivals, that minimizes the stationary mean of the absolute value of the difference of the weighted instantaneous queue lengths. We then find a scheduling policy based on weighted cumulative queue lengths, for the case of i.i.d. packet batch arrivals, that achieves target mean queueing delays in simulation.
|Item Type:||Conference Paper|
|Additional Information:||Copyright 2000 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:35|
Actions (login required)