DiffServ网络中一种改进的round robin公平加权调度算法

文中提出了DiffServ网络中一种改进的公平加权round robin调度算法。该算法在网络发生拥塞时，根据各优先业务粪的不同服务等级，动态地改变奋优先业务类的调度权重，并同时保持了各优先业务类的相对公平性。通过仿真显示，该算法在适度满足尽力服务类的同时．能有效处理不同业务类的炙发数据，比较迅速地缓解网络的拥塞状况。     

DiffServ网络中一种改进的round robin公平加权调度算法

文中提出了DiffServ网络中一种改进的公平加权round robin调度算法。该算法在网络发生拥塞时,根据各优先业务 类的不同服务等级,动态地改变各优先业务类的调度权重,并同时保持了各优先业务类的相对公平性。通过仿真显 示,该算法在适度满足尽力服务类的同时,能有效处理不同业务类的突发数据,比较迅速地缓解网络的拥塞状况。     

区分服务中AF类的一种调度算法

该文根据区分服务中确保转发(Assured Forwarding,AF)类的特点,设计了一种新的调度算法公平加权轮循(Fair、Weighted Round Robin,FWRR)算法。 FWRR是一种基于轮循、工作保持型、适于变长分组的调度算法.它的实现简单,算法复杂度为O(1).仿真实验和数学分析表明,FWRR算法不仅能够提供保证最小带宽的服务,而且能够按比例分配剩余带宽,适合用来调度区分服务中的AF类.     

区分服务网络中的TCP友好公平体系

区分服务(Differentiated Services)是IETF为实现IP服务质量(QoS)而定义的一个体系结构。研究表明,在该体系中存在不公平问题,该文将TCP友好(TCP Friendly)的概念引入到DS网络中,并定义了DS网络中的TCP友好的公平性,仿真验证了目前IETF定义的流量调节(TrafficConditioning)以及丢包策略等机制不能很好地实现TCP友好公平性,因而提出了直接拥塞控制机制来实现这一公平性。     

区分服务网络中直接拥塞反馈机制与动态流量调节

IP服务质量是目前国际上的一个研究热点,IETF为此而定义了区分服务体系结构.然而,该体系中存在不公平问题.本文提出了一种直接拥塞反馈机制(DCCS),配合网络边缘的动态流量调节(DTC)算法,能够为该体系提供很好的公平性.该机制不仅能保证响应流与非响应流之间的公平性,而且能解决响应流(如TCP)自身由于分组长度,微流数目及环回时延(RTT)等因素而产生的差异.     

FCA-ItswTCM:区分服务中一种公平的拥塞自适应标记算法

 本文提出了一种新的滑动窗口标记算法——公平的拥塞自适应标记算法(FCA-ItswTCM).算法近似识别TCP流和UDP流,适度区分标记,规避拥塞控制机制对公平性的影响;细粒度描述拥塞,预测拥塞,以此自适应调节各流注入黄包比例,兼顾网络拥塞状态对公平性的影响.仿真实验表明,与其他几种滑动窗口标记算法相比,FCA-ItswTCM对确保TCP流和UDP流带宽共享的公平性、提高资源利用率及系统稳定性有较好的效果.     

无线Mesh网络中的自适应队列调度算法研究

针对无线mesh网络的网络特性,分析了无线网络中的队列调度算法,提出了一种自适应的队列调度算法AQSM,详细讨论了该算法的具体实现过程及参数变化规则,通过仿真验证了该算法在提高网络性能的同时还可以实现对不同业务流的业务区分。     

基于优先级的分组公平调度算法研究

为了在光突发交换网络中支持区分服务,提出了一种新颖的控制分组调度算法,即基于优先级权重的公平队列调度算法.近似的调度分析模型用来简化对不同级别的调度权重的求解.:同时定义了一种参数来评估分析模型的有效性和调度算法的公平性.仿真试验结果证实了该分析模型在负载较高时是非常有效的,而且调度算法能提供很好的公平性.     

多功能相控阵雷达自适应调度算法研究

由于阵列天线的波束捷变能力 ,多功能相控阵雷达可对多个目标交替进行搜索、验证、跟踪等工作方式的操作。为此 ,需要一种调度策略以有效地分配雷达时间和能量等资源 ,达到优化雷达整体性能的目的。针对多功能相控阵雷达 ,在分析自适应调度算法的设计原则基础上提出一种自适应调度算法 ,并给出具体的性能评估指标。算法能够根据雷达事件的优先级、驻留长度、期望发射时间及时间窗合理地安排一个调度间隔内的雷达事件序列 ,仿真结果验证了调度算法的有效性。     

