An Update to Happy Eyeballs
draft-pauly-v6ops-happy-eyeballs-update-01
| Document | Type | Replaced Internet-Draft (individual) | |
|---|---|---|---|
| Authors | Tommy Pauly , David Schinazi | ||
| Last updated | 2017-03-12 | ||
| Replaced by | RFC 8305 | ||
| Stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats |
Expired & archived
plain text
xml
htmlized
pdfized
bibtex
|
||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Replaced by draft-ietf-v6ops-rfc6555bis | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
https://www.ietf.org/archive/id/draft-pauly-v6ops-happy-eyeballs-update-01.txt
Abstract
"Happy Eyeballs" (RFC6555) is the name for a technique of reducing user-visible delays on dual-stack hosts. Since one address family (IPv4 or IPv6) may be blocked, broken, or sub-optimal on a network, clients that attempt connections for both address families in parallel have a higher chance of establishing a connection sooner. Now that this approach has been deployed at scale and measured for several years, the algorithm specification can be refined to improve its reliability and generalization.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)