An Admission Control Algorithm for Isochronous and Asynchronous Traffic in IEEE 802.11ad MAC

TL;DR

The paper tackles guaranteeing Service Period (SP) allocations for mixed isochronous and asynchronous traffic in IEEE 802.11ad by introducing EACIAR, a linear-time admission-control and scheduling algorithm that does not assume periodicity for asynchronous requests. It uses an EDF-based framework to ensure deadlines, prioritizes ISO traffic, and distributes surplus SP fairly among ISO jobs, while accommodating asynchronous deadlines through a long_schedule up to $D_{max}$. Key contributions include a unified mechanism for ISO and ASYNC requests with arbitrary parameters, a correctness argument guaranteeing SP allocations before deadlines, and detailed performance analysis showing trade-offs under asynchronous load. The approach advances practical SP management in high-bandwidth, low-latency mmWave WLANs and demonstrates notable improvements over prior methods that either restricted traffic types or allowed resource over-allocation.

Abstract

Due to availability of large amount of bandwidth in the 60 GHz band and support of contention-free channel access called Service Period (SP), the IEEE 802.11ad/ay Wi-Fi standard is well suited for low latency and high data rate applications. IEEE 802.11ad supports two types of SP user traffic: isochronous and asynchronous. These user traffic need guaranteed SP duration before their respective deadlines. Hence, admission control plays an important role in an IEEE 802.11ad system. In an earlier work, we studied admission control and scheduling of isochronous and asynchronous traffic in an IEEE 802.11ad system, but we assumed the asynchronous requests to be periodic to keep the algorithm simple. That assumption resulted in overallocation of resource and potential degradation of performance. In this paper, we present an admission control algorithm which does not make such assumption and yet still maintains a linear run time complexity and allocates resources to the requests in a proportional fair manner. We provide arguments to establish correctness of the algorithm in terms of guaranteeing SP allocation to the requests before their respective deadlines.

Figures (1)

• Figure 1: Flowchart of Admission Control at a High Level