By Topic

Stability of frame-based maximal weight matching algorithms with reconfiguration delays

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

2 Author(s)
Xike Li ; Dept. of Electr. & Comput. Eng., Tennessee Univ., Knoxville, TN, USA ; Elhanany, I.

It has been shown that maximal weight matching algorithms for input-queued switches are stable under any admissible traffic conditions with a speedup of 2. As link speeds increase, the computational complexity of these algorithms limits their applicability in high port-density switches and routers. In frame-based maximal weight matching (FMWM), a new scheduling decision is generated once every several packet times, as opposed to on a packet-by-packet basis. Between new scheduling decisions, the configuration of the crossbar switch remains unchanged. We show that the FMWM algorithm is also stable with a speedup of 2 and obtain the speedup required for stability in systems with non-negligible reconfiguration delays. Simulation results illustrate the impact of the frame size on the delay experienced by arriving packets under different traffic scenarios.

Published in:

High Performance Switching and Routing, 2005. HPSR. 2005 Workshop on

Date of Conference:

12-14 May 2005