QoE-Aware Proportional Fair Scheduling for Multiuser Multiservice Wireless Networks

The effective radio resource allocation al-gorithms, which satisfy diversiform requirements of mobile naltimedia services in wireless cellular net-works, have recently attracted more and more at-tention. This paper proposes a service-aware scheduling algorithm, in which the Mean Opinion Score （MOS） is chosen as the unified metric of the Quality of Experience （QoE）. As the network needs to provide satisfactory services to all the users, the fairness of QoE should be considered. The Propor- tional Fair （PF） principle is adopted to achieve the trade-off between the network perfonmnce and us- er fairness. Then, an integer progranming problem is formed and the QoE-aware PF scheduling princi-ple is derived by solving the relaxed problem. Simu-lation results show that the proposed scheduling principle can perform better in terms of user fair-ness than the previous principle maximizing the sum of MOS. It also outperfoms the max-rain scheduling principle in terms of average MOS.

User Fairness Scheme with Proportional Fair Scheduling in Multi-user MIMO Limited Feedback System

In Multi-user MIMO (MU-MIMO) downlink system, suitable user selection schemes can improve spatial diversity gain. In most of previous studies, it is always assumed that the base station (BS) knows full channel state information (CSI) of each user, which does not consider the reality. However, there are only limited feedback bits in real system. Besides, user fairness is often ignored in most of current user selection schemes. To discuss the user fairness and limited feedback, in this paper, the user selection scheme with limited feedback bits is proposed. The BS utilizes codebook precoding transmitting strategy with LTE codebook. Furthermore, this paper analyzes the influence of the number of feedback bits and the number of users on user fairness and system sum capacity. Simulation results show that in order to achieve better user fairness, we can use fewer bits for feedback CSI when the number of user is small, and more feedback bits when the number of users is large.

A New Fairness-Oriented Packet Scheduling Scheme with Reduced Channel Feedback for OFDMA Packet Radio Systems

In this paper, we propose a flexible and fairness-oriented packet scheduling approach for 3GPP UTRAN long term evolution (LTE) type packet radio systems, building on the ordinary proportional fair (PF) scheduling principle and channel quality indicator (CQI) feedback. Special emphasis is also put on practical feedback reporting mechanisms, including the effects of mobile measurement and estimation errors, reporting delays, and CQI quantization and compression. The performance of the overall scheduling and feedback re-porting process is investigated in details, in terms of cell throughput, coverage and resource allocation fairness, by using extensive quasistatic cellular system simulations in practical OFDMA system environment with frequency reuse of 1. The performance simulations show that by using the proposed modified PF ap-proach, significant coverage improvements in the order of 50% can be obtained at the expense of only 10-15% throughput loss, for all reduced feedback reporting schemes. This reflects highly improved fairness in the radio resource management (RRM) compared to other existing schedulers, without essentially com-promising the cell capacity. Furthermore, we demonstrate the improved functionality increase in radio re-source management for UE’s utilizing multi-antenna diversity receivers.

PFS在分布式移动通信系统中的应用研究

为提高分布式移动通信系统的空间资源利用率，在并行调度思想的指导下，提出了并行比例公平调度（PPFS）方法，该方法可在取得多用户分集增益的基础上取得复用增益，进一步提高了系统的吞吐量。仿真结果表明，在分布式移动通信系统中，PPFS不仅能够为用户提供更多的接入机会，获得更高的平均系统吞吐量，并且较好地继承了比例公平调度（PFS）算法的良好的公平性性能。

ENERGY-SAVING SCHEDULING FOR LTE MULTICAST SERVICES

In the Long Term Evolution(LTE)downlink multicast scheduling,Base Station(BS)usually allocates transmit power equally among all Resource Blocks(RBs),it may cause the waste of transmit power.To avoid it,this paper put forward a new algorithm for LTE multicast downlink scheduling called the Energy-saving based Inter-group Proportional Fair(EIPF).The basic idea of EIPF is to calculate an appropriate transmitting power for each group according to its data rate respectively,and then follow the inter-group proportional fair principle to allocate RBs among multicast groups.The results of EIPF simulation show that the proposed algorithm not only can reduce the transmit power of BS effectively but also improve the utilization rate of energy.

The proportional fairness scheduling algorithm on multi-classes

In this paper, we study resource management models and algorithms that satisfy multiple performance objects simultaneously. We realize the proportional fairness principle based QoS model, which defines both delay and loss rate requirements of a class, to include fairness, which is important for the integration of multiple service classes. The resulting Proportional Fairness Scheduling model formalizes the goals of the network performance, user’s QoS requirement and system fairness and exposes the fundamental tradeoffs between these goals. In particular, it is difficult to simultaneously provide these objects. We propose a novel scheduling algorithm called Proportional Fairness Scheduling (PFS) that approximates the model closely and efficiently. We have implemented the PFS scheduling in Linux. By performing simulation and measurement experiments, we evaluate the delay and loss rate proportional fairness of PFS, and determine the computation overhead.

