Title:
Interdomain Ingress Traffic Engineering through Optimized AS-Path Prepending

dc.contributor.author Dovrolis, Constantine
dc.contributor.author Zegura, Ellen W.
dc.contributor.author Gao, Ruomei
dc.date.accessioned 2005-06-17T17:34:29Z
dc.date.available 2005-06-17T17:34:29Z
dc.date.issued 2005 en_US
dc.description.abstract In Interdomain Ingress Traffic Engineering (INITE), a "target" Autonomous System (AS) aims to control the ingress link through which the traffic of one or more upstream source networks flows to the target network or to its customers. Currently, there are few methodologies for systematic INITE. In practice, ISPs often attempt to manipulate, mostly in a trial-and-error manner, the AS-Path length 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 upstream route at each ingress link of the target network. Specifically given a set of "elephant" source networks for a particular customer of the target network, and a set of maximum load constraints on the ingress links of the latter, 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 to each ingress link. We describe how to estimate this matrix, leveraging the BGP Looking Glass Servers that are abundant today for monitoring interdomain routing. 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 develop a robust variation (RPV) of the OPV algorithm. We show that RPV manages to identify a padding vector that meets the given maximum load constraints, when it is feasible to do so, even in the presence of inaccurate AS-Path lengths and unknown BGP tie-breaking behavior. en_US
dc.format.extent 448627 bytes
dc.format.mimetype application/pdf
dc.identifier.uri http://hdl.handle.net/1853/6479
dc.language.iso en_US
dc.publisher Georgia Institute of Technology en_US
dc.relation.ispartofseries CC Technical Report; GIT-CC-05-02 en_US
dc.subject Interdomain Ingress Traffic Engineering (INITE)
dc.subject Autonomous-system (AS) level Internet topology
dc.subject Prepending
dc.subject Polynomial time algorithms
dc.title Interdomain Ingress Traffic Engineering through Optimized AS-Path Prepending en_US
dc.type Text
dc.type.genre Technical Report
dspace.entity.type Publication
local.contributor.author Dovrolis, Constantine
local.contributor.author Zegura, Ellen W.
local.contributor.corporatename College of Computing
local.relation.ispartofseries College of Computing Technical Report Series
relation.isAuthorOfPublication 501c1bfb-e253-4317-a021-560761118771
relation.isAuthorOfPublication 8816f8c5-732c-4e5a-a86e-99019028a7b6
relation.isOrgUnitOfPublication c8892b3c-8db6-4b7b-a33a-1b67f7db2021
relation.isSeriesOfPublication 35c9e8fc-dd67-4201-b1d5-016381ef65b8
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
GIT-CC-05-02.pdf
Size:
438.11 KB
Format:
Adobe Portable Document Format
Description: