基于CTMC和状态空间模型的宽带无线接入网的QoS性能研究

为了实现同一地域范围内的众多用户在有限带宽条件下提出的高QoS要求,本文对基于IEEE 802.16标准的宽带无线接入网中数据包级QoS（Quality of Service）性能进行了研究.具体做法是,首先采用批马尔可夫到达过程（BMAP,Batch Markov Arrival Process）和连续时间马尔科夫链（CTMC,Continuous Time Markov Chain）对到达过程和流量源进行建模,得到更符合实际和更准确的排队模型;然后基于状态空间,对一个无线接入网络系统进行建模,通过对得到的系统模型并结合前面得到的排队模型的深入分析,从而获得该模型下的各项QoS性能指标,如平均队列长度、丢包率、队列吞吐量和平均包时延.仿真实验结果表明,本文提出的算法模型相比于其他典型的算法模型,能够使得各项QoS性能指标有较大的改善和提高.     

面向带宽碎片最小化和QoS保障的数据中心网络流量调度算法

随着数据中心网络流量的迅速增长,如何提高数据中心网络性能和服务质量成为了研究热点。然而现有的流量调度算法在网络负载加大时,一方面会导致网络带宽碎片化从而使得网络吞吐量降低,另一方面忽视了流量应用需求导致网络服务质量较差。为此,该文提出一种面向带宽碎片最小化和QoS保障的动态流量调度算法,算法综合考虑了带宽敏感的大流、时延与丢包敏感的小流的不同需求,首先根据待调度流的源地址和目的地址建立最短路径集,其次从中筛选出满足待调度流的带宽需求的所有路径,然后根据路径剩余带宽信息和小流应用需求情况为每条路径建立权重函数,最后根据权重函数值利用轮盘赌算法选择转发路径。实验仿真结果显示,与其它算法相比,所提算法降低了小流的丢包率和时延,同时在网络负载较大时提升了网络吞吐量。     

Joint connection-level and packet-level quality-of-service support for VBR traffic in wireless multimedia networks

In this paper, we investigate call admission control (CAC) schemes that can jointly provide connection-level quality-of-service (QoS) (in terms of the new call blocking probability and the handoff dropping probability) and packet-level QoS (in terms of the packet loss probability) for wireless multimedia networks. Stationary CAC schemes are proposed as the results of the solution to constrained optimization problems. A dynamic CAC scheme that can be adapted to varied and varying traffic conditions dynamically is also proposed. The proposed CAC schemes are computationally efficient and easy to implement, thus being suitable for real-time system deployment. Simulation results have demonstrated that the proposed dynamic CAC scheme achieves better performance when applied to realistic traffic conditions found in wireless multimedia networks.     

Evaluating the expedited forwarding of voice traffic in a differentiated services network

The Differentiated Services architecture offers a scalable alternative to provide Quality of Service (QoS) to the new multimedia applications in the Internet. This paper aims at evaluating the delay and jitter experienced by voice traffic when handled by the Expedited Forwarding (EF) scheme. The analysis includes the effects of different packet scheduling mechanisms implementing EF and of the voice packet size. We also evaluate how efficiently each type of traffic uses an extra allocated bandwidth and the impact of traffic shaping. The results show that increasing the service rate share allocated to the EF aggregate does not significantly affect the competing best effort (BE) traffic. This holds as long as the BE traffic can use the bandwidth left unused by the EF traffic in idle periods. Copyright © 2002 John Wiley & Sons, Ltd.     

Soft QoS provisioning using the token bank fair queuing scheduling algorithm

Future-generation wireless packet networks will support multimedia applications with diverse QoS requirements. Much of the research on scheduling algorithms has been focused on hard QoS provisioning of integrated services. Although these algorithms give hard delay bounds, their stringent requirements sacrifice the potential statistical multiplexing performance and flexibility of the packet-switched network. Furthermore, the complexities of the algorithms often make them impractical for wireless networks. There is a need to develop a packet scheduling scheme for wireless packet-switched networks that provides soft QoS guarantees for heterogeneous traffic, and is also simple to implement and manage. This article proposes token bank fair queuing (TBFQ), a soft scheduling algorithm that possesses these qualities. This algorithm is work-conserving and has a complexity of O(1). We focus on packet scheduling on a reservation-based TDMA/TDD wireless channel to service integrated real-time traffic. The TBFQ scheduling mechanism integrates the policing and servicing functions, and keeps track of the usage of each connection. We address the impact of TBFQ on mean packet delay, violation probability, and bandwidth utilization. We also demonstrate that due to its soft provisioning capabilities, the TBFQ performs rather well even when traffic conditions deviate from the established contracts.     

