首页> 外文期刊>IEEE Transactions on Information Theory >A Necessary and Sufficient Condition for the Construction of 2-to-1 Optical FIFO Multiplexers by a Single Crossbar Switch and Fiber Delay Lines
【24h】

A Necessary and Sufficient Condition for the Construction of 2-to-1 Optical FIFO Multiplexers by a Single Crossbar Switch and Fiber Delay Lines

机译:通过单交叉开关和光纤延迟线构造2对1光学FIFO多路复用器的充要条件

获取原文
获取原文并翻译 | 示例

摘要

In this paper, we prove a necessary and sufficient condition for the construction of 2-to-1 optical buffered first-in–first-out (FIFO) multiplexers by a single crossbar switch and fiber delay lines. We consider a feedback system consisting of an$(M+2)times (M+2)$crossbar switch and$M$fiber delay lines with delays$d_1, d_2,ldots, d_M$. These$M$fiber delay lines are connected from$M$outputs of the crossbar switch back to$M$inputs of the switch, leaving two inputs (respectively, two outputs) of the switch for the two inputs (respectively, two outputs) of the 2-to-1 multiplexer. The main contribution of this paper is the formal proof that$d_1=1$and$d_i le d_i+1 le 2d_i$,$i=1,2, ldots, M-1$, is a necessary and sufficient condition on the delays$d_1, d_2,ldots,d_M$for such a feedback system to be operated as a 2-to-1 FIFO multiplexer with buffer$sum _i=1^M d_i$under a simple packet routing policy. Specifically, the routing of a packet is according to a specific decomposition of the packet delay, called the$cal C$-transform in this paper. Our result shows that under such a feedback architecture a 2-to-1 FIFO multiplexer can be constructed with$M=O(log B)$, where$B$is the buffer size. Therefore, our construction improves on a more complicated construction recently proposed by Sarwate and Anantharam that requires$M=O(sqrt B)$under the same feedback architecture (we note that their design is more general and works for priority queues).
机译:在本文中,我们证明了通过单个交叉开关和光纤延迟线构造2对1光学缓冲先进先出(FIFO)多路复用器的必要和充分条件。我们考虑一个由$(M + 2)次(M + 2)$交叉开关和$ M $带有延迟$ d_1,d_2,ldots,d_M $的光纤延迟线组成的反馈系统。这些$ M $光纤延迟线从交叉开关的$ M $输出连接到该开关的$ M $输入,为两个输入(分别为两个输出)保留了该开关的两个输入(分别为两个输出)。 2对1多路复用器。本文的主要贡献是形式证明,即$ d_1 = 1 $和$ d_i le d_i + 1 le 2d_i $,$ i = 1,2,ldots,M-1 $是延迟的充要条件$ d_1,d_2,ldots,d_M $用于在简单的数据包路由策略下使用缓冲区$ sum _i = 1 ^ M d_i $作为2比1 FIFO多路复用器的反馈系统。具体来说,数据包的路由是根据数据包延迟的特定分解,在本文中称为$ cal C $变换。我们的结果表明,在这种反馈架构下,可以使用$ M = O(log B)$构造一个2比1 FIFO多路复用器,其中$ B $是缓冲区大小。因此,我们的构造改进了Sarwate和Anantharam最近提出的更复杂的构造,该构造在相同的反馈架构下要求$ M = O(sqrt B)$(我们注意到,它们的设计更为通用,适用于优先级队列)。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号