Skip to main content

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

The information below is for an old version of the document.
Document Type
This is an older version of an Internet-Draft whose latest revision state is "Expired".
Expired & archived
Authors Karl-Johan Grinnemo , Anna Brunstrom , Per Hurtig , Naeem Khademi
Last updated 2017-01-22 (Latest revision 2016-07-21)
RFC stream (None)
Formats
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

It is widely recognized that it has become very difficult to introduce new transport protocols on the Internet. On reason to this is that there are no agreed-upon way for a source end host to find out whether there is support for a particular transport protocol along the network path from itself to a destination end host or not. This document describes a Happy Eyeballs framework that generalizes previously proposed Happy Eyeballs mechanisms to include a transport protocol, the configuration of this transport protocol, as well as a transport address, i.e., to include complete transport solutions. The described Happy Eyeballs framework is not only useful in the design and implementation of mechanisms that are to determine the support of particular transport solutions, but also for the design of mechanisms that are to select the transport solution, which, according to some criteria, is the most appropriate one to use.

Authors

Karl-Johan Grinnemo
Anna Brunstrom
Per Hurtig
Naeem Khademi

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