基于幂函数的加权自适应直方图均衡

介绍了直方图均衡（HE）和自适应直方图均衡（AHE）对比度增强方法，进而提出了一种基于幂函数形式的加权自适应直方图均衡（WAHE）法，并给出其滑动窗口权矩阵生成方式及直方图分布计算方法，最后给出了数字X光胸腔图像的处理结果。     

区分服务的改进主动队列管理算法

在区分服务模型中，具有不同微流数量、分组长度和目标速率的流聚集在资源共享时往往无法获得公平带宽。本文在自适应RIO算法基础上提出了一种区分RIO算法（Differentiated RIO，DRIO），DRIO对具有不同目标速率的流区别对待，使得无论在何种情况下都可以很好地保证各流聚集在共享带宽资源上的公平性，而且算法实现简单。仿真结果表明，DRIO对提高流聚集之间的公平性有很明显的效果。     

An optimal bandwidth allocation and data droppage scheme for differentiated services in a wireless network

This paper presents an optimal proportional bandwidth allocation and data droppage scheme to provide differentiated services (DiffServ) for downlink pre‐orchestrated multimedia data in a single‐hop wireless network. The proposed resource allocation scheme finds the optimal bandwidth allocation and data drop rates under minimum quality‐of‐service (QoS) constraints. It combines the desirable attributes of relative DiffServ and absolute DiffServ approaches. In contrast to relative DiffServ approach, the proposed scheme guarantees the minimum amount of bandwidth provided to each user without dropping any data at the base‐station, when the network has sufficient resources. If the network does not have sufficient resources to provide minimum bandwidth guarantees to all users without dropping data, the proportional data dropper finds the optimal data drop rates within acceptable levels of QoS and thus avoids the inflexibility of absolute DiffServ approach. The optimal bandwidth allocation and data droppage problems are formulated as constrained nonlinear optimization problems and solved using efficient techniques. Simulations are performed to show that the proposed scheme exhibits the desirable features of absolute and relative DiffServ. Copyright © 2009 John Wiley & Sons, Ltd.     

一种自适应RIO算法的研究

针对区分服务保证转发服务中传输流间带宽分配公平性的问题，本文提出一种自适应RIO(ARIO，adaptive RIO)算法。仿真结果表明，ARIO算法不但可以在不同订购条件下获得更高的带宽利用率和更低的分组丢失率，而且有效地改进了原RIO算法的剩余带宽公平性问题。     

区分服务QoP的可生存虚拟网络映射算法研究

用户对虚拟网保护需求呈现多样化的趋势,针对如何实现不同需求的可生存虚拟网映射是当前研究亟待解决的问题。建立了区分保护质量（QoP）的可生存虚拟网络映射问题的数学模型,然后提出了一种启发式算法进行求解。该算法包括广度优先搜索的节点映射策略和区分QoP的链路映射策略。模拟实验表明,该算法不仅能满足用户不同的虚拟网保护需求,而且相比现有算法降低了底层网络资源开销。     

An efficient scheduling scheme with diverse traffic demands in IEEE 802.16 networks

In IEEE 802.16 networks, a subscriber station (SS) could be a single mobile user, a residence house, or an office building providing Internet service for multiple customers. Considering the heterogeneity among SSs which have diverse traffic demands, in this paper, we introduce the weighted proportional fair (WPF) scheduling scheme for the Best Effort (BE) service in IEEE 802.16 networks to achieve the flexible and efficient resource allocation. We develop an analytical model to investigate the performance of WPF in terms of spectral efficiency, throughput, resource utilization, and fairness, where the Rayleigh fading channel and the adaptive modulation and coding (AMC) technique are considered. Extensive simulations are conducted to illustrate the efficiency of the WPF scheduling scheme and verify the accuracy of the analytical model. Copyright © 2009 John Wiley & Sons, Ltd.     

Burst scheduling for differentiated services in optical burst switching WDM networks

