<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.pauly-v6ops-happy-eyeballs-v3" target="https://datatracker.ietf.org/doc/html/draft-pauly-v6ops-happy-eyeballs-v3-01">
   <front>
      <title>Happy Eyeballs Version 3: Better Connectivity Using Concurrency</title>
      <author initials="T." surname="Pauly" fullname="Tommy Pauly">
         <organization>Apple Inc</organization>
      </author>
      <author initials="D." surname="Schinazi" fullname="David Schinazi">
         <organization>Google LLC</organization>
      </author>
      <author initials="N." surname="Jaju" fullname="Nidhi Jaju">
         <organization>Google LLC</organization>
      </author>
      <author initials="K." surname="Ishibashi" fullname="Kenichi Ishibashi">
         <organization>Google LLC</organization>
      </author>
      <date month="March" day="4" year="2024" />
      <abstract>
	 <t>   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 &quot;Happy Eyeballs&quot;.  This
   document updates the algorithm description in RFC 8305.

	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-pauly-v6ops-happy-eyeballs-v3-01" />
   
</reference>
