Skip to main content

Happy Eyeballs for Transport Selection
draft-grinnemo-taps-he-03

Document Type Expired Internet-Draft (individual)
Authors Karl-Johan Grinnemo , Anna Brunstrom , Per Hurtig , Naeem Khademi , Zdravko Bozakov
Last updated 2018-01-04 (Latest revision 2017-07-03)
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
Stream Stream state (No stream defined)
Consensus boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
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

Ideally, network applications should be able to select an appropriate transport solution from among available transport solutions. However, at present, there is no agreed-upon way to do this. In fact, there is not even an agreed-upon way for a source end host to determine if there is support for a particular transport along a network path. This draft addresses these issues, by proposing a Happy Eyeballs framework. The proposed Happy Eyeballs framework enables the selection of a transport solution that according to application requirements, pre-set policies, and estimated network conditions is the most appropriate one. Additionally, the proposed framework makes it possible for an application to find out whether a particular transport is supported along a network connection towards a specific destination or not.

Authors

Karl-Johan Grinnemo
Anna Brunstrom
Per Hurtig
Naeem Khademi
Zdravko Bozakov

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