By Topic

On service guarantees for input-buffered crossbar switches: a capacity decomposition approach by Birkhoff and von Neumann

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

3 Author(s)
Cheng-Shang Chang ; Dept. of Electr. Eng., Nat. Tsing Hua Univ., Hsinchu, Taiwan ; Wen-Jyh Chen ; Hsiang-Yi Huang

Based on a decomposition result by Birkhoff (1946) and von Neumann (1953) for a doubly substochastic matrix, in this paper we propose a scheduling algorithm that is capable of providing service guarantees for input-buffered crossbar switches. Our service guarantees are uniformly good for all non-uniform traffic, and thus imply 100% throughput. The off-line computational complexity to identify the scheduling algorithm is O(N4.5) for an N×N switch. Once the algorithm is identified, its on-line computational complexity is O(logN) and its on-line memory complexity is O(N3logN). Neither framing nor internal speedup is required for our approach

Published in:

Quality of Service, 1999. IWQoS '99. 1999 Seventh International Workshop on

Date of Conference:

1999