Robust Control of Information Networks

Authors:
N. A. Kuznetsov;V. N. Fetisov
Affiliations:
Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia;Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
Venue:
Automation and Remote Control
Year:
2005

Citing 5
Cited 0

Telecommunication networks: protocols, modeling and analysis

Telecommunication networks: protocols, modeling and analysis
Data networks

Data networks
Internet Routing Architectures, Second Edition

Internet Routing Architectures, Second Edition
Cisco: The Complete Reference

Cisco: The Complete Reference
Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications

Quantified Score

Hi-index	0.01

Visualization

Abstract

A problem of robust control of routing for preventing the congestion in digital information networks is considered. Models for both duplex and semiduplex data communication channels (data channels) are suggested. For the problem of robust control of routing, the factorization operation of the traffic matrix of an information network is proposed, which plays an important role in the development of a control algorithm. Robust control algorithms are proposed, in which use is made of alternate paths with an arbitrary number of links. Properties of the suggested algorithm are studied. Model examples of information networks are given, which display the effectiveness of the suggested algorithms of robust routing.