By Topic

Frame-based matching algorithms for 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

7 Author(s)
Bianco, A. ; Dipt. di Elettronica, Politecnico di Torino, Italy ; Franceschinis, M. ; Ghisolfi, S. ; Hill, A.M.
more authors

We focus on input-buffered packet switches, which are traditionally controlled slot-by-slot with heuristic approximations (such as iSLIP) of maximum weight or size matching algorithms. We consider instead a frame-based control strategy, in which f slots are grouped in a frame, and contentions are solved only at frame boundaries. A number of frame-based heuristics is described, and simulation is used to show that our approach provides performance advantages over a slot-by-slot control in a number of traffic scenarios.

Published in:

High Performance Switching and Routing, 2002. Merging Optical and IP Technologies. Workshop on

Date of Conference: