BGP4: Inter-Domain Routing in the Internet
BGP4: Inter-Domain Routing in the Internet
Towards an accurate AS-level traceroute tool
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Guidelines for interdomain traffic engineering
ACM SIGCOMM Computer Communication Review
Implications of the topological properties of Internet traffic on traffic engineering
Proceedings of the 2004 ACM symposium on Applied computing
A performance evaluation of BGP-based traffic engineering
International Journal of Network Management
Interdomain traffic engineering with redistribution communities
Computer Communications
Traffic engineering with traditional IP routing protocols
IEEE Communications Magazine
Interdomain traffic engineering with BGP
IEEE Communications Magazine
An active approach to measuring routing dynamics induced by autonomous systems
Proceedings of the 2007 workshop on Experimental computer science
An active approach to measuring routing dynamics induced by autonomous systems
ecs'07 Experimental computer science on Experimental computer science
Rationality and traffic attraction: incentives for honest path announcements in bgp
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Cooperative interdomain traffic engineering using Nash bargaining and decomposition
IEEE/ACM Transactions on Networking (TON)
Throughput optimisation of inter- and intra-domain autonomous systems traffic engineering
International Journal of Communication Networks and Distributed Systems
Explicitly accommodating origin preference for inter-domain traffic engineering
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Efficient inter-domain traffic engineering with transit-edge hierarchical routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
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.