Mechanisms for interdomain Traffic Engineering with LISP
Wed, 11/02/2011 - 12:20 by Damien Saucez
Internet is composed of the inter-connection of tens of thousands of independent networks called Autonomous Systems (ASes). ASes that only provide connectivity to the other ASes are called Internet Service Providers (ISPs). The vast majority of ASes in the Internet are multi-homed with several ISPs to reduce their costs and improve their capacity and robustness. Multi-homing increases the path diversity and thus might enable ASes to choose better quality paths. Unfortunately, the current Internet design does not allow to optimize routing for performance. Indeed, the routes are propagated gradually from AS to AS. If an AS has several routes for a given destination, it can only advertise and use its best one. In addition, the current Internet routing suffers from scalability issues. As a consequence, ASes lack of control on the traffic entering their network.
In this thesis, we propose new techniques to enable performance based interdomain incoming traffic engineering. These techniques allow any AS to control its incoming traffic to follow paths that optimize the efficiency (e.g., minimize the delay or maximize the bandwidth). For that purpose, we first introduce a system that allows an AS to control its incoming traffic in a scalable way. This system relies on the Locator/ID Separation Protocol (LISP). We improve the scalability and the robustness of the LISP control-plane with LISP-Tree. Afterward, we present a system that is able to rank the paths in order to determine the best path according to any arbitrary performance criterion. We call this system IDIPS (for ISP-Driven Informed Path Selection). Finally, we show how to combine LISP, LISP-Tree, and IDIPS to achieve performance based interdomain incoming traffic engineering.
- Damien Saucez
- PhD thesis
- Université catholique de Louvain, 10 2011.
- Full text
- (3.72 MB)
- (5.71 MB)
- Cite it
- 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 email@example.com.
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.