Window Flow Control in Quasi-M/D/1 Cut-Through Switching Network with Noisy Channels

Abstract

We investigate two acknowledgement (ACK) schemes for window flow control, full and partial ACK schemes, in conjunction with two error-checking schemes at every node or at the store-and-forward nodes only in a quasi-cut-through switching network with noisy channel. We study their various properties including throughput, delay, and the combined delay-throughput performance, and show that the proposed ACK schemes provide efficiently delay and throughput requirements for services in different application areas.