Flow control as stochastic optimal control problem with incomplete information

Proceedings - IEEE INFOCOM

Volumn 2, Issue , 2005, Pages 1328-1337

  Miller, B ^a   Avrachenkov, K ^b   Stepanyan, K ^a   Miller, G ^c  

^a INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

^b INRIA   (France)

^c MOSCOW AVIATION INSTITUTE NATIONAL RESEARCH UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

CONGESTION CONTROL; OPTIMAL CONTROL; TRANSMISSION RATES;

CARRIER COMMUNICATION; MARKOV PROCESSES; PROBLEM SOLVING; STADIUMS; TELECOMMUNICATION LINKS;

RANDOM PROCESSES;

EID: 25844460573     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2005.1498358     Document Type: Conference Paper

References (32)

1. M. Allman, V. Paxson and W. Stevens. TCP congestion control. RFC 2581 April 1999, available at http://www.ietf.org/rfc/rfc2581.txt.
2. E. Altman, K. Avrachenkov and C. Barakat, A stochastic model of TCP/IP with stationary random losses. A CM SIGCOMM'00, Computer Communications Review, 30(4), (2000) 231-242.
3. E. Altman, K. Avrachenkov and C. Barakat, TCP in presence of bursty losses, Performance Evaluation. 42, (2000), 129-147.
4. E. Altman, K.E. Avrachenkov, C. Barakat and P. Dube, TCP over a multi-state Markovian path, in Performance and QoS of Next Generation Networking, eds. K. Goto, T. Hasegawa, H. Takagi and Y. Takahashi, Springer Verlag, (2000), 103-122.
5. S. Athuraliya and S. Low, Optimization Flow Control with Newton-Like Algorithm, Telecommunication Systems, 15(3/4). (2000), 345-358.
6. C. Barakat, TCP/IP modeling and validation. IEEE Network, (2001), May/June, 38-47.
7. P.M. Brémaud, Point Processes and Queues, Springer Verlag, Berlin, 1981.
8. M.H.A. Davis, Markov Models and Optimization, Chapman & Hall, London, 1993.
9. R.J. Elliott, L.Aggoun and J.B. Moore, Hidden Markov Models, Estimation and Control, Springer Verlag, New York, 1995.
10. W.H. Fleming, R.W. Rishel, Deterministic and Stochastic Optimal Control, Springer-Verlag, Berlin, 1975.
11. S. Floyd and V. Jacobson, Random Early Detection Gateways for Congestion Avoidance, IEEE/ACM Transactions on Networking, 1(4), (1993), 397-413.
12. S. Floyd, M. Handley, J. Padhye, and J. Widmer, Equation-Based Congestion Control for Unicast Applications, In Proceedings ACM SIGCOMM, August 2000.
13. E.N. Gilbert, Capacity of a burst-noise channel, Bell Systems Technical Journal, 39, (1960), 1253-1266.
14. V. Jacobson, Congestion avoidance and control. ACM SIGCOMM'88, August 1988.
15. Yu.M. Kabanov, On the Pontriagin maximum principle for SDEs with Poisson-type driving noise, in: Stochastic and Control of Stochastic Processes, Moscow (1995/1996), World Sci. Publishing, River Edge. New York, 1997, 173-189.
16. F.P. Kelly. Mathematical modelling of the Internet, in: Mathematics Unlimited - 2001 and Beyond, eds. B. Engquist and W. Schmid, Springer Verlag, Berlin, (2001), 685-702.
17. F.P. Kelly, A. Maulloo and D. Tan, Rate control in communication networks: shadow prices, proportional fairness and stability, Journal of the Operational Research Society, 49, (1998), 237-252.
18. S. Kunniyur and R. Srikant, End-to-end congestion control: Utility functions, random losses and ECN marks, in Proc. IEEE INFOCOM'00, Tel Aviv, Israel, (2000)
19. also to appear in IEEE/ACM Transactions on Networking.
20. R.Sh. Liptser, A.N. Shiryayev, Statistics of Random Processes, Springer-Verlag, Berlin. 1977.
21. S.H. Low and D.E. Lapsley, Optimization Flow Control, I: Basic Algorithm and Convergence. IEEE/ACM Transactions on Networking. 7(6), (1999), 861-874.
22. S.H. Low, F. Paganini and J.C. Doyle, Internet Congestion Control, IEEE Control Systems Magazine, 22(1), (2002), 28-43.
23. L. Massoulié and J. Roberts, Bandwidth sharing: objectives and algorithms. IEEE/ACM Transactions on Networking, 10(3), (2002), 320-328.
24. M. Mathis, J. Semke, J. Mahdavi, and T. Ott, The Macroscopic Behavior of the TCP Congestion Avoidance Algorithm, Computer Communication Review, 27, (1997), n. 3, July.
25. B. Miller, K. Avrachenkov, K. Stepanyan, and G. Miller, Flow Control as Stochastic Optimal Control Problem with Incomplete Information, INRIA Research Report no. 5239, available at http://www.inria.fr/rrrt/rr-5239.html.
26. B.M. Miller and W.J. Runggaldier, Optimization of observations: a stochastic control approach, SIAM J. Control Optim., 35(3), (1997), 1030-1052.
27. K. Ramakrishnan and R. Jain, A binary feedback scheme for congestion avoidance in computer networks with connectionless network layer. ACM SIGCOMM'88, August 1988
28. also in ACM Transactions on Computer Systems, 8(2), (1990), 158-181.
29. K. Ramakrishnan, S. Floyd and D. Black, The Addition of Explicit Congestion Notification (ECN) to IP, RFC 3168, September 2001, available at http://www.ietf.org/rfc/rfc3168.txt.
30. V. Dumas, F. Guillemin and P. Robert, A Markovian analysis of AIMD algorithms, Advances in Applied Probability, 34(1), (2002), 85-111.
31. S. Tang and X. Li, Necessary conditions for optimal control of stochastic systems with random jumps, SIAM J. Control Optim., 32(5), (1994), 1447-1475.
32. E. Wang and B. Hajek, Stochastic Processes in Engineering Systems, Springer-Verlag, Berlin, Heidelberg, New-York, 1985.