Abstract
It has recently been shown that a combined input output queued (CIOQ) switch with a speedup factor of 2 can exactly emulate an output-queued (OQ) switch [1]–[6]. In particular, the maximal matching algorithm, named Least Cushion First/Most Urgent First (LCF/MUF) algorithm presented in [6], can be executed in parallel to achieve exact emulation. However, the buffer size at every input and output port was assumed to be of infinite size. This assumption is obviously unrealistic in practice. In this paper, we investigate via computer simulation the performance of the LCF/MUF algorithm with finite input and output buffers. We found that, under uniform traffic, a CIOQ switch behaves almost like an OQ switch if the buffer sizes at every input and output ports are 3 and 9 cells respectively. For correlated traffic, to achieve similar performance, the input and output buffer sizes have to be increased to about 7 and 11 times of the mean burst size, respectively.
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
B. Prabhakar and N. McKeown, “On the speedup required for combined input and output queued switch,” Stanford University, Stanford, CA, Tech. Rep., STAN-CSL-TR-97-738, 1997.
A. Charny, P. Krishan, N. Patel, and R. Simcoe, “Algorithms for providing bandwidth and delay guarantees in input-buffered crossbar with speedup,” Proc. of IWQoS’98, pp. 235–244.
I. Stoica and H. Xhang, “Exact emulation of an output queueing switch by a combined input output queueing switch,” Proc. of IWQoS’98, pp. 218–224.
P. Krishna, N.S. Patel, A. Charny, and R. Simcoe, “On the speedup required for work-conserving crossbar switches,” Proc. of IWQoS’98, pp. 225–234.
S.T. Chuang, A. Goel, N. McKeown, and B. Prabhakar, “Matching output qeueueing with a combined input/output-queued switch,” IEEE J. Selected Area in Commun., Vol. 17, No. 6, pp. 1030–1039, June 1999.
T. H. Lee, Y. W. Kuo, and J. C. Huang, “Quality of Service Guarantee in a Combined Input Output Queued Switch,” IEICE Trans. on Commun., pp. 190–195, Feb. 2000.
H. Zhang, “Service disciplines for guaranteed performance service in packet-switching networks,” Proc. of the IEEE, 83(10), pp. 1374–1399, October 1995.
D. Ferrari and D.C. Verma, “A scheme for real-time channel establishment in wide-area networks,” IEEE J. Selected Area in Commun., Vol. 8, No. 3, pp. 368–379, April 1990.
A.K. Parekh and R. G. Gallager, “A generalized processing sharing approach to flow control in integrated services networks: the single node case,” IEEE Trans. on Networking, Vol. 1, No. 3, pp. 344–357, June 1993.
J.C.R. Bennett and H. Zhang, “WF2Q: worst-case fair weighted fair queueing,” Proc. of IEEE INFOCOM’96, pp. 120–128.
M. Karol, M. Hluchyj, and S. Morgan, “Input verse output queueing on a space division switch,” IEEE Trans. on Commun., Vol. 35, pp. 1347–1763, Dec. 1987.
N. McKeown, V. Anantharam, and J. Walrand, “Achieving 100% throughput in an input-queued switch,” Proc. of IEEE INFOCOM’96, pp. 296–302.
T.E. Anderson, S.S. Owicki, J.B. Saxe and C.P. Thacker, “High speed switch scheduling for local area networks,” IEEE/ACM Trans. on Computer Systems, Vol. 11, No. 4, pp. 319–352, Nov. 1993.
A. Mekkittikul and N. McKeown, “A practical scheduling algorithm to achieve 100% throughput in input-queued switches,” Proc. of IEEE INFOCOM’98, pp. 792–799.
N. McKeoen, “The iSLIP scheduling algorithms for input-queued switches,” IEEE/ACM Trans. on Networking, Vol. 7, No. 2, pp. 188–201, April 1999.
S.Q. Li, “Performance of a non-blocking space-division packet switch with correlated input traffic,” Proc. of IEEE Globecom’89, Vol. 3, pp. 1754–63.
S.C. Liew, “Performance of various input-buffered and output-buffered ATM switch design principles under bursty traffic: simulation study,” IEEE Trans. on Commun., Vol. 42, pp. 1371–79, Feb/Mar/Apr. 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, TH., Kuo, YC. (2002). Performance Evaluation of Combined Input Output Queued Switch with Finite Input and Output Buffers. In: Chong, I. (eds) Information Networking: Wired Communications and Management. ICOIN 2002. Lecture Notes in Computer Science, vol 2343. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45803-4_19
Download citation
DOI: https://doi.org/10.1007/3-540-45803-4_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44256-1
Online ISBN: 978-3-540-45803-6
eBook Packages: Springer Book Archive