VOQ交换机的输出队列调度算法

针对VOQ高速交换机的通信调度,提出在VOQ交换机的输出队列中直接进行通信调度(OSA-VOQ)的策略.OSA-VOQ算法可直接支持变长数据包通信调度,克服了传统通信调度算法只能调度定长数据包的缺点,降低了交换机的实现复杂度.仿真结果表明,在各种流量下,OSA-VOQ算法都比iSLIP等现有的调度算法具有更好的调度性能.OSA-VOQ算法高效地实现了VOQ交换机的通信调度.     

可扩展网络交换调度系统的分布式迭代算法*

提出了一种最长队列优先的分布式迭代算法。与现有算法不同的是,该算法针对可扩展网络交换调度结构的特点,为处于最高优先级的调度器安排了两次迭代。其中的第一次迭代实现最长虚拟输出队列(VOQ)的查找,并且在最高优先级时隙之前的一个时隙完成,以缩短信号的处理时间。仿真结果表明,本算法与现有算法相比,在大流量的uniform流量模式下,延时性能与吞吐率获得了明显的提高;同时,该算法的硬件代价小,有效地实现了性能和复杂度的良好折中。     

分布式调度算法在VOQ交换机中的应用

为提高高速通信网络的通信效率，针对VOQ交换机，提出在交换机的各个输出端口中进行分布式通信调度(DSA)的策略。DSA算法可直接支持变长数据包通信调度，克服了传统信元交换只能调度定长数据包的缺点，降低了交换机的实现复杂度。仿真结果表明：在各种流量下，DSA算法都比信元调度算法具有更好的调度性能。     

一种支持QoS片上网络路由器的设计与实现

设计了一种8端口的NoC路由器.采用简化的VOQ结构,使用双交叉开关,可连接4个IP核,开关调度具有动态、确定和公平的特点,能够提供QoS保证,并有效降低了报文排头阻塞和片上网络面积.Synopsys Design Compiler的综合结果表明,基于0.13μm工艺实现后,面积为0.62mm2,工作频率可达500MHz.     

一种流量自适应的iSLIP算法

针对iSLIP(iterative round robin matching with slip)算法在处理突发业务时性能严重恶化的问题,在iSLIP算法的基础上提出了一种流量自适应的时隙间迭代算法TA-iSLIP(traffic adaptive iSLIP)．该算法根据队列长度智能判断当前流量情况,采取不同的调度策略,充分利用已经匹配的资源,使系统的匹配开销尽可能减小．并给出了TA-iSLIP的算法描述和性能评价,与iSLIP算法、FIRM(fcfs in round-robin matching)算法进行了比较．仿真结果表明,TA-iSLIP在均匀和非均匀流量下都达到了较好的性能,在非均匀流量下的吞吐率达到97％以上．     

Scheduling algorithm for VOQ switches

A variety of matching schemes for VOQ switches that provide high throughput for uniform traffic have been proposed. The dual round robin matching (DRRM) scheme has performance similar to iSLIP and lower implementation complexity. DRRM with exhaustive service (EDRRM) algorithm was created as modification of DRRM algorithm with goal to improve performance of DRRM algorithm for bursty and non-uniform traffic conditions. Under extremely unbalanced arrival traffic, an exhaustive service policy may lead to unfairness and starvation. This paper proposes matching scheme for VOQ switches that provides high throughput almost the same as EDRRM scheme and avoid unfairness and starvation under unbalanced traffic.     

军用高速路由器的研制及实现策略

随着Internet的迅速发展和网络安全要求的提高，军用高速路由器的开发势在必行。本首先说明了研制军用高速路由器的必要性，然后介绍了国内外的发展现状，并在此基础上阐述了高速路由器的体系结构和实现难点。接着说明了设计目标和技术手段，最后讨论了高速路由器的实现策略并预测了其前景。     

一种高速路由器的设计方案和开发策略

随着Internet的迅速发展和网络安全要求的不断提高，国产高速路由器的设计和开发势在必行。本首先说明了高速路由器的技术特点，然后介绍了国内外的研究现状产品动态。接着详细讨论了高速路由器的设计目标和技术方案，最后对高速路由器的前景进行了分析预测。     

Bandwidth guaranteed multicast scheduling for virtual output queued packet switches

Multicast enables efficient data transmission from one source to multiple destinations, and has been playing an important role in Internet multimedia applications. Although several multicast scheduling schemes for packet switches have been proposed in the literature, they usually aim to achieve only short multicast latency and high throughput without considering bandwidth guarantees. However, fair bandwidth allocation is critical for the quality of service (QoS) of the network, and is necessary to support multicast applications requiring guaranteed performance services, such as online audio and video streaming. This paper addresses the issue of bandwidth guaranteed multicast scheduling on virtual output queued (VOQ) switches. We propose the Credit based Multicast Fair scheduling (CMF) algorithm, which aims at achieving not only short multicast latency but also fair bandwidth allocation. CMF uses a credit based strategy to guarantee the reserved bandwidth of an input port on each output port of the switch. It keeps track of the difference between the reserved bandwidth and actually received bandwidth, and minimizes the difference to ensure fairness. Moreover, in order to fully utilize the multicast capability provided by the switch, CMF lets a multicast packet simultaneously send transmission requests to multiple output ports. In this way, a multicast packet has more chances to be delivered to multiple destination output ports in the same time slot and thus to achieve short multicast latency. Extensive simulations are conducted to evaluate the performance of CMF, and the results demonstrate that CMF achieves the two design goals: fair bandwidth allocation and short multicast latency.     

基于螺旋线的Round-Robin Crossbar调度算法

该文提出了一种基于螺旋线的 Round-Robin(R-R)crossbar调度算法,在调度级和迭代级分别轮询R-R指针,避免了指针同步;在输入端口轮询和迭代匹配的二维过程,执行流水线操作。当端口数32时,执行效率高,带宽利用率高,逻辑简单,容易实现。通过对R-R加权,可以保证Non-uniformtraffic高吞吐量。