New queueing strategies employing service interval-based priority for real-time communications in atm networks

Abstract

In this paper, we propose queueing strategies employing the service interval-based priority (sip) which can provide delay-bounded, and loss-free services, while maximizing bandwidth utilization in the atm network. We also describe a variation of the sip, the residual service interval-based priority (rsip) which can achieve almost full utilization by assigning priorities dynamically on the basis of the residual service interval. We store the realtime cells belonging to different connections in logically separated queues, and for each queue, we set a parameter called service interval, during which only one cell is allowed to be transmitted. The sip server takes and transmits the head-of-line (hol) cell of the queue which has the smallest service interval, while the rsip server selects the queue with the smallest residual service interval. When there is no eligible real-time cell, it transmits non-real-time cell, thus enabling a maximized bandwidth utilization. Employing the above queueing strategies, we analyze the delay characteristics deterministically with the leaky bucket bounded input traffic and then dimension the optimal service interval. In dimensioning the service interval and buffer space of each real-time service queue, we consider burstiness of traffic in conjunction with delay constraints, so that bandwidth utilization can get maximized. In addition, we consider the issues of protection from malicious users, average bandwidth utilization, and coupling between the delay bound and the bandwidth allocation granularity.