Skip to main content

Eliminating Duplicate Connectivity Checks in ICE

Document Type Expired Internet-Draft (individual)
Expired & archived
Authors Dr. Eric C. Cooper , Philip Matthews
Last updated 2006-06-16
RFC stream (None)
Intended RFC status (None)
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:


The ICE (Interactive Connectivity Establishment) protocol is designed to find the best possible transmission path between two endpoints in the presence of intervening NAT (Network Address Translation) boxes. It is a very versatile protocol, designed to operate in all possible network topologies. This versatility occasionally results in a large exchange of messages between the two endpoints. This document proposes a modification which reduces the amount of messaging ICE requires, without affecting the effectiveness of ICE. This modification suppresses the transmission of Binding Requests from server-reflexive candidates. The result is increased efficiency due to the suppressed connectivity checks, leading to fewer overall messages and faster discovery of working paths.


Dr. Eric C. Cooper
Philip Matthews

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