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

A Scalable Frame-based Multi-Crosspoint Packet Switching Architecture

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

2 Author(s)
Xike Li ; Tennessee Knoxville Univ., Knoxville ; Elhanany, I.

Input-queued cell switches employing the oldest-cell-first (OCF) policy have been shown to yield low mean delay characteristics. Moreover, it has been proven that OCF is stable for admissible i.i.d. arrival traffic when executed with a scheduling speedup of 2. However, an increase in link rates and port densities directly leads to a decrease in packet duration times, to a point where cell-by-cell switching is no longer considered practical. To address this challenge, this paper studies frame-based scheduling algorithms for a scalable combined input-output queued (CIOQ) switch architecture. The latter is decomposed into independent subgroups, each employing multiple simple crosspoint switches. A key outcome of this decomposition is a substantial reduction of scheduling times. Unlike many other schemes, which necessitate custom integrated circuits, the architecture proposed here utilizes commercially available crosspoint switches. We present a Lyapunov-based stability analysis that dictates moderate conditions under which the switch is stable for all admissible traffic patterns. By reconfiguring the crossbar switch once every several time slots, the timing constraints imposed on the scheduling algorithm are significantly relaxed. Simulation results are presented, demonstrating the merits of the approach, particularly in the presence of bursty traffic scenarios.

Published in:

High Performance Switching and Routing, 2007. HPSR '07. Workshop on

Date of Conference:

May 30 2007-June 1 2007

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.