Latest revision as of 06:36, 2 February 2021

Abstract

Traffic Engineering (TE) has become a challenging task for network management and resources optimization due to traffic uncertainty and to the difficulty to predict traffic variations. To address this uncertainty in a robust and efficient way, two almost antagonist approaches have emerged during the last years: Robust Routing and Dynamic Load-Balancing. The former copes with traffic uncertainty in an off-line preemptive fashion, computing a stable routing configuration that is optimized for a large set of possible traffic demands. The latter balances traffic among multiple paths in an on-line reactive fashion, adapting to traffic variations in order to optimize a certain cost-function. Much has been said and discussed about the advantages and drawbacks of each approach, but very few works have tried to compare the performance of both mechanisms, particularly in the same network and traffic scenarios. This paper brings insight into several Robust Routing and Dynamic Load-Balancing algorithms, evaluating their virtues and shortcomings and presenting new mechanisms to improve previous proposals. Among others, such a study intends to help network operators in choosing an adequate mechanism to cope with traffic uncertainty.

Original document

The different versions of the original document can be found in:

• http://iie.fing.edu.uy/%7Eflarroca/papers/drcn09/PID958883.pdf

• http://xplorestaging.ieee.org/ielx5/5335584/5339979/05340015.pdf?arnumber=5340015,

http://dx.doi.org/10.1109/drcn.2009.5340015

• http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005340015,

http://biblio.telecom-paristech.fr/cgi-bin/download.cgi?id=9856,

https://ieeexplore.ieee.org/document/5340015,

http://iie.fing.edu.uy/~flarroca/papers/drcn09/PID958883.pdf,

https://academic.microsoft.com/#/detail/2086416051