Schedule burst proactively for optical burst switched networks
Schedule burst proactively for optical burst switched networks
复制标题
DOI：
10.1016/j.comnet.2003.10.005
复制
发表时间：
2004-04
期刊：
影响因子：
--
通讯作者：
Jikai Li;C. Qiao
中科院分区：
文献类型：
--
作者：
Jikai Li;C. Qiao
光突发交换（OBS）是下一代互联网基础设施的一个很有前途的范例。在光突发交换中，一个关键的问题是如何在信道上快速有效地调度突发，以减少突发丢失。到目前为止，大多数调度算法避免突发竞争本地（或反应）。在本文中，我们提出了几种新的调度算法在光突发交换网络的波长转换能力和没有。我们的算法的基本思想是串行化的突发上的输出链路，以减少突发的数量，可能同时到达下游节点（从而主动减少突发竞争和突发丢失概率在下游节点）。这可以通过使用电子存储器在入口节点处明智地将本地组装的突发延迟超过预定偏移时间来实现。与现有的算法相比，我们提出的算法可以显着降低丢失率，同时确保突发的最大延迟不超过其规定的限制。
Optical Burst Switching (OBS) is a promising paradigm for the next-generation Internet infrastructure. In OBS, a key problem is to schedule bursts on channels with both fast and bandwidth efficient algorithms so as to reduce burst loss. To date, most scheduling algorithms avoid burst contention locally (or reactively). In this paper, we propose several novel algorithms for scheduling bursts in OBS networks with and without wavelength conversion capability. The basic idea of our algorithms is to serialize the bursts on an outgoing link to reduce the number of bursts that may arrive at downstream nodes simultaneously (and thus pro-actively reduce the burst contention and burst loss probability at downstream nodes). This can be accomplished by judiciously delaying locally assembled bursts beyond a pre-determined offset time at an ingress node using the electronic memory. Compared with the existing algorithms, our proposed algorithms can significantly reduce the loss rate while ensuring that maximum delay of a burst does not exceed its prescribed limit.