RFC - 3489
STUN - Simple Traversal of User Datagram Protocol (UDP) Through Network Address Translators (NATs)
| Original: | ftp://ftp.isi.edu/in-notes/rfc3489.txt |
|---|---|
| Authors: | J. Rosenberg [dynamicsoft], J. Weinberger [dynamicsoft], C. Huitema [Microsoft], R. Mahy [Cisco] |
| Date: | March 2003 |
| Category: | Proposed Standard |
| Referred by: | 16 RFC |
| Refers to: | 16 RFC |
Status
This document specifies an Internet standards track protocol for the Internet community, and requests discussion and suggestions for improvements. Please refer to the current edition of the "Internet Official Protocol Standards" (STD 1) for the standardization state and status of this protocol. Distribution of this memo is unlimited.
Copyright Notice
Copyright (C) The Internet Society (2003). All Rights Reserved.
Abstract
Simple Traversal of User Datagram Protocol (UDP) Through Network Address Translators (NATs) (STUN) is a lightweight protocol that allows applications to discover the presence and types of NATs and firewalls between them and the public Internet. It also provides the ability for applications to determine the public Internet Protocol (IP) addresses allocated to them by the NAT. STUN works with many 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.
-
prepared by Miloslav Nic
- the founder of Zvon.org and Law-Ref.org
- the head of B.Sc. program Informatics and chemistry [in Czech]
- the founder of Lidem.org - Volby 2006 - parliamentary elections in the Czech Republic [in Czech]
- the chief consultant of the publishing house ICT Press
- and Pavel Srb, a student of B.Sc. program Informatics and chemistry
