Robust load-balancing under statistical uncertainty: models and polynomial-time algorithms

Authors:
Anders Gunnar;Mikael Johansson
Affiliations:
Swedish Institute of Computer Science, Kista, Sweden;School of Electrical Engineering, Stockholm, Sweden
Venue:
NGI'09 Proceedings of the 5th Euro-NGI conference on Next Generation Internet networks
Year:
2009

Citing 9
Cited 0

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
Traffic engineering with estimated traffic matrices

Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Routing, Flow, and Capacity Design in Communication and Computer Networks

Routing, Flow, and Capacity Design in Communication and Computer Networks
Traffic matrix estimation on a large IP backbone: a comparison on real data

Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Traffic matrices: balancing measurements, inference and modeling

SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Providing public intradomain traffic matrices to the research community

ACM SIGCOMM Computer Communication Review
COPE: traffic engineering in dynamic networks

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Robust solutions of uncertain linear programs

Operations Research Letters
Optimizing OSPF/IS-IS weights in a changing world

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the problem of guaranteed-performance routing under statistical traffic uncertainty. Relevant traffic models are presented and a polynomial-time algorithm for solving the associated robust routing problem is given. We demonstrate how our techniques, in combination with fundamental limitations on the accuracy of estimated traffic matrices, enable us to compute bounds on the achievable performance of OSPF-routing optimized using only topology information and link count data. We discuss extensions to other types of traffic uncertainties and describe an alternative, more memory efficient, algorithm based on combined constraint and column generation. The proposed techniques are evaluated in several numerical examples to highlight the features of our approach.