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

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

云环境下的基于Min-Max的节能资源调度算法的研究

针对云计算环境下的高能耗问题,从系统节能的角度提出一种节能资源调度算法(energy-saving scheduling algorithm based on min-max,ESSAMM)。在Min-Max算法的基础上综合考虑了用户对于任务期望的完成时间和能量消耗两个因素,以节省任务执行过程中产生的能量消耗,并提高用户的时间QoS满意度,实现负载均衡。将任务集合中各任务按照长度从小到大排序,并根据时间QoS为该集合中长度最大和最小的任务选出符合用户期望的物理资源;根据能量估算模型,计算出这两个任务在各物理机上的执行能耗;选择最小能耗对应的物理机来执行该任务;将这两个任务在任务集合中删除,并重复上述过程,直到任务集合为空。仿真结果表明,相比于Min-Max和Min-Min资源调度算法,该算法能够有效降低系统执行任务产生的总能耗,提高用户时间服务质量,并实现调度系统负载均衡。     

基于AFDX自适应优先调度算法的实时性分析

通过分析AFDX终端系统关键技术,在AFDX网络虚拟链路的调度策略中提出采用自适应优先调度算法;并分析数据包在终端系统中的处理过程,进行网络演算建模,进而确定出AFDX网络针对不同类型数据的传输速率和服务时延.结果证明该算法较好地满足了航空电子网络数据传输实时性需求,并为AFDX智能网络管理模型中的参数模型和调度策略提...     

基于信道状态的WiMAX系统实时调度算法

介绍了M-LWDF、EXP和CD-EDD三种经典的实时调度算法,并在此基础上提出一种基于信道状态的WiMAX系统的实时调度算法CBRTS(channel-based real-time scheduling)。该算法核心思想是在数据链路层中考察物理层信道的传输条件,从而进一步将有限的无线资源更加合理地分配给用户。仿真结果表明,提出的算法具有更高的吞吐量、更小的时延和丢包率,能满足实时业务的QoS要求。     

面向移动云计算的自适应虚拟机调度算法

随着移动云计算的快速发展和应用普及,如何对移动云中心资源进行有效管理同时又降低能耗、确保资源高可用是目前移动云计算数据中心的热点问题之一.本文从CPU、内存、网络带宽和磁盘四个维度,建立了基于多目标优化的虚拟机调度模型VMSM-EUN(Virtual Machine Scheduling Model based on Energy consumption,Utility and minimum Number of servers),将最小化数据中心能耗、最大化数据中心效用以及最小化服务器数量作为调度目标.设计了基于改进粒子群的自适应参数调整的虚拟机调度算法VMSA-IPSO(Virtual Machine Scheduling Algorithm based on Improved Particle Swarm Optimization)来求解该模型.最后通过仿真实验验证了本文提出的调度算法的可行性与有效性.对比实验结果表明,本文设计的基于改进粒子群的自适应虚拟机调度算法在进行虚拟机调度时,能在降低能耗的同时提高数据中心效用.     

一种联合单播组播的全分布式调度方案

随着网络中组播业务比例的不断增长,交换结构及其调度策略必须能够为组播业务提供良好的支持.本文结合交换结构领域新的研究进展,基于带缓存交叉开关交换单元提出一种联合单播组播的全分布式调度方案DCUM.该方案利用交叉节点缓存的分布特性实现无需加速的组播复制,并通过支持组播加权因子的全分布式调度算法可同时支持单播业务与组播业务的调度.与传统组播调度方案相比,该方案结构简单,调度算法复杂度仅为O(log N),十分便于硬件实现.仿真结果表明,采用DCUM方案可获得良好的调度性能.     

基于Hadoop一种移动云计算本地化调度算法的研究

移动云计算将云计算的概念引入到移动互联网中。在对移动终端和云计算进行研究的基础上,针对移动终端请求计算量小、并发性高、用户实时性要求高的特点,提出一种基于Hadoop的移动云计算本地化调度算法。同时针对实际应用场景可能出现的热点数据问题,给出改进方案。实验结果表明改进后的本地化调度算法能够缩短系统响应时间,提高系统的吞吐率。     

