STUN - Simple Traversal of UDP Through NATs
draft-rosenberg-midcom-stun-01
Document | Type | Expired Internet-Draft (individual) | |
---|---|---|---|
Authors | Jonathan Rosenberg , Joel Weinberger , Christian Huitema , Rohan Mahy | ||
Last updated | 2002-03-07 | ||
Stream | (None) | ||
Intended RFC status | (None) | ||
Formats |
Expired & archived
pdf
htmlized (tools)
htmlized
bibtex
|
||
Stream | Stream state | (No stream defined) | |
Consensus Boilerplate | Unknown | ||
RFC Editor Note | (None) | ||
IESG | IESG state | Expired | |
Telechat date | |||
Responsible AD | (None) | ||
Send notices to | (None) |
https://www.ietf.org/archive/id/draft-rosenberg-midcom-stun-01.txt
Abstract
Simple Traversal of UDP Through NATs (STUN) is a lightweight protocol that allows applications to discover the presence and types of Network Address Translators (NATs) and firewalls between them and the public Internet. It also provides the ability for applications to determine the public IP addresses allocated to them by the nat. STUN works with nearly all existing NATs, and does not require any special behavior from them. As a result, it allows a wide variety of applications to work through existing NAT infrastructure. The STUN protocol is very simple, being almost identical to echo.
Authors
Jonathan Rosenberg
(jdrosen@cisco.com)
Joel Weinberger
(jweinberger@dynamicsoft.com)
Christian Huitema
(huitema@microsoft.com)
Rohan Mahy
(rohan@ekabal.com)
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)