Window flow control with error-checking scheme in quasi-cut-through switching network with noisy channels

Two acknowledgement (ACK) schemes for window flow control, full and partial ACK schemes, are investigated 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. It is shown that with respect to power and delay, the full ACK scheme performs better than the partial ACK scheme. On the other hand, in terms of throughput, the opposite holds. This reflects a tradeoff between throughput and delay in the contention system. Thus, the two ACK schemes can effectively be used to meet alternative user requirements for services in different application areas. The full ACK scheme yields better delay and throughput performance than that of conventional flow-controlled packet switching