RFC 8305

Happy Eyeballs Version 2: Better Connectivity Using Concurrency, December 2017

File formats:
icon for text file icon for PDF icon for HTML
Status:
PROPOSED STANDARD
Obsoletes:
RFC 6555
Authors:
D. Schinazi
T. Pauly
Stream:
IETF
Source:
v6ops (ops)

Cite this RFC: TXT  |  XML  |   BibTeX

DOI:  https://doi.org/10.17487/RFC8305

Discuss this RFC: Send questions or comments to the mailing list v6ops@ietf.org

Other actions: Submit Errata  |  Find IPR Disclosures from the IETF  |  View History of RFC 8305


Abstract

Many communication protocols operating over the modern Internet use hostnames. These often resolve to multiple IP addresses, each of which may have different performance and connectivity characteristics. Since specific addresses or address families (IPv4 or IPv6) may be blocked, broken, or sub-optimal on a network, clients that attempt multiple connections in parallel have a chance of establishing a connection more quickly. This document specifies requirements for algorithms that reduce this user-visible delay and provides an example algorithm, referred to as "Happy Eyeballs". This document obsoletes the original algorithm description in RFC 6555.


For the definition of Status, see RFC 2026.

For the definition of Stream, see RFC 8729.




Advanced Search