(Created page with " == Abstract == An important requirement of a robust traffic engineering solution is insensitivity to changes, be they in the form of traffic fluctuations or changes in the n...") |
|||
| (One intermediate revision by the same user not shown) | |||
| Line 3: | Line 3: | ||
An important requirement of a robust traffic engineering solution is insensitivity to changes, be they in the form of traffic fluctuations or changes in the network topology because of link failures. In this paper we focus on developing a fast and effective technique to compute traffic engineering solutions for Interior Gateway Protocol (IGPs) environments that are robust to link failures in the logical topology. The routing and packet forwarding decisions for IGPs is primarily governed by link weights. Our focus is on computing a single set of link weights for a traffic engineering instance that performs well over all single logical link failures. Such types of failures, although usually not long lasting, of the order of tens of minutes, can occur with high enough frequency, of the order of several a day, to significantly affect network performance. The relatively short duration of such failures coupled with issues of computational complexity and convergence time due to the size of current day networks discourage adaptive reactions to such events. Consequently, it is desirable to a priori compute a routing solution that performs well in all such scenarios. Through computational evaluations we demonstrate that our technique yields link weights that perform well over all single link failures and also scales well, in terms of computational complexity, with the size of the network. | An important requirement of a robust traffic engineering solution is insensitivity to changes, be they in the form of traffic fluctuations or changes in the network topology because of link failures. In this paper we focus on developing a fast and effective technique to compute traffic engineering solutions for Interior Gateway Protocol (IGPs) environments that are robust to link failures in the logical topology. The routing and packet forwarding decisions for IGPs is primarily governed by link weights. Our focus is on computing a single set of link weights for a traffic engineering instance that performs well over all single logical link failures. Such types of failures, although usually not long lasting, of the order of tens of minutes, can occur with high enough frequency, of the order of several a day, to significantly affect network performance. The relatively short duration of such failures coupled with issues of computational complexity and convergence time due to the size of current day networks discourage adaptive reactions to such events. Consequently, it is desirable to a priori compute a routing solution that performs well in all such scenarios. Through computational evaluations we demonstrate that our technique yields link weights that perform well over all single link failures and also scales well, in terms of computational complexity, with the size of the network. | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| Line 15: | Line 10: | ||
* [https://link.springer.com/content/pdf/10.1007%2F11422778_51.pdf https://link.springer.com/content/pdf/10.1007%2F11422778_51.pdf] | * [https://link.springer.com/content/pdf/10.1007%2F11422778_51.pdf https://link.springer.com/content/pdf/10.1007%2F11422778_51.pdf] | ||
| + | |||
| + | * [http://link.springer.com/content/pdf/10.1007/11422778_51.pdf http://link.springer.com/content/pdf/10.1007/11422778_51.pdf], | ||
| + | : [http://dx.doi.org/10.1007/11422778_51 http://dx.doi.org/10.1007/11422778_51] | ||
| + | |||
| + | * [https://link.springer.com/chapter/10.1007%2F11422778_51 https://link.springer.com/chapter/10.1007%2F11422778_51], | ||
| + | : [http://repository.upenn.edu/cgi/viewcontent.cgi?article=1132&context=ese_papers http://repository.upenn.edu/cgi/viewcontent.cgi?article=1132&context=ese_papers], | ||
| + | : [https://dblp.uni-trier.de/db/conf/networking/networking2005.html#SridharanG05 https://dblp.uni-trier.de/db/conf/networking/networking2005.html#SridharanG05], | ||
| + | : [https://repository.upenn.edu/ese_papers/108 https://repository.upenn.edu/ese_papers/108], | ||
| + | : [https://www.scipedia.com/public/Sridharan_Guerin_2010a https://www.scipedia.com/public/Sridharan_Guerin_2010a], | ||
| + | : [https://core.ac.uk/display/102718536 https://core.ac.uk/display/102718536], | ||
| + | : [https://academic.microsoft.com/#/detail/1496837406 https://academic.microsoft.com/#/detail/1496837406] | ||
Latest revision as of 16:24, 21 January 2021
Abstract
An important requirement of a robust traffic engineering solution is insensitivity to changes, be they in the form of traffic fluctuations or changes in the network topology because of link failures. In this paper we focus on developing a fast and effective technique to compute traffic engineering solutions for Interior Gateway Protocol (IGPs) environments that are robust to link failures in the logical topology. The routing and packet forwarding decisions for IGPs is primarily governed by link weights. Our focus is on computing a single set of link weights for a traffic engineering instance that performs well over all single logical link failures. Such types of failures, although usually not long lasting, of the order of tens of minutes, can occur with high enough frequency, of the order of several a day, to significantly affect network performance. The relatively short duration of such failures coupled with issues of computational complexity and convergence time due to the size of current day networks discourage adaptive reactions to such events. Consequently, it is desirable to a priori compute a routing solution that performs well in all such scenarios. Through computational evaluations we demonstrate that our technique yields link weights that perform well over all single link failures and also scales well, in terms of computational complexity, with the size of the network.
Original document
The different versions of the original document can be found in:
- http://repository.upenn.edu/cgi/viewcontent.cgi?article=1132&context=ese_papers,
- https://dblp.uni-trier.de/db/conf/networking/networking2005.html#SridharanG05,
- https://repository.upenn.edu/ese_papers/108,
- https://www.scipedia.com/public/Sridharan_Guerin_2010a,
- https://core.ac.uk/display/102718536,
- https://academic.microsoft.com/#/detail/1496837406
Document information
Published on 01/01/2010
Volume 2010, 2010
DOI: 10.1007/11422778_51
Licence: CC BY-NC-SA license
Share this document
Keywords
claim authorship
Are you one of the authors of this document?