Robust routing vs dynamic load-balancing a comprehensive study and new directions

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.

[1]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[2]  Avrim Blum,et al.  Routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing games , 2006, PODC '06.

[3]  Anja Feldmann,et al.  REPLEX: dynamic traffic engineering based on wardrop routing policies , 2006, CoNEXT '06.

[4]  Eitan Altman,et al.  A survey on networking games in telecommunications , 2006, Comput. Oper. Res..

[5]  J G Wardrop,et al.  CORRESPONDENCE. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH. , 1952 .

[6]  Walid Ben-Ameur,et al.  Routing of Uncertain Traffic Demands , 2005 .

[7]  Ariel Orda,et al.  Bottleneck Routing Games in Communication Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[8]  Manfred K. Warmuth,et al.  The Weighted Majority Algorithm , 1994, Inf. Comput..

[9]  Edith Cohen,et al.  Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs , 2003, SIGCOMM '03.

[10]  Albert G. Greenberg,et al.  COPE: traffic engineering in dynamic networks , 2006, SIGCOMM.

[11]  Jean-Louis Rougier,et al.  Routing Games for Traffic Engineering , 2009, 2009 IEEE International Conference on Communications.

[12]  Jean-Louis Rougier,et al.  Minimum-Delay Load-Balancing through Non-parametric Regression , 2009, Networking.

[13]  S. Vaton,et al.  Robust and Reactive Traffic Engineering for Dynamic Traffic Demands , 2008, 2008 Next Generation Internet Networks.

[14]  Srikanth Kandula,et al.  Walking the tightrope: responsive yet stable traffic engineering , 2005, SIGCOMM '05.

[15]  Mikkel Thorup,et al.  Traffic engineering with estimated traffic matrices , 2003, IMC '03.

[16]  Donald F. Towsley,et al.  On optimal routing with multiple traffic matrices , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[17]  Cheng Jin,et al.  MATE: MPLS adaptive traffic engineering , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).