|Authors||G. Papastergiou, K. Grinnemo, A. Brunström, D. Ros, M. Tüxen, N. Khademi and P. Hurtig|
|Title||On the Cost of Using Happy Eyeballs for Transport Protocol Selection|
|Afilliation||Media, Communication Systems|
|Publication Type||Proceedings, refereed|
|Year of Publication||2016|
|Conference Name||Applied Networking Research Workshop (ANRW)|
|Keywords||CPU load, Happy Eyeballs, memory usage, SCTP, tcp, TLS, Transport-protocol selection|
Concerns have been raised in the past several years that introducing new transport protocols on the Internet has become increasingly difficult, not least because there is no agreed-upon way for a source end host to find out if a transport protocol is supported all the way to a destination peer. A solution to a similar problem—finding out support for IPv6—has been proposed and is currently being deployed: the Happy Eyeballs (HE) mechanism. HE has also been proposed as an efficient way for an application to select an appropriate transport protocol. Still, there are few, if any, performance evaluations of transport HE. This paper demonstrates that transport HE could indeed be a feasible solution to the transport support problem. The paper evaluates HE between TCP and SCTP using TLS encrypted and unencrypted traffic, and shows that although there is indeed a cost in terms of CPU load to introduce HE, the cost is relatively small, especially in comparison with the cost of using TLS encryption. Moreover, our results suggest that HE has a marginal impact on memory usage. Finally, by introducing caching of previous connection attempts, the additional cost of transport HE could be significantly reduced.