A Cooperative Approach to Interdomain Traffic Engineering
Sun, 04/01/2007 - 01:54 by Damien Leroy
Abstract
For performance or cost reasons, Autonomous Systems
(AS) often need to control the flow of their incoming
interdomain traffic. Controlling its incoming traffic is a difficult
task since it often implies influencing ASes on the path. The
current BGP-based techniques that an AS can use for this
purpose are primitive. Moreover, their effect is often difficult
to predict.
In this paper, we propose to solve this problem by using Virtual
Peerings. A Virtual Peering is an IP tunnel between a border
router of a source AS and a border router of a destination AS.
This tunnel is established upon request from the destination AS.
These tunnels can be negociated by using backward compatible
modifications to the Border Gateway Protocol (BGP)
By using Virtual Peerings, the source and destination ASes
can achieve various traffic engineering objectives such as trafficbalancing
or reducing the latency. A key advantage of our
solution is that it does not require cooperation of the intermediate
ASes and that it can be incrementally deployed in today’s
Internet. We then show by simulations that in a load-balancing
scenario, a multi-homed AS only needs to request a few dozens
of Virtual Peerings to balance its incoming traffic.
- Authors
- B.~Quoitin and O.~Bonaventure
- Source
1st Conference on Next Generation Internet Networks Traffic Engineering (NGI 2005) , Rome, Italy, April 18-20th 2005.
- Full text
-
(125.75 KB) - Cite it
- BibTex
- Copyright
- See here
IEEE Copyright Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
ACM Copyright Notice: Copyright 1999 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page or intial screen of the document. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM Inc., fax +1 (212) 869-0481, or permissions@acm.org.
Springer-Verlag LNCS Copyright Notice: The copyright of these contributions has been transferred to Springer-Verlag Berlin Heidelberg New York. The copyright transfer covers the exclusive right to reproduce and distribute the contribution, including reprints, translations, photographic reproductions, microform, electronic form (offline, online), or any other reproductions of similar nature. Online available from Springer-Verlag LNCS series.