Scheduling Algorithms for a Slotted Packet Switch with either Fixed or Variable Length Packets
Scheduling Algorithms for a Slotted Packet Switch with either Fixed or Variable Length Packets
复制标题
具有固定或可变长度数据包的时隙数据包交换机的调度算法
DOI：
10.1023/b:pnet.0000033976.33668.65
复制
发表时间：
2004
影响因子：
1.7
通讯作者：
P. Demeester
中科院分区：
文献类型：
--
作者：
F. Callegati;W. Cerroni;G. Corazza;Chris Develder;M. Pickavet;P. Demeester
本文研究了光分组交换（OPS）中的拥塞解决问题。我们考虑了一种相当通用的全光分组交换机架构，它具有由光纤延迟线（FDL）组成的反馈光缓冲器。对于在槽传输模式下运行的交换机，解决了交换粒度的两种选择：在槽级交换（即单个槽的固定长度数据包）或在突发级别交换（可变长度数据包是槽长度的整数倍）。对于这两种情况，我们表明，尽管队列资源有限，但在合理的硬件资源下，通过适当的时间/波长调度算法设计，可以实现可接受的丢包性能。根据交换单元（槽或突发）的不同，需要部署相应的调度算法，以最有效地利用带宽和缓冲资源。
We address the problem of congestion resolution in optical packet switching (OPS). We consider a fairly generic all-optical packet switch architecture with a feedback optical buffer constituted of fiber delay lines (FDL). Two alternatives of switching granularity are addressed for a switch operating in a slotted transfer mode: switching at the slot level (i.e., fixed length packets of a single slot) or at the burst level (variable length packets that are integer multiples of the slot length). For both cases, we show that in spite of the limited queuing resources, acceptable performance in terms of packet loss can be achieved for reasonable hardware resources with an appropriate design of the time/wavelength scheduling algorithms. Depending on the switching units (slots or bursts), an adapted scheduling algorithm needs to be deployed to exploit the bandwidth and buffer resources most efficiently.