×

zbMATH — the first resource for mathematics

Routing control in IP-networks with the variable performance criterion. (English. Russian original) Zbl 1140.93476
Autom. Remote Control 68, No. 7, 1284-1293 (2007); translation from Avtom. Telemekh. 2007, No. 7, 180-189 (2007).
Summary: For routing control in backbone IP-networks, we propose to part the control time interval into two segments and to use different performance criteria on them. It is assumed that distribution of flows is realized at the first step by the Dijkstra algorithm which is included in OSPF and is used in Cisco routers. The minimax criterion is proposed at the second step; it is realized in the robust algorithm of data incoming flows distribution adjustment. The object of the adjustment algorithm is to prevent or lower the probability of networks congestion. Characteristics of the proposed algorithm are studied. Efficiency of the adjustment algorithm application for network controlling is demonstrated by the Monte Carlo method. Speed characteristics of the proposed algorithm are compared with some optimal algorithms.
MSC:
93E03 Stochastic systems in control theory (general)
90B18 Communication networks in operations research
93E20 Optimal stochastic control
93C95 Application models in control theory
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Feldmann, A., Greenberg, A., Lund, C., et al., Derivin Traffic Demands for Operational IP Networks: Methodology and Experience, IEEE/ACM Trans. Network, 2001, vol. 9, no. 3, pp. 265–279. · Zbl 05458622 · doi:10.1109/90.929850
[2] Kuznetsov, N.A., Control Algorithm Design under the Variable Criterion, Avtom. Telemekh., 1996, no. 5, pp. 5–14.
[3] Kuznetsov, N.A., Methods of Relay-linear Algorithms Realizing, Avtom. Telemekh., 1966, no. 7, pp. 110–118.
[4] Fortz, B. and Thorup, M., Optimizing OSPF/IS-IS Weights in a Changing World, IEEE J. Selected Commun., 2002, vol. 20(4), pp. 756–766. · doi:10.1109/JSAC.2002.1003042
[5] Lin, F.Y.S. and Wang, J.L., Minimax Open Shortest Path First Routing Algorithms in Networks Supporting the SMDS Services, Proc. IEEE Int. Conf. Commun., 1993, vol. 2, pp. 666–670. · doi:10.1109/ICC.1993.397358
[6] Bertsekas, D.P., Optimal Routing and Flow Control Methods for Communication Networks, in Analysis and Optimization of Systems, Bensoussan, A. and Lions, J.L., Eds., New York: Springer-Verlag, 1982. · Zbl 0545.90039
[7] Ramakrishnan, K.G. and Manoel, A.R., Optimal Routing in Shortest-Path Data Networks, Bell Labs Tech. J., 2001, pp. 117–137.
[8] Tsai, W.K., Antonio, J.K., and Huang, G.M., Complexity of Gradient Projection Method for Optimal Routing in Data Networks, IEEE/ACM Trans. Network, 1999, vol. 7, no. 6, pp. 897–905. · doi:10.1109/90.811454
[9] Applegate, D. and Cohen, E., Making Intra-Domain Routing Robust to Changing and Uncertain Traffic Demands: Understanding Fundamental Tradeoffs, Proc. ACM SIGCOMM’03 Conf. ACM, 2003.
[10] Sridharan, A., Guerin, R., and Diot, C., Achieving Near-Optimal Traffic Engineering Solutions for Current OSPF/IS-IS Networks, IEEE Trans. Network, 2005, vol. 13, no. 2, pp. 110–118. · Zbl 05458848 · doi:10.1109/TNET.2005.845549
[11] Kuznetsov, N.A. and Fetisov, V.N., Robust Control of Information Networkks, Avtom. Telemekh., 2005, no. 8, pp. 86–101.
[12] Hill, B., Cisco: The Complete Reference, Osborne: McGraw-Hill, 1998. Translated under the title Polnyi spravochnik po Cisco, Moscow: Vil’yams, 2004.
[13] Cisco–OSPF Design Guide, in Cisco Systems, 2002 (www.bspu.secna.ru/:_swp/cisco/ospf-design-guide.pdf).
[14] Schwartz, M., Telecommunication Networks: Protocols, Modelling, and Analysis, Reading: Addison-Wesley, 1987. Translated under the title Seti svyazi: protokoly, modelirovanie i analiz, Moscow: Nauka, 1992.
[15] Kurose, J. and Ross, K., Computer Networking. A Top-Down Approach Featuring the Internet, Pearson: Addison-Wesley, 2000. Translated under the title Komp’yuternye seti. Mnogourovnevaya Arkhitektura Interneta, St. Petersburg: Piter, 2004.
[16] Medina, A., Taft, N., Salamatian, K., et al., Traffic Matrix Estimation: Existing Techniques and New Directions, Proc. ACM SIGCOMM’02 Conf. ACM, 2002.
[17] Naugle, M. Illustrated TCP/IP. A Graphic Quide to the Protocol Suite, New York: Wiley, 2001. Translated under the title TCP/IP. Illyustrirovannyi uchebnik, Moscow: DMK, 2003.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.