Enhancing router QoS through job scheduling with weighted shortest processing time-adjusted

Most routers on the Internet employ a first-in-first-out (FIFO) scheduling rule to determine the order of serving data packets. This scheduling rule does not provide quality of service (QoS) with regards to the differentiation of services for data packets with different service priorities and the enhancement of routing performance. We develop a scheduling rule called Weighted Shortest Processing Time–Adjusted (WSPT-A), which is derived from WSPT (a scheduling rule for production planning in the manufacturing domain), to enhance router QoS. We implement a QoS router model based on WSPT-A and run simulations to measure and compare the routing performance of our model with that of router models based on the FIFO and WSPT scheduling rules. The simulation results show superior QoS performance when using the router model with WSPT-A.     

Dynamic QoS queuing control mechanism for multimedia differentiated services

An essential goal of communication networks is to provide multimedia services with QoS streaming. A properly designed multimedia QoS system must reserve requested resources according to user QoS requirements and the available network resources. However, the static resource allocation among priority queues in DiffServ networks leads to insufficient resource usage when a burst occurs in one priority queue while other queues starve. This study presents a User-Oriented QoS Streaming System to achieve perceptible satisfaction based on novel streaming and media differentiation policies in DiffServ networks. This study also proposes that the Dynamic QoS Queue Mapping (DQ²M) mechanism dynamically control queue scheduling by adaptively maximizing the utilization of queues and network resources according to the soft states of the DiffServ network. Evaluation results indicate that the proposed DQ²M algorithm can improve the fairness and efficiency of resource utilization for low-priority queues.     

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

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

区分服务中每跳行为的一种实现方案

区分服务体系结构 (简称DiffServ) ,作为一种互联网服务质量的解决方案 ,具有较好的可扩展性和健壮性。DiffServ中 ,其每跳行为 (PHB)的实现是关键。该文提出的PHB实现方案主要包括 :①采用类似最大队长和最小分配共享的DiffServ缓冲分配策略 ,进行队列间的缓冲区分配 ;②选用交错方式的RIOC策略进行队列管理 ;③使用一种新的调度算法———PRI/FWRR ,来进行队列调度。并通过计算机仿真说明 ,该方案能够满足DiffServ中各类PHB的特性要求     

Semaphore queue priority assignment for real-time multiprocessorsynchronization

Prior work on real time scheduling with global shared resources in multiprocessor systems assigns as much blocking as possible to the lowest priority tasks. We show that better schedulability can be achieved if global blocking is distributed according to the blocking tolerance of tasks rather than their execution priorities. We describe an algorithm that assigns global semaphore queue priorities according to blocking tolerance, and we present simulation results demonstrating the advantages of this approach with rate monotonic scheduling. Our simulations also show that a simple FIFO usually provides better real time schedulability with global semaphores than priority queues that use task execution priorities     

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

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

基于用户会话的Web服务器应用软件的QoS技术分析

传统的Web服务器应用软件对客户的请求不加识别和区分，接收到一个请求便立即进行处理。因此，这种“一视同仁”的服务无法为高优先级的请求提供Web QOS保证。通过改进应用软件，Web服务器可以为不同的客户或请求提供Web QOS。其主要方法是将客户的HTTP请求进行分类，并且实现优先化调度、接纳控制、资源分配等机制。本文介绍了基于用户会话的Web服务器应用软件的QoS技术，并指出其中存在的缺陷。     

ATM交换机多输入队列模型与PIM算法分析

介绍了ＡＴＭ的交换结构与几种输入了队例模型,提出了在多输入队列的无阻塞的交换结构中采用的ＰＩＭ算法,减少ＦＩＦＯ ＨＯＬ阻塞,并对基于ＰＩＭ时序的交换模型及其性能作了简要分析。     

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.     

Fuzzy-Based Dynamic Distributed Queue Scheduling for Packet Switched Networks

