QoS guaranteed input queued scheduling algorithms with low delay

Document Type

Conference Proceeding

Publication Date

12-1-2001

Abstract

The enhanced Birkhoff-von Neumann decomposition (EBVND) algorithm, a new class of scheduling algorithms for input queued (IQ) switches, is introduced. Theoretical analysis shows that the performance of EBVND is better than the Birkhoff-von Neumann decomposition algorithm in terms of throughput and cell delay, and can also provide rate and cell delay guarantees. Wave front Birkhoff-von Neumann decomposition (WFBVND) algorithm and its simplified version WFBVND with logN iterations (WFBVND-logN), the special cases of EBVND, are also introduced and evaluated. Simulations show that WFBVND and WFBVND-logN have much lower average cell delay as compared to the Birkhoff-von Neumann decomposition algorithm.

Identifier

0035786621 (Scopus)

ISBN

[0780367111]

Publication Title

2001 IEEE Workshop on High Performance Switching and Routing

First Page

412

Last Page

414

This document is currently not available here.

Share

COinS