V. Jacobson. Congestion avoidance and control. ACM Computer Communications Review, pages 314--329, Aug. 1988.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....without incurring the overhead of a specialized link layer protocol. Keywords: congestion control, bandwidth estimation, wireless network 1. Introduction Congestion control functions were introduced into the TCP in 1988 and have been of crucial importance in preventing congestion collapse [13]. The well known challenge in providing TCP congestion control in a mixed (wired wireless) environment is that current TCP implementations rely on packet loss as an indicator of network congestion. In the wired portion of the network a congested router is indeed the likely reason of packet loss. ....

.... source, to determine the rate at which it can transmit, must probe the path by progressively increasing the input load (through the slow start and congestion avoidance phases) until implicit feedback, such as timeouts or duplicate acknowledgments, signals that the network capacity has been reached [12,13]. The key idea of TCP Westwood is to use the bandwidth estimate to directly control the congestion window and the slow start threshold. The bandwidth is estimated by monitoring the TCP ACKs. Namely, the source performs an end toend estimate of the bandwidth available along a TCP connection by ....

V. Jacobson, Congestion avoidance and control, ACM Computer Communications Review 18(4) (August 1988) 314--329.

....the distribu tions we have discussed here. We would also like to make our simulation model more realistic without introducing unnecessary complications. Also, we would like to investigate how we can incorporate results in [8, 9, 10] which indicate that the congestion avoidance algorithm of TCP [27] introduces power laws, into to our model. Perhaps combining our findings with a model as it is used in dynamical systems will shed more light on the nature of network traffic. In mathematical and theoretical physics self similarity has been studied widely over the last few decades, motivated by ....

V. Jacobson, Congestion Avoidance and Control, ACM Computer Communication Review, Proceedings of the Sigcomm '88 Symposium in Stanford, CA, August, 1988, (18) 4, pp. 314-329

....an environment without wireless routers, the congestion control features can be switched o#. Using this mechanism, the clients are likely to receive all TCP segments in order. This will not only relieve burden of the memory, but also work well with Van Jacobson s header prediction optimization [Jac90] which makes processing of in order segments more e#cient than processing of out of order segments. Since the client is receive most of its segments in order, it can refrain from bu#ering out oforder segments. If an out of order segment do arrive at the client, it will produce an immediate ACK. ....

V. Jacobson. 4.3BSD TCP header prediction. ACM Computer Communications Review, 20(2):13--15, April 1990.

....Introduction Packet switching networks require sophisticated mechanism of flow and congestion control in order to share resources and avoid congestion phenomena. Congestion control functions were introduced into the TCP in 1988 and have been of crucial importance in preventing congestion collapse [1], 2] 9] However, while end to end TCP congestion control [4] 5] can ensure that network capacity is not exceeded, it cannot insure fair sharing of that capacity [1] In this paper we investigate via both mathematical analysis and computer simulations the issue of fairness in high speed networks ....

.... control functions were introduced into the TCP in 1988 and have been of crucial importance in preventing congestion collapse [1] 2] 9] However, while end to end TCP congestion control [4] 5] can ensure that network capacity is not exceeded, it cannot insure fair sharing of that capacity [1]. In this paper we investigate via both mathematical analysis and computer simulations the issue of fairness in high speed networks when Westwood TCP is implemented at the sender side. Moreover we propose a simpler version of RED, called EASY RED and we investigate how it interacts with Reno and ....

[Article contains additional citation context not shown here]

Jacobson, V.: Congestion Avoidance and Control. ACM Computer Communications Review, Vol. 18(4) (1988) 314 - 329

.... of an unresponsive protocol is the Unreliable Datagram Protocol (UDP) 1] The most widely advocated responsive mechanism is to decrease the generated load geometrically when congestion is detected and increase load linearly in order to probe for available capacity when the congestion subsides [2]. Because this approach was first shown to be effective in TCP, those protocols that closely follow this approach are referred to as TCP friendly. This congestion response mechanism allows the system to reach equilibrium with the generated load approximately equal to the available capacity of the ....

