Van Hautegem, Kurt; Pinto, Mario; Bruneel, Herwig; Rogiest, Wouter Analysis of VAS, WAS and XAS scheduling algorithms for fiber-loop optical buffers. (English) Zbl 1462.90033 Takahashi, Yutaka (ed.) et al., Queueing theory and network applications. 13th international conference, QTNA 2018, Tsukuba, Japan, July 25–27, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10932, 216-226 (2018). Summary: 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. In this contribution we propose two novel forward-looking algorithms, WAS and XAS, that outperform VAS in the setting of a uniform distributed packet size and a restricted buffer size. This paper presents results obtained by Monte Carlo simulation, showing that improvements of more than 20% in packet loss in specific settings are obtainable. In other settings and for other performance measures similar improvements are within reach.For the entire collection see [Zbl 1394.90013]. MSC: 90B18 Communication networks in operations research 65C05 Monte Carlo methods 90B36 Stochastic scheduling theory in operations research Keywords:contention resolution; scheduling; optical buffering; fiber loops PDFBibTeX XMLCite \textit{K. Van Hautegem} et al., Lect. Notes Comput. Sci. 10932, 216--226 (2018; Zbl 1462.90033) Full Text: DOI