Distributed asynchronous algorithms in the Internet – new routing and traffic control methods
DOI:
https://doi.org/10.26636/jtit.2005.3.328Keywords:
computer networks, optimization, shortest path, traffic control, decomposition, distributed computations, asynchronous algorithmsAbstract
The paper presents several new algorithms concerning the third (network) and the fourth (transport) layer of ISO/OSI network model. For the third layer two classes of the shortest paths algorithms – label correcting and auction algorithms – are proposed. For the fourth layer an application of price decomposition to network optimization and Internet congestion control is suggested.
Downloads
References
[1] S. Athuraliya and S. H. Low, „Optimization flow control”. II. Implementation, 2000, http://netlab.caltech.edu
View in Google Scholar
[2] D. P. Bertsekas, „An auction algorithm for shortest paths”, SIAM J. Opt., vol. 1, pp. 425-447, 1991.
View in Google Scholar
[3] D. P. Bertsekas, „A simple and fast label correcting algorithm for shortest paths”, Networks, vol. 23, pp. 703-709, 1993.
View in Google Scholar
[4] D. P. Bertsekas, F. Guerriero, and R. Musmanno, „Parallel asynchronous label-correcting methods for shortest paths”, J. Opt. Theory Appl., vol. 88, pp. 297-321, 1996.
View in Google Scholar
[5] D. P. Bertsekas and R. Gallager, Data Networks. Englewood-Cliffs: Prentice-Hall, 1992.
View in Google Scholar
[6] D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Belmont: Athena Scientific, 1997.
View in Google Scholar
[7] D. E. Comer, Internetworking with TCP/IP. Vol. I: Principles, Protocols, and Architecture. Englewood Cliffs: Prentice-Hall, 1991.
View in Google Scholar
[8] F. Guerriero and R. Musmanno, „Parallel asynchronous algorithms for the K shortest paths problem”, J. Opt. Theory Appl., vol. 104, no. 1, pp. 91-108, 2000.
View in Google Scholar
[9] V. Jacobson, „Congestion avoidance and control”, ACM Comput. Commun. Rev., vol. 18, pp. 314-329, 1988.
View in Google Scholar
[10] C. Jin, D. X. Wei, and S. H. Low, „FAST TCP: motivation, architecture, algorithms, performance”, in Proc. IEEE Infocom, Hong Kong, 2004.
View in Google Scholar
[11] A. Karbowski, „Distributed asynchronous routing in Internet - a survey of optimization algorithms”, in Proc. I Int. Conf. Decis. Sup. Telecommun. Inform. Soc. (DSTIS), Warsaw, Poland, pp. 89-97.
View in Google Scholar
[12] A. Karbowski, „Correction to Low and Lapsley’s article „Optimization flow control. I. Basic algorithm and convergence””, IEEE/ACM Trans. Netw., vol. 11, issue 2, pp. 338-339, 2003.
View in Google Scholar
[13] F. P. Kelly, „Charging and rate control for elastic traffic”, Eur. Trans. Telecommun., vol. 8, no. 1, pp. 33-37, 1997.
View in Google Scholar
[14] S. Low and D. E. Lapsley, „Optimization flow control. I. Basic algorithm and convergence”, IEEE/ACM Trans. Netw., vol. 7, issue 6, pp. 861-874, 1999.
View in Google Scholar
[15] S. Low, „Optimization flow control with on-line measurement or multiple paths”, in Proc. 16th Int. Teletraf. Congr., Edinburgh, UK, 1999.
View in Google Scholar
[16] S. H. Low, „A duality model of TCP and queue management algorithms”, IEEE/ACM Trans. Netw., vol. 11, issue 4, pp. 525-536, 2003.
View in Google Scholar
[17] S. H. Low, F. Paganini, and J. C. Doyle, „Internet congestion control”, IEEE Contr. Syst. Mag., vol. 22, no. 1, pp. 28-43, 2002.
View in Google Scholar
[18] L. Polymenakos and D. P. Bertsekas, „Parallel shortest path auction algorithms”, Paral. Comput., vol. 20, pp. 1221-1247, 1994.
View in Google Scholar
[19] H. Yaiche, R. R. Mazumdar, and C. Rosenberg, „A game-theoretic framework for bandwidth allocation and pricing in broadband networks”, IEEE/ACM Trans. Netw., vol. 8, no. 5, pp. 667-678, 2000.
View in Google Scholar
Downloads
Submitted
Published
Issue
Section
License
Copyright (c) 2005 Journal of Telecommunications and Information Technology
This work is licensed under a Creative Commons Attribution 4.0 International License.
