High-Speed Multicast Scheduling in Hybrid Optical Packet Switches with Guaranteed Latency

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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computers 2013-10, Vol.62 (10), p.1972-1987
Main Authors: Guo, Zhiyang, Yang, Yuanyuan
Format: Article
Language:English
Subjects:
hardware implementation
hybrid optical/electronic switch
latency guarantee
multicast scheduling
Optical buffering
optical interconnects
Optical packet switching
Optical switches
parallel
pipeline
Processor scheduling
Receivers
Scheduling
Vectors
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0018-9340
1557-9956
DOI:10.1109/TC.2012.125