|
Avtomatika i Telemekhanika, 2007, Issue 7, Pages 180–189
(Mi at1025)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Computer-Aided Design and Programming
Routing control in IP-networks with the variable performance criterion
N. A. Kuznetsov, V. N. Fetisov A. A. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences
Abstract:
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 Sisco 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.
Citation:
N. A. Kuznetsov, V. N. Fetisov, “Routing control in IP-networks with the variable performance criterion”, Avtomat. i Telemekh., 2007, no. 7, 180–189; Autom. Remote Control, 68:7 (2007), 1284–1293
Linking options:
https://www.mathnet.ru/eng/at1025 https://www.mathnet.ru/eng/at/y2007/i7/p180
|
Statistics & downloads: |
Abstract page: | 338 | Full-text PDF : | 130 | References: | 74 | First page: | 1 |
|