多用户MIMO-OFDM系统基于QoE效用函数的跨层资源分配

对多用户MIMO-OFDM系统下行链路的资源分配问题进行了研究.依据实时(RT,real-time)和非实时(NRT,non real-time)业务的不同特点分别设计了QoE效用函数,并提出一种基于RT &NRT QoE效用函数的跨层资源分配算法.该算法利用所设计的效用函数计算用户分得资源所贡献的QoE增量,并根据由QoE增量确定的用户优先级完成时频资源块的分配,进而通过“拟注水”方式对功率分配进行优化.仿真结果表明,该算法相比已有算法在用户平均QoE、实时业务平均分组时延、非实时业务平均分组丢失率以及系统和吞吐量方面的性能均得到了明显改善.     

基于输入队列的光分组交换短包抢先调度

光分组交换的输出队头阻塞引起分组的平均排队时延增加.分析了可变长分组的特点,提出了基于抢先方式的短包抢先调度(PSPP)算法,以减少分组在输入排队中的平均等待时间.在PSPP算法中,短包可以抢占长包的传输时间,获得优先的服务.分析和仿真结果表明,当到达业务负载为中或较低时,短包优先调度算法使短包的平均排队时延接近零,所有分组的平均等待时延减小,该算法还保证具有实时特性的TCP业务获得较低的平均等待时延.     

MIMO-OFDM系统中基于效用函数的跨层资源分配算法

针对多业务MIMO-OFDM系统的下行链路提出了一种基于效用函数的跨层资源分配算法.建立了以效用函数最大化为目的的跨层优化目标,分别设计了语音、流媒体和"尽力而为"三种业务的边界效用函数.算法首先在所有用户中分配子载波,然后进行单用户和空间子信道的功率、比特分配,并对比特数目进行取整处理.仿真结果表明算法满足了多种业务的QoS要求,对时延敏感的业务能提供更小的时延,同时对"尽力而为"业务提供了更高的吞吐量.     

基于自相似业务的移动Adhoc网络路由算法研究

该文分析了移动Adhoc网络中普遍存在但被忽视的自相似业务的路由和排队性能,提出了基于网络规划模型的多径备份路由优化功率(MBOP)算法。该算法利用多路径和备份路由,并对网络的发射功率进行优化,适用于网络结构动态变化的移动无线自组织网络。仿真结果表明,该算法可以显著改善节点的排队性能,提高网络的吞吐量改进时延性能。     

基于QoS保证的多用户OFDM系统跨层资源分配

针对正交频分复用(OFDM)系统资源分配和调度问题,提出一种基于第三代移动通信长期演进(LTE)系统的分块跨层资源分配算法。此算法考虑物理层的信道状态信息、媒体接入层(MAC)的有限用户缓存队列长度、用户的丢失率和时延等QoS要求,以提高系统频谱效率为总体目标。通过从实时视频业务和混合业务两种业务类型下进行大量对比分析,得出提出的算法能有效提高系统的频谱效率和降低系统时延。     

一种基于紧急程度的自时钟开始时间公平排队分组调度算法

为了克服目前GPS (Generalized Processor Sharing)类调度算法中实时应用分组的排队时延较大且不稳定的局限性,该文提出一种新的分组排队调度算法,该调度算法在计算分组服务标签时添加了一个紧急程度函数,调整了到达分组间的竞争关系,从而可以按照实时性应用的要求来调整到达分组的转发先优级,由此显著降低了实时性应用分组的排队时延和抖动幅度。分析和仿真实验表明,与GPS类其它调度算法相比,该调度算法对于实时应用的分组能提供较低的、更稳定的排队时延保证,同时还继承了GPS类算法的公平性和排队时延有界等特性,而且对系统虚拟时间的跟踪计算更为简捷高效。     

一种基于平均时延最小化的跨层自适应算法

该文研究了OFDM系统的跨层自适应问题。针对现有资源分配算法不能有效地兼顾频谱效率、公平性和QoS的问题,提出了一种综合考虑CSI和排队信息的基于平均时延最小化的跨层自适应资源分配算法。该算法利用经济学中的效用理论,将平均等待时间作为优化权重,充分保证了不同业务的QoS,通过效用函数保证了不同等待时间或者不同QoS的公平性。仿真结果显示,该算法的时延性能略好于LWDF算法,大大好于PF算法和EXP算法,并且很好地保证了时延的公平性,非常适合对时延敏感的通信。     

低速网络中实时补偿型差额循环调度算法的设计和实现

