ReviewA comprehensive survey on scheduler for VoIP over WLAN
Introduction
Voice over Internet Protocol (VoIP) is a revolutionary technology that utilizes high-speed packet-switched networks. The IEEE 802.11 standard has increased an importance due to significant research in the last decade. VoIP is a delay sensitive application that runs in packet-switched networks. A VoIP application would expect the network to ensure that each traffic flow is able to provide efficient performance guarantee, real-time voice flow, better throughput and a fair share of the bandwidth. Packet scheduling is important for enhancing the performance of the VoIP over WLANs. Queue management scheduling is a dynamic area of research over a WLAN based on the IEEE 802.11 standard.
This survey paper will discuss the fundamental background principles of the related schedulers and algorithms. This paper also identifies the importance of the scheduling techniques over WLANs. Related research work for real-time and specifically VoIP applications will also be highlighted. A number of traffic schedulers and algorithms are recommend for meeting the requirements of VoIP applications (Wong et al., 2004, Hegde et al.,, Zhang et al., 2008, Lim et al., 2004, Shakkottai and Stolyar, 2002, Demarch and BeckerPlease check the page range in the following Refs.: Demarch and Becker (2007) and Gao et al. (2008)., 2007, Jacobson,, Trad et al., 2004). The traffic scheduling algorithms will be discussed, highlighting their advantages, disadvantages, and challenges.
Scheduling algorithms to support packet scheduling over networks include Class Based Queue (CBQ), Faire Queue (FQ), Weight Faire Queue (WFQ), Generalized Processor Sharing (GPS), Worst-case Fair Weighted Fair Queueing (WF2Q), Deficit Round Robin (DRR), Deficit Transmission Time (DTT), Low Latency and Efficient Packet Scheduling (LLEPS), Credit Based-SCFQ (CB-SCFQ), Controlled Access Phase Scheduling (CAPS), Queue size Prediction-Computation of Additional Transmission (QP-CAT), Temporally-Weight Fair Queue (T-WFQ), Contention-Aware Temporally fair Scheduling (CATS), and Decentralized-CATS (D-CATS) (Nisar et al., 2010). These scheduling algorithms will be classified and discussed in relation to VoIP.
Most of the available traffic scheduling architecture and algorithms are for wired networks. The traditional scheduling techniques are applied without any decision on managing traffic flow for real-time applications such as a VoIP application. This paper will study the most related scheduling algorithms to ensure appropriate QoS particularly for a VoIP application. High-speed packet-switched networks from various flows enter at a switch or router for controlling the voice traffic. The purpose of the scheduling algorithm is to choose each voice traffic flow from the switch or router and transmit it in the output node. An efficient scheduling algorithm manages the various flows in an organized manner and ensures the Quality of Service (QoS) is met (Forouzan, 2007, Stiliadis and Varma, 1996, Kadhum and Hassan, 2009a, Kadhum and Hassan, 2009b).
Section snippets
Classifications of scheduling algorithms
VoIP is end-to-end delay sensitive and requires proper traffic scheduling algorithms over the network. These scheduling algorithms may be classified based on their behaviour over IP-based networks (Wu et al., 2006, Lu et al., 1999, Zhang and Ferrari, 1993). They can be classified into packet-based schedulers, frame based-packet schedulers, bit-by-bit schedulers, priority packet-based schedulers and regulative packet schedulers. Details are as shown in Table 1. The Generalized Processor Sharing
Real-time traffic scheduler
Real-time schedulers provide a guaranteed fairness facility and offer multiple sessions over the same transmission node link. These traffic schedulers divide the bandwidth in the small traffic flows and forward the traffic flow with priority over IP-based networks. Real-time flows require adequate bandwidth allocations and strict delay control within the network.
Real-time traffic scheduling system model and algorithms are designed to share the bandwidth over the network. The motivation behind
VoIP traffic scheduler issues
In WLANs, the voice traffic flow is categorized into different classes (Tao et al., 2005, Wang et al., 2005, Lee, 2005, Cole and Rosenbluth, 2001, Sze et al., 2002). The traffic flow guarantee in WLAN addresses how to assign bandwidth resources among these traffic flows so that each flow can have its own Quality of Service (QoS) requirements satisfied. Most of the schedulers perform well when the network load is not high (Venkatakrishnan and Selvakennedy, 2004, Gao et al., 2008). Some VoIP
Traffic scheduler
The main concern of the VoIP over WLAN is for a well-organized traffic flow on the network. Traffic scheduler techniques manage the multiple flows in a flexible approach with a bandwidth guarantee and it provides QoS over the networks. Some of these traffic schedulers are discussed in the following subsections. It will also show the difference between these schedulers and proposed scheduling system model.
Conclusion
This survey paper presents related traffic schedulers and algorithms for VoIP traffic. Fundamental characteristics of each scheduling technique ((Vaidya et al., 2005; Golestani, 1994; Yu et al., 2006; Antila and Luoma, 2005; Song et al., 2010; Mathy et al., 2000; Lee et al., 2007)) are discussed. The scheduling algorithms are classified into real-time traffic schedulers, VoIP traffic scheduler issues and representative schedulers. Related scheduling algorithms for enhancing the QoS of VoIP
References (88)
- et al.
Application-aware scheduling for VoIP in wireless mesh networks
Computer Networks
(2010) - et al.
Analysis and simulation of WF2Q+ based schedulers: comparisons, compliance with theoretical bounds and influence on end-to-end delay jitter
Journal of Computer Networks
(2001) - et al.
Hybrid polling and contention access scheduling in IEEE 802.11e WLANs
Journal of Parallel and Distributed Computing
(2007) Anatomy of delay performance for the strict priority scheduling scheme in multi-service Internet
Computer Communications
(2005)- Abdelghani M, Sezer S, Garcia E, Mu J, Toal C. FPGA-based lookup circuit for session-based IP packet classification....
- Ahmed S, Jiang X, Horiguchi S. Efficient scheduler for the growing VoIP traffic. In: International conference on...
- Andrew L, Ranasinghe R. Optimising the polling sequence in embedded round robin WLANs. In: Proceedings of the IEEE...
- Antila J, Luoma M. Robust delay estimation of an adaptive scheduling algorithm. In: Proceedings of the QoS-IP 2005....
- Bennett J, Zhang H. WF2Q: worst-case fair weighted fair queueing. INFOCOM '96. Fifteenth annual joint conference of the...
- Cole R, Rosenbluth J. Voice over IP performance monitoring. ACM SIGCOMM computer communication review; April 2001. vol....
MAC protocol and traffic scheduling for wireless ATM networks
Journal of Mobile Networks and Applications
Promoting the use of end-to-end congestion control in the Internet
Journal of IEEE/ACM Transactions on Networking (TON)
Random early detection gateways for congestion avoidance
Journal of IEEE/ACM Transactions on Networking (TON)
Link-sharing and resource management models for packet networks
IEEE/ACM Transactions on Networking (USA)
Experimental results for class-based queueing
IEEE/ACM Transactions on Networking (USA)
Admission control based on rate-variance envelop for VBR traffic over IEEE 802.11e HCCA WLANs
IEEE Transactions on Vehicular Technology (Beijing, China)
Providing air-time usage fairness in IEEE 802.11 networks with the deficit transmission time (DTT) scheduler
Wireless Networks (Pisa, Italy)
Network delay analysis of a class of fair queueing algorithms
IEEE Journal on Selected Areas in Communication (NJ, USA)
How fair is fair queuing
Journal of the Association for Computing Machinery (JACM)
The uniformization process of the fast congestion notification (FN)
International Journal of Computer Science and Information Security (IJCSIS)
The drop activation function of the fast congestion notification (FN) mechanism
International Journal of Communication Networks and Information Security (IJCNIS)
Scheduling for multiple flows sharing a time-varying channel: the exponential rule
American Mathematical Society Translations (USA)
Design and analysis of frame-based fair queuing: a new traffic scheduling algorithm for packet-switched networks
ACM SIGMETRICS Performance Evaluation Review (Santa Cruz, CA)
Low latency and efficient packet scheduling for streaming applications
Computer Communications (Chung-Li, Taiwan
A multiplexing scheme for H.323 Voice-Over-IP Applications
IEEE Journal on Selected Areas in Communications
Cited by (34)
A survey on 802.11 MAC industrial standards, architecture, security & supporting emergency traffic: Future directions
2021, Journal of Industrial Information IntegrationCitation Excerpt :The IEEE 802.11-based WLAN has ended up a ubiquitous networking technology deployed around the world. A primary goal of this survey paper is to develop a framework for WLAN, which help emergency traffic and provide strict Quality of Service (QoS) assurance for lifesaving emergency traffic in a dense emergency state of affairs the place an excessive quantity of nodes report the emergency [1,2]. To attain this objective, an ordinary perception of WLANs is required.
A survey on the architecture, application, and security of software defined networking: Challenges and open issues
2020, Internet of Things (Netherlands)Citation Excerpt :This makes the network difficult to differentiate between the two traffic types. The researchers in [102] explained that before an attacker attacks an SDN network using DoS/DdoS, it must first confirm that the network is an SDN network. This is achieved by identifying the processing times of the first packet and the next packets.
Optical millimeter wave mode division multiplexing of LG and HG modes for OFDM Ro-FSO system
2019, Optics CommunicationsDelay optimization using Knapsack algorithm for multimedia traffic over MANETs
2015, Expert Systems with ApplicationsCitation Excerpt :Other works for packet loss differentiation have been proposed with a focus on either analyzing end-to-end delay or bit errors existing in the frame/packet, which helps in finding the changes in the transport layer protocol (Biaz & Vaidya, 1999; Cen, Cosman, & Voelker, 2003; Garcia & Brunstrom, 2002; Tobe, Tamura, Molano, Ghosh, & Tokuda, 2000). Nisar, Amphawan, Hassan, and Sarkar (2013) presented a survey which indicates the importance of scheduling techniques in Wireless LAN for real-time applications. Kohlar, Handley, and Floyed (2006) proposed a Datagram Congestion Control Protocol (DCCP) to maximize the performance of multimedia applications.
An active model for ranging by deep convolutional neural network and elephant herding optimization algorithm (DCNN-EHOA) in WSNs
2022, International Journal of Pervasive Computing and Communications