首页> 外文期刊>Communications, IEEE Transactions on >In-Order Packet Scheduling in Optical Switch With Wavelength Division Multiplexing and Electronic Buffer
【24h】

In-Order Packet Scheduling in Optical Switch With Wavelength Division Multiplexing and Electronic Buffer

机译:具有波分复用和电子缓冲器的光开关中的有序分组调度

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

摘要

Optical switches are widely considered the most promising candidate to provide ultra-high speed interconnections for future communication and computing systems. Due to the difficulty in implementing an all-optical buffer, optical switches with electronic buffers have been proposed recently. Among these switches, the optical cut-through (OpCut) switch has the capability to achieve low latency and minimize optical-electronic-optical (O/E/O) conversions. We studied the packet-scheduling problem in single-wavelength OpCut switches in our previous work. In this paper, we consider the wavelength division multiplexed (WDM) case. While WDM makes much higher bandwidth possible, it also increases the complexity of the switch architecture, as well as packet scheduling. Our goal is to schedule as many as possible packets to the switch output in each time slot and to maintain the packet order at the same time. While we prove that such an optimal scheduling problem is NP-hard and inapproximable in polynomial time within any constant factor by reducing the set packing problem to it, we present an approximation algorithm that maintains packet order and approximates the optimal scheduling within a factor of $sqrt{2Nk}$ with regard to the number of packets transmitted, where $N$ is the switch size, and $k$ is the number of wavelengths multiplexed on each fiber. This result is in line with the best known approximation algorithm for set packing problem. Based on the approximation algorithm, we also give practical schedulers that can be implemented in the fast optical switches. Simulation results show that the schedulers achieve close performance to the ideal WDM output-queued switch in terms of packet delay under various traffic models.
机译:光开关被广泛认为是为未来的通信和计算系统提供超高速互连的最有前途的候选人。由于难以实现全光缓冲器,因此最近提出了具有电子缓冲器的光开关。在这些交换机中,光学直通(OpCut)交换机具有实现低延迟并最大程度地减少光电-光学(O / E / O)转换的能力。在先前的工作中,我们研究了单波长OpCut交换机中的数据包调度问题。在本文中,我们考虑了波分复用(WDM)情况。尽管WDM使更高的带宽成为可能,但它也增加了交换机体系结构以及数据包调度的复杂性。我们的目标是在每个时隙安排尽可能多的数据包到交换机输出,并同时保持数据包顺序。尽管我们通过减少集合打包问题证明了这样的最优调度问题是NP-hard且在多项式时间内是不可近似的,但我们提出了一种近似算法,该算法可保持数据包顺序并在$因子内近似优化调度sqrt {2Nk} $关于传输的数据包数量,其中$ N $是交换机的大小,$ k $是在每根光纤上复用的波长的数量。此结果与最著名的集合填充问题近似算法相符。基于近似算法,我们还给出了可以在快速光开关中实现的实用调度器。仿真结果表明,在各种流量模型下,调度器在分组延迟方面都可以达到理想WDM输出排队交换机的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号