Oliva Delgado, Antonio de laSoto Campos, IgnacioGarcía Martínez, AlbertoBagnulo Braun, Marcelo GabrielAzcorra Saloña, Arturo2010-02-102010-02-102010-03Computer Communications Journal, Elsevier. Volume 33, Issue 4, págs 485-499. March 20100140-3664https://hdl.handle.net/10016/6828This paper characterizes analytically the performance of REAchability Protocol (REAP), a network layer end-to-end recovery protocol for IPv6. REAP was developed by the IETF SHIM6 Working Group as part of its multihoming solution. The behavior of REAP is governed by a small number of parameters: three timers, a simple characterization of the application traffic, and the communication delay. The key figure of merit of REAP performance is the time to recover from a path failure as seen by the upper layers, figure that cannot be trivially obtained, despite the apparent simplicity of this reachability protocol. In this paper we provide upper bounds for the recovery time of REAP for different deployment scenarios, applying these analytical results to two interesting case studies, TCP and VoIP traffic.application/pdfengSHIM6REAPIPv6ReachabilityFailureRobustnessresearch articleTelecomunicacioneshttps://www.doi.org/10.1016/j.comcom.2009.10.014open access4854499Computer Communications Journal33