A Greedy Reclaiming Scheduler for IEEE 802.11e HCCA Real-Time Networks

The IEEE 802.11e standard introduces Quality of Service (QoS) support for wireless local area networks and suggests how to design a tailored HCF Controlled Channel Access (HCCA) scheduler. However the reference scheduling algorithm is suitable to assure service guarantees only for Constant Bit Rate traffic streams, whereas shows its limits for Variable Bit Rate traffic. Despite the numerous alternative schedulers proposed to improve the QoS support for multimedia applications, in the case of VBR traffic satisfactory real-time performance has not been yet achieved. This paper presents a new scheduling algorithm, Unused Time Shifting Scheduler (UTSS). It integrates a mechanism for bandwidth reclaiming into a HCCA real-time scheduler. UTSS assigns the unused portion of each transmission opportunity to the next scheduled traffic stream. Thanks to such feature, traffic variability is absorbed, reducing the waste of resources. The analytical evaluation, corroborated by the simulation results, shows that UTSS is suitable to reduce the delay experienced by VBR traffic streams and to increase the maximum burstiness sustainable by the network

Dynamic TXOP HCCA reclaiming scheduler with transmission time estimation for IEEE 802.11e real-time networks

IEEE 802.11e HCCA reference scheduler guarantees Quality of Service only for Constant Bit Rate traffic streams, whereas its as- signment of scheduling parameters (transmission time TXOP and polling period) is too rigid to serve Variable Bit Rate (VBR) traffic. This paper presents a new scheduling algorithm, Dynamic TXOP HCCA (DTH). Its scheduling scheme, integrated with the central- ized scheduler, uses both a statistical estimation of needed trans- mission duration and a bandwidth reclaiming mechanism with the aim of improving the resource management and providing an in- stantaneous dynamic Transmission Opportunity (TXOP), tailored to multimedia applications with variable bit rate. Performance evaluation through simulation, confirmed by the scheduling analysis, shows that DTH is suitable to reduce the transmission queues length. This positively impacts on the delay and on packets drop rate experienced by VBR traffic streams

Improving the QoS of IEEE 802.11e networks through imprecise computation

IEEE 802.11e HCCA reference scheduler is based on fixed value parameters that do not adapt to traffic changes, thus quality of service (QoS) for multimedia applications is a challenge, especially in the case of variable bit rate (VBR) streams, that requires dynamic resource assignment. This paper is focused on immediate dynamic TXOP HCCA (IDTH) scheduling algorithm and its new evolution immediate dynamic TXOP HCCA plus (IDTH+). Their reclaiming mechanisms, refined by the monitoring of transmission duration, aim at overcoming the limits of fixed preallocation of resources by varying the stations transmission time and avoiding waste of resources. Simulations and theoretical analysis based on the imprecise computation model show that the integration of IDTH and IDTH+ can achieve improved network performance in terms of transmission queues length, mean access delay and packets drop rate, and to efficiently manage bursty traffic. Moreover, the performance improvements of IDTH+ with respect to IDTH are highlighted

A IEEE 802.11e HCCA Scheduler with a Reclaiming Mechanism for Multimedia Applications

The QoS offered by the IEEE 802.11e reference scheduler is satisfactory in the case of Constant Bit Rate traffic streams, but not yet in the case of Variable Bit Rate traffic streams, whose variations stress its scheduling behavior. Despite the numerous proposed alternative schedulers with QoS, multimedia applications are looking for refined methods suitable to ensure service differentiation and dynamic update of protocol parameters. In this paper a scheduling algorithm,Unused Time Shifting Scheduler(UTSS), is deeply analyzed. It is designed to cooperate with a HCCA centralized real-time scheduler through the integration of a bandwidth reclaiming scheme, suitable to recover nonexhausted transmission time and assign that to the next polled stations. UTSS dynamically computes with anO(1)complexity transmission time providing an instantaneous resource overprovisioning. The theoretical analysis and the simulation results highlight that this injection of resources does not affect the admission control nor the centralized scheduler but is suitable to improve the performance of the centralized scheduler in terms of mean access delay, transmission queues length, bursts of traffic management, and packets drop rate. These positive effects are more relevant for highly variable bit rate traffic

Elastic QoS Scheduling with Step-by-Step Propagation in IEEE 802.11e Networks with Multimedia Traffic

The spreading diffusion of wireless devices and the crowded coexistence of multimedia applications greedy of bandwidth and with strict requirements stress the service provisioning offered by wireless technologies. WiFi is a reference for wireless connectivity and it requires a continuous evolution of its mechanism in order to follow increasingly demanding service needs. In particular, despite the evolution of physical layer, some critical contexts, such as industrial networks, telemedicine, telerehabilitation, and virtual training, require further refined improvements in order to ensure the respect of strict real-time service requirements. In this paper an in-depth analysis of Dynamic TXOP HCCA (DTH) MAC enhanced centralized scheduler is illustrated and it is further refined introducing a new improvement, DTH with threshold. DTH and DTH with threshold can be integrated with preexisting centralized schedulers in order to improve their performances, without any overprovisioning that can negatively impact on the admission control feasibility test. Indeed, without modifying the centralized scheduler policy, they combine together the concepts of reclaiming transmission time and statistical estimation of the traffic profile in order to provide, at each polling, an instantaneous transmission time tailored to the variable traffic requirements, increasing, when necessary, the service data rate. These mechanisms can coexist with advanced physical layer-based solutions, providing the required service differentiation. Experimental results and theoretical analysis, based on elastic scheduler theory, show that they are effective especially in the case of Variable Bit Rate traffic streams in terms of transmission queues length, packets loss, delay, and throughput

Modular software architecture for flexible reservation mechanisms on heterogeneous resources

Management, allocation and scheduling of heterogeneous resources for complex distributed real-time applications is a chal- lenging problem. Timing constraints of applications may be fulfilled by a proper use of real-time scheduling policies, admission control and enforcement of timing constraints. However, it is not easy to design basic infrastructure services that allow for an easy access to the allocation of multiple heterogeneous resources in a distributed environment. In this paper, we present a middleware for providing distributed soft real-time applications with a uniform API for reserving heterogeneous resources with real-time scheduling capabilities in a distributed environment. The architecture relies on standard POSIX OS facilities, such as time management and standard TCP/IP networking services, and it is designed around CORBA, in order to facilitate modularity, flexibility and portability of the applications using it. However, real-time scheduling is supported by proper extensions at the kernel-level, plugged within the framework by means of dedicated resource managers. Our current implementation on Linux supports reservation of CPU, disk and network bandwidth. However, additional resource managers supporting alternative real-time schedulers for these resources, as well as additional types of resources, may be easily added. We present experimental results gathered on both synthetic applications and a real multimedia video streaming case study, showing advantages deriving from the use of the proposed middleware. Finally, overhead figures are reported, showing sustainability of the approach for a wide class of complex, distributed, soft real-time applications