Experience with IPv6 path probing
draft-naderi-ipv6-probing-01
| Document | Type | Expired Internet-Draft (individual) | |
|---|---|---|---|
| Last updated | 2018-07-11 (latest revision 2015-04-21) | ||
| Stream | (None) | ||
| Intended RFC status | Informational | ||
| Formats |
Expired & archived
pdf
htmlized
bibtex
|
||
| Stream | Stream state | (No stream defined) | |
| Consensus Boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | |||
| Responsible AD | (None) | ||
| Send notices to | (None) | ||
https://www.ietf.org/archive/id/draft-naderi-ipv6-probing-01.txt
Abstract
This document reports on experience and simulations of dynamic probing of alternate paths between two IPv6 hosts when network failures occur. Two models for such probing were investigated: the SHIM6 REAchability Protocol (REAP) and the Multipath Transmission Control Protocol (MPTCP). The motivation for this document is to identify some aspects of path probing at large or very large scale that may be broadly relevant to future protocol design.
Authors
Habib Naderi
(habib@cs.auckland.ac.nz)
Brian Carpenter
(brian.e.carpenter@gmail.com)
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)