Optical burst switching (OBS) is one of the most important switching technologies for future optical wavelength division multiplexing (WDM) networks and the Internet. The model of differentiated services has been proposed to support quality of service (QoS) in the IP‐based Internet. It is also very important to have differentiated service support in OBS networks. When the burst scheduling in an OBS network is set up appropriately, network can support differentiated services. In this paper, we proposed a new burst scheduling scheme, called differentiated scheduling with identical priority offset time (DSIPO). In DSIPO, the same priority offset time is used for all the bursts destined to the same edge node regardless of their priorities. Differentiated services in terms of burst loss probability are achieved by processing the control packets of higher priority class bursts, thus reserving resources for their data bursts, more promptly upon their arrival than those of lower priority class bursts. Each intermediate (core) node can adjust the burst loss probabilities of various burst classes by choosing its own differentiated processing delay value for each priority class or its own differentiated processing delay difference value between any pair of adjacent priority classes. We model and analyse DSIPO in terms of the burst loss probability for each priority class with simulation validation. The performance of DISPO is evaluated by simulation. Copyright © 2004 John Wiley & Sons, Ltd.     

Evaluating the expedited forwarding of voice traffic in a differentiated services network

The Differentiated Services architecture offers a scalable alternative to provide Quality of Service (QoS) to the new multimedia applications in the Internet. This paper aims at evaluating the delay and jitter experienced by voice traffic when handled by the Expedited Forwarding (EF) scheme. The analysis includes the effects of different packet scheduling mechanisms implementing EF and of the voice packet size. We also evaluate how efficiently each type of traffic uses an extra allocated bandwidth and the impact of traffic shaping. The results show that increasing the service rate share allocated to the EF aggregate does not significantly affect the competing best effort (BE) traffic. This holds as long as the BE traffic can use the bandwidth left unused by the EF traffic in idle periods. Copyright © 2002 John Wiley & Sons, Ltd.     

An active scheduling paradigm for open adaptive network environments

Active and programmable networks change the functionality of routers and switches by using agents and active packets. This paper presents a new packet scheduling scheme called Active Scheduling to control and maintain QoS parameters in virtual private networks (VPNs) within the confines of adaptive and programmable networks. In Active Scheduling an agent on the router monitors the accumulated queuing delay for each service. In order to control and to keep the end‐to‐end delay within the bounds, the weights for services are adjusted dynamically by agents on the routers spanning the VPN. If there is an increase or decrease in queuing delay of a service, an agent on a downstream router informs the upstream routers to adjust the weights of their queues. This keeps the end‐to‐end delay of services within the specified bounds and offers better QoS compared to VPNs using static WFQ. The paper describes the algorithm for Active Scheduling, and presents simulation results and these are compared with WFQ. Copyright © 2004 John Wiley & Sons, Ltd.     

Price‐coupled scheduling for differentiated services: Gcµ versus GPS

We present an integrated approach to pricing and scheduling for services that are differentiated in terms of throughput, delay and loss specifications. The key building block to the model are quality value curves that specify a user's value of higher quality levels. From the analysis emerges a pricing rule that charges based on rate and quality grade, and a dynamic scheduling rule, called the Gcµ rule. The analysis also derives the economically optimal probabilistic quality of service (QoS) guarantee parameters. We compare our model to the deterministic approach of QoS guarantees using burstiness constraints and fair scheduling rules. The scheduling that arises from such a deterministic approach is the well‐known Generalized Processor Sharing (GPS). A comparative analysis inspires the fair Gcµ‐PS rule as the scheduling rule that combines the unique strengths of GPS and Gcµ. This Gcµ‐PS rule is proposed as a tailored scheduling solution for both the expedited forwarding class and the four assured forwarding classes in the IETF's differentiated services. Copyright © 2002 John Wiley & Sons, Ltd.     

Priority differentiated multicast flow scheduling method in Ceph cloud storage network

In order to solve the problem that existing flow scheduling method is difficult to meet the different multicast scheduling requirements of multi-service flows in the Ceph cloud storage network,a service priority-based multicast flow scheduling method was tailored.First,the network status was obtained via software defined network (SDN) to support flow scheduling.Then,a multicast task was decomposed into multiple attribute decision problems for multiple unicast path selection,and a method of unicast path selection based on technique for order preference by similarity to ideal solution (TOPSIS) was proposed.The unicast path selection method was used to find the optimal unicast path set for the service flow based on the flow’s network performance requirements.Then,the multicast distribution node was determined by the maximum common sub-path among the optimal unicast path sets for construct a multicast transmission path.The experiment results show that the proposed method can reduce the transmission delay of high priority flows while reduce the redundant traffic and better balance the traffic loads compared with the existing methods.