Deriving traffic demands for operational IP networks: methodology and experience
IEEE/ACM Transactions on Networking (TON)
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
Fast accurate computation of large-scale IP traffic matrices from link loads
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Increasing Internet Capacity Using Local Search
Computational Optimization and Applications
Traffic engineering with traditional IP routing protocols
IEEE Communications Magazine
Local unicast routing control agent
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
| Hi-index | 0.00 |
Routing within a single Open Shortest Path First (OSPF) area is completely determined by computing shortest paths on a topology graph. In conventional routing the link cost assigned to each edge on the graph is statically determined a-priori before the network is deployed. If subsequently, link quality degrades or alternate links become available, routing paths may become sub-optimal. The Unicast Routing Control Agent (URCA) being developed as a part of the PILSNER program dynamically changes link costs reacting to dynamic network conditions. The goals of URCA are two-fold: 1) To ensure that links are evenly loaded. URCA attempts to set link costs that ensure that most links are utilized for carrying traffic. This has the result of maximizing the effective capacity or increasing the number of users that can be supported by a given network infrastructure. 2) To ensure that the effect of soft link failures is minimized. In dynamic tactical environment with wireless links, link quality can be degraded due to congestion, blockage, mobility etc. URCA tries to route around degraded links ensuring that critical sessions are not degraded increasing the chances of a successful mission. These goals must be balanced against frequent network routing re-configuration which can be disruptive and oscillations where traffic moves back and forth between a set of links due to the reconfiguration. This paper describes the functionality of the Unicast Routing Control Agent. We discuss the challenges that must be addressed in designing an effective heuristic. We report results from a simulation study to evaluate the performance gains, such as the increase in aggregate throughput, from deploying URCA compared to the case where conventional routing is used. Our simulation experiments show that using URCA can greatly enhance throughput, and reduce delay and packet loss when deployed in a wireless tactical network.