Asymptotic Optimality of the Go-Back-n Protocol In High Speed Data Newworks With Small Buffers

摘要: As the transmission speeds of emerging data networks scale up, effects propagation delays, which do not scale, become quite consequential for design sliding windows are needed congestion control. It was previously shown that optimal window lengths grow linearly with speed λ, thus making cost memory buffers a major factor. However, it also moments number packets in only O ( ), remaining course being propagated. This fact underlies proposal made here requires small ) and yet guarantees ratio realized throughput to ideal approaches unity increasing λ. That is, when properly sized overflow so rarely even rudimentary (conversely, easily implemented) protocol like go-back-n, loss due retransmissions is negligible. result arrived at by obtaining an explicit characterization large λ tail distribution buffer occupancy closed network buffers; case single-hop virtual circuit Gaussian conditioned be nonnegative. Numerical simulation results presented confirm performance predictions theory 45 Mbps speed.