The Paths towards IPv6 Multihoming
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 get multihomed in IPv6 is required to allow route aggregation in order to preserve the scalability of the interdomain routing system. After several years of development, the IETF and the research community propose drastic changes in how site multihoming shall be achieved in IPv6. Those changes will potentially affect the fundamental multihoming mechanism, as well as intradomain routing, traffic engineering and even the behaviour of hosts within the multihomed site. This paper presents the required functionalities and the constraints imposed to the solutions to the IPv6 multihoming problem. It surveys the main multihoming approaches that have been proposed to the IETF over the period 2000 - 2005. It proposes a taxonomy, and compares the solutions according to their mechanisms, benefits and drawbacks. This survey also outlines the major steps that have led to a new multihoming architecture for IPv6.
- Authors
- C. de~Launois and M. Bagnulo
- Source
IEEE Communications Surveys and Tutorials , 8(2), 2006.
- Full text
-
(1.28 MB) - 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.