Improved Path Exploration in shim6-based Multihoming
Fri, 06/08/2007 - 18:54 by Sébastien Barré
Abstract
The shim6 host-based solution to IPv6 multihoming was designed within the IETF to provide a solution to the multihoming problem by using several IPv6 addresses per host. In this paper, we briefly describe our Linux implementation of shim6. One of the novel mechanisms introduced by shim6 is the REAchability Protocol (REAP) that allows multihomed hosts to switch to an alternate path when a failure occurs. We evaluate the performance of this protocol in a lab environment and show that it performs well in the case of unidirectional or bidirectional failures. We also show that the recovery time can be reduced by allowing REAP to send multiple probes upon failure detection.
- Authors
- Sébastien Barré and Olivier Bonaventure
- Source
SIGCOMM 2007 Workshop "IPv6 and the Future of the Internet" , Kyoto, Japan, Aug 2007.
- Full text
- (271.26 KB)
- Slides
- (925.34 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.