Stable and robust multipath oblivious routing for traffic engineering

Authors:
Yuxi Li;Baochun Bai;Janelle Harms;Robert Holte
Affiliations:
Department of Computing Science, University of Alberta;Department of Computing Science, University of Alberta;Department of Computing Science, University of Alberta;Department of Computing Science, University of Alberta
Venue:
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Year:
2007

Citing 11
Cited 2

Load-sensitive routing of long-lived IP flows

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Measuring ISP topologies with rocketfuel

Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
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
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
Coping with network failures: routing strategies for optimal demand oblivious restoration

Proceedings of the joint international conference on Measurement and modeling of computer systems
The problem of synthetically generating IP traffic matrices: initial recommendations

ACM SIGCOMM Computer Communication Review
Walking the tightrope: responsive yet stable traffic engineering

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Optimal Routing with Multiple Traffic Matrices Tradeoff between Average andWorst Case Performance

ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
COPE: traffic engineering in dynamic networks

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Optimizing OSPF/IS-IS weights in a changing world

IEEE Journal on Selected Areas in Communications
Hash routing for collections of shared Web caches

IEEE Network: The Magazine of Global Internetworking

Harnessing Traffic Uncertainties in Wireless Mesh Networks--A Stochastic Optimization Approach

Mobile Networks and Applications
Demand-oblivious routing: distributed vs. centralized approaches

INFOCOM'10 Proceedings of the 29th conference on Information communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Intra-domain traffic engineering is essential for the operation of an Internet Service Provider. Demand-oblivious routing [2] promises excellent performance guarantee with changing and uncertain traffic demands. However, it is difficult to implement it. We investigate an efficient and deployable implementation of oblivious routing. We study its performance by both numerical experiments and simulation. The performance study shows that the multipath implementation achieves a close approximation to oblivious routing [2], especially when approximate knowledge of traffic is available. The study also shows its robustness under varying traffic demands, link failures and an adversary attack. Its performance is excellent even with a 100% error in traffic estimation.