Title :
The throughput of data switches with and without speedup
Author :
Dai, J. G Jim ; Prabhakar, Balaji
Author_Institution :
Sch. of Ind. & Syst. Eng., Georgia Inst. of Technol., Atlanta, GA, USA
Abstract :
In this paper we use fluid model techniques to establish two results concerning the throughput of data switches. For an input-queued switch (with no speedup) we show that a maximum weight algorithm for connecting inputs and outputs delivers a throughput of 100%, and for combined input- and output-queued switches that run at a speedup of 2 we show that any maximal matching algorithm delivers a throughput of 100%. The only assumptions on the input traffic are that it satisfies the strong law of large numbers and that it does not oversubscribe any input or any output
Keywords :
data communication; packet switching; queueing theory; telecommunication traffic; combined input/output-queued switches; data switches; fluid model techniques; input traffic; input-queued switch; maximal matching algorithm; maximum weight algorithm; packet switches; Computer industry; Data engineering; Fabrics; Mathematics; Packet switching; Scheduling algorithm; Switches; Systems engineering and theory; Throughput; Traffic control;
Conference_Titel :
INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE
Conference_Location :
Tel Aviv
Print_ISBN :
0-7803-5880-5
DOI :
10.1109/INFCOM.2000.832229
