Happy Eyeballs for Transport Selec3on dra$-grinnemo-taps-he-02 - - PowerPoint PPT Presentation

happy eyeballs for transport selec3on dra grinnemo taps
SMART_READER_LITE
LIVE PREVIEW

Happy Eyeballs for Transport Selec3on dra$-grinnemo-taps-he-02 - - PowerPoint PPT Presentation

Happy Eyeballs for Transport Selec3on dra$-grinnemo-taps-he-02 K.-J. Grinnemo, A. Brunstrom, P. Hur5g, N. Khademi, Z. Bozakov TAPS WG, IETF 98 Chicago Mo3va3on A TAPS system decouples transport services from the underlying transport


slide-1
SLIDE 1

Happy Eyeballs for Transport Selec3on dra$-grinnemo-taps-he-02

K.-J. Grinnemo, A. Brunstrom, P. Hur5g, N. Khademi, Z. Bozakov TAPS WG, IETF 98 — Chicago

slide-2
SLIDE 2

Mo3va3on

  • A TAPS system decouples transport services

from the underlying transport protocols

  • Happy Eyeballs exploits this decoupling

– Enabling the selec5on of the “most appropriate” transport protocol from among available and feasible transport protocols for a given transport service

Transport Service MPTCP TCP UDP SCTP Applica5on

slide-3
SLIDE 3

Background

  • Builds on previous work

– D. Wing and A. Yourtchenko, “Happy Eyeballs: Success with Dual-Stack Hosts”, RFC 6555, April 2012. – F. Baker, “Tes5ng Eyeball Happiness”, RFC 6556, April 2012.

  • Extends previous work

– Selec5on of complete transports, not single protocols – Dynamic selec5on on the basis of pre-set policies and es5mated network characteris5cs

3/27/17 3

slide-4
SLIDE 4

The Happy Eyeballs Framework

1) Policy Management creates a list of candidate transport solu5ons 2) Transport Probing ini5ates connec5on abempts for transport solu5ons on the list 3) Transport Probing waits for winning connec5on

3/27/17 4

Applica5on Policy Management Transport Probing TAPS API

slide-5
SLIDE 5

Design and Implementa3on Considera3ons

  • Candidate list genera5on

– All available transport solu5ons – On the basis of pre-set policies – On the basis of both pre-set policies and es5mated network characteris5cs – …

  • Caching

– Should cache the outcome of previous connec5on abempts (cf. RFC 6555) – Op5onally cache path proper5es, e.g., RTT, path MTU

  • Concurrent connec5on abempts

– Event-based – Threads

3/27/17 5

slide-6
SLIDE 6

A Sample Implementa3on — NEAT

  • Candidate list genera5on

– Policy Manager – Policy Informa5on Base – Characteris5cs Informa5on Base

  • Caching

– Outcome of connec5on abempts

  • Concurrency

– Event-based – Libuv (hbp://libuv.org)

3/27/17 6

Characteris5cs Informa5on Base Policy Informa5on Base Policy Manager Applica5on TAPS API Transport Probing

slide-7
SLIDE 7

Content

  • Problem statement (mo5va5on)
  • The Happy Eyeballs Framework
  • Design and implementa5on considera5ons
  • A Happy Eyeballs Scenario in NEAT

3/27/17 7

slide-8
SLIDE 8

Q&A