A Novel Voice Priority Queue (VPQ) Schedule and Algorithm for VoIP over WLAN Network

The VoIP deployment on Wireless Local Area Networks (WLANs), which is based on IEEE 802.11 standards, is increasing. Currently, many schedulers have been introduced such as Weighted Fair Queueing (WFQ), Strict Priority (SP) General processor sharing (GPS), Deficit Round Robin (DRR), and Contention-Aware Temporally fair Scheduling (CATS). Unfortunately, the current scheduling techniques have some drawbacks on real-time applications and therefore will not be able to handle the VoIP packets in a proper way. The objective of this research is to propose a new scheduler system model for the VoIP application named final stage of Voice Priority Queue (VPQ) scheduler. The scheduler system model is to ensure efficiency by producing a higher throughput and fairness for VoIP packets. In this paper, only the final Stage of the VPQ packet scheduler and its algorithm are presented. Simulation topologies for VoIP traffic were implemented and analyzed using the Network Simulator (NS-2). The results show that this method can achieve a better and more accurate VoIP quality throughput and fairness index over WLANs

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

On scheduling input queued cell switches

Output-queued switching, though is able to offer high throughput, guaranteed delay and fairness, lacks scalability owing to the speed up problem. Input-queued switching, on the other hand, is scalable, and is thus becoming an attractive alternative. This dissertation presents three approaches toward resolving the major problem encountered in input-queued switching that has prohibited the provision of quality of service guarantees. First, we proposed a maximum size matching based algorithm, referred to as min-max fair input queueing (MFIQ), which minimizes the additional delay caused by back pressure, and at the same time provides fair service among competing sessions. Like any maximum size matching algorithm, MFIQ performs well for uniform traffic, in which the destinations of the incoming cells are uniformly distributed over all the outputs, but is not stable for non-uniform traffic. Subse-quently, we proposed two maximum weight matching based algorithms, longest normalized queue first (LNQF) and earliest due date first matching (EDDFM), which are stable for both uniform and non-uniform traffic. LNQF provides fairer service than longest queue first (LQF) and better traffic shaping than oldest cell first (OCF), and EDDEM has lower probability of delay overdue than LQF, LNQF, and OCF. Our third approach, referred to as store-sort-and-forward (SSF), is a frame based scheduling algorithm. SSF is proved to be able to achieve strict sense 100% throughput, and provide bounded delay and delay jitter for input-queued switches if the traffic conforms to the (r, T) model

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

Breaking the Legend: Maxmin Fairness notion is no longer effective

In this paper we analytically propose an alternative approach to achieve better fairness in scheduling mechanisms which could provide better quality of service particularly for real time application. Our proposal oppose the allocation of the bandwidth which adopted by all previous scheduling mechanism. It rather adopt the opposition approach be proposing the notion of Maxmin-charge which fairly distribute the congestion. Furthermore, analytical proposition of novel mechanism named as Just Queueing is been demonstrated.Comment: 8 Page