High-Speed Multicast Scheduling in Hybrid Optical Packet Switches with Guaranteed Latency
High-Speed Multicast Scheduling in Hybrid Optical Packet Switches with Guaranteed Latency
复制标题
DOI：
10.1109/tc.2012.125
复制
发表时间：
2013-10
影响因子：
3.7
通讯作者：
Zhiyang Guo;Yuanyuan Yang
中科院分区：
文献类型：
--
作者：
Zhiyang Guo;Yuanyuan Yang
在本文中，我们研究了 OpCut 交换机中的多播调度，这是一种最近提出的混合光电交换架构，用于在核心网络和并行计算机中传输大容量流量。首先，我们提出一种称为保证延迟多播调度（GLMS）的多播调度算法，该算法考虑多个时隙的每个数据包的调度。我们证明 GLMS 具有几个理想的特性，例如保证所有传输数据包的延迟以及对传输要求的适应性。为了放宽计算调度的时间限制，我们进一步提出了一种 GLMS 的并行和流水线处理架构，它将调度任务分配到多个流水线处理阶段，每个阶段有 N 个处理器，其中 N 是交换机大小。最后，通过简单的组合逻辑电路实现，我们表明每个处理器可以在（O（1））时间复杂度内完成一个时隙的调度。我们针对统计流量模型和真实的互联网流量对GLMS的性能进行了广泛的评估，结果表明所提出的GLMS算法可以实现非常低的平均数据包延迟和最小的丢包率。
In this paper, we study multicast scheduling in the OpCut switch, a recently proposed hybrid optical/electronic switching architecture for transmitting high-volume traffic in core networks and parallel computers. First, we present a multicast scheduling algorithm called Guaranteed Latency Multicast Scheduling (GLMS) that considers the schedule of each packet for multiple time slots. We show that GLMS has several desirable features, such as guaranteed latency for all transmitted packets and adaptivity to transmission requirements. To relax the time constraint on computing a schedule, we further propose a parallel and pipeline processing architecture for GLMS that distributes the scheduling task to multiple pipelined processing stages, with N processors in each stage, where N is the switch size. Finally, by implementing it with simple combination logic circuits, we show that each processor can finish the scheduling for one time slot in (O(1)time complexity. We evaluate the performance of GLMS extensively against statistical traffic models and real Internet traffic, and the results show that the proposed GLMS algorithm can achieve very low average packet latency with minimum packet drop ratio.