WCDMA HSUPA技术中的Node B调度算法研究

HSUPA（High Speed Uplink Packet Access）是继HSDPA（High Speed Downlink Packet Access）后，WCDMA（Wideband Code Division Multiple Access）标准的又一次重要演进。阐述了HSUPA采用的三种主要技术之一的基于Node B（基站）的快速调度，讨论了HSUPA可以采用的几种分组调度算法，并对几种算法作了简要比较。     

HSDPA分组调度算法实现简析

HSDPA（高速下行分组接入，High Speed Downlink Packages Access）技术是3GPP在R5协议中提出来的提高WCDMA网络下行数据容量和传输速率的重要技术。分组调度是HSDPA的重要组成部分，负责分组业务传输块的调度和管理，对于网络性能有重要影响。本文在扼要描述HSDPA分组调度功能和过程的基础上，重点分析对比了3种经典分组调度算法原理以及在系统中的实现过程，并给出了测试结果。     

EGPRS中新的调度算法

EGPRS（Enhanced GPRS）网络中，为不同用户分配物理信道PDCH（Packet Data Channel）的传统调度算法是PF（Proportionally Fair）算法。文中介绍了一种新的调度算法OHA（Opportunistic Handling Algorithm），该算法可以根据用户使用的不同服务类别为用户提供不同的服务质量；最后对OHA算法和PF算法的性能进行了比较。     

HSDPA中的分组调度算法

HSDPA系统采用了AMC、HARQ、快速调度等技术以支持有效的数据业务,因此对传统的调度算法提出了新的挑战,分组调度成为影响系统性能的一个重要因素.介绍了两种针对HSDPA系统的调度算法：自适应正比公平算法（APF）和M-LWDF算法,并简单分析了它们的性能.     

基于队列长度和时延约束的异步OPS权重调度

分组调度在异步光分组交换(OPS)节点中起着重要作用,一种智能的调度算法能减小分组的丢失率,增加节点的吞吐量,从而提高服务质量.文章提出了一种基于队列长度和时延约束的解决队列中分组"饿死"和时延问题的权重调度算法.算法通过计算队列长度和分组在队列中等待时间确定调度的权重值,以减小分组在核心节点处的资源竞争和等待时延,调度器计算每个输入端口的N×K个虚拟输出队列的权重值并调度最大权重值队列到可用的输出信道上.分析和仿真结果表明所提的权重调度算法具有高吞吐量和低分组丢失率特点.     

分组调度算法的仿真与分析

介绍了现有分组调度算法的发展概况，主要探讨并分析了常见的几种无线分组调度算法的适用性及其存在的问题，并且对分组调度算法进行了仿真和分析．最后指出了分组调度算法的发展方向．     

HSxPA分组调度算法评析

调度问题的根源在于对资源的竞争和分配,分组调度算法的优劣也直接影响HSxPA数据业务传输的性能。本文首先阐明HSxPA概念,接着厘清HSxPA中分组调度算法的几个种类,最后对几种主要的分组调度算法进行评析。     

分布式基站中分组调度算法的研究

本文简要介绍了分布式基站及现有分组调度算法的发展概况,主要探讨并分析了常见的几种无线分组调度算法的适用性及其存在的问题,并且进行了仿真分析。最后指出了分布式基站中分组调度算法的发展方向。     

分布式基站中分组调度算法的研究

本文简要介绍了分布式基站及现有分组调度算法的发展概况,主要探讨并分析了常见的几种无线分组调度算法的适用性及其存在的问题,并且进行了仿真分析,最后指出了分布式基站中分组调度算法的发展方向。     

GPRS的漫游——实现移动分组接入的解决方案

首先简单介绍了GPRS的系统结构，在此基础上给出了GPRS网络中的APN（access point name）和域名系统的概念，分析了漫洲情况下GPRS是如何支持分组数据路由的过程，最后介绍了GPRS系统中的IP地址管理的问题。     

QoS-guaranteed packet scheduling in wireless networks

To guarantee the quality of service (QoS) of a wireless network, a new packet scheduling algorithm using cross-layer design technique is proposed in this article. First, the demand of packet scheduling for multimedia transmission in wireless networks and the deficiency of the existing packet scheduling algorithms are analyzed. Then the model of the QoS-guaranteed packet scheduling (QPS) algorithm of high speed downlink packet access (HSDPA) and the cost function of packet transmission are designed. The calculation method of packet delay time for wireless channels is expounded in detail, and complete steps to realize the QPS algorithm are also given. The simulation results show that the QPS algorithm that provides the scheduling sequence of packets with calculated values can effectively improve the performance of delay and throughput.     

Minimizing the Number of Multicast Transmissions in Single-Hop WDM Networks

The problem of minimizing the number of transmissions for a multicast transmission under the condition that the packet delay is minimum in single-hop wavelength division multiplexing (WDM) networks is studied in this paper. This problem is proved to be NP-complete. A heuristic multicast scheduling algorithm is proposed for this problem. Extensive simulations are performed to compare the performance of the proposed heuristic algorithm with two other multicast scheduling algorithms, namely, the greedy and no-partition scheduling algorithms. The greedy algorithm schedules as many destination nodes as possible in the earliest data slot. The no-partition algorithm schedules the destination nodes of a multicast packet to receive the packet in the same data slot without partitioning the multicast transmission into multiple unicast or multicast transmissions. Our simulation results show that (i) an algorithm which partitions a multicast transmission into multiple unicast or multicast transmissions may not always produce lower mean packet delay than the no-partition algorithm when the number of data channels in the system is limited and (ii) the proposed heuristic algorithm always produces lower mean packet delay than the greedy and the no-partition algorithms because this algorithm not only partitions a multicast transmission into multiple unicast or multicast transmissions to keep the packet delay low but also reduces the number of transmissions to conserve resources.     

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

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

