WiMAX实时业务数据下行调度算法的仿真与改进

WiMAX是下一代无线城域网(WMAN)技术,支持实时与非实时等多种业务,由IEEE 802.16协议定义.协议定义了多种QoS调度类型,但并没有定义具体的带宽调度策略,而WiMAX的下行相对于上行来说是更容易造成传输瓶颈.文章提出一种针对实时业务流的优化方案,BS进行下行调度时对实时业务集中调度,根据网络状况对分组进行动态丢弃,大大减少了在网络拥挤情况下的带宽使用和分组延迟,优化了抖动,保证了更好的QoS.文中以VoIP业务为例对NS2进行仿真.仿真结果表明,通过对下行分组队列算法的合理优化,能更好地改善系统性能、提高吞吐量、减少时延和减少缓冲区需求.     

宽带CDMA网络非理想功率控制下的CAC策略

针对多媒体业务的CAC(call admission control)策略,给出了宽带CDMA(code division multiple access)网络中非理想功率控制下和外小区干扰因子对系统容量的影响分析.针对语音、视频和数据等多媒体业务的QoS(quality of service)要求,给出了一种基于QoS保证的CAC策略.仿真结果表明,非理想功率控制对系统容量有显著的影响,该策略能有效地保证不同业务的QoS需求,并明显地提高系统资源利用率.     

EPON系统中基于业务等级的动态带宽算法研究

本文针对EPON系统中上行链路的时分复用机制,提出了一种基于服务等级的动态带宽分配方案,通过自适应地改变权值及服务等级的阈值,以适应网络的状况,提高带宽利用率。通过这种方案,既保证了上行链路的高效利用,又保证了网络的性能,满足了网络业务的QoS要求。最后,通过实验证明了这种算法的正确性和可行性。     

EPON技术原理

EPON(以太网无源光网络)是面向下一代网络的接入技术,它是一个多业务平台,可以同时提供具有QoS(服务质量)保证的IP(互联网协议)业务和传统TDM(时分多路复用)业务.因此,采用EPON技术,运营商不仅可以在同一传输平台上根据用户的需要随时开通多种业务,而且易于向全IP业务网络过渡,为此介绍了EPON的体系结构,分析了EPON的上行链路和下行链路的传输原理.     

一种新的EPON上行动态带宽分配算法与仿真

为了合理分配EPON上行信道带宽,提出一种能够区分服务等级的固定周期轮询动态带宽分配算法。该算法将光网络单元(ONU)的业务分为三个等级,根据不同的业务等级动态分配上行带宽,有效保证整个EPON网络的QoS以及带宽分配的公平性。同时,为了进一步提高EPON系统上行链路的带宽利用率,克服算法产生的idle time问题,对算法进行了改进。最后,对该算法进行仿真实验。     

3G中的QoS结构及无线资源分配策略

在3G（第3代移动通信系统）中，为了给不同类型的业务提供不同级别的端到端QoS，网络资源必须进行合理分配。QoS和资源分配是密不可分的，而无线资源分配显得尤为重要。文中提出了UMTS的QoS结构，分3部分对空中接口部分的QoS（即无线资源分配策略问题）进行了讨论：首先提出了一种RRA算法，接着讨论了W－CDMA和TD－CDMA系统的无线资源分配问题，最后讨论了下行链路及上行链路的呼叫允许控制（CAC）。     

一种新的支持多业务的CDMA网络可升降级动态带宽分配与优化策略

未来无线通信网络的主要发展方向是支持多种业务.在3GPP对UMTS的规范中,将业务按其属性对服务质量(Quality of Service,QoS)要求的不同分为4类:会话类、流媒体类、交互类和背景类,除话音业务外其余3种业务都是可变比特速率业务.对该网络用户资源分配(主要是带宽的分配)若采用传统的固定分配方法,必定陷入资源利用率低下和用户QoS得不到保障的两难境地.本文针对宽带CDMA网络,提出了一种针对无线多媒体业务的动态带宽分配与优化策略,在保证用户QoS的前提下,尽可能提高资源利用率.仿真结果表明,对比传统的网络资源管理策略,该策略大大改善了系统的性能,提高了系统资源利用率.     

支持QoS的LTE MIMO下行链路资源调度算法研究

论文针对LTE(Long Term Evolution)下行链路MIMO空分复用技术选择的问题进行研究。着重分析了不同的业务类型及其QoS对时延、误码率等因素的要求,并结合LTE下行链路中每个TTI内每个用户只能选择一种MIMO模式的限制,提出了一个优化的MIMO下行链路资源调度算法(QoS-DMO),该算法将时频资源调度算法扩展到空域资源的分配,从而实现了对LTE系统资源时-频-空域三维的调度。并通过仿真结果证明:与DMO算法相比,QoS-DMO算法在确保系统吞吐量不受较大影响的前提下,在满足业务QoS要求方面有了显著的提高。     

LTE-Advanced下行链路动态调度研究

无线资源管理算法对于优化LTE-Advanced系统容量和终端用户性能是非常重要的。网络算法没有实现标准化,但网络供应商和运营商可以根据需要设计和调整算法。要提供蜂窝所需的QoS,动态分组调度和链路自适应是确保高频谱效率的关键特征。通过引入第2层调度与链路自适应框架,阐述了频域分组调度原理,提出了时域和频域联合调度算法,介绍了采用MIMO的分组调度技术,评估了下行链路分组调度性能。     

诺基亚:HSDPA/HSUPA使移动IP多媒体梦想成真

