Performance evaluation of real-time schedulers for HCCA function in IEEE 802.11e wireless networks

IEEE 802.11 standard for wireless networks recently has been enhanced with IEEE 802.11e amendment to this protocol which introduces Quality of Service support. It provides differentiation mechanisms at the Medium Access Control layer, using two additional access functions: the Enhanced Distributed Channel Access (EDCA) function and the HCF Controlled Channel Access (HCCA) function. The EDCA function is based on a distributed control and enables prioritized channel access while the latter requires centralized scheduling and allows the applications to negotiate parameterized service guarantees. Only HCCA mechanism is suitable for serving traffic streams with real-time requirements such as multimedia applications and Voice Over IP. The IEEE 802.11e standard does not specify a mandatory HCCA scheduling algorithm, while it offers a reference scheduler. In this paper we analyze four HCCA schedulers which are alternative to the reference one and which offer real-time guarantees. A performance evaluation through simulation is conducted to show the main differences between the considered schedulers, including the reference one

ENHANCED SCHEDULING TRAFFIC LIGHT MODEL USING DISCRETE EVENT SIMULATION FOR IMPROVED SIGNAL TIMING ANALYSIS

Most traffic light today used pre-timed traffic light, traffic light using sensors and traffic light which displaying a countdown timer. However, the existing methods consume a long time of vehicle queuing and waiting the traffic light signals to change, which created congestion at intersection of roads. In this paper, the proposed model enhanced the scheduling traffic light, which simulates the vehicle behaviour based on discrete event simulation and queue theory. Therefore, the simulation becomes more realistic and contributes to accurate outcome. This work focuses on the analysis of the average waiting time for the vehicle in three cases: heavy, medium and low traffic volume. The most optimum traffic signal timing is the one with minimum waiting time for the vehicles. Moreover, the new model solves the critical traffic congestion problem not only in simulation but also in real environment, which drivers take the longest average waiting time is 86 seconds while the shortest average waiting time is 64 seconds at the junction although in heavy traffic congestion. An extensive simulations have been conducted in this work in which a green interval as a control parameter is selected

Real-time support for HCCA function in IEEE 802.11e networks: a performance evaluation

The IEEE 802.11 standard for wireless networks has been recently enhanced with the IEEE 802.11e amendment which introduces Quality of Service support. It provides differentiation mechanisms at the Medium Access Control layer, using two additional access functions: the Enhanced Distributed Channel Access (EDCA) function and the HCF Controlled Channel Access (HCCA) function. Only the HCCA mechanism is suitable for serving traffic streams with real-time requirements such as multimedia applications and Voice Over IP. The IEEE 802.11e standard does not specify a mandatory HCCA scheduling algorithm, but it offers a reference scheduler as the guideline in the resources scheduling design.In this paper we analyze four HCCA alternative schedulers to the reference one. They offer real-time guarantees proposing different solutions to the request of QoS and real-time support expressed by the increasing diffusion of multimedia applications. A performance evaluation is conducted to show the main differences between the considered schedulers, including the reference one.The results show that under several scenarios there is not a unique best scheduler, but there exists a variety of solutions depending on the specified requirements. The conclusions of the paper offer some guidelines in the choice of the scheduler tailored for a particular scenario of interest

Quantitative Performance Comparison of Various Traffic Shapers in Time-Sensitive Networking

Owning to the sub-standards being developed by IEEE Time-Sensitive Networking (TSN) Task Group, the traditional IEEE 802.1 Ethernet is enhanced to support real-time dependable communications for future time- and safety-critical applications. Several sub-standards have been recently proposed that introduce various traffic shapers (e.g., Time-Aware Shaper (TAS), Asynchronous Traffic Shaper (ATS), Credit-Based Shaper (CBS), Strict Priority (SP)) for flow control mechanisms of queuing and scheduling, targeting different application requirements. These shapers can be used in isolation or in combination and there is limited work that analyzes, evaluates and compares their performance, which makes it challenging for end-users to choose the right combination for their applications. This paper aims at (i) quantitatively comparing various traffic shapers and their combinations, (ii) summarizing, classifying and extending the architectures of individual and combined traffic shapers and their Network calculus (NC)-based performance analysis methods and (iii) filling the gap in the timing analysis research on handling two novel hybrid architectures of combined traffic shapers, i.e., TAS+ATS+SP and TAS+ATS+CBS. A large number of experiments, using both synthetic and realistic test cases, are carried out for quantitative performance comparisons of various individual and combined traffic shapers, from the perspective of upper bounds of delay, backlog and jitter. To the best of our knowledge, we are the first to quantitatively compare the performance of the main traffic shapers in TSN. The paper aims at supporting the researchers and practitioners in the selection of suitable TSN sub-protocols for their use cases

Quality of service optimization of multimedia traffic in mobile networks

