Latest revision as of 22:46, 1 February 2021

Abstract

International audience; Internet traffic is highly dynamic and difficult to predict in current network scenarios. This makes of traffic engineering (TE) a very challenging task for network management and resources optimization. We study the problem of intradomain routing optimization under this traffic uncertainty. Recent works have proposed robust optimization techniques to tackle the problem, conceiving the robust routing (RR) approach. 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. Despite achieving routing reliability with relatively low performance loss, RR presents various drawbacks and conception problems as it is currently proposed. This paper brings insight into the different robust routing shortcomings, introducing new mechanisms that improve previous proposals and alleviate these problems. Among others, we propose and evaluate new optimization objectives to attain better global performance from an end-to-end quality of service perspective.

Original document

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

• http://iie.fing.edu.uy/%7Eflarroca/papers/lanoms09/lanoms09camRE.pdf

• http://xplorestaging.ieee.org/ielx5/5335459/5338789/05338803.pdf?arnumber=5338803,

http://dx.doi.org/10.1109/lanoms.2009.5338803

• https://hal.archives-ouvertes.fr/hal-00527610,

https://hal.archives-ouvertes.fr/hal-00527610/document,

https://hal.archives-ouvertes.fr/hal-00527610/file/lanoms09_soumis.pdf

• https://ieeexplore.ieee.org/document/5338803,

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

https://www.researchgate.net/profile/S_Vaton/publication/224083294_Robust_Routing_mechanisms_for_intradomain_Traffic_Engineering_in_dynamic_networks/links/0fcfd50ea8f397fae0000000.pdf,

https://hal.archives-ouvertes.fr/hal-00527610,

https://dblp.uni-trier.de/db/conf/lanoms/lanoms2009.html#CasasLV09,

https://hal.archives-ouvertes.fr/hal-00527610/document,

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