一种基于无线多媒体业务的可升降级QoS动态带宽分配与优化策略

无线多媒体网络中的业务包括话音、流媒体、交互类和背景类业务4种,除话音业务外其余3种业务都是可变比特速率业务。对该网络用户资源分配(主要是带宽的分配)若采用传统的固定分配方法,必定陷入资源利用率低下和用户QoS得不到保障的两难境地。该文提出了一种基于无线多媒体业务的动态带宽分配与优化策略,在保证用户QoS的前提下,尽可能提高资源利用率。该文分别从网络和用户两个角度考虑,通过系统容量、业务阻塞率、数据延迟、流媒体的实际传输比和VBR业务综合服务等级等参数,对可升降级QoS无线多媒体网络进行了仿真分析,结果表明,对比传统的网络资源管理策略,该策略大大改善了系统的性能,提高了系统资源利用率。     

无线多媒体业务QoS性能优化

首先简要介绍无线多媒体网络中的业务包括语音业务、流媒体业务、交互类业务和背景类业务4种.接着对影响无线多媒体业务QoS性能的三个主要因素(时延、抖动和丢包)进行分析,最后提出利用无线多媒体业务的可升降级QoS动态带宽分配与优化策略来保障用户的QoS和提高带宽资源的利用率.     

无线多媒体业务QoS性能优化

首先简要介绍无线多媒体网络中的语音业务、流媒体业务、交互类业务和背景类业务4种,接着对影响无线多媒体业务QoS性能的三个主要因素(时延、抖动和丢包)进行分析,最后提出利用无线多媒体业务的可升降级QoS动态带宽分配与优化策略来保障用户的QoS、提高带宽资源的利用率。     

基于动态最大传输窗口的带宽分配算法研究

数据业务和话音业务是未来网络中两个重要业务.作为下一代宽带接入的有效解决方案,以太网无源光网络(EPON)为用户提供了业务接口.对EPON中的上行带宽分配算法进行了分析研究,并提出一种基于动态最大传输窗口 DMTW 的 EPON 上行带宽分配算法.在本算法中根据业务和用户的优先级动态调整最大的传输窗口,合理分配上行带宽的资源,提高信道利用率和QoS,降低了传输时延.最后通过软件进行仿真,验证了算法的有效性.     

一种基于网络优化的动态信道分配策略

该文提出了一种在CDMA网络中基于网络优化的动态信道分配策略,它针对恒定比特率(CBR)业务建立了一种整数规划的数学模型,它不是每个时隙进行一次信道分配而是若干个时隙根据当前所有用户的状态统筹做一次调度,目的是使得用户QoS和系统性能得到折中考虑。通过仿真,相对于传统话音优先和按照优先级排队的分配算法,这种优化算法在保证业务的QoS的同时使得信道利用率得到提高。     

一种保证EPON系统QoS的预估DBA算法

文章提出一种保证以太无源光网络(EPON)系统服务质量(QoS)的预估动态带宽分配(DBA)算法,该算法把多个子周期组合为一个超周期,在超周期中预估各级业务带宽,然后在子周期内参考预估值进行带宽分配;并对用户上行数据进行接入管理,维持QoS的稳定.实验结果表明,该算法既能保证各级业务的带宽利用率和时延要求,又能提供更加稳定的QoS.     

一种新的基于GPON的动态带宽分配算法

为了实现吉比特无源光网络(GPON)带宽分配的公平性,降低网络的丢包率及传输延时,文章研究了GPON系统传输汇聚层的帧结构及动态带宽分配的实现方法,提出了一种新的动态带宽分配(DBA)算法--基于QoS的二层动态带宽分配算法.基本思路是根据不同等级业务的带宽需求,在PON层和ONU层分别进行带宽的合理分配.理论分析和仿真试验证明,这种算法可以提高带宽的利用率,保证不同业务的不同时延要求,并且对不同用户和不同等级的业务都具有很好的公平性.     

一种新的基于认购速率和QoS等级的动态带宽分配算法

为了实现吉比特无源光网络带宽分配的公平性,降低网络的传输延时,设计了一种新的媒质访问控制协议,提出了一种新的动态带宽分配算法.其基本思想是:在保证拥有不同QoS业务的用户得到认购速率的基础上,根据网络负载的大小,动态地将某些用户未使用的带宽分配给其他带宽需求大的用户,以提高网络的带宽利用率.仿真结果表明,这种新的算法在严格控制数据传输延时的前提下,能够保证多用户之间带宽分配的公平性.     

EPON动态带宽分配算法及仿真

