Approximations to maximum weight matching scheduling algorithms of low complexity

The choice of the scheduling algorithm is a major design criterion of a switch. Whereas it is known that maximum weight matching algorithms guarantee the stability of an input-queued switch, their computational complexity does not allow their practical deployment. In consequence, researchers have de...

Full description

Saved in:
Bibliographic Details
Main Author: Bauer, C.
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
Approximation algorithms
Computational complexity
Laboratories
Packet switching
Processor scheduling
Scheduling algorithm
Stability
Switches
Telecommunication switching
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The choice of the scheduling algorithm is a major design criterion of a switch. Whereas it is known that maximum weight matching algorithms guarantee the stability of an input-queued switch, their computational complexity does not allow their practical deployment. In consequence, researchers have designed scheduling algorithms of low complexity and with satisfying performance features. We extend this field of research by investigating the application of matching algorithms of low complexity that approximate maximum weight matching algorithms as scheduling algorithms for input-queued switches. We prove that an algorithm that approximates a maximum weight matching algorithm with approximation parameters (c, d), stabilizes a combined input/output-queued switch with a speed-up of 1/c. As an application, we show that four known scheduling algorithms of low complexity stabilize a combined input/output-queued switch with a speed-up of two. Finally, we prove that the improve/spl I.bar/matching algorithm can stabilize an input-queued switch when it is deployed with a speed-up of (3/2)+/spl epsiv/.
DOI:10.1109/AICT.2005.29