1xEV-DO Rev A中PF调度算法的实现

分析1xEV-DO Rev A中PDMA等技术对PF调度算法的影响,给出算法的具体实现方法,通过仿真实验研究其性能。实验结果表明,包分复用、HARQ等技术的引入可以使PF算法在1xEV-DO Rev A中获得较好的前向链路吞吐率,更好地满足实时业务的延迟需求。

The Effects of Filtered Channel Quality Feedback on Throughput of Proportional Fair Algorithm

The throughput (total bit per second per hertz) of a modified Proportional Fair Algorithm (PFA) is analyzed and computed. The modified PFA introduces a dynamic threshold to filter the feedbacks of Channel Quality (CQ) based on which the users' priorities are calculated for scheduling. Only those in good CQs (relative to their own average CQ) can be the candidates for scheduling. The results show that the modified PFA with a low CQ threshold can not only reduce some feedback overhead but also maintain the throughput of traditional PFA. Interestingly, for a certain combination of system parameters, the throughput gain over traditional PFA can be achieved by this modified PFA. Two methods of calculating priority, one based on signal to noise ratio, and the other on information rate, are considered. Their performances are generally similar in terms of throughput.

基于强化学习的异构业务资源分配方法

在5G及之后的无线网络中,增强移动宽带(enhanced mobile broadband,eMBB)和超可靠低延迟通信(ultra-reliable low-latency communication,URLLC)是具有不同服务质量需求的两种核心业务,如何利用有限的无线电资源实现两种业务的异构共存是一个具有挑战性的问题。文章基于3GPP所提出的穿孔技术,提出了一种智能资源分配框架,将eMBB/URLLC的资源分配问题建模为在满足URLLC可靠性约束的前提下,最大化eMBB用户数据速率的优化问题;同时考虑到无线信道的不确定性和URLLC随机穿孔的影响,引入比例公平(proportional fairness,PF)算法在总吞吐量和用户公平性之间作出权衡,提出一种基于比例公平的深度强化学习算法(proportional fairness-twin delayed deep deterministic policy gradient algorithm,PF-TD3A)智能地为两种业务分配资源。实验结果表明,所提出的算法能够在达到较好的eMBB可靠性要求的同时,进一步增大eMBB用户数据速率,平均提升约为7.4%。

Improved proportional fair dynamic subcarrier allocation with frugality constraint for SC-FDMA system

With the objective of taking full use of channel resource, we proposed two utility based dynamic subcarrier allocation （DSA） algorithms for the single carrier frequency division multiple access （SC-FDMA） system, which are the proportional fair frugality constrained （PF-FC） algorithm and the weighted proportional fair frugality constrained （WPF-FC） algorithm. The two proposed algorithms are designed under the frugality constraint （FC） control consideration so as to avoid service rate waste and improve the spectrum efficiency. Moreover, the queuing buffer model in this paper is established on a finite size structure rather than the traditional infinite queuing manner, which is more consistent with the practical transmission condition. Simulation results indicate that the two proposed algorithms can both achieve significantly better system rate-sum capacity and quality of service （QoS） performance than their primary algorithms, and are more applicable for the heterogeneous traffic.

Joint relay selection and power allocation algorithm in two-way relay networks with proportional fair constraint

In this paper, we consider the joint relay selection and power allocation problem for two-way relay systems with multiple relay nodes. Traditionally, relay selection schemes are primarily focused on selecting one relay node to maximize the transmission sum rate or minimize the outage probability. If so, it is possible to cause certain relay nodes overloaded. In addition, the joint relay selection and power allocation problem is a mixed integer program problem and prohibitive in terms of complexity. Therefore, we propose a novel low complexity joint relay selection and power allocation algorithm with proportional fair scheduling to get the load-balancing among potential relays. Simulation results turn out that, compared with round-robin schemes and max sum rate schemes, the proposed algorithm can achieve the tradeoff between system transmission sum rate and load-balancing.

一种基于ACK反馈的多用户分组调度方法

利用自动重传请求(ARQ)的应答(ACK/NAK)和前向信道质量高度相关这个特点,针对1xEV-DV的前向分组数据业务提出了一种新的调度方法.新方法无需反馈信道质量信息(CQI),只基于ACK反馈进行前向分组数据信道(F-PDCH)调度.比之于传统调度方法,新方法省略了信道质量报告信道(R-CQICH),改为要求用户在R-ACKCH上密集发送ACK/NAK信息,此信息除用于混合ARQ操作外,同时用于多用户分组调度.仿真表明,新方法有更好的吞吐量并能满足正比公平准则.