服务质量(QoS)是目前网络应用研究的一个热点。由于低速链路在当前整个网络中占有相当大的比例,因此研究如何在低速链路上为用户提供具有QoS保证的实时业务已经成为一个重要的课题,其中采取何种调度算法则是实现QoS保证的关键因素之一。该文根据低速链路的特点,提出了一种适合实时分组转发的公平排队调度算法实时补偿型差额循环调度(RCDRR)算法,并用ns2软件对RCDRR算法和DRR算法进行了模拟对比。实验及仿真结果表明: RCDRR调度算法具有公平性好、算法复杂度低、可以降低实时分组在低速链路下的排队时延等特点。     

基于多码CDMA系统的多级业务接入控制

基于支持多级业务的多码CDMA系统,本文设计了一种适合于多级业务接入的两层控制方案,借助于该方案,实时业务用户一旦被接纳就立刻进行通信,而非实时数据用户的通信过程要受到呼叫层和突发层双重的皎皎接入控制,这样,前者的QoS能够得到保证,而后者则可以充分利用网络暂时闲置的信道容量。     

多速率认知网络中协作资源共享机制研究

针对多速率认知网络分析了不同体制网络间相互协作的动机及策略.基于排队论模型,提出了不同协作策略的时延分析模型,得到了不同类型用户的业务到达率、分组长度、信道传输速率与业务平均服务时间之间的解析关系,进而揭示了不同协作资源共享机制的时延性能以及适用的场景.数值仿真验证了分析模型的准确性和有效性,同时证明:通过合理利用用户间的协作,不仅可以更好地保障主用户业务的QoS性能,还可以有效提升次级用户的接入机会和QoS保障能力.     

A low-complexity beamforming-based scheduling to downlink OFDMA/SDMA systems with multimedia traffic

In this paper, we propose a low-complexity beamforming-based scheduling scheme utilizing a semi-orthogonal user selection (SUS) algorithm in downlink orthogonal frequency division multiple access (OFDMA)/space division multiple access (SDMA) systems to support multimedia traffic. One of the challenges in the multi-dimensional (space, time, and frequency) radio resource allocation problem for OFDMA/SDMA systems is its high complexity, especially to simultaneously satisfy the quality of services (QoS) requirements for various traffic classes. In the literature, the SUS algorithm is usually applied to the single-class traffic environment, but extending the SUS algorithm to the multimedia environment is not straightforward because of the need to prioritize the real-time (RT) users and the non-real-time (NRT) users. To solve this problem, we propose the concept of urgency value to guarantee the fairness of the NRT as well as the best effort (BE) users while satisfying the delay requirement for the RT users. Simulation results show that, when traffic load is greater than 0.5, the proposed scheduling algorithm can improve the fairness performance by more than 100% over the most recently proposed algorithms.     

Resource Allocation in OFDMA Wireless Communications Systems Supporting Multimedia Services

We design a resource allocation algorithm for downlink of orthogonal frequency division multiple access (OFDMA) systems supporting real-time (RT) and best-effort (BE) services simultaneously over a time-varying wireless channel. The proposed algorithm aims at maximizing system throughput while satisfying quality of service (QoS) requirements of the RT and BE services. We take two kinds of QoS requirements into account. One is the required average transmission rate for both RT and BE services. The other is the tolerable average absolute deviation of transmission rate (AADTR) just for the RT services, which is used to control the fluctuation in transmission rates and to limit the RT packet delay to a moderate level. We formulate the optimization problem representing the resource allocation under consideration and solve it by using the dual optimization technique and the projection stochastic subgradient method. Simulation results show that the proposed algorithm well meets the QoS requirements with the high throughput and outperforms the modified largest weighted delay first (M-LWDF) algorithm that supports similar QoS requirements.     

一种适用于B3G移动通信系统下行共享信道的调度算法

本文针对后三代(B3G)移动通信系统中的宽带无线信道特性和流媒体业务特征,分析了可用于高速下行共享信道的各种传统分组调度算法,提出面向流媒体业务能够提高系统吞吐量的基于优先级公平调度(Priority-Based Fairness Scheduling,PBFS)算法.该算法根据各移动用户收发信道质量和业务传输的QoS要求动态调整各用户的业务传输优先级,确定下行共享信道的调度方案.并给出该算法的简化形式S-PBFS.仿真结果表明,与传统调度算法相比,S-PBFS算法在数据包传输时延受限的条件下具有无线信道利用率高、实现复杂度低等特点.     

LTE系统上行链路调度算法研究

