Recursive construction of FIFO optical multiplexers with switched delay lines
Recursive construction of FIFO optical multiplexers with switched delay lines
复制标题
DOI：
10.1109/tit.2004.838092
复制
发表时间：
2004-12
期刊：
影响因子：
--
通讯作者：
Cheng-Shang Chang;D. Lee;Chao-Kai Tu
中科院分区：
文献类型：
--
作者：
Cheng-Shang Chang;D. Lee;Chao-Kai Tu
在本文中，我们开发的先进先出（FIFO）光复用器的递归结构的数学理论相结合的（无缓冲）交叉开关和光纤延迟线（SDL）。我们表明，通过级联多级SDL单元，2到1的多路复用器与一个大的缓冲区，可以精确地模拟从多路复用器的出发过程和损失过程。通过引入一类新的多路复用器，称为延迟损耗多路复用器，这样的结果被扩展到的情况下的n到1多路复用器。延迟损耗多路复用器具有与普通多路复用器相同的离开过程。然而，由于多路复用器中的缓冲区溢出而丢失的分组可能被延迟。我们理论的一个关键结果是自路由n到1多路复用器，其中数据包通过多级SDL单元的路由路径可以在其到达时确定。
In this paper, we develop mathematical theory for recursive construction of first-in first-out (FIFO) optical multiplexers by the combination of (bufferless) crossbar switches and fiber delay lines (SDLs). We show that by cascading multistage SDL units, 2-to-1 multiplexers with a large buffer can be emulated exactly for both the departure process and the loss process from the multiplexer. Such results are extended to the case of n-to-1 multiplexers by introducing a new class of multiplexers, called delayed-loss multiplexers. A delayed-loss multiplexer has the same departure process as an ordinary multiplexer. However, lost packets due to buffer overflow in a multiplexer might be delayed. A key result from our theory is the self-routing n-to-1 multiplexer, where the routing path of a packet through the multistage SDL units can be determined upon its arrival.