P.Tinnakornsrisuphap, A.Makowski, "Limit Behavior of ECN/RED Gateways Under a Large Number of TCP Flows", IEEE Infocom 2003. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Analysis of Adaptive Random Early Detection (ARED) - La, Ranjan, Abed (Correct)
....shows that the system is more stable under ARED when the system is moderately loaded. Further, stays reasonably close to the expected value of 0.0413 from (25) which is shown by the dotted horizontal line. The slight fluctuation in the queue sizes and will diminish as increases as shown in [17]. A main source of the fluctuation in is the coarse granularity of the update rule . One should also note that the average queue size of the RED gateway is very close to that predicted by the numerical example in section IV, but slightly larger due to somewhat smaller . This justifies the use ....
P. Tinnakornsrisuphap and A. Makowski. Limit behavior of ECN/RED gateways under a large number of TCP flows. Submitted to IEEE INFOCOM 2003.
Rate-Based versus Queue-Based Models of Congestion Control - Deb, Srikant (2004) Self-citation (April) (Correct)
No context found.
P. Tinnakornsrisuphap and A. Makowski. Limit behavior of ECN/RED gateways under a large number of TCP flows. In Proceedings of INFOCOM, pages 873--883, San Francisco, CA, April 2003.
Modeling TCP Traffic with Session Dynamics - Many.. - Tinnakornsrisuphap, .. Self-citation (Makowski Gateways Number Flows) (Correct)
....bandwidth due to slow start. The shortcomings of these models suggest a need for a unified model that is accurate in all regimes, instead of being restricted to a specific regime. Since the number of connections that share a bottleneck link is likely to be large, we follow the approach in [10], which considers macroscale modeling of aggregate TCP flows competing for the capacity of a bottleneck link. Macroscale TCP models can be developed by systematically applying limit theorems to derive a limiting tra#c model when the number of TCP flows becomes large. The potential benefits of ....
....context, resource allocation problems are of greatest interest in networks operating at high utilization, e.g. when the number of users is large. In such a scenario, the limit behavior will become increasingly accurate as the number of users increases. In this paper we extend the model in [10] by incorporating explicitly an additional layer of dynamics, namely the session layer, with TCP in the transport layer and RED gateway [2] with ECN [1] capability in the network layer. As the number of sessions increases, we show that (i) the queue size per session and the workload per session ....
[Article contains additional citation context not shown here]
P. Tinnakornsrisuphap and A. M. Makowski, Limit behavior of ECN/RED gateways under a large number of TCP flows, in Proceedings of IEEE INFOCOM 2003.
Many Flow Asymptotics For TCP With ECN/RED - Makowski (2002) Self-citation (Tinnakornsrisuphap Makowski) (Correct)
....Theorem (CLT) complement. These results help clarify some of the questions on the relationship between RED bu#ers and the marking probability function. The CLT result can help in the network dimensioning problem as it helps establish a probabilistic bound on the bu#er utilization in RED gateways [20]. While the TCP model proposed here is somewhat rudimentary and considers only long lived connections, it is possible to extend the approach to accommodate shortlived connections and the slow start phase of the TCP congestion control mechanism [22] The concept of many source asymptotics has ....
....router, and multiplexing TCP flows is not as e#ective. iv) The queue length at the steady state can be easily calculated. Moreover, the steady state distribution of the window size and the average window size can be evaluated from well known TCP models [16, 17] Details can be found in [20]. v) For a more accurate description of the queue dynamics, a Central Limit Theorem type analysis shows that there exists a rv L 0 (t) such that # N N =#N L 0 (t) 7) provided f : IR [0, 1] is continuously di#erentiable. Roughly speaking, we have the approximation Nq(t) # ....
P. Tinnakornsrisuphap and A. M. Makowski, "Limit Behavior of ECN/RED Gateways Under a Large Number of TCP Flows," submitted to IEEE INFOCOM, 2003.
Using Partial Differential Equations to Model TCP.. - Marsan, Garetto.. (2004) (Correct)
No context found.
P.Tinnakornsrisuphap, A.Makowski, "Limit Behavior of ECN/RED Gateways Under a Large Number of TCP Flows", IEEE Infocom 2003.
Using Partial Differential Equations to Model TCP.. - Marsan, Garetto.. (Correct)
No context found.
P.Tinnakornsrisuphap, A.Makowski, "Limit Behavior of ECN/RED Gateways Under a Large Number of TCP Flows", IEEE Infocom 2003.
Fluid Models and Solutions for Large-Scale IP Networks - Liu, Presti, al. (2003) (5 citations) (Correct)
No context found.
P. Tinnakornsrisuphap and A. Makowski. Limit Behavior of ECN/RED Gateways Under a Large Number of TCP Flows . In Proceedings of IEEE Infocom, 2003.
FAST Protocols: Theory, Implementation, Experiment.. - Low, Almes.. (2003) (Correct)
No context found.
P. Tinnakornsrisuphap and A. Makowski. Limit behavior of ECN/RED gateways under a large number of TCP flows. In Proceedings of the IEEE Infocom, April 2003.
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