Distributed, asynchronous algorithms for network control with contracted flow rates – a review
DOI:
https://doi.org/10.26636/jtit.2006.4.395Keywords:
computer networks, asynchronous algorithms, distributed optimization, routing, quality of service, service level agreementAbstract
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.
Downloads
References
[1] M. S. Bazaraa, H. D. Sherali, and C. M. Shetty, Nonlinear Programming: Theory and Algorithms. New York [etc.]: Wiley, 1993.
View in Google Scholar
[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.
View in Google Scholar
[3] D. P. Bertsekas, Network Optimization: Continuous and Discrete Models. Belmont: Athena Scientific, 1998.
View in Google Scholar
[4] D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Belmont: Athena Scientific, 1997.
View in Google Scholar
[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.
View in Google Scholar
[6] W. Findeisen, F. N. Bailey, M. Brdyś, K. Malinowski, and A. Woźniak, Control and Coordination in Hierarchical Systems. Chichester [etc.]: Wiley, 1980.
View in Google Scholar
[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.
View in Google Scholar
[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.
View in Google Scholar
[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.
View in Google Scholar
[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.
View in Google Scholar
Downloads
Submitted
Published
Issue
Section
License
Copyright (c) 2006 Journal of Telecommunications and Information Technology
This work is licensed under a Creative Commons Attribution 4.0 International License.
