Protocols
Saved & recent

Interactive Connectivity Establishment

Also called: ICE, ICE candidates, candidate pair

ICE finds a usable connection path by collecting candidate addresses, exchanging them through signaling, and testing candidate pairs. Candidates can represent local interfaces, addresses learned through STUN, or relays allocated with TURN. A successful pair can be nominated for the communication.

Two laptops behind different routers may first try a direct path and use a relay if that path cannot work. ICE checks reachability rather than assuming that a published address is reachable. Its checks are distinct from the application’s signaling channel, and the selected route depends on connectivity, priorities and policy rather than a promise of the shortest physical path.

Related
Session Traversal Utilities for NAT, Traversal Using Relays around NAT, WebRTC
Further reading
IETF RFC 8445 — Interactive Connectivity Establishment
peer A candidates peer B candidates host mapped relay host mapped relay check succeeds successful pair nominated schematic path choice
ICE tests candidate pairs and nominates a working one. A candidate address alone is not proof of connectivity.

View in the full Protocols collection