DocumentCode
2011724
Title
On high speed packet switches with windowed input buffers
Author
Thomas, George
Author_Institution
Dept. of Electr. & Comput. Eng., Southwestern Louisiana Univ., Lafayette, LA, USA
fYear
1993
fDate
29 Nov-2 Dec 1993
Firstpage
1406
Abstract
Hluchyj and Karol [1988] proposed a simple algorithm for input buffer queue service in packet switches. The present authors give an improvement to their windowed service discipline which offers i) improved throughput, ii) a certain degree of fairness in access and iii) relative ease of implementation using a single queue rather than multiple queues. Simulation results are presented to compare the two algorithms
Keywords
buffer storage; channel capacity; multi-access systems; packet switching; queueing theory; access; algorithms; fairness; high speed packet switches; implementation; input buffer queue service; single queue; throughput; windowed input buffers; windowed service discipline; Analytical models; Buffer storage; Fabrics; Packet switching; Performance analysis; Switches; Throughput; Traffic control; USA Councils; Web and internet services;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 1993, including a Communications Theory Mini-Conference. Technical Program Conference Record, IEEE in Houston. GLOBECOM '93., IEEE
Conference_Location
Houston, TX
Print_ISBN
0-7803-0917-0
Type
conf
DOI
10.1109/GLOCOM.1993.318305
Filename
318305
Link To Document