面向目标跟踪的传感器网络睡眠调度协议

移动目标跟踪是无线传感器网络中的一项重要应用,将睡眠调度机制引入到目标跟踪算法中可以大大降低能耗。针对目标跟踪的实际需求,提出一种面向目标跟踪的传感器网络睡眠调度协议。根据目标跟踪不同阶段,分别设计了目标跟踪前和跟踪过程中传感器节点的睡眠调度机制;另外给出了目标丢失时,如何唤醒节点继续跟踪目标的调度策略。结果表明:该算法能够在保证跟踪质量的同时,降低跟踪能耗。     

一种支持DiffServ模型的全分布式调度算法

调度算法设计对于网络路由设备实现区分服务(DiffServ)模型的单跳行为(per hop behavior,简称PHB)至关重要.现有支持DiffServ模型的调度算法普遍基于输出排队(output queued,简称OQ)或是输入排队(input queued,简称IQ)交换结构进行设计,均无法在高速环境下提供高性能的调度.基于联合输入/交叉节点排队(combinedinput-crosspoint-queued,简称CICQ)交换结构提出一种支持DiffServ模型的全分布式调度算法DDSS (distributed DiffServ supporting scheduling),并通过理论分析对其公平性进行了验证.DDSS算法采用基于预约带宽的逐级流量控制机制实现所有预约带宽在快速转发(expedited forwarding,简称EF)业务与确保转发(assured forwarding,简称AF)业务之间的分配,采用优先级调度机制为EF业务提供低延迟服务,算法复杂度为O(log N).仿真结果表明,DDSS算法具有良好的时延性能和公平特性,与现有算法相比,能够更好地支持DiffServ模型.     

缓冲交叉开关交换结构多播调度算法研究

高性能核心交换设备多播调度受到越来越多的关注·交叉开关结构下的多播调度方案或者性能较差,或者过于复杂,难于应用在高速交换场合·为此,提出一种面向多播的多输入队列缓冲交叉开关体系结构·将多播调度分解为信元分派、输入调度、输出调度3个可分布式并行执行的子问题,并设计了相应的调度算法,降低了算法复杂性·实验结果表明,交叉点缓冲区容量与输入队列数量对多播性能都具有很大的影响·在突发流量到达下,与单多播输入队列的体系结构相比,无论是采用O(1)复杂度的HA-RR-RR还是复杂度更高的调度算法,均能显著提高系统吞吐性能·     

Multicast Pull Scheduling: When Fairness Is Fine

We investigate server scheduling policies to minimize average user perceived latency in pull-based client-server systems (systems where multiple clients request data from a server) where the server answers requests on a multicast/ broadcast channel. We first show that there is no O(1) -competitive algorithm for this problem. We then give a method to convert any nonclairvoyant unicast scheduling algorithm A to nonclairvoyant multicast scheduling algorithm B . We show that if A works well, when jobs can have parallel and sequential phases, then B works well if it is given twice the resources. More formally, if A is an s -speed c -approximation unicast algorithm, then its counterpart algorithm B is a 2s -speed c -approximation multicast algorithm. It is already known [5] that Equi-partition, which devotes an equal amount of processing power to each job, is a (2 + ε) -speed O(1 + 1/ε) -approximation algorithm for unicast scheduling of such jobs. Hence, it follows that the algorithm {BEQUI}, which broadcasts all requested files at a rate proportional to the number of outstanding requests for that file, is a (4 + ε) -speed O(1 + 1/ε) -approximation algorithm. We give another algorithm BEQUI-EDF and show that BEQUI-EDF is also a (4 + ε) -speed O(1 + 1/ε) -approximation algorithm. However, BEQUI-EDF has the advantage that the maximum number of preemptions is linear in the number of requests, and the advantage that no preemptions occur if the data items have unit size.     

Scheduling multicast traffic in input-buffered ATM switch

