Packet Scheduling in Optical FIFO Buffers
Packet Scheduling in Optical FIFO Buffers
复制标题
光 FIFO 缓冲器中的数据包调度
DOI：
10.1109/hsnw.2007.4290548
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
Y. Ganjali
中科院分区：
文献类型：
--
作者：
N. Beheshti;Y. Ganjali
光技术的最新进展表明，在不久的将来建立全光缓存器是可能的。这些缓冲器通常由多个光纤延迟线（FDL）和光开关组成。进入的数据包通过光学延迟线存储有限的时间。光交换机在不同的延迟线之间传输这些数据包，或者如果数据包要离开系统，则将它们发送到输出线。作为使用光学技术的直接结果，这种设置的主要限制之一是开关的尺寸需要很小。在本文中，我们证明了仅使用O（logN）2times2开关来构造大小为N的FIFO队列的可行性。一个简单的调度算法，实现这一界限。所提出的结构提供了一种使用最少数量的延迟线和开关来存储光分组的有效方式。
Recent advances in optical technology show the possibility of building all-optical buffers in the near future. These buffers are usually composed of a number of fiber delay lines (FDLs) and optical switches. Incoming packets are stored for a limited time by going through optical delay lines. Optical switches transfer these packets among different delay lines, or send them towards the output line if a packet is to leave the system. As a direct consequence of using optical technology, one of the major constraints in this setting is that the size of switch needs to be small. In this paper, we show the feasibility of constructing a FIFO queue of size N by using only O(log N) 2times2 switches. A simple scheduling algorithm that achieves this bound is developed. The proposed structure provides an efficient way of storing optical packets using a minimal number of delay lines and switches.