Enhanced low latency queuing algorithm with active queue management for multimedia applications in wireless networks

Multimedia applications in wireless networks are usually categorized into various classes according to their traffic patterns and differentiated Quality-of-Service (QoS) requirements. The traffic of heterogeneous multimedia applications often exhibits Long-Range Dependent (LRD) and Short-Range Dependent (SRD) properties, respectively. The integrated scheduling scheme that combines Priority Queuing (PQ) and Generalized Processor Sharing (GPS) within a hierarchical structure, referred to as PQ-GPS, has been identified as an efficient mechanism for QoS differentiation in wireless networks and attracted significant research efforts. However, due to the high complexity and interdependent relationship among traffic flows, modelling of the integrated scheduling scheme poses great challenges. To address this challenging and important research problem, we develop an original analytical model for PQ-GPS systems under heterogeneous LRD and SRD traffic. A cost-effective flow decomposition approach is proposed to equivalently divide the integrated scheduling system into a group of Single-Server Single-Queue (SSSQ) systems. The expressions for calculating the queue length distribution and loss probability of individual traffic flows are further derived. After validating its accuracy, the developed model is adopted as an efficient performance tool to investigate the important issues of resource allocation and call admission control in the integrated scheduling system under QoS constraints.

The paper considers both the basic mechanisms of queue management on the router and the principle of their operation. A comparative analysis of the following queuing mechanisms: FIFO (First-In First-Out), CQ (Custom Queuing), PQ (Priority Queuing), WFQ (Weighted Fair Queuing), CBWFQ (Class Based Weighted Fair Queuing) and LLQ (Low Latency Queuing) based on a number of parameters such as traffic volume, traffic type, service of mixed traffic, enable on router and number of queues was made. The results of analysis showed that each of the queuing mechanisms has its advantages when dealing with certain types of traffic. Whereas in the process of load balancing several interfaces of the router are involved simultaneously the choice of queuing mechanism on each of them will depend on QoS for real-time traffic. Thus in this work the effect of various queue management mechanisms (such as FIFO, PQ, CQ, WFQ, LLQ) to QoS for real-time traffic in the process of load balancing on the router in an IP network was also investigated. The simulation results showed that most of queuing mechanisms (except FIFO and CQ) in the process of load balancing allowed to provide high QoS for real time traffic by reducing the values of delays and jitter and a significant reduction of lost packets for such traffic flows. At the same time the results showed that in the load balancing process, the most efficient queues servicing mechanism is LLQ, which provides the lowest delay for VoIP and the end to-end delay commensurable with the PQ mechanism for video traffic.

The unique characteristics of wireless networks pose a number of nontrivial challenges to multimedia applications with security and rigorous QoS requirements. Lack of adequate security protection is incapable of meeting security requirements of applications, whereas enabling excessive security services inevitably leads to further degradation in QoS due to additional computation and payload encapsulation. Early work, e.g. LAP, achieves balance by adjusting security policy according to QoS metrics; but none of them are security guaranteed. In this paper, we present an efficient risk-aware QoP (Quality of Protection) and QoS optimization algorithm for multimedia applications in wireless networks. It can achieve an optimization for QoP/QoS performance metrics through offering hierarchical security services and QoS support. Experiment demonstrates that even in high risk environments our scheme can efficiently balance QoP and QoS requirements.

Effective support of real‐time multimedia applications in wireless access networks, viz. cellular networks and wireless LANs, requires a dynamic bandwidth adaptation framework where the bandwidth of an ongoing call is continuously monitored and adjusted. Since bandwidth is a scarce resource in wireless networking, it needs to be carefully allocated amidst competing connections with different Quality of Service (QoS) requirements. In this paper, we propose a new framework called QoS‐adaptive multimedia wireless access (QoS‐AMWA) for supporting heterogeneous traffic with different QoS requirements in wireless cellular networks. The QoS‐AMWA framework combines the following components: (i) a threshold‐based bandwidth allocation policy that gives priority to handoff calls over new calls and prioritizes between different classes of handoff calls by assigning a threshold to each class, (ii) an efficient threshold‐type connection admission control algorithm, and (iii) a bandwidth adaptation algorithm that dynamically adjusts the bandwidth of an ongoing multimedia call to minimize the number of calls receiving lower bandwidth than the requested. The framework can be modeled as a multi‐dimensional Markov chain, and therefore, a product‐form solution is provided. The QoS metrics—new call blocking probability (NCBP), handoff call dropping probability (HCDB), and degradation probability (DP)—are derived. The analytical results are supported by simulation and show that this work improves the service quality by minimizing the handoff call dropping probability and maintaining the bandwidth utilization efficiently. Copyright © 2006 John Wiley & Sons, Ltd.