对当前EPON(Ethernet Passive Optical Network)系统中比较经典的动态带宽分配算法进行简要分析,提出了一种支持QoS(Quality of Service)的动态带宽分配算法.算法动态确定轮询周期,充分保证了高优先级业务所需的带宽,同时考虑到了剩余带宽的再分配.仿真结果表明,该算法提高了系统的带宽利用率,提供了更加稳定的QoS.     

基于多门限预留机制的自适应带宽分配算法

针对异构无线网络融合环境提出了一种基于多门限预留机制的自适应带宽分配算法,从而为多业务提供QoS保证。该算法采用多宿主传输机制,通过预设各个网络中不同业务的带宽分配门限,并基于各个网络中不同业务和用户的带宽分配矩阵,根据业务k支持的传输速率等级需求和网络状态的变化,将自适应带宽分配问题转化为一个动态优化问题并采用迭代方法来求解,在得到各个网络中不同业务和用户优化的带宽分配矩阵的同时,在带宽预留门限和网络容量的约束条件下实现网络实时吞吐量的最大化,以提高整个异构网络带宽的利用效率。数值仿真结果显示,所提算法能够支持满足QoS需求的传输速率等级,减小了新用户接入异构网络的阻塞概率,提高了平均用户接入率并将网络吞吐量最大提高40%。     

Cross-layer resource allocation for integrated Voice/Data traffic in wireless cellular networks

A major task in next-generation wireless cellular networks is provisioning of quality of service (QoS) over the bandwidth limited and error-prone wireless link. In this paper, we propose a cross-layer design scheme to provide QoS for voice and data traffic in wireless cellular networks with differentiated services (DiffServ) backbone. The scheme combines the transport layer protocols and link layer resource allocation to both guarantee the QoS requirements in the transport layer and achieve efficient resource utilization in the link layer. Optimal resource allocation problems for voice and data flows are formulated to guarantee pre-specified QoS with minimal required resources. For integrated voice/data traffic in a cell, a hybrid time-division/code-division medium access control (MAC) scheme is presented to achieve efficient multiplexing. Theoretical analysis and simulation results demonstrate the effectiveness of the proposed cross-layer approach.     

An optimal solution to resource allocation among soft QoS traffic in wireless network

Optimization theory and nonlinear programming method have successfully been applied into wire‐lined networks (e.g., the Internet) in developing efficient resource allocation and congestion control schemes. The resource (e.g., bandwidth) allocation in a communication network has been modeled into an optimization problem: the objective is to maximize the source aggregate utility subject to the network resource constraint. However, for wireless networks, how to allocate the resource among the soft quality of service (QoS) traffic remains an important design challenge. Mathematically, the most difficult comes from the non‐concave utility function of soft QoS traffic in the network utility maximization (NUM) problem. Previous result on this problem has only been able to find its sub‐optimal solution. Facing this challenge, this paper establishes some key theorems to find the optimal solution and then present a complete algorithm called utility‐based allocation for soft QoS to obtain the desired optimal solution. The proposed theorems and algorithm act as designing guidelines for resource allocation of soft QoS traffic in a wireless network, which take into account the total available resource of network, the users’ traffic characteristics, and the users’ channel qualities. By numerical examples, we illustrate the explicit solution procedures.Copyright © 2013 John Wiley & Sons, Ltd.     

Dynamic-Grouping bandwidth reservation scheme for multimedia wireless networks

In wireless networks carrying multimedia traffic (voice, video, data, and image), it becomes necessary to provide a quality-of-service(QoS) guarantee for multimedia traffic connections supported by the network. In order to provide mobile hosts with high QoS in the next-generation wireless networks, efficient and better bandwidth reservation schemes must be designed. This paper presents a novel dynamic-grouping bandwidth reservation scheme as a solution to support QoS guarantees in the next-generation wireless networks. The proposed scheme is based on the probabilistic resource estimation to provide QoS guarantees for multimedia traffic in wireless cellular networks. We establish several reservation time sections, called groups, according to the mobility information of mobile hosts of each base station. The amount of reserved bandwidth for each base station is dynamically adjusted for each reservation group. We use the dynamic-grouping bandwidth reservation scheme to reduce the connection blocking rate and connection dropping rate, while increasing the bandwidth utilization. The simulation results show that the dynamic-grouping bandwidth reservation scheme provides less connection-blocking rate and less connection-dropping rate and achieves high bandwidth utilization.     

Cross-layer resource allocation for QoS guarantee with finite queue constraint in multirate OFDMA wireless networks

