Throughput analysis of input queueing packet switch under improved FIFO policy

The improved policy is proposed to attain higher maximum throughput, smaller probability of blocking, and shorter waiting time. One of the blocked packets is returned to the head of the input buffer and other packets are sent back to the end of the respective input buffers in order to reduce block-repeating probability. The authors analyze maximum throughput, probability of blocking, probability of the packets being sent to the end of the buffer, and average waiting time, respectively. They show that the maximum throughput and the average waiting time of the input queueing packet switch under the proposed policy can be improved