Happy Eyeballs Version 2: Better Connectivity Using Concurrency
RFC 8305, “Happy Eyeballs Version 2: Better Connectivity Using Concurrency”, is a Proposed Standard document published in December 2017 by D. Schinazi, T. Pauly. It obsoletes RFC 6555. The canonical text is published by the RFC Editor.
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.
What “Proposed Standard” means
An entry-level standards-track specification: stable, peer-reviewed and a solid basis for implementation, though it may still evolve before becoming an Internet Standard.
The canonical text of RFC 8305 is hosted at rfc-editor.org. Available in TXT,HTML.
- RFC 8306 Extensions to the Path Computation Element Communication Protocol for Point-to-Multipoint Traffic Engineering Label Switched Paths
- RFC 8298 Self-Clocked Rate Adaptation for Multimedia
- RFC 8297 An HTTP Status Code for Indicating Hints
- RFC 8294 Common YANG Data Types for the Routing Area
- RFC 8292 Voluntary Application Server Identification for Web Push
- RFC 8291 Message Encryption for Web Push
- RFC 8288 Web Linking
- RFC 8287 Label Switched Path Ping/Traceroute for Segment Routing IGP-Prefix and IGP-Adjacency Segment Identifiers with MPLS Data Planes