By Topic

Traffic scheduling in non-blocking optical packet switches with minimum delay

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)
Bin Wu ; Dept. of Electr. & Electron. Eng., Hong Kong Univ. ; Yeung, K.L.

For performance guaranteed OPS switches with reconfiguration overhead, it has been shown that packet delay can be minimized by using N switch configurations (where N is the switch size) to schedule the traffic. However, this usually involves an exorbitant speedup requirement, which makes it impractical under current technology. In this paper, a new minimum-delay scheduling algorithm QLEF (quasi largest-entry-first) is proposed. We prove that QLEF pushes the required speedup bound to the lowest known level. As an example, when N=950, QLEF only requires a speedup of Sschedule=21.33 instead of 42.25 for MIN (B. Towles and W.J. Dally, 2003) and 30.27 for ai-SCALE (B. Wu and K.L. Yeung, 2005). This gives a 50% improvement over MIN and 30% over ai-SCALE

Published in:

Global Telecommunications Conference, 2005. GLOBECOM '05. IEEE  (Volume:4 )

Date of Conference:

2-2 Dec. 2005