Efficient radio resource allocation is essential to provide quality of service （QoS） for wireless networks. In this article, a cross-layer resource allocation scheme is presented with the objective of maximizing system throughput, while providing guaranteed QoS for users. With the assumption of a finite queue for arrival packets, the proposed scheme dynamically a/locates radio resources based on user＇s channel characteristic and QoS metrics derived from a queuing model, which considers a packet arrival process modeled by discrete Markov modulated Poisson process （dMMPP）, and a multirate transmission scheme achieved through adaptive modulation. The cross-layer resource allocation scheme operates over two steps. Specifically, the amount of bandwidth allocated to each user is first derived from a queuing analytical model, and then the algorithm finds the best subcarrier assignment for users. Simulation results show that the proposed scheme maximizes the system throughput while guaranteeing QoS for users.     

Optimal resource allocation and adaptive call admission control for voice/data integrated cellular networks

Resource allocation and call admission control (CAC) are key management functions in future cellular networks, in order to provide multimedia applications to mobiles users with quality of service (QoS) guarantees and efficient resource utilization. In this paper, we propose and analyze a priority based resource sharing scheme for voice/data integrated cellular networks. The unique features of the proposed scheme are that 1) the maximum resource utilization can be achieved, since all the leftover capacity after serving the high priority voice traffic can be utilized by the data traffic; 2) a Markovian model for the proposed scheme is established, which takes account of the complex interaction of voice and data traffic sharing the total resources; 3) optimal CAC parameters for both voice and data calls are determined, from the perspective of minimizing resource requirement and maximizing new call admission rate, respectively; 4) load adaption and bandwidth allocation adjustment policies are proposed for adaptive CAC to cope with traffic load variations in a wireless mobile environment. Numerical results demonstrate that the proposed CAC scheme is able to simultaneously provide satisfactory QoS to both voice and data users and maintain a relatively high resource utilization in a dynamic traffic load environment. The recent measurement-based modeling shows that the Internet data file size follows a lognormal distribution, instead of the exponential distribution used in our analysis. We use computer simulations to demonstrate that the impact of the lognormal distribution can be compensated for by conservatively applying the Markovian analysis results.     

Joint resource allocation for WLAN&WCDMA integrated networks based on spectral bandwidth mapping

Next wireless network aims to integrate heterogeneous wireless access networks by sharing wireless resource. The spectral bandwidth mapping concept is proposed to uniformly describe the resource in heterogeneous wireless networks. The resources of codes and power levels in WCDMA system as well as statistical time slots in WLAN are mapped into equivalent bandwidth which can be allocated in different networks and layers. The equivalent bandwidth is jointly distributed in call admission and vertical handoff control process in an integrated WLAN/WCDMA system to optimize the network utility and guarantee the heterogeneous QoS required by calls. Numerical results show that, when the incoming traffic is moderate, the proposed scheme could receive 5%?C10% increase of system revenue compared to the MDP based algorithms.     

Integrating Distributed Channel Allocation and Adaptive Handoff Management for QoS-Sensitive Cellular Networks

Next generation high-speed cellular networks are expected to support multimedia applications, which require QoS provisions. Since frequency spectrum is the most expensive resource in wireless networks, it is a challenge to support QoS using limited frequency spectrum. In the literature, two orthogonal approaches are used to address the bandwidth utilization issue and the QoS provision issue; that is, channel allocation schemes have been proposed to improve bandwidth efficiency, whereas handoff management schemes, based on bandwidth reservation, have been proposed to guarantee a low connection dropping rate. However, little effort has been taken to address both issues together. In this paper, we integrate distributed channel allocation and adaptive handoff management to provide QoS guarantees and efficiently utilize the bandwidth. First, we present a complete distributed distributed channel allocation algorithm and propose techniques to reduce its message complexity and intra-handoff overhead. Second, we integrate the proposed distributed channel allocation algorithm with an adaptive handoff management scheme to provide QoS guarantees and efficiently utilize the bandwidth. Detailed simulation experiments are carried out to evaluate the proposed methodology. Compared to previous schemes, our scheme can significantly reduce the message complexity and intra-handoff overhead. Moreover, the proposed scheme can improve the bandwidth utilization while providing QoS guarantees.     

TCP-Aware Uplink Scheduling for IEEE 802.16

In IEEE 802.16 networks, a bandwidth request-grant mechanism is used to accommodate various QoS requirements of heterogeneous traffic. However, it may not be effective for TCP flows since (a) there is no strict QoS requirement in TCP traffic; and (b) it is difficult to estimate the amount of required bandwidth due to dynamic changes of the sending rate. In this letter, we propose a new uplink scheduling scheme for best-effort TCP traffic in IEEE 802.16 networks. The proposed scheme does not need any bandwidth request process for allocation. Instead, it estimates the amount of bandwidth required for a flow based on its current sending rate. Through simulation, we show that the proposed scheme is effective to allocate bandwidth for TCP flows