无线城域网带宽调度算法的设计与仿真

无线城域网空中接口规范IEEE802.16标准将刚络中的业务流分为UGS、rtPS、nrtPS和BE四种类型,虽然协议中提出了对不同类型业务的QoS保证机制,但并没有给出具体的能保障不同业务服务质量的调度算法.通过研究不同类型业务各自特点及其适用的调度方法,提出了一种基于802.16的上行带宽调度算法--分类联合调度算法,使系统中不同类型的业务流具有可比拟的调度因子,从而进行业务流的自动分类和联合调度.理论分析和仿真结果表明,算法有效提高网络资源利用率,同时能满足不同业务流的QoS需求.     

增强超宽带无线网络QoS的调度算法

基于对UWB网络中已有调度算法性能的分析,提出了一种用于增强UWB无线网络QoS的调度算法。该算法采用跨层设计的思想,能根据无线物理层信道状态和应用层业务传输速率的变化进行动态带宽分配,分配过程主要采用带宽借贷的思想,即在具有不同优先级的业务流之间进行带宽调度,以尽最大可能满足具有不同优先级的业务流QoS要求。仿真结果表明,该算法能有效地增强网络的QoS,提高整个网络的性能。     

基于业务流均衡的802.16无线分组调度算法

基于对802.16 2004标准所提出的四种业务流的分析,结合802.16网络的实际应用场景,提出了一种基于业务流均衡的802.16系统无线分组调度算法,并对该算法进行了Matlab仿真类比。仿真结果表明,新算法能够很好地解决分组调度的优先权问题和“饥饿”情况,具有重要的实际意义。     

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

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

时间敏感网络下的一种新型灵活门控机制

时间敏感网络流调度算法通常需要生成大量的门控事件。这超出了网络设备的能力，使得调度算法难以在实际网络中部署。针对此问题，提出一种新型灵活门控机制，通过放松实时业务流与尽力而为业务流严格隔离的约束，允许部分节点对实时业务流不启用门控机制。该机制允许灵活地选择在各个网络设备端口对各实时业务流使能门控，能够将调度实时业务流所需的门控事件最多减少91.6%,其甚至允许实时业务传输路径上存在不支持门控调度的网络设备，实现与普通网络的混合组网。     

自相似业务下QoS队列调度算法性能分析

研究自相似业务下QoS队列调度算法性能,研究自相似业务下不同队列调度算法性能的优劣,发现目前队列调度算法针对具体业务流时的性能差异并对算法进行改进。     

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

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

由VTRR算法为DiffServ提供QoS的一种方法

ＤｉｆｆＳｅｒｖ是解决宽带Ｉｎｔｅｒｎｅｔ ＱｏＳ控制的一种可行方案，它在边界节点将不同的ＱｏＳ要求映射成ＰＨＢ。对每类具有相同ＰＨＢ的ＩＰ业务流，应用ＶＴＲＲ公平调度算法。ＶＴＲＲ算法允许在竞争带宽的业务流中公平共享分配的带宽。将ＶＴＲＲ与ＲＳＶＰ结合使用，能为ＤｉｆｆＳｅｒｖ提供ＱｏＳ保证。     

一种高性能CICQ交换结构调度算法

在CICQ的两类调度算法中,无队列状态信息调度算法相对简单,但在非均匀的业务流环境下性能无法令人满意;基于队列状态信息的调度算法在非均匀的业务流环境下性能良好,但算法复杂度高。针对以上不足,提出一种低复杂度的高效调度算法CRR-FRR。新算法无需比较和排序,硬件实现简单,具有良好的可扩展性。仿真结果表明,无论是在均匀分布还是在突发业务源的情况下,均具有良好的时延性能。     

由VTRR算法为DiffServ提供QoS的一种方法

DiffServ是解决宽带Internet QoS控制的一种可行方案,它在边界节点将不同的QoS要求映射成PHB.对每类具有相同PHB的IP业务流,应用VTRR公平调度算法.VTRR算法允许在竞争带宽的业务流中公平共享分配的带宽.将VTRR与RSVP结合使用,能为DiffServ提供QoS保证.     

一种支持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模型.     

Achieving fair service with a hybrid scheduling scheme for CICQ switches

