Network Working Group | C. Jennings |
Internet-Draft | S. Nandakumar |
Intended status: Standards Track | Cisco |
Expires: September 3, 2018 | March 2, 2018 |
Snowflake - A Lighweight, Asymmetric, Flexible, Receiver Driven Connectivity Establishment
draft-jennings-dispatch-snowflake-01
Interactive Connectivity Establishment (ICE) (RFC5245) defines protocol machinery for two peers to discover each other and establish connectivity in order to send and receive Media Streams.
This draft raises some issues inherent in the assumptions with ICE and proposes a lightweight receiver driven protocol for asymmetric connectivity establishment.
This Internet-Draft is submitted in full conformance with the provisions of BCP 78 and BCP 79.
Internet-Drafts are working documents of the Internet Engineering Task Force (IETF). Note that other groups may also distribute working documents as Internet-Drafts. The list of current Internet-Drafts is at https://datatracker.ietf.org/drafts/current/.
Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as "work in progress."
This Internet-Draft will expire on September 3, 2018.
Copyright (c) 2018 IETF Trust and the persons identified as the document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents (https://trustee.ietf.org/license-info) in effect on the date of publication of this document. Please review these documents carefully, as they describe your rights and restrictions with respect to this document. Code Components extracted from this document must include Simplified BSD License text as described in Section 4.e of the Trust Legal Provisions and are provided without warranty as described in the Simplified BSD License.
ICE was designed over a decade ago and certain assumptions about the network topology, timing considerations, application complexity have drastically changed since then. Newer additions/clarifications to ICE in [I-D.ietf-ice-rfc5245bis] and Trickle ICE [I-D.ietf-ice-trickle] have indeed help improve its performance and the way the connectivity checks are performed.
However, enforcing stringent global pacing requirements coupled with brute force connectivity checks, tightly coupled timing dependencies between the ICE agents, the need for symmetric connection setup, for example, has rendered the protocol inflexible for innovation and increasingly difficult to apply and debug in a dynamic network and evolving application contexts.
This specification defines Snowflake, where, like ICE, both sides gather a set of address candidates that may work for communication. However, instead of both sides trying to synchronize connectivity checks in time-coupled fashion, the sending side acts as a slave and sends STUN packets wherever the receiving side tells it to and when it is told to do so. The receiving side is free to choose whatever algorithm and timing it wants to find a path that works. The sender and receiver roles are reversed for media flow in the opposite direction.
The current version of this draft builds on its original instantiation submitted in year 2015 as <https://datatracker.ietf.org/doc/draft-jennings-mmusic-ice-fix/>
In this document, the key words "MUST", "MUST NOT", "SHOULD", "SHOULD NOT", "MAY", and "OPTIONAL" are to be interpreted as described in RFC 2119 [RFC2119] and indicate requirement levels for compliant implementations.
ICE was developed roughly ten years ago and several things have been learned that could be improved:
Snowflake is a light weight, asymmetric, flexible and receiver controlled protocol for end points to establish connectivity between them.
The following subsections go into further details of its working.
A typical Snowflake operating model has the following components
The basic principle here is, each side (Receiver Agent) is responsible for discovering a viable path for it's incoming media. It does so by indicating the addresses for the Sender to verify the connectivity. Once a viable path is established, the Sender Agent continues to transmit the media. This process deviates from ICE by negating the need for agent's role (controlled vs controlling), nomination procedures (aggressive vs passive) and tightly coupled symmetric checklists validation.
As a precursor to connectivity establishment, the protocol assumes that there exists a dedicated backchannel that the agents can use to exchange protocol control messages.
The protocol starts with the Sender Agent conveying its intention to send media via the backchannel to the Receiver agent. The sender does so by sending a "PlaceCall" control message and populates the same with the ICE candidates gathered so far.
On receiving the sender's intention to send media (via the backchannel), the Receiver Agent proceeds with gathering the candidates defined by its local policies or previous knowledge of connectivity checks. The Receiver Agent then directs the Sender Agent to carryout STUN connectivity checks towards the receiver by sending the "DoPing" control message via the backchannel. This message is populated with the candidate pair that the receiver wants the sender to verify the reachability.
The Receiver Agent may sends multiple "DoPing" messages to the Sender Agent, sending "DoPing" message per candidate pair to be tested for connectivity, as deemed necessary. The order, the timing and the number of candidate pairs to be tested are fully controlled by the Receiver Agent's implementation.
On receiving the "DoPing" message with the candidate pair to be tested, the Sender Agent carries out STUN ping checks on that candidate pair. It does so by sending the STUN Binding Request message towards the receiver over the media path (as its done with ICE today). This opens up the required local pinholes and are further maintained by the Sender for the duration of the session. The Sender Agent also ensures that the frequency and the timing of these checks respect the congestion control requirements for the underlying transport.
On receiving the STUN Ping from the Sender Agent, the Receiver Agent does the following two things:
If a successful STUN Ping response was received (either via the media path or the backchannel), there is a viable path for the Sender to transmit the media.
The above set of procedures can be continuously performed during the lifetime of the session as and when the Receiver Agent determines better candidates for receiving the media. Such a decision is totally defined by the local policies and can be performed independently of the other side.
Below picture captures one instance of protocol exchange where the Receiver Agent indicates the Sender Agent to carry out the connectivity checks. One can envision multiple executions of the protocol as and when receiver has updated its knowledge of addresses or priorities or bandwidth availability.
Snowflake Information Flow (One-way Media) --------------------------------------------- Sender Agent CallAgent(backchannel) Receiver Agent | | | | | | | | | |(1) connect to backchannel | |.................................................| | | | | | | |Gather Sender Candidates| | | | | | | | | | | |(2) PlaceCall [Sender Candidates] | |----------------------->| | | | | | | | | |(3) PlaceCall [Sender Candidates] | |----------------------->| | | | | | | | | |Gather Receiver Candidates | | | | | | | | | | |(4) DoPing [Candidate Pair] | |<-----------------------| | | | | | | |(5) DoPing [Candidate Pair] | |<-----------------------| | | | | | | | |(6) STUN Ping (over media path) | |<----------------------------------------------->| | | | | | | | |(7) GotPing (STUN Ping Response) | |<-----------------------| | | | | | | |(8) GotPing (STUN Ping Respnse) | |<-----------------------| | | | | | | |Repeat Steps 4-8 as needed | | |for other candidate pairs | | | | | | | | | |(9) Found a viable path for sending media | |.................................................| | | | | | |
This makes it very easy to see which outbound connection were sent from the Sender Agent to open a pin hole. Then when the Sender asked the Receiver Agent to send a test STUN Ping, the connectivity can be easily verified. It becomes easier to set up a client with an automated test jig that tests all the combinations and makes sure they work as you only need to test receiving capability and sender capability independently.
This more or less removes the timing complexity by allowing both sides to be responsible for their own timing. If it turns out that we can pace things much faster than 50ms then this allows us to take advantage of that without both sides upgrading at the same time.
If we end up with a lot more candidates due to v6, mobile etc, this removes the issue we have today where a path might have worked but the two sides did not find it due to timing issues.
This allows media to be sent in one direction over a path that does not work in the reverse direction.
Given there exists a dedicated backchannel, this protocol can speed up the media flow by using TURN server for the backchannel, for example. Once either agents learns more about the candidates, each can update the other side to ensure a better low latency path is used for media.
TODO
TODO
TODO
[RFC2119] | Bradner, S., "Key words for use in RFCs to Indicate Requirement Levels", BCP 14, RFC 2119, DOI 10.17487/RFC2119, March 1997. |
[I-D.ietf-ice-dualstack-fairness] | Martinsen, P., Reddy, T. and P. Patil, "ICE Multihomed and IPv4/IPv6 Dual Stack Guidelines", Internet-Draft draft-ietf-ice-dualstack-fairness-07, November 2016. |
[I-D.ietf-ice-rfc5245bis] | Keranen, A., Holmberg, C. and J. Rosenberg, "Interactive Connectivity Establishment (ICE): A Protocol for Network Address Translator (NAT) Traversal", Internet-Draft draft-ietf-ice-rfc5245bis-18, February 2018. |
[I-D.ietf-ice-trickle] | Ivov, E., Rescorla, E., Uberti, J. and P. Saint-Andre, "Trickle ICE: Incremental Provisioning of Candidates for the Interactive Connectivity Establishment (ICE) Protocol", Internet-Draft draft-ietf-ice-trickle-17, February 2018. |