@misc{rfc3489,
    series =    {Request for Comments},
    number =    3489,
    howpublished =  {RFC 3489},
    publisher = {RFC Editor},
    doi =       {10.17487/RFC3489},
    url =       {https://www.rfc-editor.org/info/rfc3489},
    author =    {Jonathan Rosenberg and Christian Huitema and Rohan Mahy and Joel Weinberger},
    title =     {{STUN - Simple Traversal of User Datagram Protocol (UDP) Through Network Address Translators (NATs)}},
    pagetotal = 47,
    year =      2003,
    month =     mar,
    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. {[}STANDARDS-TRACK{]}},
}