Towards a statistical characterization of the competitiveness of oblivious routing

Authors:
Gábor Németh;Gábor Rétvári
Affiliations:
HSNLab, Dept. of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Budapest, Hungary;HSNLab, Dept. of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Budapest, Hungary
Venue:
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Year:
2012

Citing 6
Cited 0

Inferring link weights using end-to-end measurements

Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Minimizing Congestion in General Networks

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
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
Traffic matrix estimation on a large IP backbone: a comparison on real data

Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Optimal hierarchical decompositions for congestion minimization in networks

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
On optimal multipath rate-adaptive routing

ISCC '10 Proceedings of the The IEEE symposium on Computers and Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Oblivious routing asks for a static routing that serves arbitrary user demands with minimal performance penalty. Performance is measured in terms of the competitive ratio, the proportion of the maximum congestion to the best possible congestion. In this paper, we take the first steps towards extending this worst-case characterization to a more revealing statistical one. We define new performance metrics and we present numerical evaluations showing that, in statistical terms, oblivious routing is not as competitive as the worst-case performance characterizations would suggest.