Leveraging Network Performances with IPv6 Multihoming and Multiple Provider-Dependent Aggregatable Prefixes
Sun, 04/01/2007 - 01:54 by Damien Leroy
Abstract
Multihoming, the practice of connecting to multiple providers, is becoming highly popular. Due to the growth of the BGP routing tables in the Internet, the way to multihome in IPv6 is required to preserve the scalability of the interdomain routing system. A proposed method is to assign multiple provider-dependent aggregatable (PA) IPv6 prefixes to each site, instead of a single provider-independent (PI) prefix. This paper shows that the use of multiple PA prefixes per sites not only allows route aggregation but also can be used to reduce end-to-end delay by leveraging the Internet path diversity. We also quantify the gain in path diversity, and show that a dual-homed stub that uses multiple PA prefixes has already a better Internet path diversity than any multihomed stub that uses a single PI prefix, whatever its number of providers. We claim that the benefits provided by the use of IPv6 multihoming with multiple PA prefixes is an opportunity to develop the support for quality of service and traffic engineering.
- Authors
- C.~de~Launois, B. Quoitin and O. Bonaventure
- Source
3rd International Workshop on QoS in Multiservice IP Networks (QoSIP 2005) , Catania, Italy, February 2-4th 2005.
- Full text
-
(422.3 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.