Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Diwan, Aniruddha S.; | Guérin, Roch | Sivarajan, Kumar N.
Affiliations: ECE Department, Indian Institute of Science, C. V. Raman Avenue, Bangalore 560 012, India E‐mail: diwan@ece.iisc.ernet.in | University of Pennsylvania, Department Electrical Engineering, Rm. 367 GRW, 200 South 33rd Street, Philadelphia, PA 19104, USA E‐mail: guerin@ee.upenn.edu | Tejas Networks, Khanija Bhavan, Race Course Road, Bangalore 560 001, India E‐mail: kumar@tejasnetworks.com
Note: [] Corresponding author.
Abstract: In this paper, we study the performance of high‐speed packet switches, where the switch fabric operates at a slightly higher speed than the links, i.e., a speeded‐up switch. Such structures are by no means new and there are two well studied architectures in the literature for such packet switches: pure input queueing (no speedup) and pure output queueing (speedup of N, the number of links), with output queueing switches offering substantial performance benefits. However, as link speeds keep increasing, the speedup of N needed for pure output queueing becomes a significant technical challenge. This is one of the main reasons for the renewed interest in moderately speeded‐up switch fabrics. The aim of this paper is to highlight the result that only a moderate speed‐up factor (less than two) is sufficient to achieve full input link utilization. In particular, we emphasize that this holds, even without relying on a central switch controller making intelligent decisions on which packets to schedule through the switch. As shown in recent works, i.e., [5, 17, 20, 23, 25] there are clearly benefits to using intelligent controllers, but they do come at a cost. Instead, in this paper we focus on what can be achieved by relying simply on switch speedup. We do so by means of analysis and simulations. Our analysis provides explicit expressions for the average queue length in switches with integer and rational speedups. The results are complemented by simulations that are used to obtain delay estimates, and which also allow us to extend our investigation to shared memory switches for which we find that good performance can be achieved with an even lower speedup.
Keywords: Input queueing, output queueing, high‐speed packet switches, speedup factor, HOL blocking
Journal: Journal of High Speed Networks, vol. 10, no. 3, pp. 161-186, 2001
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl