In optical packet/burst switched networks fiber loops provide a viable and compact means of contention resolution. For fixed size packets it is known that a basic void-avoiding schedule (VAS) can vastly outperform a more classical pre-reservation algorithm as FCFS. For the setting of a uniform distributed packet size and a restricted buffer size we proposed two novel forward-looking algorithms, WAS and XAS, that, in specific settings, outperform VAS up to 20% in terms of packet loss. This contribution extends the usage and improves the performance of the WAS and XAS algorithms by introducing an additional threshold variable. By optimizing this threshold, the process of selectively delaying packet longer than strictly necessary can be made more or less strict and as such be fitted to each setting. By Monte Carlo simulation it is shown that the resulting T-WAS and T-XAS algorithms are most effective for those instances where the algorithms without threshold can offer no or only limited performance improvement.

在光分组/突发交换网络中，光纤环路提供了一种可行且紧凑的竞争解决方法。对于固定大小的数据包，众所周知，基本的无效规避计划（VAS）可以大大胜过更经典的预保留算法（如FCFS）。为了设置统一的分布式数据包大小和受限制的缓冲区大小，我们提出了两种新颖的前瞻性算法WAS和XAS，在特定设置下，它们的性能优于VAS最高20 ％就丢包而言。通过引入附加的阈值变量，此贡献扩展了使用范围并提高了WAS和XAS算法的性能。通过优化该阈值，可以使选择性地延迟比严格必要的时间更长的分组的过程变得或多或少严格，并且因此适合于每个设置。通过蒙特卡洛模拟，结果表明，所得的T-WAS和T-XAS算法对于没有阈值的算法无法提供或只能提供有限的性能改进的情况最为有效。