A cell scheduler for non-real-time traffic with service fairness in ATM networks

Non-real-time (NRT) services such as nrt-VBR, ABR and UBR traffic are inten ded for data applications. Although NRT services do not have stringent QoS requirements for cell transfer delay and cell delay variation, ATM networks should provide NRT services while considering other criteria to ensure an excellent performance such as cell loss ratio (CLR), buffer size requiremen t and service fairness. Service fairness means that networks should treat a ll connections fairly That is, connections with low arrival rates should no t be discriminated against. In addition, given a fixed buffer size for a co nnection, reducing the maximum number of cells in a buffer during the lifet ime of a connection can lead to a low CLR due to buffer overflow. Thus, the se criteria should be considered as much as possible when designing a cell scheduler to provide NRT services. Whereas most of the conventional cell sc heduling schemes are usually appropriate for one performance criterion, but inappropriate for another one. In this work: we present a novel cell sched uling scheme, called buffer minimized and service fairness (BMSF), to sched ule DIRT services in ATM networks. Using probability constraints and select ing a connection with the longest buffer size to transmit first allow BMSF to attain a satisfactory performance with respect to maximum buffer size re quirement, CLR, and service fairness in terms of the maximum buffer size an d cell waiting delay criteria. Simulation results demonstrate that BMSF per forms better than some conventional schemes in terms of these criteria, par ticularly when NRT services have diverse arrival rates. Thus, the BMSF sche me proposed herein can feasibly schedule NRT services in ATM networks.