QoS敏感的802.11e分组调度算法

分析并总结无线网络中基于QoS的分组调度算法,针对802.11e EDCA机制中多媒体数据分组调度的不公平问题,提出QoS敏感的802.11e数据分组调度算法.首先,根据不同数据业务延时敏感性需求,提出新的基于紧急度的数据分组调度指标.然后,在802.11e协议中根据业务流的紧急度,调整不同业务流所对应AC队列的参数,改变AC队列信道访问优先级,使紧急业务流有更多机会竞争到信道访问权.最后,进行大量仿真实验,实验结果验证了所提算法的有效性.     

交换控制芯片中队列调度算法的研究

在分析队列调度的3种常用算法基础上，研究了加权循环（WRR）算法在交换控制芯片中的应用，采用两级优先级队列提供质量服务（QoS）功能，用加权系数分配带宽。仿真结果表明，WRR算法占用资源少，能较好地支持QoS服务。     

高速分组交换网络中调度器的设计

为了满足迅猛发展的网络业务对网络服务质量提出的更高要求,使用高速分组网络交换机中的队列调度器可以有效地提供高质量的网络服务。通过采用分级式队列调度和四种队列调度算法有效地实现了队列调度器的设计。并且深入地比较和分析了队列调度器中多种队列调度算法的优缺点,尤其是对DRR调度算法进行了优化和改进。最后。对所设计的电路进行了仿真验证和电路综合,结果表明该调度器可以满足网络对服务质量的更高要求,并且能够应用到高速分组交换网络的调度器设计中。     

队列调度算法在网络中的应用研究

作为保证QoS的一种重要手段,队列调度算法近年来引起了网络研究者的广泛关注。本文首先介绍了队列调度问题及一些常用的队列调度算法,然后提出一个非GPS模型的队列模型及调度算法——WDQ算法(Weighted Delay Queuing,基于权重的延迟队列),并且解释了这种算法能够有效抵抗通信量的突发,具有控制不同权重分组延迟的能力,对于提高和改善网络服务质量QoS方面的研究和网络运行情况的研究具有积极意义。     

一种基于加权公平队列调度的改进型算法

随着网络业务的不断增多,比如IP电话、视频会议、远程教学等应用的不断出现,需要Internet提供良好的QoS支持,传统的队列调度算法无法满足网络质量要求,文中提出了一种基于加权公平队列调度的改进型算法。首先对GPS模型进行详细分析,在此基础上深入研究WFQ算法,针对WFQ队列调度算法无法保证实时性业务的QoS,提出了改进型L_CBWFQ算法。该算法在带宽不足的情况下,区分实时性会话业务,进行权值调整策略,保证实时性业务的QoS。仿真分析表明,L_CBWFQ算法不仅能够提高实时性业务的QoS,而且在延时、抖动方面也有很大的改善。     

一种基于区分服务的嵌套队列调度算法

现有队列调度算法只能满足某一种特定类型业务流量的服务质量(QoS)需求,无法广泛支持多种类型业务流量。为此,提出一种基于区分服务的嵌套队列调度算法。将现有队列调度算法通过嵌套模型进行组合,并根据该嵌套模型进行队列调度,从而为多种类型业务流量提供均衡的QoS保障。仿真结果表明,该算法能够满足不同类型业务流量的QoS需求,其各项性能指标所达效果与最优效果的差距较小,并且在多种类型业务流量的支持方面比现有队列调度算法表现更好。     

DiffServ中动态优先级调度算法的延迟分析

通过对DiffServ体系的4种优先级队列和优先级调度算法的分析,得出了动态优先级调度算法可以解决IP分组转发时的公平性问题。但随之而来的问题是IP分组转发时的超延迟现象。在确定出较精确的延迟门限标准和具体的实现方法后,得出动态优先级调度算法使IP分组的转发不会超出延迟门限。从仿真实验表明,动态优先级调度算法在一般的网络环境和条件下,4种优先级队列分组的公平性转发能够提供QoS保证。     

一种适合于多播和单播的集成调度算法

具有输入队列结构的路由器或交换机内部交换可以工作在线路速率上，适应了高速网络交换的要求，但现有输入队列调度方案将单播和多播流量分开考虑，使用不同的交换结构和调度算法，不适合网络中多播流和单播流并存的实际情况．该文提出一种不区分多播、单播分组，遵循同一入队策略和同一调度规则的集成调度算法EOPF、(Extented Oldest Port First)．仿真实验表明EOPF算法在各种多播和单播负载组成比例下始终保持高吞吐率，并能在全单播流量下达到100％吞吐率，适合于多播、单播混合存在的网络流量。     

基于DiffServ的高效调度算法的研究

区分服务(DiffServ)体系是未来IP QoS研究的主要发展方向,在区分服务的体系下,队列调度是实现IP QoS的核心技术。在深入研究区分服务体系下的基本分组调度算法优缺点的基础上,提出一种改进算法,以队列分组的延迟特性,保证实时业务的实时特性。对改进算法进行了仿真,在多约束下,对性能进行了评价。     

