By Topic

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. e Telecomun., Politec. di Torino, Turin, Italy ; Cuda, D. ; Giaccone, P. ; Pretti, M.

We consider the problem of scheduling the transmission of packets 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. In this work, we propose a novel scheme to optimize the performance of a preexisting scheduler. Our main idea is to assist the scheduling decision, considering "messagesâ rather than queue lengths. Such messages are obtained by running an iterative parallel algorithm, inspired by a rigorous belief-propagation approach. We demonstrate that belief-propagation-assisted scheduling is able to boost the performance of a given scheduler, reaching almost optimal throughput, even under critical traffic scenarios.

Published in:

Computers, IEEE Transactions on  (Volume:62 ,  Issue: 10 )