The DOI matches its Crossref record.
Implementing NAT Hole Punching with QUIC
Open accessAbstract
The widespread adoption of Network Address Translation (NAT) technology has led to a significant number of network end nodes being located in private networks behind NAT devices, impeding direct communication between these nodes. To solve this problem, a technique known as "hole punching" has been devised for NAT traversal to facilitate peer-to-peer communication among end nodes located in distinct private networks. However, as the increasing demands for speed and security in networks, TCP-based hole punching schemes gradually show performance drawbacks. Therefore, we present a QUIC-based hole punching scheme for NAT traversal. Through a comparative analysis of the hole punching time between QUIC-based and TCP-based protocols, we find that the QUIC-based scheme effectively reduces the hole punching time, exhibiting a pronounced advantage in weak network environments. Furthermore, in scenarios where the hole punched connection is disrupted due to factors such as network transitions or NAT timeouts, this paper evaluates two schemes for restoring the connection: QUIC connection migration and re-punching. Our results show that QUIC connection migration for connection restoration saves 2 RTTs compared to QUIC re-punching, and 3 RTTs compared to TCP re-punching, effectively reducing the computational resources consumption for re-punching.
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“This reflects only that QUIC's connection establishment latency is lower than TCP's, a finding consistent with Liang et al. [21], and does not directly speak to hole-punch success.”
From Large-Scale Measurement of NAT Traversal for the Decentralized Web: A Case Study of DCUtR in IPFS (2026) · cites this paper as Liang et al. [21]
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
No references could be resolved yet.
Research works printed but not linked: 3
- Y. Huang, T. Z. Fu, D.- , J , , " , design and analysis of a large-scale p2p- ," ACM SIGCOMM computer communication review, vol. 38, no. 4, pp. 375-388, 2008.
- W , " ," arXiv preprint arXiv:1709.06837, 2017. · arXiv
- H. Yin, X. Liu, T. Zhan, V. Sekar, F. Qiu, C. Lin, H. Zhang, and B. Li, " : ," ACM Transactions on Multimedia Computing, Communications, and Applications (TOMM), vol. 6, no. 3, pp. 1-19, 2010.
Cited by
Sorted by citations
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
Metadata
- Authors
- Liang, J., Xu, W., Wang, T., Yang, Q., & Zhang, S.
- Affiliations
- Shenzhen University (CN)
- New York University (US)
- Venue
- 2024 IEEE 100th Vehicular Technology Conference (VTC2024-Fall)
- Publisher
- IEEE
- Published
- 2024-10-07
- Pages
- 1-7
- ISSN
- 1090-3038 (ISSN-L)
- OpenAlex
- W4406266936
- Cited by
- 4
- References
- 0
- Citations by year
- 2025: 3 · 2024: 1
- FWCI
- 1.75
- Type
- conference paper
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- IEEE Vehicular Technology Conference (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Basic and Applied Basic Research Foundation of Guangdong Province (2024A1515012407)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Network Traffic and Congestion Control
- Physical Sciences › Computer Science › Computer Networks and Communications › Peer-to-Peer Network Technologies
- Physical Sciences › Engineering › Electrical and Electronic Engineering › IPv6, Mobility, Handover, Networks, Security
- Keywords
- QUIC, NAT traversal, peer-to-peer communication, connection migration, TCP comparison, private networks
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
