Exact emulation of a priority queue with a switch and delay lines
Exact emulation of a priority queue with a switch and delay lines
复制标题
DOI：
10.1007/s11134-006-6669-x
复制
发表时间：
2006-07
期刊：
影响因子：
1.2
通讯作者：
A. Sarwate;V. Anantharam
中科院分区：
文献类型：
--
作者：
A. Sarwate;V. Anantharam
实现可行的光分组队列问题阻碍了全光分组交换网络的发展。数据包可以在延迟线中进行缓冲，但是从输入输出的角度来看，延迟线在功能上不能模拟队列。本文考虑了一个大小为（M+ 1） × （M+ 1）的交换系统，该交换系统具有一个外部到达的可区分输入，一个外部出发的可区分输出，以及长度为sl1，L2，…的定长延迟线。，将其他输入和输出成对连接。我们用m + 1来衡量这种仿真的复杂性。我们证明了这一点，并提出了一个适用于；此外，在我们的建设中。我们还概述了一个全光分组交换通信网络架构的想法，该架构基于使用交换机和延迟线的有限大小优先级队列的近似仿真，并在分组级别具有擦除控制编码。
All-optical packet switched networking is hampered by the problem of realizing viable queues for optical packets. Packets can be buffered in delay lines, but delay lines do not functionally emulate queues from an input-output point of view. In this paper we consider the problem ofexactemulation of a priority queue of sizeKusing a switching system comprised of a switch of size (M+ 1) × (M+ 1), which has one distinguished input for external arrivals, one distinguished output for external departures, and fixed-length delay lines of lengthsL1,L2, ...,LMconnecting the other inputs and outputs in pairs. We measure the complexity of such an emulation byM+ 1. We prove thatand present a construction which works with; further, in our construction. We also sketch an idea for an all-optical packet switched communication network architecture based onapproximateemulation of priority queues of finite size using switches and delay lines, with erasure control coding at the packet level.