By Topic

On the Speedup Required to Achieve 100% Throughput for Multicast Over Crossbar 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

1 Author(s)
Koksal, C.E. ; Dept. of Electr. & Comput. Eng., Ohio State Univ., Columbus, OH

We show an isomorphism between maximal matching for packet scheduling in crossbar switches and strictly non-blocking circuit switching in three-stage Clos networks. We use the analogy for a crossbar switch of size n times n to construct a simple multicast packet scheduler of complexity O(n log n) based on maximal matching. We show that, with this simple scheduler, a speedup of O(log n/log log n) is necessary to support 100% throughput for any admissible multicast traffic. If fanout splitting of multicast packets is not allowed, we show that an extra speedup of 2 is necessary, even when the arrival rates are within the admissible region for mere unicast traffic. Also we revisit some problems in unicast switch scheduling. We illustrate that the analogy provides useful perspectives and we give a simple proof for a well known result.

Published in:

Quality of Service, 2008. IWQoS 2008. 16th International Workshop on

Date of Conference:

2-4 June 2008