T. V. Lakshman and U. Madhow. The performance of TCP for networks with high bandwidth delay products and random loss. IEEE#ACM Trans on Networking, 5#3#:336#350, June 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The Asymmetric Best-Effort Service - Hurley, Le Boudec, Thiran (1999) (3 citations) (Correct)
....Since throughput has been shown to be inversely proportional to round trip time, intuitively we need to compensate for the delay boost Green packets experience in order to attain the throughput goal. There are many well established formulas which re late long TCP throughput and packet loss ratio [2], 3] 1] 4] We use a formula, which agrees with but is based on less modelling assumptions than these. It has the advantage of providing an explicit relationship for any magnitude of loss ratio i.e. it varies based on whether the loss ratio is very small or very large. However, our ....
T.V. Lakshman and U. Madhow. The performance of TCP for networks with high bandwidth delay products and ran- dom loss. IEEE/ACM Trans on Networking, 5(3):336-350, June 1997.
Rate adaptation, Congestion Control and Fairness: A Tutorial - Boudec (2000) (Correct)
....(N 1) L = If q is very small this can be approximated by with C = Formula 32.5 is the basis used to design TCP friendly applications. It can be shown that the formula still holds, though with a slightly different constant, if more realistic modelling assumptions are taken [5, 14]. TCP friendly applications are normally using the so called Real Time transport Protocol (RTP) RTP is not a transport protocol like TCP; rather, it defines a number of common data formats used by multimedia application. RTP comprises a set of control messages, forming the so called RTP ....
T. V. Lakshman and U. Madhow. The performance of tcp for networks with high bandwidth delay products and random loss. IEEE/ACM Trans on Networking, 5(3):336--350, June 1997.
The Alternative Best-Effort Service - Hurley, Le Boudec, Thiran (1999) (1 citation) (Correct)
....RTT s it increases its rate by r s , and responds to loss detection by decreasing its rate to be j 2 (0; 1) times the previous rate. This behaviour is a simplification of the congestion response of a TCP flow. We need to use this method of global modelling, rather than using known TCP equations [6, 7, 3, 4, 1]. Those relate loss rate to throughput for an indiviual source, with no concept of the number of bottlenecks a flow experiences. Suppose ff = ff l for all l = 1 : L, namely the drop bias is the same on every link. Then it can be shown that the distribution of long term rates x s can be ....
....network all flows have a round trip time f , where f 2 [ b ; g ] Let x b and x g be the throughput received by a blue and green flow respectively in the ABE environment. In the flat best effort scenario they would have throughput x f . Assuming the established loss throughput formula [6, 7, 3, 4, 1] holds, x b = C b p q b ; x g = C g p q g and x b = C f p q f where q b , q g , q g are the blue, green, and flat loss ratios respectively, and C is a constant. Assume we can characterise the dropping at the router by a nondecreasing convex function OE(x) where OE(0) 0 and ....
T. V. Lakshman and U. Madhow. The performance of TCP for networks with high bandwidth delay products and random loss. IEEE/ACM Trans on Networking, 5(3):336--350, June 1997.
Global Fairness of Additive-Increase and.. - Vojnovic, Le Boudec, .. (2000) (35 citations) (Correct)
....knowledge, this is the first general result encompassing many of the relevant system parameters, applicable to an arbitrary network topology with multiple bottlenecks. Our results allows to find a first order approximation of rate distributions; combined with a loss throughput formula such as [2] [7], this gives a prediction of the loss rates. The results are based on limit results in [8] as such they apply only assimptotically to real network scenarios. However, our extensive simulations indicate that our results apply well in realistic cases. The novelty of our approach is an application ....
T. V. Lakshman and U. Madhow, "The performance of tcp for networks with high bandwidth--delay products and random loss," IEEE/ACM Transactions on Networking, vol. (5)3, pp. 336--350, June 1997.
A Note on the Fairness of Additive Increase and.. - Hurley, Le Boudec.. (1999) (31 citations) (Correct)
No context found.
T. V. Lakshman and U. Madhow. The performance of TCP for networks with high bandwidth delay products and random loss. IEEE#ACM Trans on Networking, 5#3#:336#350, June 1997.
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