Providing performance guarantees for arriving traffic flows has become an important measure for today’s routing and switching systems. However, none of current scheduling algorithms built on CICQ (combined input and cross-point buffered) switches can provide flow level performance guarantees. Aiming at meeting this requirement, the feasibility of implementing flow level scheduling is discussed thoroughly. Then, based on the discussion, it comes up with a hybrid and stratified fair scheduling (HSFS) scheme, which is hierarchical and hybrid, for CICQ switches. With HSFS, each input port and output port can schedule variable length packets independently with a complexity of O(1). Theoretical analysis show that HSFS can provide delay bound, service rate and fair performance guarantees without speedup. Finally, we implement HSFS in SPES (switch performance evaluation system) to verify the analytical results.     

支持公平服务的CICQ分层混合调度策略

为到达业务提供性能保障是衡量一个交换系统性能的重要参考.针对现有联合输入交叉点排队交换结构(CICQ)调度策略缺乏基于流的服务质量保障,探讨了在CICQ交换结构实施基于"流"调度的可能性,提出了一种能够为到达业务流的提供公平服务的分层混合调度策略(HSFS).HSFS采用分层的混合调度机制,每个输入、输出端口可独立地进行变长分组交换,其复杂度为O(1),具有良好可扩展特性.理论分析结果表明,HSFS无需加速便能为到达业务提供时延上限、速率和公平性保障.最后,基于SPES对HSFS的性能进行了评估.     

Max-Min Fair Scheduling in Input-Queued Switches

Fairness in traffic management can improve the isolation between traffic streams, offer a more predictable performance, eliminate transient bottlenecks, mitigate the effect of certain kinds of denial-of-service attacks, and serve as a critical component of a quality-of-service strategy to achieve certain guaranteed services such as delay bounds and minimum bandwidths. In this paper, we choose a popular notion of fairness called max-min fairness and provide a rigorous definition in the context of input-queued switches. We show that being fair at the output ports alone or at the input ports alone or even at both input and output ports does not actually achieve an overall max-min fair allocation of bandwidth in a switch. Instead, we propose a new algorithm that can be readily implemented in a distributed fashion at the input and output ports to determine the exact max-min fair rate allocations for the flows through the switch. In addition to proving the correctness of the algorithm, we propose a practical scheduling strategy based on our algorithm. We present simulation results, using both real traffic traces and synthetic traffic, to evaluate the fairness of a variety of popular scheduling algorithms for input-queued switches. The results show that our scheduling strategy achieves better fairness than other known algorithms for input-queued switches and, in addition, achieves throughput performance very close to that of the best schedulers.     

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

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

Preemptive and non-preemptive scheduling of optical switches with configuration delay

Utilizing optical technologies for the design of packet switches and routers offers several advantages in terms of scalability, high bandwidth, power consumption, and cost. However, the configuration delays of optical crossbars are much longer than that of the electronic counterpart, which makes the conventional slot-by-slot scheduling methods no longer the feasible solution. Therefore, some tradeoff must be found between the empty time slots and configuration overhead. This paper classifies such scheduling problems into preemptive and non-preemptive scenarios, each has its own advantages and disadvantages. Although non-preemptive scheduling is inherently not good at achieving the above-mentioned tradeoff, it is shown, however, that the proposed maximum weight matching (MWM) based greedy algorithm is guaranteed to achieve an approximation 2 for arbitrary configuration delay, and with a relatively low time complexity O(N2). For preemptive scheduling, a novel 2-approximation heuristic is presented. Each time in finding a switch configuration, the 2-approximation heuristic guarantees the covering cost of the remaining traffic matrix to have 2-approximation. Simulation results demonstrate that 2-approximation heuristic (1) performs close to the optimal scheduling, and (2) outperforms ADJUST and DOUBLE in terms of traffic transmission delay and time complexity.     

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.     

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

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

时隙间迭代的输入队列交换机Round-Robin调度算法

输入队列因具有良好的可扩展性而广泛应用于高速交换机和路由器中,但输入队列需要精心设计调度算法以获取较好的性能.Round-Robin算法因其简单性和并行性而得到广泛的研究,但现有的Round-Robin算法在突发流量和非均匀流量下的负荷-延迟性能较差.提出了调度决策在时隙间进行迭代的思想,并利用队列长度具有随机性的特点设计了能近似最大匹配的Round-Robin算法--iSLOT.仿真结果表明,iSLOT不仅在均匀流量下是稳定的,在非均匀流量和突发流量下的吞吐率及延迟性能均远好于现有的Round-Robin算法.     

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

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