Skip to main content

Happy Eyeballs Version 3: Better Connectivity Using Concurrency
draft-pauly-happy-happyeyeballs-v3-00

Document Type Replaced Internet-Draft (individual)
Expired & archived
Authors Tommy Pauly , David Schinazi , Nidhi Jaju , Kenichi Ishibashi
Last updated 2025-02-19
Replaces draft-pauly-v6ops-happy-eyeballs-v3
Replaced by draft-ietf-happy-happyeyeballs-v3
RFC stream (None)
Intended RFC status (None)
Formats
Stream Stream state (No stream defined)
Consensus boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Replaced by draft-ietf-happy-happyeyeballs-v3
Telechat date (None)
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:

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 updates the algorithm description in RFC 8305.

Authors

Tommy Pauly
David Schinazi
Nidhi Jaju
Kenichi Ishibashi

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)