长期演进(Long Term Evolution,LTE)已经成为4G无线技术标准。目前,LTE分组调度的下行链路调度被大多数研究者研究,上行链路的研究相对较少。针对上行链路调度无法保证实时业务分组在延迟期限内传输,存在公平性较差、分组丢弃多的问题。因此,提出了一种新的上行链路调度算法。该算法根据实时业务的延迟约束条件建立目标整数线性规划模型,再根据目标整数线性规划模型进行调度。实验结果表明,该算法能保证实时业务分组在延迟期限内传输,适用于实时业务,能确保公平性,最小化分组丢弃,具有较好的适用性。     

Wireless Packet Scheduling Algorithm for OFDMA System Based on Time‐Utility and Channel State

In this paper, we propose an urgency‐ and efficiencybased wireless packet scheduling (UEPS) algorithm that is able to schedule real‐time (RT) and non‐real‐time (NRT) traffics at the same time while supporting multiple users simultaneously at any given scheduling time instant. The UEPS algorithm is designed to support wireless downlink packet scheduling in an orthogonal frequency division multiple access (OFDMA) system, which is a strong candidate as a wireless access method for the next generation of wireless communications. The UEPS algorithm uses the time‐utility function as a scheduling urgency factor and the relative status of the current channel to the average channel status as an efficiency indicator of radio resource usage. The design goal of the UEPS algorithm is to maximize throughput of NRT traffics while satisfying quality‐of‐service (QoS) requirements of RT traffics. The simulation study shows that the UEPS algorithm is able to give better throughput performance than existing wireless packet scheduling algorithms such as proportional fair (PF) and modifiedlargest weighted delay first (M‐LWDF), while satisfying the QoS requirements of RT traffics such as average delay and packet loss rate under various traffic loads.     

QoS-aware scheduling algorithm in relay-assisted LTE-A system

This paper details on the uplink scheduling algorithm for long term evolution advanced （LTE-A） system with relays. While emulating quality of service （QoS）-aware services with different bit-rate and delay budget requirements for the upstream direction, a new QoS-aware scheduling algorithm for in-band relays is proposed. In this work, an improved scheduling metric calculation method and bit-rate guarantee scheme is applied. Moreover, this algorithm proposes an efficient scheme for the backhaul link allocation which allows information of the most backlogged users to be transmitted first. Finally, this paper concludes with simulation results to demonstrate how the proposed resource allocation strategy improves the performance of the system.     

基于智能网络的租户服务质量保证技术

在多租户虚拟网络环境中,用户对于网络服务的多样性以及性能的稳定性需求并不会随着网络架构和运营模式的升级而削弱,用户需求之间的差异性和动态性对于不同切片间资源的分配和调度效率提出了新的挑战。针对多租户虚拟网络的特殊环境,首先提出了QVR(QoS-Virtual Routing)流量调度算法,同时将用户流量调度与网络虚拟资源分配看做一个联合优化问题,提出了面向多租户的流量调度算法以及适用于共享链路的动态带宽分配算法。该算法能够释放更多的物理网络资源,明显降低了租户网络的延时和拥塞。     

FQLP:ATM网中一种新的实时业务调度算法

 本文提出了基于丢失优先权公平队列(FQLP)调度算法.理论分析和仿真实验表明FQLP调度算法能保证实时业务获得的网络资源不小于预约带宽,为实时业务提供确定的时延上界.FQLP调度算法利用ATM网络中的信元优先权机制,提高了网络资源的利用率.同时FQLP调度策略能保证信元的发送顺序.     

Improved MLWDF scheduler for LTE downlink transmission

In long-term evolution (LTE) downlink transmission, modified least weighted delay first (MLWDF) scheduler is a quality of service (QoS) aware scheduling scheme for real-time (RT) services. Nevertheless, MLWDF performs below optimal among the trade-off between strict delay and loss restraints of RT and non-RT traffic flows, respectively. This is further worsened with the implementation of hybrid automatic retransmission request (HARQ). As these restraints grow unabated with increasing number of user demands, the performance of MLWDF further reduces. In order to ameliorate this situation, there is a need to directly incorporate the variations in user demands and HARQ implementation as parameters to the MLWDF scheduler. In this work, an improvement to the MLWDF scheduler is proposed. The improvement entails adding two novel parameters that characterise user demand and HARQ implementation. The scheduler was tested using varying three classes of service in QoS class identifiers (QCIs) table standardised by Third Generation Partnership Project for LTE network to characterise different services. It was also tested on the basis of packet prioritisation. The proposed scheduler was simulated with LTE-SIM simulator and compared with the MLWDF and proportional fairness schedulers. In terms of delay, throughput and packet loss ratio; the proposed scheduler increased overall system performance.