| J.-K. Choi and C. K. Un, "On acknowledgment schemes of sliding window flow control," IEEE Transactions on Communications, vol. 37, no. 11, pp. 1184--1191, 1989. |
....available. Upon receiving the permit from the destination the sender continues by sending another batch of packets. This method is efficient, can approach optimal performance of a given system [15] and, if necessary, the permit packet traffic can be minimized with a delayed acknowledgment scheme [5]. A disadvantage of this scheme is that of choosing a window size. The choice of a window size is a trade off: small window sizes limit the congestion and tend to avoid large delays, and large window sizes allow full speed transmission and maximum throughput under lightly loaded conditions. Making ....
J.-K. Choi and C. K. Un, "On acknowledgment schemes of sliding window flow control," IEEE Transactions on Communications, vol. 37, no. 11, pp. 1184--1191, 1989.
No context found.
J.-K. Choi and C. K. Un, "On acknowledgment schemes of sliding window flow control," IEEE Transactions on Communications, vol. 37, no. 11, pp. 1184--1191, 1989.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC