Telecommunication networks: protocols, modeling and analysis
Telecommunication networks: protocols, modeling and analysis
Illustrated TCP/IP: a graphic guide to the protocol suite
Illustrated TCP/IP: a graphic guide to the protocol suite
Complexity of gradient projection method for optimal routing in data networks
IEEE/ACM Transactions on Networking (TON)
Deriving traffic demands for operational IP networks: methodology and experience
IEEE/ACM Transactions on Networking (TON)
Cisco: The Complete Reference
Traffic matrix estimation: existing techniques and new directions
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
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
Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks
IEEE/ACM Transactions on Networking (TON)
Optimizing OSPF/IS-IS weights in a changing world
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
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.