Providing delay guarantee in input queued switches: A comparative analysis of scheduling algorithms

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Real-time applications require switching components to deliver packets in bounded delay. Most of such switches are designed as output-queued switches, which suffer from bandwidth limitation. Input queued switches remedy this by introducing buffers at inputs, however due to input/output contention providing delay guarantee is difficult. Based on maximum weighted matching, we present several classes of schedulers, which provide best-effort delay guarantee for various delay classes. Each scheduler uses some combination of Round Robin and Earliest Deadline First policy at various service points. Comparative analysis is performed and some key parameters in the design of efficient schedulers with delay guarantee are provided. These parameters are: average match per time slot, average weight per match, and fairness. Finally, the effect of speedup is studied. Our schedulers can support variable length IP packets as well as multicast packets, the latter being supported by fanout splitting. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Azhari, S. V., Yazdani, N., & Zareh Bidoki, A. M. (2003). Providing delay guarantee in input queued switches: A comparative analysis of scheduling algorithms. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. https://doi.org/10.1007/978-3-540-45235-5_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free