By Topic

On the performance of advanced stable matching algorithms in combined input output queued network 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
$31 $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

3 Author(s)
Schweizer, A. ; Univ. of Western Australia, Nedlands ; Siliquini, J. ; Devadason, T.

Combined input output queued switches have emerged as one solution to overcome speedup problems in pure output queued switches. It has been shown that a speedup of two is sufficient to exactly mimic the behavior of an output queued switch when a stable matching algorithm is used. Over the years, a number of advanced stable matching algorithms have been developed and their use is also suggested for network switches. While these algorithms provide considerable improvement for a reference application to which they usually refer, the conditions encountered in a network switch are typically very different. A mathematical analysis and simulation results for a key parameter in stable matchings will be presented. It will be argued that the reduction of iterations with advanced stable matching algorithms in network switches is very limited.

Published in:

Communications, 2007. APCC 2007. Asia-Pacific Conference on

Date of Conference:

18-20 Oct. 2007