A Dynamic-feedback Scheduling Algorithm for Cluster Load Balancing based on Priority Queue

在分析现有面向LVS集群的负载均衡调度算法优缺点的基础上,提出了一种新的调度算法—基于优先级队列的动态反馈调度算法.该算法根据定期采集到的各服务器负载信息动态地调整各服务器的权值,并根据权值建立优先级调度队列借以实现连接的调度.算法可保证良好的负载均衡性,且时间复杂度降低至O(1).     

支持区分服务的自适应队列调度算法

分析了在DiffServ模型下的WRR和DWRR调度算法,提出了一种基于WRR的改进的 调度算法AWRR(ADWRR),同时提出了AWRR调度算法的实现过程。该算法根据网络中各业务数 据的实际流量动态的调整其对应的权值。因此AWRR不仅能提供QoS保证,而且还能根据该节点的 实际负载状况,提供动态的带宽分配。     

一种有效的网络多出口流量调度方案

针对基于Linux的多出口流量调度与负载不均衡问题,利用历史流量率和历史调度权值,提出一种自动按网络流量状态调整最优出口比例的自适应流量调度方案,给出方案的双出口校园网络完整配置过程和关键调度算法实现。仿真实验表明,该方案可有效调度网络多个出口的流量,保证网络多出口负载均衡。     

流媒体服务器比例带宽分配的改进算法

结合比例带宽分配与转码技术,提出了基于转码的流媒体服务器比例带宽分配算法.该算法将服务器分配与调度资源的过程细分为一系列充分小的时间片,在每一个时间片里,服务器根据已有的资源分配与预测的带宽需求情况进行综合分析,动态地给每一个请求分配带宽.建立的数学模型表明了该策略能保证所有请求都能在不同的负载下获得最佳的带宽分配.仿真实验结果表明,该策略不仅可以充分利用系统资源,而且还能保证不同优先级请求之间资源的公平分配.     

基于服务时间的加权公平队列调度算法

针对已知存储系统调度算法无法保证服务资源公平分配的问题,提出一种基于服务时间的加权公平队列调度算法,该算法直接采用访问请求的服务时间作为服务资源分配的依据,其公平性非常接近于公平调度算法的理论极限,在负载波动的情况下仍能保持资源分配的稳定性。     

路由器多端口公平调度算法与实现

本文提出并实现了一种应用于路由器多端口公平调度的算法——分组分割轮询调度算法。该算法把分组分割成更小的数据片,采用分组调度和分片调度相结合,处理一个包仅需O(1)的运算量,易于在高速网络设备中实现,可以做到多个端口近似公平共享输出带宽,阻止个别端口过度占用输出带宽。该算法已经应用于核心路由器BE12000的8OC-3线卡,实际运行良好,具有较好的性能。     

基于流调度选择的DCN动态负载均衡算法

针对数据中心网络(data center network,DCN)动态调度导致的负载不均衡问题,提出了基于流调度选择的动态负载均衡(dynamic load balancing based on flow scheduling selection,DLBFSS)算法。该算法首先计算拥塞链路上各条大流的等价最短路径,并删除不满足流带宽需求的路径;然后计算剩余路径的可用吞吐量,选择可用吞吐量最大的路径作为最优调度路径;最后根据大流的带宽和最优路径的负载定义调度的拥塞概率,将拥塞概率作为大流调度选择的依据。实验结果表明,与传统ECMP（equal-cost multi-path）路由和现有大流调度算法相比,DLBFSS能够减小网络时延,提高流的带宽利用率,保证了更好的负载均衡。     

一种基于IEEE 802.16j网络的带宽调度方案*

针对IEEE 802.16j网络,提出了一种上行业务的动态联合带宽资源调度方案。根据该网络系统树状拓扑结构,在基站BS和中继站RS间采用分级分布式资源调度体制,从而既保障了业务的带宽需求,又提升了上行带宽利用率,同时还提出了针对不同类型业务采用不同的调度算法,改善了调度的公平合理性。仿真结果表明,提出的动态联合调度方案相比严格优先级调度更具灵活性,能够在兼顾用户速率公平的条件下有效地保证各种服务的QoS要求,同时也可获得较高的带宽资源利用率。     

DiffServ网络中基于流量负载的动态带宽分配