V. Jacobson, Congestion Avoidance and Control, ACM Computer Communications Review, 18(4):314-329, Proceedings of ACM SIGCOMM `88, Stanford, CA, August 1988.

....is rather inappropriate. The LDA algorithm adjusts its adaptation parameters dynamically in response to the losses, delays and capacity observed on the path traversed by the adaptive connection. The capacity of the network is estimated by enhancing RTP with the packet pair approach presented in [12]. In Sec. 2 of this paper we present some related work on the issue of TCP friendly adaptation. The loss delay based adjustment algorithm (LDA) is then presented in Sec. 3. Finally, the performance of the algorithm in terms of bandwidth utilization, scalability and fairness towards competing TCP ....

V. Jacobson. Congestion avoidance and control. ACM Computer Communication Review, 18(4):314-- 329, Aug. 1988. Proceedings of the Sigcomm '88 Symposium in Stanford, CA, August, 1988.

....a TCP connection uses AIMD algorithm to adjust its congestion window size cwnd. That is, for each positive acknowledgment received, it increases its cwnd by , and in the case of congestion indication (i.e. receipt of three duplicate acknowledgments or ECN) it reduces its cwnd by half to [13]. These analytical models characterize the AIMD behavior of TCP as follows [15] as each positive acknowledgment increases cwnd by 1 cwnd and each congestion indication reduces the cwnd by half to , the rate at which the expected congestion window size changes is expressed as 1 p , where ....

V. Jacobson. Congestion Avoidance and Control. ACM Computer Communication Reviews, Vol. 14, 1988

.... Adaptive, feedback based mechanisms were first introduced to dynamically control the user s traffic (sending windows at the transport layer level) in classical packet switched networks [5] Examples include the DECBit rate adjustment scheme [6] and the slow start enhancement to the TCP IP [7]. Similar concepts have been proposed ( 8] 9] 10] 11] 12] to directly control the rate of traffic sources where rates are either determined explicitly by some network controllers [11] or are incremented and decremented in an adaptive fashion based on some fed back network information ....

V. Jacobson. Congestion avoidance and control. ACM Computer Communication Review, pages 314--329, Aug 1988.

....1 Introduction Adaptive, feedback based mechanisms were first introduced to dynamically control the user s traffic (sending windows at the transport layer level) in classical packet switched networks. Examples include the DECBit rate adjustment scheme [1] and the slow start enhancement to TCP IP [2]. Motivated by the potential for increased network utilization, similar concepts have been recently proposed ( 3] 4] 5] 6] to directly control the rate of traffic sources in ATM networks where rates are either determined explicitly by some network controllers [4] or are incremented and ....

V. Jacobson. Congestion avoidance and control. ACM Computer Communication Review, pages 314--329,

....to minimise the above undesirable e ects. Optimal control of queues aims to minimise queue length variance by optimally computing the source rates. TCP IP networks do not implement optimal control. The queues in IP routers are loosely controlled by TCP s adaptive congestion control algorithms [7] which mainly focus on preventing congestion collapse and maintaining a stable network. TCP achieves this by reacting to packet loss (bu er over ow) with a severe cut to packet ow and slowly increasing the rate as it starts to receive acknowledgements from the receiver. Large queue oscillations ....

V. Jacobson. Congestion Avoidance and Control. ACM Computer Communication Review, 18:314-329, August 1988.

....heterogeneous networks. It was originally designed to provide reliable data delivery over conventional (wired) networks for a limited range of transmission rates and propagation delays. One of TCP strengths lies in its congestion control mechanism proposed in the cornerstone work by Van Jacobson [1]. Nowadays, data transfers over communication paths with ever larger bandwidth delay products, quality of service (QoS) requirements for interactive traffic and communication over wireless links, are shifting the domain for which TCP was originally engineered. As a consequence, active research is ....

V. Jacobson. Congestion Avoidance and Control. ACM Computer Communications Review, 18(4):314--329, August 1988.

....than the Retransmission Time Out (RTO) a packet is assumed to be lost , and (2) when a packet has been acknowledged more than 3 times, the next packet is assumed to be lost. Earlier implementations of TCP were distributed in releases corresponding to the original implementation of Jacobson [10]. However, over the years, there have been some ne tuning, improvements and additions to the original TCP algorithms. Some of the proposed changes have been widely adopted and are part of TCP implementations today, e.g. fast retransmit and recovery [2] TCP Tahoe and TCP Reno are the (most) ....

V. Jacobson. Congestion Avoidance and Control. ACM Computer Communication Review, 18:314-329, Aug 1988. Proceedings of Sigcomm'88 Symposium, Stanford, CA.

....than the Retransmission Time Out (RTO) a packet is assumed to be lost , and (2) when a packet has been acknowledged more than 3 times, the next packet is assumed to be lost. Earlier implementations of TCP were distributed in releases corresponding to the original implementation of Jacobson [Jac88] However, over the years, there have been some ne tuning, improvements and additions to the original TCP algorithms. Some of the proposed changes have been widely adopted and are part of TCP implementations today. TCP Tahoe and TCP Reno are the (most) deployed current versions. Other revisions ....

V. Jacobson. Congestion Avoidance and Control. ACM Computer Communication Review, 18:314-329, Aug 1988. Proceedings of Sigcomm'88 Symposium, Stanford, CA.

No context found.

V. Jacobson. Congestion avoidance and control. ACM Computer Communications Review, pages 314--329, Aug. 1988.

No context found.

V. Jacobson. 4BSD Header Prediction. ACM Computer Communication Review, April 1990.

No context found.

V. Jacobson, Congestion avoidance and control, ACM Computer Communications Review, 18(4): 314 - 329, Aug. 1988.

No context found.

V.Jacobson. Congestion avoidance and control. ACM Computer Communications Review, 18(4):314--329, 1988.

No context found.

V. Jacobson. Congestion avoidance and control. ACM Computer Communication Review, 18(4):314-329, Aug. 1988.

No context found.

Jacobson, V. Congestion avoidance and control. ACM Computer Communication Review 18, 4 (Aug. 1988.

No context found.

V. Jacobson. Congestion avoidance and control. ACM Computer Communication Review, 18, 4:314--329, 1988.

No context found.

V. Jacobson. 4BSD Header Prediction. ACM Computer Communication Review, April 1990.

No context found.

V. Jacobson. 4BSD TCP Header Prediction. ACM Computer Communication Review, 20(2):13--15, Apr. 1990.

No context found.

V. Jacobson, Congestion avoidance and control, ACM Computer Communication Review 18 (4) (1988.

No context found.

V. Jacobson. 4BSD TCP Header Prediction. ACM Computer Communication Review, 20(2):13--15, Apr. 1990.

No context found.

Jacobson, V., Congestion Avoidance and Control. ACM Computer Communications Review, 18(4):314--329, August 1988.

First 50 documents

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