A bandwidth allocation algorithm with channel quality and QoS aware for IEEE 802.16 base stations

Subscriber stations located in different places encounter various interferences in an IEEE 802.16 network, resulting in that their communication channels experience varying channel conditions. Thus, an excellent bandwidth allocation algorithm should not only satisfy various QoS required by heterogeneous traffic, but also consider the channel quality to maximize bandwidth utilization. In this paper, a bandwidth allocation algorithm with channel quality awareness and QoS guarantee, called CQQ, is proposed. CQQ not only satisfies each connection's QoS requirement, but also dynamically adjusts the downlink/uplink bandwidth to match current downlink/uplink traffic ratio. CQQ allocates more bandwidth to the connections having better channel quality by applying weighted fair queuing strategy to raise the bandwidth usage. CQQ provides lower delay violation ratio and higher goodput than the previous algorithms, as observed from the simulation results. Copyright © 2012 John Wiley & Sons, Ltd.     

QoS-aware routing based on bandwidth estimation for mobile ad hoc networks

Routing protocols for mobile ad hoc networks (MANETs) have been explored extensively in recent years. Much of this work is targeted at finding a feasible route from a source to a destination without considering current network traffic or application requirements. Therefore, the network may easily become overloaded with too much traffic and the application has no way to improve its performance under a given network traffic condition. While this may be acceptable for data transfer, many real-time applications require quality-of-service (QoS) support from the network. We believe that such QoS support can be achieved by either finding a route to satisfy the application requirements or offering network feedback to the application when the requirements cannot be met. We propose a QoS-aware routing protocol that incorporates an admission control scheme and a feedback scheme to meet the QoS requirements of real-time applications. The novel part of this QoS-aware routing protocol is the use of the approximate bandwidth estimation to react to network traffic. Our approach implements these schemes by using two bandwidth estimation methods to find the residual bandwidth available at each node to support new streams. We simulate our QoS-aware routing protocol for nodes running the IEEE 802.11 medium access control. Results of our experiments show that the packet delivery ratio increases greatly, and packet delay and energy dissipation decrease significantly, while the overall end-to-end throughput is not impacted, compared with routing protocols that do not provide QoS support.     

A call admission control scheme for packet data in CDMA cellular communications

In wireless cellular communication systems, call admission control (CAC) is to ensure satisfactory services for mobile users and maximize the utilization of the limited radio spectrum. In this paper, we propose a new CAC scheme for a code division multiple access (CDMA) wireless cellular network supporting heterogeneous self-similar data traffic. In addition to ensuring transmission accuracy at the bit level, the CAC scheme guarantees service requirements at both the call level and the packet level. The grade of service (GoS) at the call level and the quality of service (QoS) at the packet level are evaluated using the handoff call dropping probability and the packet transmission delay, respectively. The effective bandwidth approach for data traffic is applied to guarantee QoS requirements. Handoff probability and cell overload probability are derived via the traffic aggregation method. The two probabilities are used to determine the handoff call dropping probability, and the GoS requirement can be guaranteed on a per call basis. Numerical analysis and computer simulation results demonstrate that the proposed CAC scheme can meet both QoS and GoS requirements and achieve efficient resource utilization.     

Quality of service management for IPTV services support in VANETs: a performance evaluation study

In order to deliver a qualitative Internet Protocol Television (IPTV) service over vehicular ad hoc networks (VANETs), a quality of service (QoS) mechanism is needed to manage the allocate of network resources to the diverse IPTV application traffic demands. Unlike other mobile network, VANETs have certain unique characteristic that presents several difficulties in providing an effective QoS. Similarly, IPTV requires a constant stream for QoS which at the moment is quite difficult due to the inherent VANET characteristics. To provide an effective QoS that will meet the IPTV application service demands, VANETs, must satisfy the compelling real-time traffic streaming QoS requirement (i.e., minimum bandwidth allocation, packet loss and jitter). In this report, we evaluate via simulation the feasibility of deploying quality IPTV services over VANETs, by characterizing the association between the IPTV streaming quality determining factors (i.e., throughput, delay, loss, jitter) and the IPTV quality degradation, with respect to node density and node velocity. Furthermore, we used an objective QoS metric (Media-Delivery-Index) to identify, locate and address the loss or out-of-order packet. We outline how, using these information’s can support in shaping network parameters to optimize service flows. The implementation assures a priority for handling IPTV traffic, such that maximise the usage of VANETs resources, and opens the possibility that loss and delay can be minimised to a degree that could guarantee quality IPTV service delivery among vehicle in a vehicular network system.

     

Cross-Layer optimization for LDPC-coded multirate multiuser systems with QoS constraints

In this paper, we propose a new multirate multiple-access wireless system implemented by variable spreading gain and chip-level random interleaving. The receiver employs a flexible chip-level iterative multiuser detection scheme where the variable spreading gain affects only the despreading parameters. Optimization across the physical and network layers in the uplink of such a system is treated. It is assumed that each user employs an low-density parity-check (LDPC) code to protect its data. At the physical layer, the quality of service (QoS) requirement is specified in terms of the target bit error rate (BER) of each user. Optimal user transmit powers are dynamically adjusted according to the current system load and the corresponding rate requirements. At the network layer, the QoS requirements include the call blocking probabilities, call connection delays, packet congestion probabilities and packet loss rates. To maximize the average revenue of the network subject to both call-level and packet-level QoS constraints, a multicriterion reinforcement learning (MCRL)-based adaptive call admission control (CAC) method is proposed that can easily handle multiple average QoS requirements. Unlike existing model-based approaches, the MCRL-based technique does not require the explicit knowledge of the state transition probabilities to derive the optimal policy. This feature is important when the number of states is so large that model-based optimization algorithms become infeasible, which is typically the case for a large integrated service network supporting a number of different service types.     

Providing deterministic packet delays and packet losses in multimedia wireless networks

‘Anytime, anywhere’ communication, information access and processing are much cherished in modern societies because of their ability to bring flexibility, freedom and increased efficiency to individuals and organizations. Wireless communications, by providing ubiquitous and tetherless network connectivity to mobile users, are therefore bound to play a major role in the advancement of our society. Although initial proposals and implementations of wireless communications are generally focused on near‐term voice and electronic messaging applications, it is recognized that future wireless communications will have to evolve towards supporting a wider range of applications, including voice, video, data, images and connections to wired networks. This implies that future wireless networks must provide quality‐of‐service (QoS) guarantees to various multimedia applications in a wireless environment. Typical traffic in multimedia applications can be classified as either Constant‐Bit‐Rate (CBR) traffic or Variable‐Bit‐Rate (VBR) traffic. In particular, scheduling the transmission of VBR multimedia traffic streams in a wireless environment is very challenging and is still an open problem. In general, there are two ways to guarantee the QoS of VBR multimedia streams, either deterministically or statistically. In particular, most connection admission control (CAC) algorithms and medium access control (MAC) protocols that have been proposed for multimedia wireless networks only provide statistical, or soft, QoS guarantees. In this paper, we consider deterministic QoS guarantees in multimedia wireless networks. We propose a method for constructing a packet‐dropping mechanism that is based on a mathematical framework that determines how many packets can be dropped while the required QoS can still be preserved. This is achieved by employing: (1) An accurate traffic characterization of the VBR multimedia traffic streams; (2) A traffic regulator that can provide bounded packet loss and (3) A traffic scheduler that can provide bounded packet delay. The combination of traffic characterization, regulation and scheduling can provide bounded loss and delay deterministically. This is a distinction from traditional deterministic QoS schemes in which a 0% packet loss are always assumed with deterministically bounding the delay. We performed a set of performance evaluation experiments. The results will demonstrate that our proposed QoS guarantee schemes can significantly support more connections than a system, which does not allow any loss, at the same required QoS. Moreover, from our evaluation experiments, we found that the proposed algorithms are able to out‐perform scheduling algorithms adopted in state‐of‐the‐art wireless MAC protocols, for example Mobile Access Scheme Based on Contention and Reservation for ATM (MASCARA) when the worst‐case traffic is being considered. Copyright © 2002 John Wiley & Sons, Ltd.     

Call admission control for QoS provisioning in 4G wireless networks: issues and approaches

This article presents a survey on the issues and the approaches related to designing call admission control schemes for fourth-generation wireless systems. We review the state of the art of CAC algorithms used in the traditional wireless networks. The major challenges in designing the CAC schemes for 4G wireless networks are identified. These challenges are mainly due to heterogeneous wireless access environments, provisioning of quality of service to multiple types of applications with different requirements, provisioning for adaptive bandwidth allocation, consideration of both call-level and packet-level performance measures, and consideration of QoS at both the air interface and the wired Internet. To this end, architecture of a two-tier CAC scheme for a differentiated services cellular wireless network is presented. The proposed CAC architecture is based on the call-level and packet-level QoS considerations at both the wireless and wired parts of the network. A performance analysis model for an example CAC scheme based on this architecture is outlined, and typical numerical results are presented.     

Cross-Layer MAC Protocol and Holistic Opportunistic Scheduling with Adaptive Power Control for QoS in WiMAX

Providing quality of service (QoS) to different service classes with integrated real-time and non-real-time traffic is an important issue in broadband wireless access networks. Opportunistic MAC (OMAC) is a novel view of communication over spatiotemporally varying wireless link whereby the multi-user diversity is exploited rather than combated to maximize bandwidth efficiency or system throughput. It combines cross-layer design features and opportunistic scheduling scheme to achieve high utilization while providing QoS support to various applications. Channel characteristics, traffic characteristics and queue characteristics are the essential factors in the design of opportunistic scheduling algorithms. In this paper, we propose a cross-layer MAC scheduling framework in WiMAX point-to-multipoint (PMP) systems and a corresponding opportunistic scheduling algorithm with an adaptive power control scheme to provide QoS support to the heterogeneous traffic. Extensive simulation experiments have been carried out to evaluate the performance of our proposal. The simulation results show that our proposed solution can improve the performance of the WiMAX PMP systems in terms of packet loss rate, packet delay and system throughput.     

Improving the efficiency of circuit-switched satellite networks bymeans of dynamic bandwidth allocation capabilities

Current satellite systems operate according to circuit switching transfer modes. To improve flexibility and efficiency, several kinds of packet switching systems have been proposed. However, it appears that full packet switches are still too complex and expensive to be implemented on board the satellites in the near future. For the time being, dynamic bandwidth allocation capabilities (DBAC) provide a compromise solution when satellite systems are based on classical circuit switches, since the DBAC payload allows changing dynamically the capacity of each connection, without teardown and setup. We consider a DBAC satellite system, and define algorithms to allocate the bandwidth so as to provide deterministic and statistical QoS guarantees. Standard dual leaky buckets (DLBs) regulate the traffic sources. We define bandwidth-handling policies, design connection admission control rules, and evaluate the system performance analytically. Results show a significant increase in bandwidth utilization of our system, when compared to a plain circuit switching solution     

End-to-End Adaptive QoS Provisioning over GPRS Wireless Mobile Network

The General Packet Radio Service (GPRS) offers performance guaranteed packet data services to mobile users over wireless frequency-division duplex links with time division multiple access, and core packet data networks. This paper presents a dynamic adaptive guaranteed Quality-of-Service (QoS) provisioning scheme over GPRS wireless mobile links by proposing a guaranteed QoS media access control (GQ-MAC) protocol and an accompanying adaptive prioritized-handoff call admission control (AP-CAC) protocol to maintain GPRS QoS guarantees under the effect of mobile handoffs. The GQ-MAC protocol supports bounded channel access delay for delay-sensitive traffic, bounded packet loss probability for loss-sensitive traffic, and dynamic adaptive resource allocation for bursty traffic with peak bandwidth allocation adapted to the current queue length. The AP-CAC protocol provides dynamic adaptive prioritized admission by differentiating handoff requests with higher admission priorities over new calls via a dynamic multiple guard channels scheme, which dynamically adapts the capacity reserved for dealing with handoff requests based on the current traffic conditions in the neighboring radio cells. Integrated services (IntServ) QoS provisioning over the IP/ATM-based GPRS core network is realized over a multi-protocol label switching (MPLS) architecture, and mobility is supported over the core network via a novel mobile label-switching tree (MLST) architecture. End-to-end QoS provisioning over the GPRS wireless mobile network is realized by mapping between the IntServ and GPRS QoS requirements, and by extending the AP-CAC protocol from the wireless medium to the core network to provide a unified end-to-end admission control with dynamic adaptive admission priorities.     