在DiffServ网络中,流量以聚集类的形式存在,聚集类中的流量负载是随时间不断地发生动态变化的.当不同聚集类中的流量负载与调度算法(如WFQ)为其分配的资源(如带宽)不成比例时,即使两个聚集类的优先级相同,它们中的数据包也会得到不公平的待遇.为此,DiffServ网络中面向公平的动态带宽分配引起了广泛的研究.本文中为了实现公平的带宽分配,提出了一种基于流量负载的动态带宽分配的方法,其中在动态计算各个聚集类应分得的新带宽时主要考虑了当前分得的带宽和聚集类的队列长度增量这两个因素.仿真实验结果说明了该方法的有效性.     

基于区分服务的队列调度算法研究

文中分析了在区分服务(DiffServ)模型下的WRR和DWRR调度算法的优缺点,提出了一种DWRR的改进调度算法DWRR+.该算法根据当前队列中分组的长度动态设置一次服务中发送分组的最大字节数,既保证了低权值业务的延迟特性,又保证带宽分配相对的公平性,避免了低优先级队列可能长时间得不到服务的缺点,改善了DWRR算法不能很好满足业务的时延特性.使用NS-2网络仿真器进行算法性能评价,仿真结果表明DWRR+算法在保证输出带宽的前提下降低了延时,可以在一定程度上保证不同业务的服务质量.     

Stability of data networks under an optimization-based bandwidth allocation

It is known that a data network may not be stable at the connection level under some unfair bandwidth allocation policies, even when the normal offered load condition is satisfied, i.e., the average traffic load at each link is less than its capacity. In this note, we show that, under the normal offered load condition, a data network is stable when the bandwidth of the network is allocated so as to maximize a class of general utility functions. Using the microscopic model proposed by Kelly (1997, 2001) for a transmission control protocol (TCP) congestion control algorithm, we argue that the bandwidth allocation in the network dominated by this algorithm can be modeled as our bandwidth allocation model, and hence that the network is stable under the normal offered load condition. This result may shed light on the stability issue of the Internet since the majority of its data traffic is dominated by the TCP.     

Distribution-based bandwidth access scheme in slotted all-optical packet-switched networks

The common approach in an ingress switch to access a slotted all-optical packet-switched network is the TTA (timer-based/threshold-based bandwidth access) bandwidth access scheme in which packet differentiation is provided by a time-out mechanism. In contrast, we propose in this paper the DA (distribution-based bandwidth access) to access the slotted all-optical packet-switched network within a DiffServ domain. Each torrent (the traffic between each pair of ingress and egress switches) is given a bandwidth measured in slots within a frame at an ingress switch. The slots from each torrent are evenly distributed throughout the frame and among the output wavelengths/fibers of the ingress switch. Comparing to the most commonly used technique TTA, we demonstrate that our DA approach can achieve the following: (1) provide each traffic torrent a fairer access to the network bandwidth; (2) reduce the probability of the slot drop rate at the optical network; (3) reduce the excessive bandwidth allocation by the bursty torrents; (4) balance the traffic load much better on wavelength channels; and (5) guarantee a stable edge switch operation to service traffic in which the traffic generation rate to the optical network is lower than the traffic service rate.     

大时间尺度上MPEG4视频流量预测的自适应算法

为了保证用户的服务质量(QoS),宽带分组网络需要进行动态带宽分配,而视频流量预测在动态带宽分配中发挥着重要的作用。本文从自相关性、自相似性的Hurst参数两个方面,阐明图像组(GOP)时间尺度上的流量能够体现原有视频帧序列的流量特性,并在固定步长的LMS自适应算法(FSSA)的基础上提出了一种新的可变步长自适应算法(VSSA),在GOP所表示的大时间尺度上预测MPEG4视频流量。大量的仿真实验结果表明,VSSA算法可以明显地改善预测性能。     

IEEE 802.11e协议HCCA机制下的QoS研究

分析了IEEE 802.11e协议HCCA信道接入机制下的简单带宽调度算法对多媒体业务的QoS支持情况,指出其不足并在其基础上进行了改进,提出了一种基于业务等级的带宽调度算法E-HCCA（Enhanced HCCA）。E-HCCA对不同优先等级业务的数据在带宽分配上采用不同的策略,在优先保证各个节点CBR业务的基础上,根据节点的VBR流量动态平均分配剩余带宽。相比较简单调度算法,E-HCCA算法更好地支持了多用户下的语音业务流和视频业务流,降低了分组时延,增加了系统吞吐率。     

多通道并行传输中基于收益最大化的流量分配方法

