TCP network calculus: The case of large delay-bandwidth product

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 2002, Pages 417-426

  Altman, Eitan ^a   Avrachenkov, Konstantin ^a   Barakat, Chadi ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; NETWORK PROTOCOLS; NONLINEAR PROGRAMMING; PROBABILITY;

QUEUE MANAGEMENT BUGGERS; RECEIVER CONGESTION;

INTERNET;

EID: 0036346544     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. A stochastic model of TCP/IP with stationary random losses
2. Impact of fairness on internet performance
3. Fixed point approximation for TCP behaviour in an AQM network
4. A new approach to model the stationary behavior of TCP connections
5. Random early detection gateways for congestion avoidance
6. Distributed control and resource pricing
7. Congestion avoidance and control
8. Rate control for communication networks: Shadow prices, proportional fairness and stability
9. End-to-end congestion control schemes: Utility functions, random losses, ECN marks
10. Optimization flow control I: Basic algorithm and convergence
11. Bandwidth sharing and admission control for elastic traffic
12. The macroscopic behaviour of the TCP congestion avoidance algorithm
13. Fluid-based analysis of a network of AQM routers supporting TCP flows with application to RED
14. Fair end-to-end window-based congestion control
15. The stationary behavior of the ideal TCP congestion avoidance
16. Modeling TCP throughput: A simple model and its empirical validation
17. End-to-end routing behavior in the internet
18. Global fairness of additive-increase and multiplicative-decrease with heterogeneous roundtrip times