Input queuing has become dominant and popular building blocks for high speed crossbar switches with many ports and fast line rates because they require minimum speed-up of memory bandwidth. Input Queued switches with finite Virtual Output Queues guarantees QoS performance in terms of throughput and average delay. A switch performs two functions Queuing and Scheduling. Queue Management algorithm manages the size of the queues and drops packets when necessary or appropriate. Scheduling algorithms determine next packet to transfer and solves conflicts with the switching fabric. Fairness and Starvation are another two properties of IQ switches and it is analyzed in finite VOQ in this works. Fairness performs fair allocation of bandwidth among flows and prevents flows from misbehaving flows. Starvation of VOQ prevents serving High priority queue. The motivation behind this study is to schedule the HoL packets queued in finite VOQs by Framing with Low Latency Queuing (LLQ) and Weighted Fair Queueing (WFQ). This queueing technique of VOQ is measured in terms of throughput and average delay by fair allocation of bandwidth with WFQ and Starvation-free queue with LLQ.

Low latency and efficient packet scheduling for streaming applications

Objectives: Due to the distributed network topology of peer-to-peer network, there are high possibilities for the malicious node, thereby making security a very important criterion in managing the network performance. Methods: Security in the network is ensured by validation using Rumor Recovery (RR) protocol. Trust table verification method guarentees the validity of initiator node and sower node validity. In this method, the initiator node sends its query message to the responder node according to the rumor generation and recovery phase and query issuance phase of the RR protocol. Responder node validation process is used for saving responding nodes from attacks. Findings: In this paper, we mainly concentrate on the detection and elimination of initiator node attack, replay attack, and sower attack. The performance metrics considered for evalution are delay, delivery ratio and throughput. Simulation results show that the proposed Trusted Rumor Riding (TRR) protocol. 1. Out performs RR protocol by 34% in terms of delay, 1% in terms of delivery ratio and 17% in terms of throughput while detecting and eliminating the initiator attack; 2. Out performs RR by 98% in terms of delay, 41% in terms of delivery ratio and 19% in terms of throughput while detecting and eliminating the replay attack; and 3. Out performs RR by 95% in terms of delay, 9% in terms of delivery ratio and 36% in terms of throughput while detecting and eliminating the sower attack. Most of the existing works did not consider these three attacks; only few works considered it, but those were failed to meet the quality of service requirements. The detected attacks are avoided in a effective manner to provide the secure communication. Applications/Improvement: From the results, it is concluded that the proposed TRR protocol can detect several attack while satisfying the quality of service needs.

This paper proposes a novel packet scheduling algorithm for delay constraint traffic on high speed down link packet access (HSDPA) and also a packet scheduler for this algorithm. In this packet scheduling algorithm, we consider both the delay constraint and the throughput for each traffic class while maximizing the system capacity. Considering the delay constraint and the throughput simultaneously, our method can guarantee different quality of service (QoS) for each traffic class. Finally, in order to demonstrate the performance of our proposed algorithm, we compare our algorithm with the proportional fairness (PF) method and round robin (RR) method by system simulations. Numerical results show that system performance can be significantly improved employing our algorithm compared to that with the PF or RR method.

Defending against fake VIP in scant-transparency information systems with QoS differentiation

