On high speed packet switches with windowed input buffers

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.<<ETX>>