HFAQM: A hybrid fair active queue management mechanism to improve fairness and stability for wireless local area network

Active Queue Management (AQM) is a proactive scheme that controls network congestion by avoiding it before it happens. When implementing AQM in wireless networks, several contemporary issues must be considered, such as interference, collisions, multipath-fading, propagation distance and shadowing effects, which affect the transmission rate of the links. These issues in WLAN networks with the existence of different types of flow have a direct effect on fairness. The main idea behind the wireless network is using the flexibility of radio waves to transfer data from point to point that is giving WLAN the flexibility and mobility: wireless nodes can connect, disconnect or even move from one access point to another rapidly. However, this affects the stability of the WLAN network. This research aims to reduce unfairness and instability by proposing a Hybrid-Fair AQM (HFAQM) scheme. HFAQM comprises two mechanisms: Congestion Indicator Mechanism (CIM), and Control Function Mechanism (CFM). CIM was designed to improve fairness in WLANs by hybridizing queue delay with arrival rate as parameters to calculate the congestion level. Whereas, CFM was developed to improve network stability by using an adaptive control function with the ability to drop and mark packets to overcome the rapidly changing characteristics of WLAN network. A series of experimental studies were conducted to validate the proposed mechanisms and four variants of AQM schemes, RED, REM, AVQ and CoDel, were chosen to evaluate the performance of HFAQM through simulation. The findings show that HFAQM’s main achievement is 99% fairness and improved stability by 10% from the closest scheme, with better throughput, queue length, queue loss, and outgoing link utilization as secondary achievements. The proposed scheme provides significantly better fairness and stability in WLAN environment, with the existence of different types of flow

A Fairness Investigation on Active Queue Management Schemes in Wireless Local Area Network

Active Queue Management (AQM) is scheme to handle network congestion before it happened by deciding which packet has to be dropped, when to drop it, and through which port have to drop when it has become or is becoming congested. Furthermore, AQM schemes such as Random Early Detection (RED), Random Early Marking (REM), Adaptive Virtual Queue (AVQ), and Controlled Delay (CoDel) have been proposed to maintain fairness when unresponsive constant bit rate UDP flows share a bottleneck link with responsive TCP traffic. However, the performance of these fair AQM schemes need more investigation especially evaluation in WLANs environment. This paper provides an experimental evaluation of different AQM schemes in WLAN environment with presence of two different types of flows (TCP flows and UDP flows) to study the behavior of these AQM schemes which might punish some flows unfairly. The simulation method has conducted in this paper by using Network Simulation 2 (ns-2) with the topology of bottleneck scenario. The result has shown that REM and AVQ both obtain higher fairness value than RED and Codel. However, CoDel has given the lowest fairness comparing with RED scheme which have given a moderated value in terms of fairness in WLANs environment. Besides, AQM schemes must be chosen not only based on its performance or capability to indicate the congestion and recovering overflow situation but also considering fairness with different types of flows and the environment as well, such as WLANs environment

Providing Fairness Through Detection and Preferential Dropping of High Bandwidth Unresponsive Flows

Stability of the Internet today depends largely on cooperation between end hosts that employ TCP (Transmission Control Protocol) protocol in the transport layer, and network routers along an end-to-end path. However, in the past several years, various types of traffic, including streaming media applications, are increasingly deployed over the Internet. Such types of traffic are mostly based on UDP (User Datagram Protocol) and usually do not employ neither end-to-end congestion norflow control mechanism, or else very limited. Such applications could unfairly consume greater amount of bandwidth than competing responsive flows such as TCP traffic. In this manner, unfairness problem and congestion collapse could occur. To avoid substantial memory requirement and complexity, fair Active Queue Management (AQM) utilizing no or partial flow state information were proposed in the past several years to solve these problems. These schemes however exhibit several problems under different circumstances.This dissertation presents two fair AQM mechanisms, BLACK and AFC, that overcome the problems and the limitations of the existing schemes. Both BLACK and AFC need to store only a small amount of state information to maintain and exercise its fairness mechanism. Extensive simulation studies show that both schemes outperform the other schemes in terms of throughput fairness under a large number of scenarios. Not only able to handle multiple unresponsive traffic, but the fairness among TCP connections with different round trip delays is also improved. AFC, with a little overhead than BLACK, provides additional advantages with an ability to achieve good fairness under a scenario with traffic of diff21erent sizes and bursty traffic, and provide smoother transfer rates for the unresponsive flows that are usually transmitting real-time traffic.This research also includes the comparative study of the existing techniques to estimate the number of active flows which is a crucial component for some fair AQM schemes including BLACK and AFC. Further contribution presented in this dissertation is the first comprehensive evaluation of fair AQM schemes under the presence of various type of TCP friendly traffic