The revised ARPANET routing metric
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
The weighted majority algorithm
Information and Computation
Deriving traffic demands for operational IP networks: methodology and experience
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Traffic engineering with estimated traffic matrices
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
How to Better Use Expert Advice
Machine Learning
Walking the tightrope: responsive yet stable traffic engineering
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
COPE: traffic engineering in dynamic networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
REPLEX: dynamic traffic engineering based on wardrop routing policies
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
Minimum-Delay Load-Balancing through Non-parametric Regression
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
A survey on networking games in telecommunications
Computers and Operations Research
Routing games for traffic engineering
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Bottleneck Routing Games in Communication Networks
IEEE Journal on Selected Areas in Communications
Optimal multipath forwarding in planned Wireless Mesh Networks
Computer Communications
| Hi-index | 0.24 |
Internet traffic is highly dynamic and difficult to predict in current network scenarios, which enormously complicates network management and resources optimization. To address this uncertainty in a robust and efficient way, two almost antagonist Traffic Engineering (TE) techniques have been proposed in the last years: Robust Routing and Dynamic Load Balancing. Robust Routing (RR) copes with traffic uncertainty in an off-line preemptive fashion, computing a single static routing configuration that is optimized for traffic variations within some predefined uncertainty set. On the other hand, Dynamic Load Balancing (DLB) balances traffic among multiple paths in an on-line reactive fashion, adapting to traffic variations in order to optimize a certain congestion function. In this article we present the first comparative study between these two alternative methods. We are particularly interested in the performance loss of RR with respect to DLB, and on the response of DLB when faced with abrupt changes. This study brings insight into several RR and DLB algorithms, evaluating their virtues and shortcomings, which allows us to introduce new mechanisms that improve previous proposals.