The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Traversal Using Relays around NAT (TURN): Relay Extensions to Session Traversal Utilities for NAT (STUN)
Abstract
If a host is located behind a NAT, then in certain situations it can be impossible for that host to communicate directly with other hosts (peers).In these situations, it is necessary for the host to use the services of an intermediate node that acts as a communication relay.This specification defines a protocol, called TURN (Traversal Using Relays around NAT), that allows the host to control the operation of the relay and to exchange packets with its peers using the relay.TURN differs from some other relay control protocols in that it allows a client to communicate with multiple peers using a single relay address.The TURN protocol was designed to be used as part of the ICE (Interactive Connectivity Establishment) approach to NAT traversal, though it also can be used without ICE.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
RTP: A Transport Protocol for Real-Time Applications
Schulzrinne, H., Casner, S., Frederick, R., & Jacobson, V. (2003) · doi:10.17487/rfc3550 · Cited by 5,776
SIP: Session Initiation Protocol
(2009) · IP Communications and Services for NGN · doi:10.1201/9781420070910-13 · Cited by 4,369
SIP: Session Initiation Protocol
Rosenberg, J., Schulzrinne, H., Camarillo, G., Johnston, A., Peterson, J., Sparks, R., Handley, M., & Schooler, E. (2002) · doi:10.17487/rfc3261 · Cited by 3,024
Self-citationKey words for use in RFCs to Indicate Requirement Levels
Bradner, S. (1997) · doi:10.17487/rfc2119 · Cited by 2,997
Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers
Nichols, K., Blake, S., Baker, F., & Black, D. (1998) · doi:10.17487/rfc2474 · Cited by 1,530
The Addition of Explicit Congestion Notification (ECN) to IP
Ramakrishnan, K., Floyd, S., & Black, D. (2001) · doi:10.17487/rfc3168 · Cited by 1,512
Requirements for Internet Hosts - Communication Layers
(1989) · doi:10.17487/rfc1122 · Cited by 1,370
RTP: A Transport Protocol for Real-Time Applications
Audio-Video Transport Working Group, Schulzrinne, H., Casner, S., Frederick, R., & Jacobson, V. (1996) · doi:10.17487/rfc1889 · Cited by 1,297
Postel, J. B. (1981) · Cited by 1,130
IP Encapsulating Security Payload (ESP)
Atkinson, R. (1995) · doi:10.17487/rfc1827 · Cited by 1,076
Kent, S. (2005) · doi:10.17487/rfc4302 · Cited by 780
Address Allocation for Private Internets
Rekhter, Y., Moskowitz, B., Karrenberg, D., J., G., & Lear, E. (1996) · doi:10.17487/rfc1918 · Cited by 615
The Secure Real-time Transport Protocol (SRTP)
Baugher, M., McGrew, D., Naslund, M., Carrara, E., & Norrman, K. (2004) · doi:10.17487/rfc3711 · Cited by 570
IP Encapsulating Security Payload (ESP)
Kent, S. (2005) · doi:10.17487/rfc4303 · Cited by 435
Rosenberg, J. (2010) · doi:10.17487/rfc5245 · Cited by 358
Self-citationSession Traversal Utilities for NAT (STUN)
Petit-Huguenin, M., Salgueiro, G., Rosenberg, J., Wing, D., Mahy, R., & Matthews, P. (2020) · doi:10.17487/rfc8489 · Cited by 272
Self-citationSession Traversal Utilities for NAT (STUN)
Rosenberg, J., Mahy, R., Matthews, P., & Wing, D. (2008) · doi:10.17487/rfc5389 · Cited by 264
Self-citationRandomness Requirements for Security
Eastlake, D., Schiller, J., & Crocker, S. (2005) · doi:10.17487/rfc4086 · Cited by 239
Network Address Translation (NAT) Behavioral Requirements for Unicast UDP
Jennings, C. (2007) · doi:10.17487/rfc4787 · Cited by 171
Address Allocation for Private Internets
Rekhter, Y., Moskowitz, B., Karrenberg, D., & De, G. (1994) · doi:10.17487/rfc1597 · Cited by 134
State of Peer-to-Peer (P2P) Communication across Network Address Translators (NATs)
Srisuresh, P., Ford, B., & Kegel, D. (2008) · doi:10.17487/rfc5128 · Cited by 106
Packetization Layer Path MTU Discovery
Mathis, M., & Heffner, J. (2007) · doi:10.17487/rfc4821 · Cited by 81
Cited by
Large-Scale Measurement of NAT Traversal for the Decentralized Web: A Case Study of DCUtR in IPFS
Trautwein, D., Ihle, C., Schubotz, M., Breitinger, C., & Gipp, B. (2026) · Proceedings of the 2026 ACM Internet Measurement Conference · doi:10.1145/3777912.3809138
“Relay Fallback with TURN: If direct connection attempts fail, most commonly because one or both peers are behind a Symmetric NAT, ICE falls back to relaying traffic through a Traversal Using Relays around NAT (TURN) server [27].”
Metadata
- Authors
- Matthews, P., & Rosenberg, J.
- Publisher
- RFC Editor
- Published
- 2020-02
- OpenAlex
- W2299636399
- Cited by
- 258
- References
- 23
- Type
- report
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.