Stability of a frame-based oldest-cell-first maximal weight matching algorithm

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 traffic conditions when executed with a scheduling speedup of 2. However, as link speeds increase, the compu...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications Vol. 56; no. 1; pp. 21 - 26
Main Authors: Xike Li, Elhanany, I.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.01.2008
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithm design and analysis
Algorithms
Applied sciences
Buffers
Computational complexity
Delay
Exact sciences and technology
Matching
Processor scheduling
Routers
Scalability
Scheduling
Scheduling algorithm
Stability
Switches
Switching and signalling
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Teletraffic
Time measurements
Timing
Traffic control
Packet switching
Scalability
High density
stability analysis
Teletraffic
switching architectures
Router
Scheduling
Stability criterion
Buffer system
Algorithm
Computational complexity
Packet scheduling algorithms
Queueing system
Traffic management
Traffic control
Delay time
Selector switch
Timing
ISSN:0090-6778, 1558-0857
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 traffic conditions when executed with a scheduling speedup of 2. However, as link speeds increase, the computational complexity of these algorithms limits their applicability in high port-density switches and routers. To address the scalability issue, we describe a Frame-Based Maximal Weight Matching (FMWM) algorithm, employing OCF as queue weights, in which a new scheduling decision is issued once every several cell times. Between scheduling decisions, the configuration of the crossbar switch remains unchanged. We further extend the analysis to address the case of multiple classes of service, and prove that the algorithm is stable with an internal buffer transfer speedup of 2, thereby significantly relaxing the timing constraints imposed on the scheduling process.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2008.050189