移动网络上的数字内容,和把不同媒体和服务混合到同一会话里的基于IP的个人对个人通信内容的提交,带来了额外的网络话务量和收入。通信中使用的数据量比收入增长得更快,这促使运营商优化其网络来支持主导传输类型。当下行链路足以满足内容对个人的服务的时候,实时交互和个人对个人的基于IP的服务提出了优化上行链路的需求。HSDPA/HSUPA是什么?HSDPA(高速下行链路分组接入和H S U P A(高速上行链路分组接入这两个关键技术,提供了突破性的数据速度——理论上达到了下行链路14.Mbps,上行链路5.8Mbps,明显高于先进的3G网络。对用户来…     

Fair Class-Based Downlink Scheduling with Revenue Considerations in Next Generation Broadband Wireless Access Systems

The success of emerging Broadband Wireless Access Systems (BWASs) will depend, among other factors, on their ability to manage their shared wireless resources in the most efficient way. This is a complex task due to the heterogeneous nature, and hence, diverse Quality of Service (QoS) requirements of different applications that these systems support. Therefore, QoS provisioning is crucial for the success of such wireless access systems. In this paper, we propose a novel downlink packet scheduling scheme for QoS provisioning in BWASs. The proposed scheme employs practical economic models through the use of novel utility and opportunity cost functions to simultaneously satisfy the diverse QoS requirements of mobile users and maximize the revenues of network operators. Unlike existing schemes, the proposed scheme is general and can support multiple QoS classes with users having different QoS and traffic demands. To demonstrate its generality, we show how the utility function can be used to support three different types of traffic, namely best-effort traffic, traffic with minimum data rate requirements, and traffic with maximum packet delay requirements. Extensive performance analysis is carried out to show the effectiveness and strengths of the proposed packet scheduling scheme.     

Fair resource allocation with guaranteed statistical QoS for multimedia traffic in wideband CDMA cellular network

A dynamic fair resource allocation scheme is proposed to efficiently support real-time and non-real-time multimedia traffic with guaranteed statistical quality of service (QoS) in the uplink of a wideband code-division multiple access (CDMA) cellular network. The scheme uses the generalized processor sharing (GPS) fair service discipline to allocate uplink channel-resources, taking into account the characteristics of channel fading and intercell interference. In specific, the resource allocated to each traffic flow is proportional to an assigned weighting factor. For real-time traffic, the assigned weighting factor is a constant in order to guarantee the traffic statistical delay bound requirement; for non-real-time traffic, the assigned weighting factor can be adjusted dynamically according to fading, channel states and the traffic statistical fairness bound requirement. Compared with the conventional static-weight scheme, the proposed dynamic-weight scheme achieves capacity gain. A flexible trade-off between the GPS fairness and efficient resource utilization can also be achieved. Analysis and simulation results demonstrate that the proposed scheme enhances radio resource utilization and guarantees statistical QoS under different fairness bound requirements.     

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.     

QoS control in the 3GPP evolved packet system

In this article we describe the QoS concept of the evolved packet system, which was standardized in 3GPP Release 8. The concept provides access network operators and service operators with a set of tools to enable service and subscriber differentiation. Such tools are becoming increasingly important as operators are moving from a single to a multi-service offering at the same time as both the number of mobile broadband subscribers and the traffic volume per subscriber is rapidly increasing. The ?bearer? is a central element of the EPS QoS concept and is the level of granularity for bearer-level QoS control. The network-initiated QoS control paradigm specified in EPS is a set of signaling procedures for managing bearers and controlling their QoS assigned by the network. The EPS QoS concept is class-based, where each bearer is assigned one and only one QoS class identifier by the network. The QCI is a scalar that is used within the access network as a reference to node-specific parameters that control packet forwarding treatment. This class-based approach, together with the network-initiated QoS control paradigm, gives network operators full control over the QoS provided for its offered services for each of its subscriber groups.     

Energy-efficient and QoS-aware discontinuous reception using a multi-cycle mechanism in 3GPP LTE/LTE-advanced

In the paper we present a novel energy-efficient and Quality-of-Service (QoS)-aware Discontinuous Reception (DRX) scheme by using a multi-cycle mechanism for the Long Term Evolution (LTE) networks. The proposed scheme is capable of improving the power-saving efficiency while simultaneously meeting the specific QoS requirements by dynamically tuning the DRX parameters according to the traffic intensity. It is a table-driven method which off-line pre-establishes the optimal DRX parameters corresponding to the traffic intensities and different QoS requirements such as the packet delays and packet loss rates based on a theoretical analysis approach. At runtime, the DRX parameters of each User Equipment (UE) can be determined optimally with a simple table lookup without spending much computational time and resource. The analytical model is validated against simulation experiments. Based on the analysis results, the power-saving efficiency of our proposed multi-cycle DRX scheme can be effectively boosted by about 37 % comparing to that of the typical DRX scheme while simultaneously meeting the specific QoS requirements like the packet delays and packet loss rates under the scenarios with different traffic intensities.     

An efficient resource allocation to improve QoS of 5G slicing networks using general processor sharing‐based scheduling algorithm

Fifth generation (5G) slicing is an emerging technology for software‐defined networking/network function virtualization–enabled mobile networks. Improving the utilization and throughput to meet the quality of service (QoS) requirements of 5G slicing is very important for the operators of mobile networks. With growing data traffic from different applications of numerous smart mobile devices having several QoS requirements, we expect networks to face problems of congestion and overload that prevent the effective functioning of a radio access network (RAN). This paper proposes a more effective packet‐based scheduling scheme for data traffic by 5G slicing with two operation modes for improving the resource utilization of 5G cloud RAN and providing an efficient isolation of the 5G slices. These two operation modes are referred to as static sharing resource (SSR) scheme and dynamic sharing resources (DSR) scheme. The SSR scheme is a modified version of an existing method. The goal of this approach is to reallocate the shared available resources of 5G network fairly and maximize the utilization of bandwidth while protecting a 5G slice from overwhelming other 5G slices. Throughput and delays of the system model are also discussed to show its performance limits. On the basis of the simulation outcomes, we observed that the proposed DSR scheme outperforms the SSR scheme in terms of provided delay and throughput. In addition, the token bucket parameters together with the assigned capacity weight for each slice can be selected and configured based on the required QoS. Finally, a good estimate for the maximum delay bounds of the slices is provided by the derived theoretical delay bound.     

基于能效的NOMA蜂窝车联网动态资源分配算法

在支持车与车直接通信(V2V)的非正交多址接入(NOMA)蜂窝网络场景下,针对V2V用户与蜂窝用户的干扰以及NOMA准则下的功率分配问题,该文提出一种基于能效的动态资源分配算法。该算法首先为了保证V2V用户的时延及可靠性同时满足蜂窝用户的速率需求,联合考虑子信道调度、功率分配和拥塞控制,建立了最大化系统能效的随机优化模型。其次,利用李雅普诺夫随机优化方法,通过控制可接入数据量保证队列稳定性以避免网络拥塞,并根据实时网络负载状态动态地进行资源调度,设计一种次优化子信道匹配算法获得用户调度方案,进一步,利用凸优化理论和拉格朗日对偶分解方法得到功率分配策略。最后,仿真结果表明,该文算法可以满足不同用户的服务质量(QoS)需求,并在保证网络稳定性前提下提高系统能效。     

QoS‐based radio network dimensioning for LTE networks with heavy real‐time traffic

Applications of video streaming and real‐time gaming, which generate large amounts of real‐time traffic in the network, are expected to gain considerable popularity in Long Term Evolution networks. Maintaining the QoS such as packet delay, packet loss ratio, median, and cell border throughput requirements in networks dominated by real time traffic, is critical. The existing dimensioning methodology does not consider QoS parameters of real‐time traffic in network dimensioning. Moreover, exhaustive and time‐consuming simulations are normally required to evaluate the performance and QoS of real‐time services. To overcome this problem, we propose an improved radio network dimensioning framework that considers the QoS of real‐time traffic in network dimensioning. In this framework, an analytical model is proposed to evaluate the capacity and performance of real‐time traffic dominant Long Term Evolution networks. The proposed framework provides a fast and accurate means of finding the trade‐off between system load, packet delay, packet loss ratio, required median, and cell border throughput. It also provides network operators with an analytical means for obtaining the minimum number of sites required by jointly considering coverage, capacity and QoS requirements. The accuracy of the proposed model is validated through simulations. Copyright © 2012 John Wiley & Sons, Ltd.     

Network queue scheduling algorithm based on self-similar traffic level grading prediction

Self-similarity characteristic of network traffic will lead to the continuous burstness of data in the network.In order to effectively reduce the queue delay and packet loss rate caused by network traffic burst,improve the transmission capacity of different priority services,and guarantee the service quality requirements,a queue scheduling algorithm P-DWRR based on the self-similarity of network traffic was proposed.A dynamic weight allocation method and a service quantum update method based on the self-similar traffic level grading prediction results were designed,and the service order of the queue according was determined to the service priority and queue waiting time,so as to reduce the queuing delay and packet loss rate.The simulation results show that the P-DWRR algorithm can reduce the queueing delay,delay jitter and packet loss rate on the basis of satisfying the different service priority requirements of the network,and its performance is better than that of DWRR and VDWRR.     

Radio resource management for cellular CDMA systems supporting heterogeneous services

A novel radio resource management (RRM) scheme for the support of packet-switched transmission in cellular CDMA systems is proposed by jointly considering the physical, link, and network layer characteristics. The proposed resource management scheme is comprised of a combination of power distribution, rate allocation, service scheduling, and connection admission control. Power distribution allows individual connections to achieve their required signal-to-interference-plus-noise ratio, while rate allocation guarantees the required delay/jitter for real-time traffic and the minimum transmission rate requirement for non-real-time traffic. Efficient rate allocation is achieved by making use of the randomness and burstiness; of the packet generation process. At the link layer, a packet scheduling scheme is developed based on information derived from power distribution and rate allocation to achieve quality of service (QoS) guarantee. Packet scheduling efficiently utilizes the system resources in every time slot and improves the packet throughput for non-real-time traffic. At the network layer, a connection admission control (CAC) scheme based on the lower layer resource allocation information is proposed. The CAC scheme makes use of user mobility information to reduce handoff connection dropping probability (HCDP). Theoretical analysis of the grade of service performance, in terms of new connection blocking probability, HCDP, and resource utilization, is given. Numerical results show that the proposed RRM scheme can achieve both effective QoS guarantee and efficient resource utilization.