一种核心无状态保存的自适应成比例公平带宽分配机制

提出了一种核心无状态的自适应成比例公平带宽分配机制 CSPAFA(core stateless proportional adaptivefair allocation) ,在边界路由器完成基于每个流的状态处理 ,将所有流分成标记流和非标记流两种业务类型 ,采用DPS(dynamic packet state)技术将有关信息编码进 IP分组头 .在核心将输出链路带宽分成两部分 ,核心根据当前的网络负荷对标记流按服务规格成比例地分配输出链路带宽 ,对未标记流公平分配带宽 ,并且能自适应地调整两类业务的带宽共享比例 .最后 ,给出了在

一种新的基于GPS的分组公平调度器

GPS(通用处理器共享 )是一种调度算法流模型 ,WFQ(加权公平排队 )、WF2 Q(最差情形公平加权公平排队 )等调度算法都是基于对GPS的模拟 .本文证明了WFQ、WF2 Q等算法并不是P GPS(基于分组的GPS) ,也就不能保证P GPS的时延及服务特性 .此外 ,本文提出了正确的P

上行虚拟MIMO系统的双比例公平用户配对算法

在分析上行虚拟多输入多输出(V-MIMO)系统的传统正交用户配对算法的基础上,提出了一种先按比例公平准则选取第一个用户,然后基于一种改进的比例公平准则选取其配对用户的新的双比例公平(D-PF)用户配对算法,并基于不同的接收机结构分析评估了该算法的吞吐量性能以及用户之间的公平度。仿真结果表明,与传统的正交用户配对算法相比,所提 D-PF 算法能够取得更好的吞吐量和用户公平度性能。

基于实时业务挤占的OFDMA系统的无线资源分配方案

为了在实时业务和非实时业务共享无线资源的场景中增加系统吞吐量,该文提出了一种基于实时业务挤占的无线资源分配方法,该方案首先实施统一调度,然后进行实时业务挤占过程。在保证对实时业务服务的情况下,实时业务挤占的无线资源分配方案提高了多用户分集效果,增加了系统的吞吐量。理论和仿真分析表明,与已有的传统的实时业务和非实时业务共享无线资源的调度方案相比,该方案能够提供更高的系统吞吐量和频谱效率。在实际应用中,该方案具有一定的可行性和可操作性。

OFDMA系统中基于有限反馈的资源公平调度算法

OFDMA是下一代无线通信系统中在下行链路上实现大容量通信的一种有前途的技术,其中的关键技术之一是在共享信道的用户间公平合理地分配子载波和功率。分析了功率约束下系统最大吞吐量的实现方法,提出了一种基于有限反馈的资源公平调度算法,这种算法具有系统所需反馈信息量少、用户间公平性好等性能。

反向链路分组数据业务媒体接入控制技术的研究

为更好地利用系统资源,对调度控制和专用速率控制等媒体接入控制(MAC)技术进行了分析比较,并结合它们的特点提出了一种新的混合媒体接入控制技术.按照3GPP2规定的仿真方法论,进行了基于CDMA2000 1xEVDV-RelD的模拟动态仿真分析.结果表明混合策略可以提高系统稳定性,减少时延,提高吞吐量,更好地满足各种服务质量(QoS)业务的需求.

基于QoS效用函数的比例公平调度算法

比例公平调度算法应用于多媒体业务调度时,不能满足其多方面的服务质量(QoS)需求,尤其是当有业务的瞬时QoS参数值接近业务可忍受的QoS阈值时,该业务的调度优先级变化趋势不明显,使该业务不能被及时调度,降低了多媒体业务的通信质量。为此,在PF算法调度优先级判断表达式中引入QoS因子参数项,加强服务质量需求参数项对调度的影响,提出基于QoS效用函数的比例公平调度算法。实验结果证明,该算法可以迅速增加接近QoS阈值多媒体业务的调度机会,使VolP业务的平均延时降低44%、公平性提高3%。

多性能目标分组调度策略

在高速分组交换网络中,分组调度策略和算法的设计是一个关键问题.由于网络分组调度策略有着多方面性能的要求,如何同时满足多个性能目标是当前的研究难点.基于比例公平性原则,提出了一种分组网络中的比例公平调度策略(proportional fairness scheduling,简称PFS),该调度策略综合考虑了网络效率、用户QoS要求和系统公平性等多维目标,对该策略进行了详细的分析和论证.比例公平调度策略可以广泛应用于分组网络调度策略的设计研究和改进.