Efficient distributed scheduling architecture for wireless ATM networks

Abstract

This paper presents a new distributed scheduling architecture for wireless ATM networks. Usually, in WATM scheduling architectures, a fixed order is defined among the different connections through their ATM service category (CBR >VBR >- ABR >- UBR). We argue that although this static priority is easier to implement, this type of precedence is not necessarily a good choice for the MAC layer. The MAC layer scheduling should define an order such that it uses efficiently the resources while providing quality of service (QoS) guarantees. In this spirit, our architecture delays (without violating their QoS) the real time connections in order to improve the performance of non real time connections.