V. Jacobson, Congestion Avoidance and Control, ACM SIGCOMM'88, pp 314-329, Aug. 1988. An update version is available via ftp://ftp.ee.lbl.gov/papers/congavoid.ps.Z. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Distinguishing Congestion and Corruption Losses: A Negative.. - Biaz, Vaidya (1997) (3 citations) (Correct)
....Key Words: TCP Congestion Avoidance Packet losses 1 Introduction The TCP protocol can adapt to very different network bandwidth and conditions. But there still exists the problem of recovering from losses other than congestion. All losses are all assumed, by TCP, to be congestion losses [9] and TCP reacts to all losses with congestion control mechanisms. On wired networks, this assumption is good. But on wireless links, losses occur more frequently due to corruption or for reasons other than congestion [3, 4] This can lead to a very poor performance. Fast Recovery and Fast ....
V. Jacobson, Congestion Avoidance and Control, ACM SIGCOMM'88, pp 314-329, Aug. 1988. An update version is available via ftp://ftp.ee.lbl.gov/papers/congavoid.ps.Z.
TCP over Wireless Networks Using Multiple Acknowledgements - Biaz, Mehta, West, Vaidya (1997) (9 citations) (Correct)
....to the experiments planned. Several performance optimization to this protocol are possible, as described in Section 7. 2 Motivation and Related work TCP is a protocol which has been designed, improved and tuned to work efficiently on wired network where the packet loss is very small ( 1 ) [7]. Whenever a packet is lost, it is reasonably assumed that congestion occurred on the connection path. Hence, TCP triggers slow start and congestion avoidance algorithms when a timeout occurs for a packet. These algorithms proved their efficiency on a wired network. But, on a wireless link, the ....
....many variations possible on the protocol summarized below. Such variations will be investigated in our future work. 3.1 The sender 3.1. 1 Data Sent The sender will strictly follow the regular TCP when sending any packet as defined by RFC 793 [8]with the addition of algorithms introduced by [7] : slow start, congestion avoidance, fast retransmit and fast recovery [9] 3.1.2 Acknowledgement Ack p received Before describing the actions taken at the reception of Ack P , we define some variables. We must distinguish the round trip time RTT between the sender and the receiver (end to end) ....
V. Jacobson, Congestion Avoidance and Control, ACM SIGCOMM'88, pp 314-329, Aug. 1988. An update version is available via ftp://ftp.ee.lbl.gov/papers/congavoid.ps.Z.
Using End-to-End Statistics to Distinguish Congestion and.. - Biaz, Vaidya (1997) (5 citations) (Correct)
....Key Words: TCP Congestion Avoidance Packet losses 1 Introduction The TCP protocol can adapt to very different network bandwidth and conditions. But there still exists the problem of recovering from losses other than congestion. All losses are all assumed, by TCP, to be congestion losses [9] and TCP reacts to all losses with congestion control mechanisms. On wired networks, this assumption is good. But on wireless links, losses occur more frequently due to corruption or for reasons other than congestion [3, 4] This can lead to a very poor performance. Fast Recovery and Fast ....
V. Jacobson, Congestion Avoidance and Control, ACM SIGCOMM'88, pp 314-329, Aug. 1988. An update version is available via ftp://ftp.ee.lbl.gov/papers/congavoid.ps.Z.
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