A Proof of Quasi-Independence Of Sliding Window Flow Control and Go-Back-N Error Recovery Under Independent Packet Errors
MetadataShow full item record
A quasi-independence result holds for the go-back-n automatic re- peat request (ARQ) protocol and the sliding window flow control protocol if packet errors are independent. The result is independent of the magnitude of the packet error probability or the cost of an error. The implication is that window flow control can potentially be analyzed with varying degrees of complexity and then combined with a term representing the cost due to errors. A parallel result for the selective repeat ARQ protocol, however, does not appear to hold.