Change search
ReferencesLink to record
Permanent link

Direct link
Robust routing under statistical uncertainty: models and polynomial-time algorithms
Swedish Institute of Computer Science.
KTH, School of Electrical Engineering (EES), Automatic Control.
2009 (English)In: NGI '09 Next Generation Internet Networks, 2009Conference paper (Refereed)
Abstract [en]

We study the problem of routing under statistical traffic uncertainty. Models for characterizing the statistical uncertainty which arises when the traffic matrix is estimated from link loads using a maximum likelihood scheme are given, and associated optimization models are formulated for finding routing settings that are insensitive to likely estimation errors. Both statistical and worst-case ellipsoidal traffic models are treated. We demonstrate how the routing optimization can be performed in polynomial time, and compare such algorithms with alternatives based on combined constraint and column generation. The proposed techniques are evaluated in several numerical examples.

Place, publisher, year, edition, pages
National Category
URN: urn:nbn:se:kth:diva-79734DOI: 10.1109/NGI.2009.5175781ScopusID: 2-s2.0-70449370968OAI: diva2:499924
5th Euro-NGI Conference on Next Generation Internet Networks, NGI 2009. Aveiro, Portugal. 1-3 July 2009
QC 20120427Available from: 2012-02-13 Created: 2012-02-09 Last updated: 2012-04-27Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Gunnar, AndersJohansson, Mikael
By organisation
Automatic Control

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 11 hits
ReferencesLink to record
Permanent link

Direct link