Enhanced-robustness Dijkstra algorithm for control of routing in the IP-networks

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

Citing 4
Cited 0

Telecommunication networks: protocols, modeling and analysis

Telecommunication networks: protocols, modeling and analysis
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
Computer Networking: A Top-Down Approach Featuring the Internet

Computer Networking: A Top-Down Approach Featuring the Internet
Optimizing OSPF/IS-IS weights in a changing world

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A modified Dijkstra algorithm which is an efficient tool for allocation of the input data flows in the backbone IP-networks using the OSPF protocol was proposed. The purpose of modification was to improve the algorithm robustness to the overloads in the data networks. Numerous experimental comparisons of the performance of the proposed algorithm and the linear programming-based algorithm of robust load correction and allocation in the IP-networks demonstrated that the proposed algorithm is highly efficient.