Frame-based matching algorithms for optical switches
Frame-based matching algorithms for optical switches
复制标题
光开关基于帧的匹配算法
DOI：
--
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
Hung
中科院分区：
文献类型：
--
作者：
Yihan Li;S. Panwar;Hung
虚拟输出排队被固定长度的高速电子交换机广泛用于克服线头阻塞。这是通过匹配算法来完成的。这些匹配算法通常是基于单元的。也就是说，在每个时隙中，计算新的匹配集，并且更新交换结构以连接匹配的输入和输出。光交换机中的结构重新配置不如电子交换机中快。在重新配置期间，不能传输任何数据。给定该开销，对于每个时隙更新输入和输出之间的连接是没有效率的。我们提出了基于帧的匹配算法的光分组交换，使连接可以更新得更少，以减少带宽损失。这些方案的实现复杂度和性能进行了研究。
Virtual output queuing is widely used by fixed-length high-speed electronic switches to overcome head-of-line blocking. This is done by means of matching algorithms. These matching algorithms have typically been cell-based. That is, in every time slot, a new matching set is calculated and the switch fabric is updated to connect matched inputs and outputs. Fabric reconfiguration in an optical switch is not as fast as in an electronic switch. During reconfiguration, no data can be transferred. Given this overhead, it is not efficient to update connections between inputs and outputs for every time slot. We present frame-based matching algorithms for optical packet switches, so that connections can be updated less frequently to reduce the bandwidth loss. The implementation complexity and performance of these schemes are studied.