Latest revision as of 21:43, 3 February 2021

Abstract

BGP is traditionally configured to implement traffic engineering objectives without considering potential network dynamics. This might result in undesirable traffic distribution when network failures occur. In this paper, we present algorithms for interdomain traffic engineering that achieve the interdomain traffic engineering objectives under network failures. That is, we aim to configure routing policies so that traffic is distributed evenly. More importantly, the configuration is robust in the sense that it is able to achieve the specified traffic engineering goals despite network failures. We first investigate the coarse-grained robust configurations. The derived configuration can achieve optimal robust traffic engineering objectives for most network failures. Further, we develop a greedy algorithm to derive robust BGP configuration for any traffic distribution and link capacities. We use simulations to evaluate the robustness of the derived BGP configurations by applying the algorithm to both transit and stub ASs under realistic traffic demands. Our results show that the derived BGP configurations can improve the default configuration significantly in terms of achieving the robust traffic engineering objectives. Furthermore, our algorithm achieves robust traffic engineering goals without diminishing other routing objectives.

Original document

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

• http://www.ieee-icnp.org/2006/papers/s8a4.pdf

• http://xplorestaging.ieee.org/ielx5/4110262/4110263/04110302.pdf?arnumber=4110302,

http://dx.doi.org/10.1109/icnp.2006.320180

• https://scholarworks.umass.edu/ece_faculty_pubs/413,

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

https://dblp.uni-trier.de/db/conf/icnp/icnp2006.html#QiuG06,

https://works.bepress.com/lixin_gao/22/download,

https://www.ieee-icnp.org/2006/papers/s8a4.pdf,

http://www.ieee-icnp.org/2006/papers/s8a4.pdf,

https://works.bepress.com/lixin_gao/22,

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