Addressing the problem of queue scheduling for the packet-switched system is a vital aspect of congestion control. In this paper, the fuzzy logic based decision method is adopted for queue scheduling in order to enforce some level of control for traffic of different quality of service requirements using predetermined values. The fuzzy scheduler proposed in this paper takes into account the dynamic nature of the Internet traffic with respect to its time-varying packet arrival process that affects the network states and performance. Three queues are defined, viz low, medium and high priority queues. The choice of prioritizing packets influences how queues are served. The fuzzy scheduler not only utilizes queue priority in the queue scheduling scheme, but also considers packet drop susceptibility and queue limit. Through simulation it is shown that the fuzzy scheduler is more appropriate for the dynamic nature of Internet traffic in a packet-switched system as compared with some existing queue scheduling methods. Results show that the scheduling strategy of the proposed fuzzy scheduler reduces packet drop, provides good link utilization and minimizes queue delay as compared with the priority queuing (PQ), first-in-first-out (FIFO), and weighted fair queuing (WFQ).     

基于收益驱动请求分类的多目标动态优先请求调度

请求调度通常需要在充分利用现有服务器资源的基础上满足响应时间最小化和系统吞吐量最大化的目标,但对于以盈利为目的的电子商务网站来说,关键还是要提高交易请求和VIP用户发起请求的达成率。针对电子商务网站请求调度的多重目标,首先提出了收益驱动的请求分类多维标准,在此基础上定义了请求优先级和调度优先级的概念,给出了基于请求分类的多目标动态优先调度算法MODP,并引入了基于事前过载判断而非负载测量的调度机制以避免控制延迟,有利于电子商务网站在多变的负载条件下自适应地实现差别服务和QoS保障。仿真实验证明了MODP机制与算法的有效性,将其与传统FCFS调度方法进行对比研究,结果表明:服务器无论在高载还是低载情况下,MODP调度策略在实现收益最大化、平均响应时间最小化的目标方面都具有明显的优势。     

Definition and Performance Evaluation of Network Services Deployed Over a Differentiated Services Network

A vital requirement for next generation IP networks is the provision of services with differentiated behavior and characteristics. The basic reason for that is the need to provide Quality of Service (QoS) to the different types of user traffic produced by applications that are different in nature and behavior, analogously to the IP network services. The Differentiated Services (DiffServ) paradigm is still one of the major outcomes of the research community toward the provision of QoS to individual customer needs and applications. This paper addresses the definition and deployment of specific network services in a DiffServ environment. We reuse and extend the fundamental concepts of the Expedited Forwarding and Assured Forwarding per hop behaviors in order to define four new network services, apart from the well known Best Effort one, which introduce a specific traffic handling implementation along with an Admission Control methodology. These are analyzed and simulated in the paper in order to evaluate their performance and confirm the correctness of their fundamental principles.     

OnceAS/Q:一个面向QoS的Web应用服务器

网络分布计算环境下应用系统的需求多样化和复杂性的增长,要求位于中间件层次的Web应用服务器(web application server,简称WAS)从原来的"尽力而为"服务模型转变为服务质量(quality of service,简称QoS)保障模型,为具有不同需求的应用分别提供适宜的服务质量保障.目前的WAS系统在此方面仍然比较薄弱.OnceAS/Q是一个面向QoS的WAS系统,它以QoS规约为基础,为不同应用提供不同的QoS保障能力.OnceAS/Q实现了一个应用QoS保障框架,提供了一组QoS服务组件支持具有QoS需求的应用开发和运行.介绍了OnceAS/Q的体系结构和主要组件,详细阐述了两个关键问题,一是QoS规约的定义及其映射,另一个是面向QoS的服务组件和资源的动态重配.OnceAS/Q原型在Ecperf测试基准下,对其QoS保障能力进行了实验.实验数据表明,在较大规模的应用环境下,OnceAS/Q能够提供更好的服务质量,并且开销是可接受的.     

一种资源优化的双最小均衡Web集群区分服务调度算法

