By Topic

A new low-delay matching algorithm for input-queued switches

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
M. Hosaagrahara ; Dept. of Electr. & Comput. Eng., Drexel Univ., Philadelphia, PA, USA ; H. Sethu

This paper presents a randomized algorithm, called degree-sequenced matching (DSM), for scheduling packets in an input-queued switch. Previously known high-throughput, randomized algorithms implicitly prioritize the matching of ports with larger degrees and causes longer delays at the low-degree ports. Our algorithm, however, achieves a lower average delay but without compromising the throughput. The DSM algorithm sorts nodes based on their node-degrees and begin each iteration of the algorithm by matching the lowest degree nodes. Using real gateway traffic traces as well as synthetically generated traffic, we present simulation results showing that DSM achieves a low average delay, while still achieving near maximum throughput.

Published in:

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.

Date of Conference:

17-19 Oct. 2005