Optimization approach with ?-proximal convexification for Internet traffic control

• Autorzy: Kozakiewicz A.
• Języki publikacji: EN

Abstrakty

EN

The optimization flow control algorithm for traffic control in computer networks, introduced by Steven H. Low, works only for concave utility functions. This assumption is rather optimistic and leads to several problems, especially with streaming applications. In an earlier paper we introduced a modification of the algorithm based on the idea of proximal convexification. In this paper we extend this approach, replacing the proximal method with the ?-proximal method. The new method mixes the quadratic proximal term with higher-order terms, achieving better results. The algorithms are compared in a simple numerical experiment.

Słowa kluczowe

EN

nonlinear programming; price method; convexification; network control

• Wydawca: Instytut Łączności - Państwowy Instytut Badawczy
• Czasopismo: Journal of Telecommunications and Information Technology
• Rocznik: 2005
• Tom: nr 3
• Strony: 37--42
• Opis fizyczny: Bibliogr. 14 poz., rys.

Twórcy

autor

Kozakiewicz A.

• Institute of Control and Computation Engineering, Warsaw University of Technology Nowowiejska st 15/19, 00-665 Warsaw, Poland,

Bibliografia

• [1] S. H. Low and D. E. Lapsley, “Optimization flow control. I: Basic algorithm and convergence”, IEEE/ACM Trans. Netw., vol. 7, no. 6, pp. 861–874, 1999.
• [2] A. Kozakiewicz, A. Karbowski, and K. Malinowski, “Partial convexification and its application to Internet traffic control”, in Proc. 8th IEEE Int. Conf. MMAR’2002, Szczecin, Poland, vol. 1, pp. 275–280, 2002.
• [3] A. Kozakiewicz, “Zastosowanie uwypuklania w optymalizacji wielokryterialnej, hierarchicznej i globalnej”. Warszawa: Politechnika Warszawska, 2001 (M.Sc. thesis in Polish).
• [4] S. H. Low, L. Petersen, and L. Wang, “Understanding Vegas: a duality model”, J. ACM, vol. 49, no. 2, pp. 207–235, 2002.
• [5] A. Karbowski, “Comments on optimization flow control. I: Basic algorithm and convergence”, IEEE/ACM Trans. Netw., vol. 11, no. 2, pp. 338–339, 2003.
• [6] F. P. Kelly, A. K. Maulloo, and D. K. H. Tan, “Rate control for communication networks: shadow prices, proportional fairness and stability”, J. Oper. Res. Soc., vol. 49, pp. 237–252, 1998.
• [7] P. Key and L. Massouli´e, “User policies in a network implementing congestion pricing”, in Worksh. Internet Serv. Qual. Econom., Cambridge, USA, 1999.
• [8] P. Key, D. McAuley, P. Barham, and K. Laevens, “Congestion pricing for congestion avoidance”, Microsoft Res. Tech. Rep. MSR-TR-99-15, 1999.
• [9] R. J. La and V. Anantharam, “Charge-sensitive TCP and rate control in the Internet”, in Proc. Infocom’2000, Tel Aviv, Israel, 2000, pp. 1166–1175.
• [10] D. Wischik, “How to mark fairly”, in Worksh. Internet Serv. Qual. Econom., Cambridge, USA, 1999.
• [11] D. P. Bertsekas, Constrained Optimization and Lagrange Multipliers Methods. London: Academic Press, 1982.
• [12] D. P. Bertsekas, Nonlinear Programming. 2nd ed. Belmont: Athena Scientific, 1999.
• [13] D. P. Bertsekas, “Convexification procedures and decomposition methods for nonconvex optimization problems”, J. Opt. Theory Appl., vol. 29, no. 2, pp. 169–197, 1979.
• [14] A. Kozakiewicz and A. Karbowski, “Metoda r-proksymalna uwypuklania zadań optymalizacji”, in Proc. 4th Nat. Conf. MSK’2003, Kraków, Poland, 2003, pp. 343–346 (in Polish).