Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
1260 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 47, NO. 8, AUGUST 1999 Achieving 100% Throughput
 

Summary: 1260 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 47, NO. 8, AUGUST 1999
Achieving 100% Throughput
in an Input-Queued Switch
Nick McKeown, Senior Member, IEEE, Adisak Mekkittikul, Member, IEEE,
Venkat Anantharam, Fellow, IEEE, and Jean Walrand, Fellow, IEEE
Abstract-- It is well known that head-of-line blocking limits
the throughput of an input-queued switch with first-in­first-out
(FIFO) queues. Under certain conditions, the throughput can be
shown to be limited to approximately 58.6%. 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: longest
queue first (LQF) and oldest cell first (OCF). Both algorithms

  

Source: Anantharam, Venkat - Department of Electrical Engineering and Computer Sciences, University of California at Berkeley

 

Collections: Engineering