在一种新的Web集群体系结构的基础上,提出了一种资源优化的双最小均衡区分服务调度算法：首先在前端调度器按资源均衡度将Web请求分配到各后台服务器．然后将Web请求的优先级与资源均衡度两个特征参数结合起来,综合设计后台服务器的Web请求调度顺序,为了评估该算法的性能,进行了大量的模拟实验．在与其他著名调度策略如分离式调度的对比结果显示：双最小均衡调度算法使Web请求的效率提高了11％,同时很好地实现了区分服务．证实了资源优化调度策略具有一定的普遍意义．     

支持优先级的高速交换开关缓冲队列分析与设计

缓冲队列在交换开关中起着重要的作用。为了使交换开关的调度更加灵活有效,可以采用硬件方法实现缓冲排队。为了支持QOS,还有必要设计一种支持优先级的排队机制。该文在研究已有的缓冲排队方案基础上,提出一种支持优先级FIFO排队的硬件体系结构PFQ(PriorityFIFOQueue)。PFQ借鉴了移位寄存器的基本思想,按链表形式组织每个FIFO队列,通过设置高速局部总线,有效解决了头信元阻塞问题。使得采用PFQ的交换开关可以实现更加灵活的调度算法。模拟结果表明PFQ具有灵活、高效、硬件代价较低并且实现简单的优点。     

一种DiffServ模型的主动队列管理算法FPRIO

面向QoS的DiffServ模型,在改进RIO-C算法的基础上,提出了一种新的主动队列管理算法——FPRIO。通过理论分析和仿真实验验证,证明该算法是一种适合于DiffServ模型的主动队列管理算法。     

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

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

PbRED:基于优先级的RED改进算法

随机早期检测算法RED作为一种重要的主动队列管理算法,通过有效地控制队列长度,取得较好的吞吐量性能。然而,当多个业务流存在不同优先级时,不能很好地区分服务质量。提出一种新的RED改进算法—PbRED,基于业务的优先级调整丢弃概率,通过减小高优先级的丢弃概率、增大低优先级的丢弃概率,为不同优先级的业务进行区分服务。仿真实验结果表明,在获得较高吞吐量的同时,PbRED可以使不同优先级业务流的服务质量存在合理区分度,保证高优先级业务流获得更好的吞吐量性能。     

Schedulability analysis for Controller Area Network (CAN) with FIFO queues priority queues and gateways

Controller Area Network (CAN) is widely used in automotive applications. Existing schedulability analysis for CAN is based on the assumption that the highest priority message ready for transmission at each node on the network will be entered into arbitration on the bus. However, in practice, some CAN device drivers implement FIFO rather than priority-based queues invalidating this assumption. In this paper, we introduce response time analysis and optimal priority assignment policies for CAN messages in networks where some nodes use FIFO queues while other nodes use priority queues. We show, via a case study and experimental evaluation, the detrimental impact that FIFO queues have on the real-time performance of CAN. Further, we show that in gateway applications, if it is not possible to implement a priority queue, then it is preferable to use multiple FIFO queues each allocated a small number of messages with similar transmission deadlines.     

RDRP: Reward-Driven Request Prioritization for e-Commerce web sites

Meeting client Quality-of-Service (QoS) expectations proves to be a difficult task for the providers of e-Commerce services, especially when web servers experience overload conditions, which cause increased response times and request rejections, leading to user frustration, lowered usage of the service and reduced revenues. In this paper, we propose a server-side request scheduling mechanism that addresses these problems. Our Reward-Driven Request Prioritization (RDRP) algorithm gives higher execution priority to client web sessions that are likely to bring more service profit (or any other application-specific reward). The method works by predicting future session structure by comparing its requests seen so far with aggregated information about recent client behavior, and using these predictions to preferentially allocate web server resources. Our experiments using the TPC-W benchmark application with an implementation of the RDRP techniques in the JBoss web application server show that RDRP can significantly boost profit attained by the service, while providing better QoS to clients that bring more profit.