The usage of voice over IP (VoIP) traffic in IEEE 802.11 wireless networks is expected to increase in the near future due to widely deployed 802.11 wireless networks and VoIP services on fixed lines. However, the quality of service (QoS) of VoIP traffic in wireless networks is still unsatisfactory. In this thesis, I identify several sources for the QoS problems of VoIP traffic in IEEE 802.11 wireless networks and propose solutions for these problems. The QoS problems discussed can be divided into three categories, namely, user mobility, VoIP capacity, and call admission control. User mobility causes network disruptions during handoffs. In order to reduce the handoff time between Access Points (APs), I propose a new handoff algorithm, Selective Scanning and Caching, which finds available APs by scanning a minimum number of channels and furthermore allows clients to perform handoffs without scanning, by caching AP information. I also describe a new architecture for the client and server side for seamless IP layer handoffs, which are caused when mobile clients change the subnet due to layer 2 handoffs. I also present two methods to improve VoIP capacity for 802.11 networks, Adaptive Priority Control (APC) and Dynamic Point Coordination Function (DPCF). APC is a new packet scheduling algorithm at the AP and improves the capacity by balancing the uplink and downlink delay of VoIP traffic, and DPCF uses a polling based protocol and minimizes the bandwidth wasted from unnecessary polling, using a dynamic polling list. Additionally, I estimated the capacity for VoIP traffic in IEEE 802.11 wireless networks via theoretical analysis, simulations, and experiments in a wireless test-bed and show how to avoid mistakes in the measurements and comparisons. Finally, to protect the QoS for existing VoIP calls while maximizing the channel utilization, I propose a novel admission control algorithm called QP-CAT (Queue size Prediction using Computation of Additional Transmission), which accurately predicts the impact of new voice calls by virtually transmitting virtual new VoIP traffic.

In this paper, a novel quality of service (QoS) class mapping and scheduling scheme for the LTE-WiFi converged network is proposed to ensure that end-to-end QoS support is provisioned seamlessly. A mapping among QoS classes of LTE and WiFi is performed first, then scheduling scheme is outlined. For scheduling scheme, traffic is separated into real-time (RT) and non-real-time (NRT) components, then a two-stage complex queuing strategy is performed. In the first stage, deficit weighted round robin queuing (DWRRQ) and class-based weighted fair queuing (CBWFQ) are used for RT and NRT applications respectively to segregate and forward traffic according to resource requirements. Whereas in the second stage, rate-control priority queuing (RCPQ) is used for all types of traffic to give each class appropriate priority level. Performance evaluation of the converged network was done based on different metrics such as jitter, end-to-end delay, throughput, and packet loss ratio. Simulation results show significant improvements for RT with slight degradation on NRT applications after using the new scheduling scheme.

The quality of service (QoS) support in wireless local area networks (WLANs) faces a big challenge due to time-correlated fading channel. Conventional automatic repeat reQuest (ARQ) schemes based on time diversity may result in consecutive retransmission failures degrading QoS severely. This paper proposes a novel Differentiated cooperative medium access control (MAC) protocol, called DC-MAC, to enhance QoS in WLANs based on the IEEE 802.11e architecture. The retransmission is initiated from an appropriate transmission queue of an appropriate relay node instead of the original source to exploit spatial diversity. A novel negative acknowledgement (NAK) feedback mechanism is introduced for loss distinguishing and channel estimation such that cooperative retransmission will be employed only when necessary and only by competent nodes. Simulations conducted on the OPNET platform show that the proposed scheme significantly improves the performances of both multimedia applications and data applications in terms of throughput and delay while supporting service differentiation.