Performance of an input-buffered ATM switch is limited by the head-of-line (HOL) blocking problem. HOL blocking is even more pronounced in multicast switch where cells compete for multiple outputs simultaneously. Previous studies in input-buffered unicast switch have shown that HOL blocking can only be eliminated by using per-output queuing and sophisticated scheduling methods, such as the maximal weight matching (MWM) or the parallel iterative matching (PIM) methods. The MWM or PIM types of scheduling algorithm cannot be applied to multicast switch because of the high computation complexity. In this paper, we present a reservation based scheduling algorithm, which employs per-VC queuing for multicast connections and per-output queuing for unicast connections. Instead of the input ports sending a huge amount of state information to the output ports for processing, we circulate reservation vectors amongst the input ports. Each input port will then make reservation based on its local state and the availability of the output ports. The scheduling is done on a frame by frame basis. While the input ports are transmitting cells according to the schedule of the current frame, the next frame schedule is computed. Simulations reveal that our method substantially outperforms the methods that employ FIFO queuing discipline.     

902.16e系统中一种节能的实时业务数据调度算法

在802.16e系统中,当多个拥有实时业务的MS同时处在休眠模式时,BS的调度结果不仅决定了这些实时业务的QoS,还会影响到网络的平均节能效率.针对这个问题提出了一种新的节能数据调度算法.该算法具有两个方面的技术特点:1)通过调整新加入的MS休眠模式的启动时间,使得各MS的侦听窗口尽量分散并实现系统负载在OFDM帧上较为均匀的分布,以平滑BS调度器的输入;2)对目前广泛使用的实时业务调度算法EDF进行改进,提高处在休眠状态的MS的数据调度优先级.仿真结果表明,该算法在保证系统QoS的同时,不仅能够较大地提高了网络的平均节能效率,还降低了系统的整体信令开销.     

On the Integration of Unicast and Multicast Cell Scheduling in Buffered Crossbar Switches

Internet traffic is a mixture of unicast and multicast flows. Integrated schedulers capable of dealing with both traffic types have been designed mainly for Input Queued (IQ) buffer-less crossbar switches. Combined Input and crossbar queued (CICQ) switches, on the other hand, are known to have better performance than their buffer-less predecessors due to their potential in simplifying the scheduling and improving the switching performance. The design of integrated schedulers in CICQ switches has thus far been neglected. In this paper, we propose a novel CICQ architecture that supports both unicast and multicast traffic along with its appropriate scheduling. In particular, we propose an integrated round-robin-based scheduler that efficiently services both unicast and multicast traffic simultaneously. Our scheme, named multicast and unicast round robin scheduling (MURS), has been shown to outperform all existing schemes under various traffic patterns. Simulation results suggested that we can trade the size of the internal buffers for the number of input multicast queues. We further propose a hardware implementation of our algorithm for a 16 times 16 buffered crossbar switch. The implementation results suggest that MURS can run at 20 Gbps line rate and a clock cycle time of 2.8 ns, reaching an aggregate switching bandwidth of 320 Gbps.     

Multicast-Unicast Data Delivery Method in Wireless IPv6 Networks

Multicast IPv6 is an efficient way of transmitting data simultaneously to a group of IPv6 users. It has the advantage of reducing the required bandwidth of IPv6 data delivery compared to unicast transmission. The data rate of multicast transmission over WLAN is confined by the user with the lowest rate in the multicast group, which is called the fixed base rate problem. This paper proposes a delivery method that incorporates both multicast and unicast transmissions to solve the fixed base rate problem. The proposed method divides the IPv6 network into two levels: multicast mode for the upper level of the network [IPv6 server to Access Point (AP)], and unicast mode for the lower level (AP to mobile nodes). To maintain the end-to-end multicast transmission, the AP is responsible for converting multicast packets to unicast packets. Such a combination enables the proposed method to inherit the advantages of both multicast and unicast transmissions. The performance of our proposed method is evaluated in a test-bed environment that considers the transmission of real-time video application. The proposed multicast-unicast is able to improve the throughput and video quality experienced by the end user, with low packet loss and transmission delay.     

Scheduling and performance analysis of multicast interconnects

