m (Scipediacontent moved page Draft Content 806902045 to Gao et al 2010a)
 
Line 2: Line 2:
 
== Abstract ==
 
== Abstract ==
  
In INterdomain Ingress Traffic Engineering (INITE), a “target” Autonomous System (AS) aims to control the ingress link at which the traffic of one or more upstream source networks enters that AS. In practice, ISPs often manipulate, mostly in a trial-and-error manner, the length of the AS-Path attribute of upstream routes through a simple technique known as prepending (or padding). In this paper, we focus on prepending and propose a polynomial-time algorithm (referred to as OPV) that determines the optimal padding for an advertised route at each ingress link of the target network. Specifically, given a set of “elephant” source networks and some maximum load constraints on the ingress links of the target AS, OPV determines the minimum padding at each ingress link so that the load constraints are met, when it is feasible to do so. OPV requires as input an AS-Path length estimate from each source network to each ingress link. We describe how to estimate this matrix, leveraging the BGP Looking Glass Servers. To deal with unavoidable inaccuracies in the AS-Path length estimates, and also to compensate for the generally unknown BGP tie-breaking process in upstream networks, we also develop a robust variation (RPV) of the OPV algorithm.
+
In INterdomain Ingress Traffic Engineering (INITE), a “target” Autonomous System (AS) aims to control the ingress link at which the traffic of one or more upstream source networks enters that AS. In practice, ISPs often manipulate, mostly in a trial-and-error manner, the length of the AS-Path attribute of upstream routes through a simple technique known as prepending (or padding). In this paper, we focus on prepending and propose a polynomial-time algorithm (referred to as OPV) that determines the optimal padding for an advertised route at each ingress link of the target network. Specifically, given a set of “elephant” source networks and some maximum load constraints on the ingress links of the target AS, OPV determines the minimum padding at each ingress link so that the load constraints are met, when it is feasible to do so. OPV requires as input an AS-Path length estimate from each source network to each ingress link. We describe how to estimate this matrix, leveraging the BGP Looking Glass Servers. To deal with unavoidable inaccuracies in the AS-Path length estimates, and also to compensate for the generally unknown BGP tie-breaking process in upstream networks, we also develop a robust variation (RPV) of the OPV algorithm.
 
+
Document type: Part of book or chapter of book
+
 
+
== Full document ==
+
<pdf>Media:Draft_Content_806902045-beopen14032-5513-document.pdf</pdf>
+
  
  
Line 16: Line 11:
 
* [https://link.springer.com/content/pdf/10.1007%2F11422778_52.pdf https://link.springer.com/content/pdf/10.1007%2F11422778_52.pdf]
 
* [https://link.springer.com/content/pdf/10.1007%2F11422778_52.pdf https://link.springer.com/content/pdf/10.1007%2F11422778_52.pdf]
  
* [http://www.springerlink.com/index/pdf/10.1007/11422778_52 http://www.springerlink.com/index/pdf/10.1007/11422778_52],[http://dx.doi.org/10.1007/11422778_52 http://dx.doi.org/10.1007/11422778_52]
+
* [http://link.springer.com/content/pdf/10.1007/11422778_52.pdf http://link.springer.com/content/pdf/10.1007/11422778_52.pdf],
 +
: [http://dx.doi.org/10.1007/11422778_52 http://dx.doi.org/10.1007/11422778_52]
  
* [https://link.springer.com/chapter/10.1007/11422778_52 https://link.springer.com/chapter/10.1007/11422778_52],[https://core.ac.uk/display/20963569 https://core.ac.uk/display/20963569],[https://smartech.gatech.edu/handle/1853/6479 https://smartech.gatech.edu/handle/1853/6479],[https://academic.microsoft.com/#/detail/1563675742 https://academic.microsoft.com/#/detail/1563675742]
+
* [https://link.springer.com/chapter/10.1007/11422778_52 https://link.springer.com/chapter/10.1007/11422778_52],
 +
: [https://dblp.uni-trier.de/db/conf/networking/networking2005.html#GaoDZ05 https://dblp.uni-trier.de/db/conf/networking/networking2005.html#GaoDZ05],
 +
: [https://core.ac.uk/display/20963569 https://core.ac.uk/display/20963569],
 +
: [https://www.scipedia.com/public/Gao_et_al_2010a https://www.scipedia.com/public/Gao_et_al_2010a],
 +
: [https://smartech.gatech.edu/handle/1853/6479 https://smartech.gatech.edu/handle/1853/6479],
 +
: [https://academic.microsoft.com/#/detail/1563675742 https://academic.microsoft.com/#/detail/1563675742]

Latest revision as of 16:07, 21 January 2021

Abstract

In INterdomain Ingress Traffic Engineering (INITE), a “target” Autonomous System (AS) aims to control the ingress link at which the traffic of one or more upstream source networks enters that AS. In practice, ISPs often manipulate, mostly in a trial-and-error manner, the length of the AS-Path attribute of upstream routes through a simple technique known as prepending (or padding). In this paper, we focus on prepending and propose a polynomial-time algorithm (referred to as OPV) that determines the optimal padding for an advertised route at each ingress link of the target network. Specifically, given a set of “elephant” source networks and some maximum load constraints on the ingress links of the target AS, OPV determines the minimum padding at each ingress link so that the load constraints are met, when it is feasible to do so. OPV requires as input an AS-Path length estimate from each source network to each ingress link. We describe how to estimate this matrix, leveraging the BGP Looking Glass Servers. To deal with unavoidable inaccuracies in the AS-Path length estimates, and also to compensate for the generally unknown BGP tie-breaking process in upstream networks, we also develop a robust variation (RPV) of the OPV algorithm.


Original document

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

http://dx.doi.org/10.1007/11422778_52
https://dblp.uni-trier.de/db/conf/networking/networking2005.html#GaoDZ05,
https://core.ac.uk/display/20963569,
https://www.scipedia.com/public/Gao_et_al_2010a,
https://smartech.gatech.edu/handle/1853/6479,
https://academic.microsoft.com/#/detail/1563675742
Back to Top

Document information

Published on 01/01/2010

Volume 2010, 2010
DOI: 10.1007/11422778_52
Licence: CC BY-NC-SA license

Document Score

0

Views 1
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?