With the onset of multimedia applications, Quality of Service (QoS) in 802.11-based wireless ad hoc networks has been an essential area to look into. Standard wireless protocols such as IEEE 802.11b and IEEE 802.11e have been deemed unsuitable for multimedia traffic transmission in an ad hoc (multihop) network environment due to the unique network characteristics. As an ad hoc network is infrastructureless and distributed in nature, it gives rise to several challenges in QoS provisioning. In this thesis, we focus on the research of three key areas on QoS in ad hoc networks namely, buffer management in the medium access control (MAC) layer, cross-layer design and flow admission control. Firstly, we study MAC layer buffer management in the IEEE 802.11e protocol. The IEEE 802.11e MAC protocol provides QoS for multimedia traffic by probabilistic priority queueing. Ad hoc networks tend to generate a large volume of network control packets for route maintenance and these control packets are typically queued in the highest priority queue. As a result, higher priority control traffic is always being served, consuming most of the bandwidth and results in poor network performance for data traffic. We examine this problem and propose a dynamic buffer management scheme to mitigate it. By setting different threshold levels in different priority queues, we allow lower priority data traffic to be served when the higher priority control traffic is deemed to be excessive. Simulation of our proposed scheme has shown that our approach yielded better network performance compared to the standard protocol in terms of packet delivery ratio and average delay. Secondly, we study the cross-layer interaction between the MAC and Network layers to identify its impact on QoS. We select the IEEE 802.11e MAC protocol and Ad-hoc On Demand Distance Vector (AODV) routing protocol in our study since they are standardized protocols for wireless networks. In IEEE 802.11e MAC protocol, lower priority traffic has a higher probability of being blocked. Hence, the MAC layer will inform the Network layer of a broken link through the link notification function. In this case, AODV will re-route the paths that traverse this link. As a result, higher priority traffic which shares the same link as the lower priority traffic will undergo the same re-routing procedures. We termed this phenomenon path correlation effect. Under high traffic load, the path correlation effect will be more intense and hence degrade the QoS of higher priority traffic. To break the path correlation effect, we propose a cross-layer design called the Bundled Virtual Circuit (BVC). Our proposed BVC scheme not only addresses the path correlation issues, but also provides priority treatment from the Network layer to the MAC layer. Through our simulations, our proposed cross-layer design approach is proven to provide better network performance than the 802.11e/AODV protocols in terms of packet delivery ratio and delay. Finally, we examine flow admission control at the routing layer in ad hoc networks. Standard routing protocols such as AODV performs routing on a shortest path basis. In the presence of multiple routes, hotspots are likely to form among the intermediate nodes and thus lead to network congestion. In addition, existing routes are not well-protected from the introduction of new routes. We propose a flow admission control algorithm to be used with AODV. Our algorithm allows routes to be created through available bandwidth and congestion estimation. During the route discovery phase, each node will be gauged on its estimated available bandwidth and its backlog of packets in the MAC buffer. If a node does not have sufficient bandwidth, or has too many backlogged packets compared to the requested flow rate, it will not participate in the route discovery process. From simulations, our new scheme is able to provide better network performance than the standard AODV protocol in terms of delay. Our work in this thesis focuses on QoS provisioning in ad hoc networks from the MAC and network layer perspectives. By studying the network characteristics and protocols’ behavior, we investigate the various problems of providing QoS in an ad hoc network environment and propose three different schemes to improve the QoS provisioning at the MAC and network layers. We believe that our work is able to provide some insights to the research area on QoS in ad hoc networks.

Long Term Evolution (LTE) network is a promising wireless technology which provides mobile users with high data rate and low latency. LTE has been developed by the 3rd Generation Partnership Project (3GPP) to improve the end to end system delay and support higher Quality of Services (QoS). However, 3GPP has not defined a firm provision to handle the scheduling process, so that scheduling becomes an open issue for researchers. Instead, they defined nine classes with their corresponding Quality of Services (QoS) requirements. In this paper, a novel scheduling algorithm is proposed based on class service using cooperative game theory technique. The available resources are fairly distributed among classes as proportion which results in higher fairness level among classes. In the second level, the users with tightest delay requirements are prioritized. The proposed algorithm is compared with Proportional Fairness (PF) and Exponential (EXP) rule algorithms in terms of throughput, delay and fairness index. The proposed model outperforms PF and EXP schemes in all comparative parameters.

As wireless communication gains popularity, significant research has been devoted to supporting real-time transmission with stringent Quality of Service (QoS) requirements for wireless applications. At the same time, a wireless hybrid network that integrates a mobile wireless ad hoc network (MANET) and a wireless infrastructure network has been proven to be a better alternative for the next generation wireless networks. By directly adopting resource reservation-based QoS routing for MANETs, hybrids networks inherit invalid reservation and race condition problems in MANETs. How to guarantee the QoS in hybrid networks remains an open problem. In this paper, we propose a QoS-Oriented Distributed routing protocol (QOD) to enhance the QoS support capability of hybrid networks. Taking advantage of fewer transmission hops and anycast transmission features of the hybrid networks, QOD transforms the packet routing problem to a resource scheduling problem. QOD incorporates five algorithms: 1) a QoS-guaranteed neighbor selection algorithm to meet the transmission delay requirement, 2) a distributed packet scheduling algorithm to further reduce transmission delay, 3) a mobility-based segment resizing algorithm that adaptively adjusts segment size according to node mobility in order to reduce transmission time, 4) a traffic redundant elimination algorithm to increase the transmission throughput, and 5) a data redundancy elimination-based transmission algorithm to eliminate the redundant data to further improve the transmission QoS. Analytical and simulation results based on the random way-point model and the real human mobility model show that QOD can provide high QoS performance in terms of overhead, transmission delay, mobility-resilience, and scalability.