Multicast is an important operation in various emerging computing/networking applications. In particular, many multicast applications require not only multicast capability but also predictable communication performance, such as guaranteed multicast latency and bandwidth, called quality-of-service (QoS). In this paper, we consider scheduling in multicast interconnects, which aims to minimize the multicast latency for a set of multicast requests. Unfortunately, such a problem has been proved to be NP-Complete, which means that it is unlikely to find a fast exact algorithm for the multicast scheduling problem. We then turn to propose a simple, fast greedy multicast scheduling algorithm and derive a lower bound and an upper bound on the performance of the algorithm. As can be seen, while a lower bound is fairly straightforward, the upper bound is much more difficult to obtain. By translating the multicast scheduling problem into a graph theory problem and employing a random graph approach, we are able to obtain a probabilistic upper bound on the performance of the multicast scheduling algorithm. Our analytical and simulation results show that the performance of the proposed multicast scheduling algorithm is quite close to the lower bound and is statistically guaranteed by the probabilistic upper bound. The research work was supported in part by the U.S. National Science Foundation under grant numbers CCR-0073085 and CCR-0207999.     

A hybrid multicast–unicast assignment approach for data distribution management in HLA

The main focus of data distribution management (DDM) in HLA is to reduce the amount of data received by federates in large-scale distributed simulations. The use of limited multicast resources plays a key role in the performance of DDM. In order to improve the performance of DDM by using communication protocol effectively, a hybrid multicast–unicast data transmission problem and its formal definition are presented, and then a hybrid multicast–unicast assignment approach is proposed. The approach uses a new adaptive communication protocol selection (ACPS) strategy to utilize the advantages of multicast and unicast, avoid their disadvantages, and consider the inter-relationship between connections. It includes the ACPS static assignment algorithm and the ACPS dynamic assignment algorithm, according to the difference between the static connections and the dynamic connections. In our approach, a concept of distance is presented to measure the inter-relationship between connections for multicast and the message redundancy for unicast, which is the core of the two algorithms in order to gather the connections to a multicast group or to balance the use of unicast and multicast for best performance. As a result, our algorithms can more effectively decide whether a new connection should use unicast or multicast communication, and whether adjusting previous assignment result can further improve the performance. In addition, a control mechanism is introduced to deal with connection changes during the dynamic assignment. The experiment results indicate that our algorithms can utilize the multicast and unicast communication resources effectively, as well as can achieve better performance than existing methods in the real running environment.     

支持组播的输入队列ATM交换机设计及其调度策略研究

目前基于输入队列技术的 ATM交换机的研究日益活跃 .输入队列单播调度算法的研究已经取得了较多研究成果 ,并已得到商业应用 .但输入队列组播调度算法的研究目标主要集中于提高吞吐量 ,而忽略了调度算法对组播流 Qo S的影响 ,如延迟等 .文中提出了一种支持组播功能的输入队列 ATM交换机的设计方案 ,并给出相应的输入队列组播调度算法 ,称为组播最长正则队列优先算法 (ML NQF) .调度算法 ML QNF具有改善吞吐量、满足Qo S需求和公平服务等特点 .     

Multicast Pull Scheduling: When Fairness Is Fine

Abstract. We investigate server scheduling policies to minimize average user perceived latency in pull-based client-server systems (systems where multiple clients request data from a server) where the server answers requests on a multicast/ broadcast channel. We first show that there is no O(1) -competitive algorithm for this problem. We then give a method to convert any nonclairvoyant unicast scheduling algorithm A to nonclairvoyant multicast scheduling algorithm B . We show that if A works well, when jobs can have parallel and sequential phases, then B works well if it is given twice the resources. More formally, if A is an s -speed c -approximation unicast algorithm, then its counterpart algorithm B is a 2s -speed c -approximation multicast algorithm. It is already known [5] that Equi-partition, which devotes an equal amount of processing power to each job, is a (2 + ε) -speed O(1 + 1/ε) -approximation algorithm for unicast scheduling of such jobs. Hence, it follows that the algorithm {BEQUI}, which broadcasts all requested files at a rate proportional to the number of outstanding requests for that file, is a (4 + ε) -speed O(1 + 1/ε) -approximation algorithm. We give another algorithm BEQUI-EDF and show that BEQUI-EDF is also a (4 + ε) -speed O(1 + 1/ε) -approximation algorithm. However, BEQUI-EDF has the advantage that the maximum number of preemptions is linear in the number of requests, and the advantage that no preemptions occur if the data items have unit size.