Mobile communication systems have continued to evolve beyond the currently deployed Third Generation (3G) systems with the main goal of providing higher capacity. Systems beyond 3G are expected to cater for a wide variety of services such as speech, data, image transmission, video, as well as multimedia services consisting of a combination of these. With the air interface being the bottleneck in mobile networks, recent enhancing technologies such as the High Speed Downlink Packet Access (HSDPA), incorporate major changes to the radio access segment of 3G Universal Mobile Telecommunications System (UMTS). HSDPA introduces new features such as fast link adaptation mechanisms, fast packet scheduling, and physical layer retransmissions in the base stations, necessitating buffering of data at the air interface which presents a bottleneck to end-to-end communication. Hence, in order to provide end-to-end Quality of Service (QoS) guarantees to multimedia services in wireless networks such as HSDPA, efficient buffer management schemes are required at the air interface. The main objective of this thesis is to propose and evaluate solutions that will address the QoS optimization of multimedia traffic at the radio link interface of HSDPA systems. In the thesis, a novel queuing system known as the Time-Space Priority (TSP) scheme is proposed for multimedia traffic QoS control. TSP provides customized preferential treatment to the constituent flows in the multimedia traffic to suit their diverse QoS requirements. With TSP queuing, the real-time component of the multimedia traffic, being delay sensitive and loss tolerant, is given transmission priority; while the non-real-time component, being loss sensitive and delay tolerant, enjoys space priority. Hence, based on the TSP queuing paradigm, new buffer managementalgorithms are designed for joint QoS control of the diverse components in a multimedia session of the same HSDPA user. In the thesis, a TSP based buffer management algorithm known as the Enhanced Time Space Priority (E-TSP) is proposed for HSDPA. E-TSP incorporates flow control mechanisms to mitigate congestion in the air interface buffer of a user with multimedia session comprising real-time and non-real-time flows. Thus, E-TSP is designed to provide efficient network and radio resource utilization to improve end-to-end multimedia traffic performance. In order to allow real-time optimization of the QoS control between the real-time and non-real-time flows of the HSDPA multimedia session, another TSP based buffer management algorithm known as the Dynamic Time Space Priority (D-TSP) is proposed. D-TSP incorporates dynamic priority switching between the real-time and non-real-time flows. D-TSP is designed to allow optimum QoS trade-off between the flows whilst still guaranteeing the stringent real-time component’s QoS requirements. The thesis presents results of extensive performance studies undertaken via analytical modelling and dynamic network-level HSDPA simulations demonstrating the effectiveness of the proposed TSP queuing system and the TSP based buffer management schemes

An efficient ant colony system based on receding horizon control for the aircraft arrival sequencing and scheduling problem

The aircraft arrival sequencing and scheduling (ASS) problem is a salient problem in air traffic control (ATC), which proves to be nondeterministic polynomial (NP) hard. This paper formulates the ASS problem in the form of a permutation problem and proposes a new solution framework that makes the first attempt at using an ant colony system (ACS) algorithm based on the receding horizon control (RHC) to solve it. The resultant RHC-improved ACS algorithm for the ASS problem (termed the RHC-ACS-ASS algorithm) is robust, effective, and efficient, not only due to that the ACS algorithm has a strong global search ability and has been proven to be suitable for these kinds of NP-hard problems but also due to that the RHC technique can divide the problem with receding time windows to reduce the computational burden and enhance the solution's quality. The RHC-ACS-ASS algorithm is extensively tested on the cases from the literatures and the cases randomly generated. Comprehensive investigations are also made for the evaluation of the influences of ACS and RHC parameters on the performance of the algorithm. Moreover, the proposed algorithm is further enhanced by using a two-opt exchange heuristic local search. Experimental results verify that the proposed RHC-ACS-ASS algorithm generally outperforms ordinary ACS without using the RHC technique and genetic algorithms (GAs) in solving the ASS problems and offers high robustness, effectiveness, and efficienc

FHCF: A simple and efficient scheduling scheme for IEEE 802.11e wireless networks

The IEEE 802.11e medium access control (MAC) layer protocol is an emerging standard to support quality of service (QoS) in 802.11 wireless networks. Some recent works show that the 802.11e hybrid coordination function (HCF) can improve signi¯cantly the QoS support in 802.11 networks. A simple HCF referenced scheduler has been proposed in the 802.11e which takes into account the QoS requirements of °ows and allocates time to stations on the basis of the mean sending rate. As we show in this paper, this HCF referenced scheduling algorithm is only e±cient and works well for °ows with strict constant bit rate (CBR) characteristics. However, a lot of real-time applications, such as videoconferencing, have some variations in their packet sizes, sending rates or even have variable bit rate (VBR) characteristics. In this paper we propose FHCF, a simple and e±cient scheduling algorithm for 802.11e that aims to be fair for both CBR and VBR °ows. FHCF uses queue length estimations to tune its time allocation to mobile stations. We present analytical model evaluations and a set of simulations results, and provide performance comparisons with the 802.11e HCF referenced scheduler. Our performance study indicates that FHCF provides good fairness while supporting bandwidth and delay requirements for a large range of network loads