Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty

Authors:
Ayşegül Altin;B. Fortz;Hakan Ümit
Affiliations:
Department of Industrial Engineering, Faculty of Engineering, TOBB University of Economics and Technology, Ankara, Turkey;Département d'Informatique, Faculté des Sciences, Université Libre de Bruxelles, Bruxelles, Belgium;Operations & Technology Management Center, Vlerick Leuven Gent Management School, Gent, Belgium
Venue:
Networks
Year:
2012

Citing 12
Cited 0

Designing least-cost nonblocking broadband networks

Journal of Algorithms
A flexible model for resource management in virtual private networks

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
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
Internet Routing and Related Topology Issues

SIAM Journal on Discrete Mathematics
Measuring ISP topologies with rocketfuel

IEEE/ACM Transactions on Networking (TON)
Routing, Flow, and Capacity Design in Communication and Computer Networks

Routing, Flow, and Capacity Design in Communication and Computer Networks
Increasing Internet Capacity Using Local Search

Computational Optimization and Applications
Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks

IEEE/ACM Transactions on Networking (TON)
Provisioning virtual private networks under traffic uncertainty

Networks - Special Issue on Multicommodity Flows and Network Design
An open source traffic engineering toolbox

Computer Communications
Edge-based traffic engineering for OSPF networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimizing OSPF/IS-IS weights in a changing world

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The desire for configuring well-managed open shortest path first (OSPF) routes to handle the communication needs in the contemporary business world with larger networks and changing service requirements has opened the way to use traffic engineering tools with the OSPF protocol. Moreover, anticipating possible shifts in expected traffic demands while using network resources efficiently has started to gain more attention. We take these two crucial issues into consideration and study the weight setting problem for OSPF routing problem with polyhedral demands. Our motivation is to optimize the link weight metric such that the minimum cost routing uses shortest paths with equal cost multipath splitting and the routing decisions are robust to possible fluctuations in demands. In addition to a compact mixed integer programming model, we provide an algorithmic approach with two variations to tackle the problem. We present several test results for these two strategies and discuss whether we could make our weight-managed OSPF comparable to unconstrained routing under polyhedral demand uncertainty. © 2012 Wiley Periodicals, Inc. NETWORKS, 2012 © 2012 Wiley Periodicals, Inc.