Achieving 100% Throughput in an Input-Queued Switch

DMCA

Achieving 100% Throughput in an Input-Queued Switch (1996)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Nick McKeown , Adisak Mekkittikul , Venkat Anantharam , Jean Walrand

Venue:	IEEE TRANSACTIONS ON COMMUNICATIONS
Citations:	527 - 27 self

BibTeX

@INPROCEEDINGS{McKeown96achieving100%,
    author = {Nick McKeown and Adisak Mekkittikul and Venkat Anantharam and Jean Walrand},
    title = {Achieving 100% Throughput in an Input-Queued Switch },
    booktitle = {IEEE TRANSACTIONS ON COMMUNICATIONS},
    year = {1996},
    pages = {296--302},
    publisher = {}
}

OpenURL

Abstract

It is well known that head-of-line (HOL) blocking limits the throughput of an input-queued switch with FIFO queues. Under certain conditions, the throughput can be shown to be limited to approximately 58%. It is also known that if non-FIFO queueing policies are used, the throughput can be increased. However, it has not been previously shown that if a suitable queueing policy and scheduling algorithm are used then it is possible to achieve 100% throughput for all independent arrival processes. In this paper we prove this to be the case using a simple linear programming argument and quadratic Lyapunov function. In particular, we assume that each input maintains a separate FIFO queue for each output and that the switch is scheduled using a maximum weight bipartite matching algorithm. We introduce two maximum weight matching algorithms: LQF and OCF. Both

Keyphrases

input-queued switch separate fifo queue independent arrival process scheduling algorithm maximum weight bipartite non-fifo queueing policy suitable queueing policy fifo queue certain condition quadratic lyapunov function simple linear programming argument

DMCA