Cart (Loading....) | Create Account
Close category search window
 

Belief-Propagation Assisted Scheduling in Input-Queued 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

4 Author(s)
Atalla, S. ; Dipt. di Elettron., Politec. di Torino, Torino, Italy ; Cuda, D. ; Giaccone, P. ; Pretti, M.

We consider the problem of scheduling packets transmission across the switching fabric in an input-queued switch. In order to achieve maximum throughput, scheduling algorithms usually employ the queue length as a parameter for determining the priority to serve a given queue. Unfortunately, optimal schedulers are too complex to be implemented directly in hardware, which is the only viable solution in high-end switches, since scheduling decisions must be taken in very short time, of order of ns. Conversely, implementable algorithms, based on parallel and greedy decisions, are inefficient in terms of throughput. In this work we do not propose any new scheduling algorithm or switching architecture, but a novel scheme to optimize the performance of a pre-existing scheduler. Indeed, we propose to assist the scheduling decision by considering "message" values instead of queue lengths. Such messages are obtained by running an iterative parallel algorithm (efficiently implementable in hardware and fully compatible with pre-existing schedulers), based on a rigorous Belief-Propagation approach. We show that BP-assisted scheduling is able to boost the performance of a given scheduler, reaching almost optimal throughput, even under critical traffic scenarios.

Published in:

High Performance Interconnects (HOTI), 2010 IEEE 18th Annual Symposium on

Date of Conference:

18-20 Aug. 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.