Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Hashing vectors for tabu search
Annals of Operations Research - Special issue on Tabu search
An incremental algorithm for a generalization of the shortest-path problem
Journal of Algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Experimental analysis of dynamic algorithms for the single source shortest paths problem
Journal of Experimental Algorithmics (JEA)
Even strongly universal hashing is pretty fast
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Detection of combined occurrences
Communications of the ACM
Some optimal inapproximability results
Journal of the ACM (JACM)
OSPF: Anatomy of an Internet Routing Protocol
OSPF: Anatomy of an Internet Routing Protocol
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
Tabu Search
Universal Hashing and k-Wise Independent Random Variables via Integer Arithmetic without Primes
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
IEEE Communications Magazine
Traffic engineering with traditional IP routing protocols
IEEE Communications Magazine
Optimizing OSPF/IS-IS weights in a changing world
IEEE Journal on Selected Areas in Communications
Traffic engineering with MPLS in the Internet
IEEE Network: The Magazine of Global Internetworking
A column generation approach for IGP weight setting problem
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
Improved balancing heuristics for optimizing shortest path routing
Computer Communications
TIE breaking: tunable interdomain egress selection
IEEE/ACM Transactions on Networking (TON)
Rethinking internet traffic management: from multiple decompositions to a practical protocol
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
An Integer Programming Algorithm for Routing Optimization in IP Networks
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Large-scale network parameter configuration using an on-line simulation framework
IEEE/ACM Transactions on Networking (TON)
An open source traffic engineering toolbox
Computer Communications
Autonomic traffic engineering for network robustness
IEEE Journal on Selected Areas in Communications
Performance evaluation of a unicast routing control agent for proactive diverse link selection
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Computers and Operations Research
Network architecture for joint failure recovery and traffic engineering
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Network architecture for joint failure recovery and traffic engineering
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
Biased random-key genetic algorithms for combinatorial optimization
Journal of Heuristics
Data-driven network connectivity
Proceedings of the 10th ACM Workshop on Hot Topics in Networks
On the approximability of the minimum congestion unsplittable shortest path routing problem
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Competitive online multicommodity routing
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Link-state routing with hop-by-hop forwarding can achieve optimal traffic engineering
IEEE/ACM Transactions on Networking (TON)
Computer Networks: The International Journal of Computer and Telecommunications Networking
A parallel architecture for IGP weights optimization
APNOMS'07 Proceedings of the 10th Asia-Pacific conference on Network Operations and Management Symposium: managing next generation networks and services
DoS-resilient virtual networks through multipath embedding and opportunistic recovery
Proceedings of the 28th Annual ACM Symposium on Applied Computing
B4: experience with a globally-deployed software defined wan
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
Online OSPF weights optimization in IP networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Open Shortest Path First (OSPF) is one of the most commonly used intra-domain internet routing protocol. Traffic flow is routed along shortest paths, splitting flow evenly at nodes where several outgoing links are on shortest paths to the destination. The weights of the links, and thereby the shortest path routes, can be changed by the network operator. The weights could be set proportional to the physical lengths of the links, but often the main goal is to avoid congestion, i.e. overloading of links, and the standard heuristic recommended by Cisco (a major router vendor) is to make the weight of a link inversely proportional to its capacity.We study the problem of optimizing OSPF weights for a given a set of projected demands so as to avoid congestion. We show this problem is NP-hard, even for approximation, and propose a local search heuristic to solve it. We also provide worst-case results about the performance of OSPF routing vs. an optimal multi-commodity flow routing. Our numerical experiments compare the results obtained with our local search heuristic to the optimal multi-commodity flow routing, as well as simple and commonly used heuristics for setting the weights. Experiments were done with a proposed next-generation AT&T WorldNet backbone as well as synthetic internetworks.