基于LTE下行多业务传输QoS保证的跨层调度算法

众多资源分配的调度算法中, 有区别地实现不同业务QoS要求的调度策略研究不多。针对此问题, 通过将不同QoS等级和要求加入到调度策略的影响因素中, 提出了一种适用于LTE下行多业务传输的多目标跨层分组调度算法, 并设计了一个用户满意度函数, 用来评价分组调度算法的综合性能。对该算法性能进行了仿真验证, 并同PF算法仿真结果进行比较与分析, 表明该算法能够满足不同业务的QoS要求, 综合性能优于PF算法。     

Management of Multi-Queue Switches in QoS Networks

The concept of Quality of Service (QoS) networks has gained growing attention recently, as the traffic volume in the Internet constantly increases, and QoS guarantees are essential to ensure proper operation of most communication-based applications. A QoS switch serves m incoming queues by transmitting packets arriving to these queues through one output port, one packet per time step. Each packet is marked with a value indicating its priority in the network. Since the queues have bounded capacities and the rate of arriving packets can be much higher than the transmission rate, packets can be lost due to insufficient queue space. The goal is to maximize the total value of transmitted packets. This problem encapsulates two dependent questions: buffer management, namely which packets to admit into the queues, and scheduling, i.e. which queue to use for transmission in each time step. We use competitive analysis to study online switch performance in QoS-based networks. Specifically, we provide a novel generic technique that decouples the buffer management and scheduling problems. Our technique transforms any single-queue buffer management policy (preemptive or non-preemptive) to a scheduling and buffer management algorithm for our general m queues model, whose competitive ratio is at most twice the competitive ratio of the given buffer management policy. We use our technique to derive concrete algorithms for the general preemptive and non-preemptive cases, as well as for the interesting special cases of the 2-value model and the unit-value model. We also provide a 1.58-competitive randomized algorithm for the unit-value case. This case is interesting by itself since most current networks (e.g. IP networks) do not yet incorporate full QoS capabilities, and treat all packets equally.     

A cross-layer elastic CAC and holistic opportunistic scheduling for QoS support in WiMAX

QoS provisioning is an important issue in the deployment of broadband wireless access networks with real-time and non-real-time traffic integration. An opportunistic MAC (OMAC) combines cross-layer design features with opportunistic scheduling scheme to achieve high system utilization while providing QoS support to various applications. A single scheduling algorithm cannot guarantee all the QoS requirements of traffics without the support of a suitable CAC and vice versa. In this paper, we propose a cross-layer MAC scheduling framework and a corresponding opportunistic scheduling algorithm in tandem with the CAC algorithm to support QoS in WiMAX point-to-multipoint (PMP) networks. Extensive experimental simulations have been carried out to evaluate the performance of our proposal. The simulation results show that our proposed solution can improve the performance of WiMAX networks in terms of packet delay, packet loss rate and throughput. The proposed CAC scheme can guarantee the admitted connections to meet their QoS requirements.     

A performance study of uplink scheduling algorithms in point-to-multipoint WiMAX networks

The IEEE 802.16 standard defines the specifications for medium access control (MAC) and physical (PHY) layers of WiMAX networks. A critical part of the MAC layer specification is packet scheduling, which resolves contention for bandwidth and determines the transmission order of users. Evaluating the performance packet scheduling algorithms is of utmost importance towards realizing large-scale WiMAX deployment. In this paper, we conduct a comprehensive performance study of scheduling algorithms in point-to-multipoint mode of OFDM-based WiMAX networks. We first make a classification of WiMAX scheduling algorithms, then simulate a representative number of algorithms in each class taking into account that vital characteristics of the IEEE 802.16 MAC layer and OFDM physical layer. We evaluate the algorithms with respect to their abilities to support multiple classes of service, providing quality of service (QoS) guarantees, fairness amongst service classes and bandwidth utilization. To the best of our knowledge, no such comprehensive performance study has been reported in the literature. Simulation results indicate that none of the current algorithms is capable of effectively supporting all WiMAX classes of service. We demonstrate that an efficient, fair and robust scheduler for WiMAX is still an open research area. We conclude our study by making recommendations that can be used by WiMax protocol designers.     

支持多优先级分组交换调度算法研究及其调度器设计

输入缓存交换结构的特点是缓存器和交换结构的运行速率与端口速率相等、实现容易,但存在队头阻塞。如果采用虚拟输出排队方法和适当的分组调度算法可予以消除,使吞吐率达到100%。文章首先研究讨论了并行迭代匹配算法,滑动迭代匹配调度算法的基本原理、迭代仲裁步骤及其硬件实现;对高速分组交换调度算法的性能进行了分析比较。然后给出了在高速输入队列交换机中实现多优先级调度算法的调度器设计与实现方案。经设计实现证明高速分组交换调度算法不仅硬件实现简单,而且具有良好的特性。     

Port partitioning and dynamic queueing for IP forwarding

With the increase of internet protocol (IP) packets the performance of routers became an important issue in internet/working. In this paper we examine the matching algorithm in gigabit router which has input queue with virtual output queueing. Dynamic queue scheduling is also proposed to reduce the packet delay and packet loss probability. Port partitioning is employed to reduce the computational burden of the scheduler in a switch which matches the input and output ports for fast packet switching. Each port is divided into two groups such that the matching algorithm is implemented within each pair of groups in parallel. The matching is performed by exchanging the pair of groups at every time slot. Two algorithms, maximal weight matching by port partitioning (MPP) and modified maximal weight matching by port partitioning (MMPP) are presented. In dynamic queue scheduling, a popup decision rule for each delay critical packet is made to reduce both the delay of the delay critical packet and the loss probability of loss critical packet. Computational results show that MMPP has the lowest delay and requires the least buffer size. The throughput is illustrated to be linear to the packet arrival rate, which can be achieved under highly efficient matching algorithm. The dynamic queue scheduling is illustrated to be highly effective when the occupancy of the input buffer is relatively high.Scope and purposeTo cope with the increasing internet traffic, it is necessary to improve the performance of routers. To accelerate the switching from input ports to output in the router partitioning of ports and dynamic queueing are proposed. Input and output ports are partitioned into two groups A/B and a/b, respectively. The matching for the packet switching is performed between group pairs (A, a) and (B, b) in parallel at one time slot and (A, b) and (B, a) at the next time slot. Dynamic queueing is proposed at each input port to reduce the packet delay and packet loss probability by employing the popup decision rule and applying it to each delay critical packet.The partitioning of ports is illustrated to be highly effective in view of delay, required buffer size and throughput. The dynamic queueing also demonstrates good performance when the traffic volume is high.     

A terabit multiservice switch

This article describes a terabit multiservice switch architecture. Because of its multiterabit switching speed, quality of service (QoS) support capability, multiprotocol capability including TDM, and scalability, the Cyclone switch architecture is directly applicable in the following areas and many more: multiterabit switching at the Internet core, terabit routers and carrier-class ATM or MPLS switches; aggregation for all optical networks; unified packet/circuit switching platform; and high-end enterprise applications. The Cyclone switch architecture enables a scalable switching platform from multiple Gbits to multiple Tbits per second in five custom 0.18-micron CMOS ICs. A wire-speed scheduling capability supports eight quality of service classes and a million flows     

A Switch Architecture Guaranteeing QoS Provision and HOL Blocking Elimination

Both QoS support and congestion management techniques become essential to achieve good network performance in current high-speed interconnection networks. The most effective techniques traditionally considered for both issues, however, require too many resources for being implemented. In this paper we propose a new cost-effective switch architecture able to face the challenges of congestion management and, at the same time, to provide QoS. The efficiency of our proposal is based on using the resources (queues) used by RECN (an efficient Head-Of-Line blocking elimination technique) also for QoS support, without increasing queue requirements. Provided results show that the new switch architecture is able to guarantee QoS levels without any degradation due to congestion situations.     

多用户MIMO无线通信系统跨层调度研究

无线频谱资源日益显得匮乏,而当今的无线通信系统需要为用户提供端到端的Q o S保障。为了在高速动态变化的无线环境下实现尽可能高的频谱利用率和Q o S保障,系统的几个层要联合运作才能达成上述两个目标。在分组网络中,实现这些目标的一个重要途径是设计适当的调度算法。本文根据信息论的框架,对分组调度算法的设计问题进行简要的介绍。然后重点介绍资源分配问题中跨层方法的优点,并对反馈信息量增加问题的折中方案进行分析。同时,对多发射多接收系统能够提供的额外自由度问题进行深入的讨论。     

Parallel desynchronized block matching: A feasible scheduling algorithm for the input-buffered wavelength-routed switch

The input-buffered wavelength-routed (IBWR) switch is a promising switching architecture for slotted optical packet switching (OPS) networks. The benefits of the IBWR fabric are a better scalability and lower hardware cost, when compared to output buffered OPS proposals. A previous work characterized the scheduling problem of this architecture as a type of matching problem in bipartite graphs. This characterization establishes an interesting relation between the IBWR scheduling and the scheduling of electronic virtual output queuing switches. In this paper, this relation is further explored, for the design of feasible IBWR scheduling algorithms, in terms of hardware implementation and execution time. As a result, the parallel desynchronized block matching (PDBM) algorithm is proposed. The evaluation results presented reveal that IBWR switch performance using the PDBM algorithm is close to the performance bound given by OPS output buffered architectures. The performance gap is especially small for dense wavelength division multiplexing (DWDM) architectures.