A scheduling algorithm called queue length control is proposed to ensure different quality in each of the traffic flows at a network node. This algorithm determines the control parameters (average queue length and its standard deviation) for a queue in advance (and off-line) by using the M/G/1 model based on the delay target of each queue and then schedules based on these control parameters for each queue. A simulation compares this algorithm to other algorithms and demonstrates that the delay target of each traffic flow could be achieved over a broad range. When the control parameters are determined, although the actual packet length distribution and the packet arrival distribution are assumed to be different, a certain level of performance can be achieved. In other words, the presence of superior robust control characteristics is demonstrated.
|Number of pages||11|
|Journal||Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)|
|Publication status||Published - 1 Mar 2004|
- Delay time target
- Priority algorithm
- Queue length control algorithm