D. D. Kouvatsos and A. T. Othman, "Optimal flow control of end-to-end packetswitched network with random routing," IEEE Proceedings, vol. 136 Pt E, no. 2, pp. 90-- 100, 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Adding Adaptive Flow Control to Swift/RAID - Fullmer, Long, Cabrera (Correct)
....up to the available buffer capacity. The destination sends permits (acknowledgments) of the packets received. Upon receiving the permit from the destination the sender continues by sending another batch of packets. This method is efficient, and can approach optimal performance of a given system [8]. 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. One ....
D. D. Kouvatsos and A. T. Othman, "Optimal flow control of end-to-end packet-switched network with random routing," IEEE Proceedings, vol. 136 Pt E, no. 2, pp. 90--100, 1989.
Implementation of Adaptive Flow Control Mechanism to the Swift.. - Fullmer (1994) (Correct)
....Flow control mechanisms control an offered load to a system in a manner that prevents an overload or a congestion in the system. It has also been called congestion control in the same context and we make no distinction between the two here. Flow control mechanisms have been studied for many years [8, 15, 1]. 12 #1 IN #1 Out #N Out #N IN Network IN To Client From Client Client Buffers Server N Buffers Server 1 Buffers Network Pipe Network Out To Client From Client FIGURE 2.6: Logical organization of buffers for the Swift architecture. The underlying system that the Swift architecture runs on can ....
....sends permits (basically acknowledgments) of the packets received and 13 the buffer space now 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 ....
D. D. Kouvatsos and A. T. Othman, "Optimal flow control of end-to-end packetswitched network with random routing," IEEE Proceedings, vol. 136 Pt E, no. 2, pp. 90-- 100, 1989.
Unknown - (Correct)
No context found.
D. D. Kouvatsos and A. T. Othman, "Optimal flow control of end-to-end packetswitched network with random routing," IEEE Proceedings, vol. 136 Pt E, no. 2, pp. 90-- 100, 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