Internet routing diversity for stub networks with a Map-and-Encap scheme
Tue, 02/21/2012 - 11:33 by Damien Saucez
Routing diversity has been identified as essential for network robustness and traffic engineering. The Internet possesses by its very nature a large path diversity. However this diversity cannot be fully exploited due to BGP limitations, which only keeps one single route for each available prefix. Despite some previous works in the area, no operational and non-disruptive architecture have been proposed yet to allow the networks to better exploit Internet path diversity.
This paper proposes one step in this direction, focusing on the interconnection between an Autonomous System (AS) and its Internet Service Provider (ISP). We propose the use of a so-called “Map-and-Encap” scheme to bypass current BGP limitations in order to use arbitrary paths. With this scheme, an ISP may propose its rich path diversity (at least partially) to its customers, in order to perform advanced traffic engineering (e.g. fast recovery, load balancing...) based on richer and more flexible path selection policies (e.g., considering price, performance or stability of routes). To assess the potential benefits of the proposed architecture, we evaluate the potential route diversity that a Tier 1 may offer to its stub clients, based on different possible route selection policies (i.e. which routes are offered to its customers). We also analyze the overhead that is created at the control-plane (routing updates received by the mapping database) and that may impact the data-plane (path changes that may be caused by some route withdrawals/updates). Our evaluation shows that the increase in diversity has a controllable and acceptable overhead. It also gives some insights into efficient deployment strategies.
- Xavier Misseri, Jean-Louis Rougier and Damien Saucez
IEEE ICC 2012, 2012.
- 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 firstname.lastname@example.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.