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.
This work has been partially supportedb y ITRC (Iranian Telecommunication Research Center).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Firoiu, V., et al.: Efficient admission control for piecewise linear traffic envelopes at EDF schedulers. IEEE/ACM Trans. Networking 6, 558–570 (1998)
Liebeherr, J., et al.: Exact admission control in networks with bounded delay services. IEEE/ACM Trans. Networking 4, 885–901 (1996)
Zhang, H.: Service disciplines for packet-switching integrated services networks, Ph.D. dissertation, Univ. California, Berkley, CA (November 1993)
Liebeherr, J., et al.: Priority queue schedulers with approximate sorting in output buffered switches. IEEE Journal on Selected Area 17, 1127–1144 (1999)
Schoenen, R., et al.: Distributed cell scheduling algorithms for virtual-output queued swiches. In: Proc. IEEE GLOBECOM 1999, pp. 1211–1215 (1999)
Schoenen, R.: An architecture supporting quality-of-service in virtual-output queued switches. IEICE Trans. Commun. E83-B (2) (February 2000)
Kam, A.C., et al.: Linear complexity algorithms for QoS support in input-queued switches with no speedup. IEEE Journal Selected Areas Comm. (June 1999)
Lee, S.W., et al.: Improved dynamic weighted cell scheduling algorithm based on Earliest Deadline First scheme for various traffics of ATM switch. In: Proc. IEEE Globecom 1996, London, pp. 1959–1963 (1996)
Karol, M., et al.: Input versus output queuing on a space division switch. IEEE Trans. Comm. 6, 1347–1356 (1988)
Tamir, Y., et al.: High performance multiqueue buffers for VLSI communication switches. In: Proc. of 15th Annual Symposium on Computer Architecture (June 1988)
McKeown, N., et al.: Achieving 100% throughput in an input-queued switch. In: IEEE Infocom 1996 (1996)
Schoenen, R., et al.: Weighteda rbitration algorithms with priorities for inputqueued switches with 100% throughput. In: Proc. IEEE Broadband Switching Systems (1999)
Gale, D., et al.: College Admissions and the stability of marriage. American Mathematical Monthly 69, 9-15 (1962)
Stoica, I., et al.: Exact emulation of an output queueing switch by a combined input output queueing switch. In: 6th IEEE/IFIP IWQoS 1998 (1998)
Chaung, S.T., et al.: Matching output queuing with a combined input output queued switch, Technical Report, CSL-TR-98-758 (April 1998)
McKeown, N.: The iSLIP scheduling algorithm for input-queued switches. IEEE/ACM Trans. Networking 7(2) (April 1999)
McKeown, N., et al.: Scheduling multicast cells in an input-queued switch. In: Proc. IEEE Infocom (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Azhari, S.V., Yazdani, N., Bidoki, A.M.Z. (2003). Providing Delay Guarantee in Input Queued Switches: A Comparative Analysis of Scheduling Algorithms. In: Kahng, HK. (eds) Information Networking. ICOIN 2003. Lecture Notes in Computer Science, vol 2662. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45235-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-45235-5_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40827-7
Online ISBN: 978-3-540-45235-5
eBook Packages: Springer Book Archive