前向分组数据业务中重传分组优先权的研究

该文研究了前向分组数据业务中应用的调度算法,在对常见的几种调度算法分析之后,提出一种新的调度算法。从理论和仿真两方面的性能分析显示,该算法通过适当改变重传分组的优先权,在保证满足公平性准则的前提下,提高了系统吞吐量,降低了平均分组时延,改善了分组时延分布。     

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

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

双服务器分组调度算法

分组调度算法对于确保分组交换系统的QoS具有重要意义。时延,公平性,计算复杂度是微量分组度算法的主要指标。本文提出了一种双服务器分组调度算法,该算法在两种不同的工作状态下分别采用两种服务规则决定分组的服务次序。其中一种服务规则用来确保分组的时延,另一种服务规则在时延得到保障的情况下对系统的公平性进行改善,这两种规则计算都不复杂。因此本文提出的算法具有时延低,公平性较好,计算复杂度低的特点。     

Next Generation Wireless Mobile System Efficient, Fair, Class Based Packet Scheduling Algorithm

Efficient utilization of network resources is a key goal for emerging broadband wireless access systems (BWAS). This is a complex goal to achieve due to the heterogeneous service nature and diverse quality of service (QoS) requirements of various applications that BWAS support. Packet scheduling is an important activity that affects BWAS QoS outcomes. This paper proposes a novel packet scheduling mechanism that improves QoS in mobile wireless networks which exploit IP as a transport technology for data transfer between BWAS base stations and mobile users at the radio transmission layer. In order to improve BWAS QoS the new packet algorithm makes changes at both the IP and the radio layers. The new packet scheduling algorithm exploits handoff priority scheduling principles and takes into account buffer occupancy and channel conditions. The packet scheduling mechanism also incorporates the concept of fairness. Performance results were obtained by computer simulation and compared to the well known algorithms. Results show that by exploiting the new packet scheduling algorithm, the transport system is able to provide a low handoff packet drop rate, low packet forwarding rate, low packet delay and ensure fairness amongst the users of different services.     

Media Synchronization and QoS Packet Scheduling Algorithms for Wireless Systems

Wireless multimedia synchronization is concerned with distributed multimedia packets such as video, audio, text and graphics being played-out onto the mobile clients via a base station (BS) that services the mobile client with the multimedia packets. Our focus is on improving the Quality of Service (QoS) of the mobile client's on-time-arrival of distributed multimedia packets through network multimedia synchronization. We describe a media synchronization scheme for wireless networks, and we investigate the multimedia packet scheduling algorithms at the base station to accomplish our goal. In this paper, we extend the media synchronization algorithm by investigating four packet scheduling algorithms: First-In-First-Out (FIFO), Highest-Priority-First (PQ), Weighted Fair-Queuing (WFQ) and Round-Robin (RR). We analyze the effect of the four packet scheduling algorithms in terms of multimedia packet delivery time and the delay between concurrent multimedia data streams. We show that the play-out of multimedia units on the mobile clients by the base station plays an important role in enhancing the mobile client's quality of service in terms of intra-stream synchronization and inter-stream synchronization. Our results show that the Round-Robin (RR) packet scheduling algorithm is, by far, the best of the four packet scheduling algorithms in terms of mobile client buffer usage. We analyze the four packet scheduling algorithms and make a correlation between play-out of multimedia packets, by the base station, onto the mobile clients and wireless network multimedia synchronization. We clarify the meaning of buffer usage, buffer overflow, buffer underflow, message complexity and multimedia packet delay in terms of synchronization between distributed multimedia servers, base stations and mobile clients.     

Fair scheduling in wireless packet networks

Fair scheduling of delay and rate-sensitive packet flows over a wireless channel is not addressed effectively by most contemporary wireline fair-scheduling algorithms because of two unique characteristics of wireless media: (1) bursty channel errors and (2) location-dependent channel capacity and errors. Besides, in packet cellular networks, the base station typically performs the task of packet scheduling for both downlink and uplink flows in a cell; however, a base station has only a limited knowledge of the arrival processes of uplink flows. We propose a new model for wireless fair-scheduling based on an adaptation of fluid fair queueing (FFQ) to handle location-dependent error bursts. We describe an ideal wireless fair-scheduling algorithm which provides a packetized implementation of the fluid mode, while assuming full knowledge of the current channel conditions. For this algorithm, we derive the worst-case throughput and delay bounds. Finally, we describe a practical wireless scheduling algorithm which approximates the ideal algorithm. Through simulations, we show that the algorithm achieves the desirable properties identified in the wireless FFQ model     

iRGRR/PM：一种新的高速crossbar分组调度策略

iRGRR(iterative Request-Grant-based Round-Robin)算法是一种输入排队crossbar调度算法,具有硬件易实现、可扩展性强、性能优良等优点.在此基础上,该文提出一种新的高速crossbar分组调度策略iRGRR/PM(iRGRR with Packet Mode),可以更好地支持IP分组的调度,能够被应用于高速、大容量的路由器中.与iRGRR算法相比,iRGRR/PM简化了分组输出重组模块的设计,并且提高了crossbar的带宽资源利用率.文中简单分析了两种算法间的分组时延关系,并进行了详尽的仿真研究.结果表明:在相同条件下,iRGRR/PM算法具有更高的吞吐量,尤其在非均匀业务流下能获得接近100%的吞吐量;调度长分组时,iRGRR/PM算法具有更好的时延性能.