@techreport{ietf-happy-happyeyeballs-v3-00,
    number =    {draft-ietf-happy-happyeyeballs-v3-00},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-ietf-happy-happyeyeballs-v3/00/},
    author =    {Tommy Pauly and David Schinazi and Nidhi Jaju and Kenichi Ishibashi},
    title =     {{Happy Eyeballs Version 3: Better Connectivity Using Concurrency}},
    pagetotal = 19,
    year =      2025,
    month =     apr,
    day =       7,
    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.},
}