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.
CITATION STYLE
Van Hautegem, K., Pinto, M., Bruneel, H., & Rogiest, W. (2018). Analysis of VAS, WAS and XAS scheduling algorithms for fiber-loop optical buffers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10932 LNCS, pp. 216–226). Springer Verlag. https://doi.org/10.1007/978-3-319-93736-6_16
Mendeley helps you to discover research relevant for your work.