Scheduled Maintenance on April 29th, 2016:
IEEE Xplore will be unavailable for approximately 1 hour starting at 11:30 AM EDT. We apologize for the inconvenience.
By Topic

Scheduling for input-queued packet switches by a re-configurable parallel match evaluator

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

4 Author(s)
Spiridon F. Beldianu ; Dept. of Elect. and Comp. Eng., New Jersey Institute of Technology, Newark, NJ, USA 07102 ; Roberto Rojas-Cessa ; Eiji Oki ; Sotirios G. Ziavras

A parallel match evaluator (PE) selects the most productive match for an input-queued (IQ) switch among several tested. However, current PE-based approaches use N fixed permutations out of possible N!, where N is the number of switch ports. A fixed permutation represents a permanent match between the inputs and outputs. To improve switching performance, this letter proposes a re-configurable PE (RPE) where permutations are selected according to traffic pattern, queue occupancy, or queuing times. This letter shows the performance improvement achieved with the proposed RPE.

Published in:

IEEE Communications Letters  (Volume:14 ,  Issue: 4 )