Latest revision as of 04:03, 2 February 2021

Abstract

Link weight optimization is shown to be a key issue in engineering of IGPs using shortest path first routing. The IGP weight optimization problem seeks a weight array resulting an optimal load distribution in the network based on the topology information and a traffic demand matrix. Several solution methods for various kinds of this problem have been proposed in the literature. However, the interaction of IGP with BGP is generally neglected in these studies. In reality, the optimized weights may not perform as well as expected, since updated link weights can cause shifts in the traffic demand matrix by hot-potato routing in the decision process of BGP. Hot-potato routing occurs when BGP decides the egress router for a destination prefix according to the IGP lengths. This paper mainly investigates the possible degradation of an IGP weight optimization tool due to hot-potato routing under a worst-case example and some experiments which are carried out by using an open source traffic engineering toolbox. Furthermore, it proposes an approach based on robust optimization to overcome the negative effect of hot-potato routing and analyzes its performance

Original document

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

• https://hal.archives-ouvertes.fr/hal-01255570

• http://wpage.unina.it/pescape/cit/01690393.pdf,

https://difusion.ulb.ac.be/vufind/Record/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/145453/Details,

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

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

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

http://ieeexplore.ieee.org/document/1690393,

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

• http://xplorestaging.ieee.org/ielx5/11123/35638/01690393.pdf?arnumber=1690393,

http://dx.doi.org/10.1109/icisp.2006.33