针对已有的多通道并行传输中的流量分配方法不区分业务、也未考虑资源收益的问题,分析了业务参数模型,引入业务的收益作为多通道并行传输中流量分配的效益评价函数,通过将流量分配映射为带宽分配建立了基于收益最大化的多通道并行传输流量分配模型。基于边际收益递减法则,提出了一种边际收益优先的多业务流多通道并行传输流量分配算法,该算法先根据边际收益优先的贪心策略获取最大化收益的流量分配方案,然后通过调整业务在不同通道间的流量来保证业务的最低质量要求,最后通过典型业务实例分析和仿真实验验证了算法的有效性。与基于带宽比例策略的流量分配算法相比,所提出的方法能够在保证业务质量的前提下,实现带宽资源的优化配置,提高运营商的收益。     

多业务流量预测动态带宽分配方法

静态带宽资源分配方法或基于业务分类的动态带宽分配方法等很难适应业务流特性,无法保证各级业务的服务质量。设计了流量预测及带宽分配模型,给出了流量预测计算方法,提出多业务流量预测动态带宽分配方法（MSTPDBA）,该方法基于业务预测流量的大小进行可用带宽的重新分配。仿真实验证明了MSTPDBA的有效性,能控制不同业务的时延,并提高了系统带宽资源的利用率。     

A new approach to dynamic bandwidth allocation in Quality of Service networks: Performance and bounds

Efficient dynamic resource provisioning algorithms are necessary to the development and automation of Quality of Service (QoS) networks. The main goal of these algorithms is to offer services that satisfy the QoS requirements of individual users while guaranteeing at the same time an efficient utilization of network resources.In this paper we introduce a new service model that provides per-flow bandwidth guarantees, where users subscribe for a guaranteed rate; moreover, the network periodically individuates unused bandwidth and proposes short-term contracts where extra-bandwidth is allocated and guaranteed exclusively to users who can exploit it to transmit at a rate higher than their subscribed rate.To implement this service model we propose a dynamic provisioning architecture for intra-domain Quality of Service networks. We develop a set of dynamic on-line bandwidth allocation algorithms that take explicitly into account traffic statistics and users’ utility functions to increase users’ benefit and network revenue.Further, we propose a mathematical formulation of the extra-bandwidth allocation problem that maximizes network revenue. The solution of this model allows to obtain an upper bound on the performance achievable by any on-line bandwidth allocation algorithm.We demonstrate through simulation in realistic network scenarios that the proposed dynamic allocation algorithms are superior to static provisioning in providing resource allocation both in terms of total accepted load and network revenue, and they approach, in several network scenarios, the ideal performance provided by the mathematical model.     

Harmonic proportional bandwidth allocation and scheduling for service differentiation on streaming servers

To provide ubiquitous access to the proliferating rich media on the Internet, scalable streaming servers must be able to provide differentiated services to various client requests. Recent advances of transcoding technology make network-I/O bandwidth usages at the server communication ports controllable by request schedulers on the fly. In this article, we propose a transcoding-enabled bandwidth allocation scheme for service differentiation on streaming servers. It aims to deliver high bit rate streams to high priority request classes without overcompromising low priority request classes. We investigate the problem of providing differentiated streaming services at application level in two aspects: stream bandwidth allocation and request scheduling. We formulate the bandwidth allocation problem as an optimization of a harmonic utility function of the stream quality factors and derive the optimal streaming bit rates for requests of different classes under various server load conditions. We prove that the optimal allocation, referred to as harmonic proportional allocation, not only maximizes the system utility function, but also guarantees proportional fair sharing between classes with different prespecified differentiation weights. We evaluate the allocation scheme, in combination with two popular request scheduling approaches, via extensive simulations and compare it with an absolute differentiation strategy and a proportional-share strategy tailored from relative differentiation in networking. Simulation results show that the harmonic proportional allocation scheme can meet the objective of relative differentiation in both short and long timescales and greatly enhance the service availability and maintain low queueing delay when the streaming system is highly loaded.     

一种近似公平的网络带宽分配算法

Internet业务流由大量相互竞争的数据流构成。为了保障各种网络业务所需的服务质量,需要在这些数据流之间进行近似公平的带宽分配。文章提出了采用多令牌桶进行带宽分配的机制,提供了一定的流间隔离与保护。仿真实验表明,该算法在保护网关的缓冲区和控制带宽的公平分配方面是有效的。