Analysis of Radio Resource Allocation in LTE Uplink

Long term evolution (LTE) uses orthogonal frequency division multiple access (OFDMA) and single carrier frequency division multiple access (SC-FDMA) as the downlink and uplink transmission schemes respectively. The Quality of Service (QoS) provision to users is one of the key objectives of the wireless network operators. This paper analyses an uplink LTE radio scheduler, called bandwidth and QoS aware (BQA) scheduler and evaluates its QoS performance. The BQA uplink scheduler is designed to provide efficient and fair allocation of the radio resources to users according to: the QoS of various traffic classes and the instantaneous channel conditions. The scheduler functionality is divided into time domain packet scheduling (TDPS) and frequency domain packet scheduling (FDPS). In this paper, an innovative feature, that is user QoS provisioning with dynamic QoS weights, is employed for the BQA scheduler along with multi-bearer users support. The QoS performance of the BQA scheduler is analyzed in several simulation scenarios using heterogeneous traffic environment. The results show that the BQA scheduler guarantees provision of QoS to users.     

Inter‐ONU Bandwidth Scheduling by Using Threshold Reporting and Adaptive Polling for QoS in EPONs

I dynamic bandwidth allocation (DBA) scheme, an inter–optical network unit (ONU) bandwidth scheduling, is presented to provide quality of service (QoS) to different classes of packets in Ethernet passive optical networks (EPONs). This scheme, referred to as TADBA, is based on efficient threshold reporting from, and adaptive polling order rearranging of, ONUs. It has been shown that the network resources are efficiently allocated among the three traffic classes by guaranteeing the requested QoS, adaptively rearranging the polling orders, and avoiding nearly all fragmentation losses. Simulation results using an OPNET network simulator show that TADBA performs well in comparison to the available allocation scheme for the given parameters, such as packet delay and channel utilization.     

Design of ATM Networks with Multiple Traffic Classes

In this paper, we propose a new heuristic design algorithm for the virtual path (VP)-based ATM network with multiple traffic classes, in which QoS constraints associated with traffic class are taken into account. The minimum bandwidth of VP required to carry given amount of traffic is obtained by utilizing an equivalent bandwidth concept, and the route of each VP is placed so that the network cost is minimized while the QoS requirement is fulfilled. To evaluate our design algorithm, we consider two kinds of traffic: voice traffic as low speed service and still picture traffic as high speed service. Through numerical examples, we demonstrate that our design method can achieve an efficient use of network resources, which results in providing a cost-effective VP-based ATM network.     

Bandwidth allocation in wireless networks with guaranteedpacket-loss performance

Providing quality-of-service (QoS) guarantees over wireless packet networks poses a host of technical challenges that are not present in wireline networks. One of the key issues is how to account for the characteristics of the time-varying wireless channel and for the impact of link-layer error control in the provisioning of packet-level QoS. We accommodate both aspects in analyzing the packet-loss performance over a wireless link. We consider the cases of a single and multiplexed traffic streams. The link capacity fluctuates according to a fluid version of Gilbert-Elliott channel model. Traffic sources are modeled as on-off fluid processes. For the single-stream case, we derive the exact packet-loss rate (PLR) due to buffer overflow at the sender side of the wireless link. We also obtain a closed-form approximation for the corresponding wireless effective bandwidth. In the case of multiplexed streams, we obtain a good approximation for the PLR using the Chernoff-dominant eigenvalue (CDE) approach. Our analysis is then used to study the optimal forward error correction code rate that guarantees a given PLR while minimizing the allocated bandwidth. Numerical results and simulations are used to verify the adequacy of our analysis and to study the impact of error control on the allocation of bandwidth for guaranteed packet-loss performance