Distributed, asynchronous algorithms for network control with contracted flow rates - a review

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

Abstrakty

EN

The paper reviews current algorithms for distributed, asynchronous control of networks when the customer is guaranteed to get some predetermined (e.g., as a part of a service level agreement - SLA) values of flow. Two cases are considered - both with single and multiple commodity. It is assumed, that the flow cost functions are convex with special attention devoted to linear and strictly convex cases.

Słowa kluczowe

EN

computer networks; asynchronous algorithms; distributed optimization; routing; service level agreement; service quality

• Wydawca: Instytut Łączności - Państwowy Instytut Badawczy
• Czasopismo: Journal of Telecommunications and Information Technology
• Rocznik: 2006
• Tom: nr 4
• Strony: 46--52
• Opis fizyczny: Bibliogr. 10 poz.

Twórcy

autor

Karbowski A.

• Research and Academic Computer Network (NASK), Wąwozowa st 18, 02-796 Warsaw, Poland. Institute of Control and Computation Engineering, Warsaw University of Technology, Nowowiejska st 15/19, 00-665 Warsaw, Poland,

Bibliografia

• [1] M. S. Bazaraa, H. D. Sherali, and C. M. Shetty, Nonlinear Programming: Theory and Algorithms. New York [etc.]: Wiley, 1993.
• [2] P. Beraldi, F. Guerriero, and R. Musmanno, “Parallel algorithms for solving the convex minimum cost flow problem”, Comput. Opt. Appl., vol. 18, pp. 175–190, 2001.
• [3] D. P. Bertsekas, Network Optimization: Continuous and Discrete Models. Belmont: Athena Scientific, 1998.
• [4] D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Belmont: Athena Scientific, 1997.
• [5] A. Elwalid, C. Jin, S. Low, and I. Widjaja, “MATE: multipath adaptive traffic engineering”, Comput. Netw., vol. 40, issue 6, pp. 695–709, 2002.
• [6] W. Findeisen, F. N. Bailey, M. Brdyś, K. Malinowski, and A. Woźniak, Control and Coordination in Hierarchical Systems. Chichester [etc.]: Wiley, 1980.
• [7] A. Karbowski, “Distributed asynchronous algorithms in the Internet – new routing and traffic control methods”, J. Telecomm. Inform. Technol., no. 3, pp. 29–36, 2005.
• [8] Z.-Q. Luo and P. Tseng, “On the rate of convergence of a distributed asynchronous routing algorithm”, IEEE Trans. Automat. Contr., vol. 39, issue 5, pp. 1123–1129, 1994.
• [9] P. Tseng, D. P. Bertsekas, and J. N. Tsitsiklis, “Partially asynchronous algorithms for network flow and other problems”, SIAM J. Contr. Opt., vol. 28, pp. 678–710, 1990.
• [10] J. N. Tsitsiklis and D. P. Bertsekas, “Distributed asynchronous optimal routing in data networks”, IEEE Trans. Automat. Contr., vol. AC-31, no. 4, pp. 325–332, 1986.