Cited by 0Peer-to-Peer Network TechnologiesNetwork Traffic and Congestion ControlInternet Traffic Analysis and Secure E-voting

Large-Scale Measurement of NAT Traversal for the Decentralized Web: A Case Study of DCUtR in IPFS

Open access
Trautwein, Dennis, Ihle, Cornelius, Schubotz, Moritz, Breitinger, Corinna, Gipp, Bela·2026·Proceedings of the 2026 ACM Internet Measurement Conference

Abstract

The promise of decentralized peer-to-peer (P2P) systems is fundamentally gated by the challenge of Network Address Translation (NAT) traversal, with existing solutions often reintroducing the very centralization they seek to avoid. This paper presents the first large-scale measurement study of a fully decentralized NAT traversal protocol, Direct Connection Upgrade through Relay (DCUtR), within the production libp2p-based InterPlanetary File System (IPFS) network. Drawing on over 4.4 million traversal attempts from 85,000+ distinct networks across 167 countries, we provide an empirical analysis of modern P2P connectivity. We establish a conditional success rate of 70% ± 7.1% for the hole-punching stage, given that prerequisite relay reservation and public address discovery succeed, providing a crucial new benchmark for the field. Critically, we empirically challenge the long-held belief of UDP's superiority for NAT traversal, demonstrating that DCUtR's high-precision, RTT-based synchronization yields statistically indistinguishable hole punching success rates for both TCP and QUIC (≈ 70%). Our analysis further validates the protocol's design for permissionless environments by showing that success is independent of relay characteristics and that the mechanism is highly efficient, with 97.6% of successful connections established on the first attempt. Building on this analysis, we propose a concrete roadmap of protocol enhancements aimed at achieving universal connectivity and contribute our complete dataset to foster further research in this domain.

Verified 2026-10-31 · 10 references not checked yet

AI snapshot

Written from the paper’s full text.

TL;DR

This paper presents the first large-scale measurement study of the decentralized DCUtR NAT-traversal protocol in the production IPFS/libp2p network, drawing on over 4.4 million traversal attempts from 85,000+ distinct networks across 167 countries. It establishes a conditional hole-punching success rate of 70% ± 7.1% and empirically challenges the assumption that UDP-based traversal outperforms TCP.

Key findings

  • DCUtR achieves a conditional hole-punching success rate of 70% ± 7.1%, given that prerequisite relay reservation and public address discovery succeed; these prerequisites themselves fail for approximately 29% of attempts, so end-to-end connectivity from scratch is lower (H1 supported).
  • Success is largely independent of relay characteristics: failed attempts show only slightly higher relay RTTs, and success rates are largely independent of the relay's fractional path position (H2 supported).
  • Synchronization is highly efficient, with 97.6% of successful hole punches completing on the first attempt (1,200,947 samples), 1.8% on the second, and 0.6% on the third (H3a supported).
  • When restricted to a single transport, both TCP and QUIC achieve success rates near ∼70%, contradicting the long-held belief in UDP's inherent superiority; when unrestricted, roughly ∼80% of successful connections use QUIC (H3b supported).
  • Connection Reversal is validated: outcomes show a significantly higher share of CONNECTION_REVERSED when an active port mapping is present (H4 supported).
  • 50% of peers experience a direct RTT of 70% or less of their relayed RTT; approximately 10% report a higher RTT after hole punching, while 90% benefit.

Methods

  • Measurement campaign ran December 1, 2022, to January 1, 2023, using a three-component infrastructure: a DHT-crawling "honeypot" that discovers NATed, DCUtR-capable peers via inbound relayed connections; a gRPC server that serves peers to clients and stores results; and volunteer clients (Go CLI/GUI, open-sourced as "punchr") that act as listeners and perform hole punches.
  • A "protocol filter" randomly assigned by the server isolates TCP vs. QUIC transport for independent evaluation; each hole punch is attempted up to three times.
  • Data: over 6.25 million hole punches tracked across 212 API keys (148 sign-ups); clients deployed in 39 countries, hole-punching remote peers in 167 countries. Network identification yielded 859 distinct client networks and 86,769 remote networks; 4.43 million data points (70.9%) were unambiguously associated with a single client network, 20.9% had no public network, and 8.1% spanned multiple public IPs. Analysis of success rates used only results with no pre-existing port mapping, >1,000 data points per network, and outcome SUCCESS or FAILED.

Limitations

  • Client sampling bias: volunteers from IPFS/libp2p communities are likely more technically proficient and on more stable/less restrictive networks, potentially overestimating success rates and limiting generalizability (stated).
  • Discovery bias: the honeypot excludes peers behind highly restrictive NATs/firewalls that prevent even relayed connections, pre-filtering for baseline reachability and possibly inflating observed success (stated).
  • NAT type classification: the architecture observes only hole-punch outcomes, not internal NAT mapping/filtering behavior, so failures cannot be attributed to specific NAT configurations, and single-NAT vs. CGNAT peers cannot be distinguished (stated).
  • The Connection Reversal analysis relies on port-mapping reports from the 212 volunteer clients, whose configurations may not represent the broader population (stated).
  • The reported 70% rate is conditional on prerequisite stages succeeding; the unconditional end-to-end metric is necessarily lower (stated).

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1145/3777912.3809138

Cites

26 of 36 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Claims the paper makes

5 of 13 cited sources checked · 4 supported · 0 flagged · accuracy not yet measured

  • Findingown data

    When hole-punch attempts are restricted to a specific transport protocol, both TCP and QUIC achieve success rates near ~70%.

    “When we restrict hole-punch attempts to a specific transport protocol, Figure 8b shows that both TCP and QUIC achieve success rates near ∼ 70%, strongly validating H3b.”
    Quote in the paperSubstantial claim
  • Findingown data

    An additional 8.1% of data points correspond to clients that reported multiple public IPs across different networks.

    “An additional 8.1% of data points correspond to clients that reported multiple public IPs across different networks, which can arise when a client is assigned more than one public IP address.”
    Quote in the paperNot a substantial claim
    • The authors state this as an assumption: Data points belong to the same network if the client reports the same public IP address.
    • The authors state this as an assumption: If a client's public IP changes but remains within the same Autonomous System (AS), the measurements are from the same network provided that the set of locally assigned private IP addresses remains unchanged.
  • Findingown data
    § Abstract

    The study draws on over 4.4 million traversal attempts from 85,000+ distinct networks across 167 countries.

    “Drawing on over 4.4 million traversal attempts from 85,000+ distinct networks across 167 countries, we provide an empirical analysis of modern P2P connectivity.”
    Quote in the paperSubstantial claim
    • Rests on an assumption: The honeypot's crawling behavior increases the likelihood that other peers insert the honeypot into their routing tables, thereby raising the number of inbound connections it receives.
  • Findingown data

    Our RTT accuracy measurements support this: the standard deviation is less than half of the measured RTT in the large majority of cases.

    “Our RTT accuracy measurements support this: the standard deviation is less than half of the measured RTT in the large majority of cases.”
    Quote in the paperSubstantial claim
  • Findingown data

    50% of peers experience a reduction to 70% or less of their original RTT after hole punching.

    “The figure shows that 50% of peers experience a reduction to 70% or less of their original RTT.”
    Quote in the paperSubstantial claim
  • Classified as probably not a substantial claim. 44
  • May combine two claims. 40
  • The quote only partly states this claim. 1
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation

    Halkes et al. observed in 2011 that approximately 11% of their monitored peer cohort were behind EDM NAT devices.

    “Halkes et al. [14] observed in 2011 that approxi- mately 11% of their monitored peer cohort were behind EDM NAT devices.”
    Quote in the paperNot a substantial claim1 of 1 sources checked
    • cites Halkes et al. [14] [14] Gertjan Halkes and Johan Pouwelse. 2011. UDP NAT and firewall puncturing in the wild. In Lecture Notes in Computer Science. Springer Berlin Heidelberg, Berlin, Heidelberg, 1–12. source
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation
    § 2 The Challenge of NAT for Peer-to-Peer

    NAT is a prevalent technique used in network gateways to modify IP address information, primarily to mitigate IPv4 address exhaustion.

    “Network Address Translation (NAT) is a prevalent technique used in network gateways to modify IP address information; primarily, to mitigate IPv4 address exhaustion [9].”
    Quote in the paperNot a substantial claim1 of 1 sources checked
    • cites [9] [9] Kjeld Borch Egevang and Paul Francis. 1994. The IP Network Address Translator (NAT). RFC 1631. doi:10.17487/RFC1631 source

      The Overview of NAT describes NAT as a router function installed at a stub domain’s exit point, and §3.3 says it modifies IP addresses. The Introduction identifies IP address depletion as a motivation. But the Conclusions (p. 8) call NAT a possible short-term solution whose suitability still required experimentation; the paper does not establish that NAT was prevalent. (LLM, conf=0.87)

      Experimental — accuracy not yet measured
  • Classified as probably not a substantial claim. May combine two claims.

    Interpretationcitation

    Based on the EDM NAT prevalence reported by Halkes et al., we expect to encounter approximately 19.6% mixed EDM/EIM peer combinations and 1.2% combinations where both peers are behind EDM NATs.

    “Based on the EDM NAT prevalence reported by Halkes et al. [14], we expect to encounter approximately 19.6% mixed EDM/EIM peer combinations and 1.2% combinations where both peers are behind EDM NATs.”
    Quote in the paperSubstantial claim1 of 1 sources checked
    • cites Halkes et al. [14] [14] Gertjan Halkes and Johan Pouwelse. 2011. UDP NAT and firewall puncturing in the wild. In Lecture Notes in Computer Science. Springer Berlin Heidelberg, Berlin, Heidelberg, 1–12. source
  • May combine two claims.

    Interpretationcitation

    The ~80% QUIC share 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.

    “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.”
    Quote in the paperSubstantial claim1 of 1 sources checked
    • cites Liang et al. [21] [21] Jinyu Liang, Wei Xu, Taotao Wang, Qing Yang, and Shengli Zhang. 2024. Imple- menting NAT Hole Punching with QUIC. doi:10.48550/arXiv.2408.01791 source
  • May combine two claims.

    Premisenone given

    The data from Halkes et al. presents limitations due to its age (2011) and relatively small sample size (fewer than 2,000 peers).

    “The data from Halkes et al. [14] presents limitations due to its age (2011) and relatively small sample size (fewer than 2,000 peers).”
    Quote in the paperNot a substantial claim1 of 1 sources checked
    • cites Halkes et al. [14] [14] Gertjan Halkes and Johan Pouwelse. 2011. UDP NAT and firewall puncturing in the wild. In Lecture Notes in Computer Science. Springer Berlin Heidelberg, Berlin, Heidelberg, 1–12. source
  • May combine two claims.

    Findingown data

    This rate depends on successful relay reservation and public address discovery which themselves fail for approximately 29% of attempts.

    “This rate depends on successful relay reservation and public address discovery which themselves fail for approximately 29% of attempts (see Section 6).”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.

    Findingown data

    The number of contributed hole punches increased after December 1, declined over Christmas, and tapered off following the distribution of the campaign termination notice in early January.

    “The graph shows that the number of contributed hole punches increased after December 1, declined over Christmas, and tapered off following the distribution of the campaign termination notice in early January.”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Findingown data

    Applying the network identification method, we identify 859 distinct networks that the clients operate in (no two clients operated from the same network) and 86,769 networks for remote peers.

    “Applying this method, we identify 859 distinct networks that the clients operate in (no two clients operated from the same network) and 86, 769 networks for remote peers.”
    Quote in the paperNot a substantial claim
    • The authors state this as an assumption: Data points belong to the same network if the client reports the same public IP address.
    • The authors state this as an assumption: If a client's public IP changes but remains within the same Autonomous System (AS), the measurements are from the same network provided that the set of locally assigned private IP addresses remains unchanged.
  • May combine two claims.

    Findingown data

    In total, over 6.25 million hole punches were tracked across 212 API keys while 148 sign-ups were registered.

    “In total, we tracked over 6.25 million hole punches across 212 API keys while registering 148 sign-ups.”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Findingown data

    Approximately 10% of peers report a higher RTT after the hole punch, while 90% benefit from a reduced RTT.

    “Approximately 10% of peers report a higher RTT after the hole punch (all points above 100), while 90% benefit from a reduced RTT.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Findingown data

    For critical relay-mediated RTTs (scenario 2), over 90% of measurements exhibit a standard deviation less than half of the average RTT, indicating a substantial synchronization margin.

    “The results show that for the critical relay-mediated RTTs (scenario 2), over 90% of measurements exhibit a standard deviation less than half of the average RTT, indicating a substantial synchronization margin.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingown data

    The sample distribution is skewed toward the U.S.

    “While the sample distibution is skewed toward the U.S., our dataset captures globally distributed measurements.”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Findingown data

    Clients were deployed in 39 countries and hole-punched remote peers in 167 countries.

    “Figures 3a and 3b show that the clients were deployed in 39 countries and hole-punched remote peers in 167 countries.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S4 (based).

    Findingnone given
    § 7 Optimizations & Future Work

    The central finding of transport-agnosticism of DCUtR is a result of the effective RTT-based synchronization.

    “The viability of this roadmap is under- scored by the central finding of transport-agnosticism of DCUtR as a result of the effective RTT-based synchronization.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingnone given
    § 7 Optimizations & Future Work

    The remaining approximately 30% failure rate represents the next frontier for DCUtR improvement.

    “The remaining ∼ 30% failure rate represents the next frontier for DCUtR improvement.”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Findingown data

    Most relay nodes fall near the midpoint between us and the remote peer, with a slight skew toward proximity to the client.

    “Most relay nodes fall near the midpoint between us and the remote peer, with a slight skew toward proximity to the client.”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Findingown data

    Failed hole-punch attempts exhibit slightly higher RTTs through the relay than successful attempts, suggesting a weak negative correlation, but the overall difference is minor as the two CDFs remain closely aligned.

    “While failed attempts exhibit slightly higher RTTs, suggesting a weak negative correlation, the overall difference is minor as the two CDFs remain closely aligned.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingown data

    One highly mobile client was observed operating from 28 distinct networks during the measurement period.

    “At the other extreme, one highly mobile client was observed operating from 28 distinct networks during the measurement period.”
    Quote in the paperNot a substantial claim
    • The authors state this as an assumption: Data points belong to the same network if the client reports the same public IP address.
    • The authors state this as an assumption: If a client's public IP changes but remains within the same Autonomous System (AS), the measurements are from the same network provided that the set of locally assigned private IP addresses remains unchanged.
  • May combine two claims.

    Findingown data
    § 9 Conclusion

    Synchronization is highly effective, with most successes occurring on the first attempt (H3a).

    “that synchronization is highly effective, with most successes occurring on the first attempt (H3a)”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingown data
    § 9 Conclusion

    Our CC BY-SA licensed dataset of over 4.4 million measurements across more than 85k networks globally provides a valuable resource for future research.

    “Our CC BY-SA licensed dataset of over 4.4 million measurements across more than 85k networks globally provides a valuable resource for future research.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingnone given
    § 2016. A Multi-perspective Analysis of Carrier-Grade NAT Deployment. In Pro-

    The provided dataset is a Postgres database dump available via a specific IPFS CID.

    “The provided dataset is a Postgres database dump available via this IPFS CID”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.

    Premisecitation

    Two conflicting trends have emerged since Halkes et al.'s study: (i) expected reduction in EDM NAT deployment as vendors comply with BEHAVE RFC, and (ii) proliferation of Carrier-Grade NAT (CGNAT) deployments, which employed EDM translation in 40% of cases as of 2016.

    “Two conflicting trends have emerged since their study: (i) the ex- pected reduction in EDM NAT deployment as vendors increasingly comply with the BEHAVE RFC [17], and (ii) the proliferation of Carrier-Grade NAT (CGNAT) deployments, which employed EDM translation in 40% of cases as of 2016 [28].”
    Quote in the paperNot a substantial claim0 of 2 sources checked
    • cites [17] [17] Cullen Fluffy Jennings and Francois Audet. 2007. Network Address Translation (NAT) Behavioral Requirements for Unicast UDP. RFC 4787. doi:10.17487/ RFC4787 source
    • cites [28] [28] Philipp Richter, FlorianWohlfart, Narseo Vallina-Rodriguez, Mark Allman, Randy Bush, Anja Feldmann, Christian Kreibich, Nicholas Weaver, and Vern Paxson.

      Couldn’t be matched to a paper in Crossref, so it can’t be checked.

  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Study design and conductown data

    No abuse by non-registered clients was observed.

    “Any detected abuse by non-registered clients could be excluded from the dataset; however, we did not observe any such behavior.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation
    § 2 The Challenge of NAT for Peer-to-Peer

    NAPT allows multiple devices within a private network to share a single public IP address.

    “The most common variant, Network Address Port Translation (NAPT), also known as Port Address Translation (PAT), allows multiple devices within a private network to share a single public IP address [15].”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [15] [15] Matt Holdrege and Pyda Srisuresh. 1999. IP Network Address Translator (NAT) Terminology and Considerations. RFC 2663. doi:10.17487/RFC2663 source
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Interpretationreasoning

    DCUtR's permissionless design introduces several security trade-offs.

    “DCUtR's permissionless design intro- duces several security trade-offs.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S2 (checkable).

    Interpretationown data

    If a direct connection can be established via a pre-existing port mapping, it is highly advantageous to prioritize this method over initiating a full hole punch.

    “If a direct connection can be established via a pre-existing port mapping, it is highly advantageous to prioritize this method over initiating a full hole punch.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Study design and conductown data

    This analysis is based on port-mapping reports from our 212 volunteer clients, whose network configurations may not be representative of the broader population.

    “We note that this analysis is based on port-mapping reports from our 212 volunteer clients, whose network configurations may not be representative of the broader population.”
    Quote in the paperNot a substantial claim
  • Classified as probably not a substantial claim.

    Interpretationreasoning

    Aggressive port allocation patterns may trigger network-level intrusion detection systems.

    “Aggressive port allocation patterns may trigger network-level in- trusion detection systems.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Study design and conductreasoning
    § 0 10 20 30

    We cannot and do not attribute individual failures to specific NAT configurations.

    “As a result, we cannot and do not attribute individual failures to specific NAT configurations.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Study design and conductown data

    Our dataset does not support a definitive classification of remote NAT types, preventing attribution of individual failures to specific NAT mapping or filtering behaviors.

    “our dataset does not support a definitive classification of remote NAT types, preventing us from attributing individual failures to specific NAT mapping or filtering behaviors”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Interpretationcitation

    Guha et al.'s measurements comprised just 93 home NATs, which offers limited statistical power and lower representativeness than our considerably larger dataset.

    “However, their measurements comprised just 93 home NATs, which offers limited statistical power and lower representativeness than our considerably larger dataset.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Interpretationown data

    DCUtR's deterministic synchronization mechanism effectively mitigates the traditional challenges of TCP traversal, demonstrating that the protocol is transport-agnostic.

    “DCUtR's deterministic synchronization mechanism effectively mitigates the traditional challenges of TCP traversal, demonstrating that the protocol is indeed transport-agnostic.”
    Quote in the paperSubstantial claim
  • Classified as probably not a substantial claim.

    Interpretationnone given

    Opening a high volume of ports (e.g., 256-2,048) simultaneously increases a node's attack surface: each open port represents a potential entry point for fingerprinting or exploitation by adversaries.

    “Beyond NAT resource limits, opening a high volume of ports (e.g., 256–2,048) simultaneously also increases a node's attack surface: each open port represents a potential entry point for fingerprinting or exploitation by adversaries who may be aware of the technique.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Interpretationown data

    This pattern aligns with the timing of our study and expected client availability during the holiday period.

    “This pattern aligns with the timing of our study and expected client availability during the holiday period (see Figures 3a and 3b).”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation

    TCP hole punching is widely considered difficult due to constraints of the three-way handshake and susceptibility to RST packets from stateful firewalls.

    “TCP hole punching is widely considered difficult due to constraints of the three-way handshake and susceptibility to RST packets from stateful firewalls, which are well-documented [11, 13].”
    Quote in the paperNot a substantial claim0 of 2 sources checked
    • cites [11] [11] Bryan Ford, Dan Kegel, and Pyda Srisuresh. 2008. State of Peer-to-Peer (P2P) Communication across Network Address Translators (NATs). RFC 5128. doi:10. 17487/RFC5128

      Not checked in the free run.

    • cites [13] [13] Saikat Guha and Paul Francis. 2005. Characterization and measurement of TCP traversal through NATs and firewalls. In Proceedings of the 5th ACM SIGCOMM Conference on Internet Measurement (Berkeley, CA) (IMC '05). USENIX Associa- tion, USA, 18. source
  • Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based). May combine two claims.

    Interpretationnone given
    § 7 Optimizations & Future Work

    Failures can arise from transient network conditions, misconfigurations, overly restrictive firewalls, or the prevalence of Symmetric NATs.

    “Failures can arise from transient network conditions, misconfigurations, overly restrictive firewalls, or the prevalence of Symmetric NATs.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Interpretationreasoning

    When the search space coverage increases to 3.1% (2,048 ports), the success probability rises to 99.9%.

    “When the search space coverage increases to 3.1% (2,048 ports), the success probabil- ity rises to 99.9%.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based). May combine two claims.

    Interpretationnone given
    § 1 2 3

    The relay represents a trust boundary and can observe the addresses and connection patterns of both parties, enabling behavioral profiling over time.

    “The relay itself represents a trust boundary. It can observe the addresses and connection patterns of both parties, enabling behavioral profiling over time.”
    Quote in the paperNot a substantial claim
  • Classified as probably not a substantial claim.

    Study design and conductreasoning

    The 1,000 data point threshold ensures statistical stability of per-network success rates by excluding transient or minimally contributing clients whose small sample sizes would introduce high variance into the aggregate metric.

    “The 1,000 data point threshold ensures statistical stability of per-network success rates by excluding transient or minimally contributing clients whose small sample sizes would introduce high variance into the aggregate metric.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisereasoning

    Symmetric NATs pose the greatest challenge for P2P connectivity.

    “At the opposite end of the spectrum are Symmetric NATs, which pose the greatest challenge for P2P connectivity.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Interpretationreasoning

    The excluded data points represent fundamental failures in the broader connectivity stack upon which DCUtR depends.

    “The excluded data points represent fundamental failures in the broader connectivity stack upon which DCUtR depends.”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Premisecitation

    TURN guarantees connectivity but increases latency and requires the TURN server to handle the full bandwidth of the session.

    “Although TURN guarantees connectivity, it increases latency and requires the TURN server to handle the full bandwidth of the session.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S1 (asserted), S3 (load-bearing).

    Interpretationreasoning

    If birthday paradox techniques achieve a 64% success rate for the 19.6% of mixed connection attempts, the overall DCUtR success rate could improve 12.5%.

    “If birthday paradox techniques achieve a 64% success rate for the 19.6% of mixed connection attempts, the overall DCUtR success rate could improve 12.5%.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based). May combine two claims.

    Interpretationnone given
    § 1 2 3

    Repeated failed TCP simultaneous-open attempts can be misidentified as SYN floods by stateful firewalls, risking IP denylisting, while resource-constrained NATs may exhaust their session tables under sustained probing.

    “On the denial-of-service front, re- peated failed TCP simultaneous-open attempts can be misidentified as SYN floods by stateful firewalls, risking IP denylisting, while resource-constrained NATs may exhaust their session tables under sustained probing.”
    Quote in the paperNot a substantial claim
  • Classified as probably not a substantial claim.

    Interpretationreasoning

    The approximately 30% failure rate, despite the protocol's general efficacy (H1), is likely due, in part, to challenging NAT configurations, such as Endpoint-Dependent Mappings (EDM).

    “The ∼ 30% failure rate, despite the protocol's general efficacy (H1), is likely due, in part, to challenging NAT configurations, such as Endpoint-Dependent Mappings (EDM).”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Interpretationreasoning

    When path asymmetry is significant, the synchronization margin shrinks, which may partly explain the remaining ~30% failure rate.

    “When path asymmetry is significant, however, the synchronization margin shrinks, which may partly explain the remaining ∼ 30% failure rate.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Interpretationown data

    Taken together, these findings demonstrate only a minor effect from elevated RTTs and no measurable dependence on relay path location, providing compelling evidence for H2.

    “Taken together, these findings demonstrate only a minor effect from elevated RTTs and no measurable dependence on relay path location, providing compelling evidence for H2.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.

    Premisereasoning
    § 0 CONNECTION REVERSAL

    Circuit v2 is designed to minimize resource usage, imposing negligible processing and bandwidth costs on relays, unlike traditional TURN relays.

    “Crucially, Circuit v2 is designed to minimize resource usage, imposing negligible processing and bandwidth costs on relays; unlike traditional TURN relays, which forwards all application traffic.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Interpretationreasoning

    Without the conservative constraints on port probing and opening operations, success rates could be substantially higher.

    “Without these constraints, success rates could be substantially higher.”
    Quote in the paperNot a substantial claim
    • The authors state this as an assumption: Conservative values for port probing and opening operations are assumed because NAT devices maintain limited active session capacities and may interpret intensive port scanning as malicious behavior.
  • May combine two claims.

    Interpretationreasoning

    The skew toward proximity to the client is expected because peers by default request reservations with two relays, clients dial remote peers via all available relay addresses, and the connection to the closer relay succeeds first.

    “This skew is expected, since peers by default request reservations with two relays. Clients then dial remote peers via all available relay addresses. It is natural that the connection to the closer relay, and thus to the remote peer through it, succeeds first.”
    Quote in the paperNot a substantial claim
    • Rests on an assumption: Peers by default request reservations with two relays.
  • Classified as probably not a substantial claim.

    Interpretationreasoning

    This insight motivates the optimizations described in Section 7.

    “This insight motivates the optimizations described in Section 7.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation

    ICE is the de facto standard for handling the complexities of NAT.

    “The de facto standard for handling the complexities of NAT is the Interactive Connectivity Establishment (ICE) framework [1, 29]”
    Quote in the paperNot a substantial claim0 of 2 sources checked
    • cites [1] [1] Harald T. Alvestrand. 2021. Overview: Real-Time Protocols for Browser-Based Applications. RFC 8825. doi:10.17487/RFC8825 source
    • cites [29]

      Couldn’t be matched to a paper in Crossref, so it can’t be checked.

  • Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based).

    Study design and conductnone given

    Personally identifiable information has been anonymized.

    “Personally identifiable information has been anonymized.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Interpretationreasoning

    Cases where the direct path is slower than the relayed path can occur if the relay is located on a high-speed internet backbone, while the direct peer-to-peer path traverses slower consumer-grade ISP networks.

    “Cases where the direct path is slower than the relayed path can occur if the relay is located on a high-speed internet backbone, while the direct peer-to-peer path traverses slower consumer-grade ISP networks.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.

    Premisenone given

    The Identify protocol provides functionality similar to STUN, is lightweight, and all libp2p peers support it by default.

    “The Identify protocol provides functionality similar to STUN, is lightweight, and all libp2p peers support it by default.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S4 (based). May combine two claims.

    Interpretationnone given

    All studies we identified rely on data that is considerably outdated, which may not accurately reflect the current internet landscape and underscores the need for renewed, large-scale measurement of NAT traversal in the current Internet.

    “Moreover, all studies we identified rely on data that is considerably outdated. This may not accurately reflect the current internet landscape and underscores the need for renewed, large-scale measurement of NAT traversal in the current Internet.”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Study design and conductreasoning

    This selection bias may lead to an overestimation of the protocol's success rate (H1) and may limit the generalizability of our findings.

    “This selection bias may lead to an overestimation of the protocol's success rate (H1) and may limit the generalizability of our findings.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Interpretationown data

    Hole punching can significantly improve performance and enable delay-sensitive applications.

    “These results confirm that hole punching can significantly improve performance and enable delay-sensitive applications.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Study design and conductreasoning
    § 2016. A Multi-perspective Analysis of Carrier-Grade NAT Deployment. In Pro-

    The research followed strict ethical guidelines.

    “The research followed strict ethical guidelines.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.

    Study design and conductreasoning
    § 2016. A Multi-perspective Analysis of Carrier-Grade NAT Deployment. In Pro-

    The Go-Client generated ten peer identities upon startup, each listening on a different port, and for each hole punch we round-robin through the ten peers, mitigating persistent port mappings to yield a high number of CONNECTION_REVERSED results.

    “Importantly, the Go-Client generated ten peer identities upon startup. Each peer ID would listen on a different port. For each hole punch we 'round robin' through the ten peers. This way we mitigated persistent port mappings to yield a high number of CONNECTION_REVERSED results.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S2 (checkable). May combine two claims.

    Interpretationreasoning
    § 9 Conclusion

    The proposed optimizations of role alternation on retries, refined RTT calculation, proactive NAT priming, and the birthday paradox exploitation offer concrete paths toward higher direct-connectivity rates and strengthen the protocol as a building block for the decentralized Internet.

    “The proposed optimizations of role alter- nation on retries, refined RTT calculation, proactive NAT priming, and the birthday paradox exploitation offer concrete paths toward higher direct-connectivity rates and strengthen the protocol as a building block for the decentralized Internet.”
    Quote in the paperNot a substantial claim
  • The quote only partly states this claim.

    Study design and conductreasoning
    § 2016. A Multi-perspective Analysis of Carrier-Grade NAT Deployment. In Pro-

    Data from remote, non-consenting peers was collected based on their operation of public, permissionless P2P nodes (IPFS, libp2p), which inherently expose network metadata (IP, PeerID, protocols) through standard interactions.

    “Data from remote, non-consenting peers was collected based on their operation of public, permissionless P2P nodes (IPFS, libp2p), which inherently expose network metadata (IP, PeerID, protocols) through standard interactions.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Study design and conductnone given
    § 2016. A Multi-perspective Analysis of Carrier-Grade NAT Deployment. In Pro-

    Participants either signed up, receiving detailed information and providing explicit consent regarding data collection (including IP addresses and libp2p PeerIDs) and its academic use, or voluntarily ran a tool whose documentation clearly stated data collection for research.

    “Participants either signed up, receiving detailed information and providing explicit consent regarding data collection (including IP addresses and libp2p PeerIDs) and its academic use, or voluntarily ran a tool whose documentation (README) clearly stated data collection (including IP addresses and libp2p PeerIDs) for research.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Study design and conductreasoning
    § 2016. A Multi-perspective Analysis of Carrier-Grade NAT Deployment. In Pro-

    Collected data (e.g., hole punch success) was a byproduct of standard interactions, with no non-standard or privacy-invasive data gathered beyond what a public P2P node inherently exposes.

    “Collected data (e.g., hole punch success) was a byproduct of these standard interactions, with no non-standard or privacy-invasive data gathered beyond what a public P2P node inherently exposes.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Interpretationown data
    § 9 Conclusion

    While not a full replacement for STUN/TURN today, DCUtR can already offload significant traffic and, when combined with suitable relays (e.g. VPN or SSH gateways), has the potential to eliminate dependence on these services entirely.

    “While not a full replacement for STUN/TURN today, it can already offload significant traffic and, when combined with suitable relays (e.g. VPN or SSH gateways), has the potential to eliminate dependence on these services entirely.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.

    Interpretationreasoning

    Alternating roles in subsequent attempts would succeed on the second try, given that the initiator is not behind a symmetric NAT.

    “The above scenario would succeed on the second try, given that the initiator is not behind a symmetric NAT.”
    Quote in the paperNot a substantial claim
    • The authors state this as an assumption: The initiator is behind an EDM NAT but the listener is not.
  • Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based). May combine two claims.

    Interpretationnone given

    Having both parties sending client hellos might result in two distinct QUIC connections, which can also be acceptable in some scenarios.

    “Contrary to a TCP simultaneous open, having both parties sending client hellos might result in two distinct QUIC connections, which can also be acceptable in some scenarios.”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Interpretationreasoning
    § 9 Conclusion

    DCUtR meaningfully advances decentralization by reducing reliance on centralized intermediaries, thus mitigating single points of failure and enhancing self-sovereign control over data.

    “DCUtR meaningfully advances decentralization by reducing re- liance on centralized intermediaries, thus mitigating single points of failure and enhancing self-sovereign control over data.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S2 (checkable), S3 (load-bearing).

    Interpretationcitation

    Long-term success also depends on improving the network environment itself through a combination of standards advocacy and better use of existing mechanisms.

    “Long-term success also depends on improving the network environ- ment itself through a combination of standards advocacy and better use of existingmechanisms.”
    Quote in the paperNot a substantial claim
  • Classified as probably not a substantial claim. May combine two claims.

    Interpretationreasoning

    Peer-to-peer RTT may be insufficient in more complex network topologies, where the resulting discrepancy can cause the SYNC packet to arrive outside the optimal time window, increasing the likelihood of connection failures.

    “this approach may be insufficient in more complex network topologies. In such cases, the resulting discrepancy can cause the SYNC packet to arrive outside the optimal time window, thereby increasing the likeli- hood of connection failures.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Interpretationown data
    § 9 Conclusion

    This paper presents a large-scale empirical evaluation of DCUtR, validating its design principles and establishing a contemporary benchmark for decentralized NAT traversal.

    “This paper presents a large-scale empirical evaluation of DCUtR, validating its design principles and establishing a contemporary benchmark for decentralized NAT traversal.”
    Quote in the paperSubstantial claim
71 of 71
  • The paper relies on this without support.

    The honeypot's crawling behavior increases the likelihood that other peers insert the honeypot into their routing tables, thereby raising the number of inbound connections it receives.

    “This behavior increases the likelihood that other peers insert the honeypot into their routing tables. As a result, server peers increasingly redirect client traffic to the honeypot, thereby raising the number of inbound connections it receives.”
  • The paper relies on this without support.

    Hole punching is a best effort technique with no guaranteed success.

    “Hole punching is a best effort technique with no guaranteed success.”
  • The authors state this as an assumption.

    Data points belong to the same network if the client reports the same public IP address.

    “We identify individual networks using two assumptions: (i) data points belong to the same network if the client reports the same public IP address, and (ii) if a client's public IP changes but remains within the same Autonomous System (AS), we treat the measurements as coming from the same network provided that the set of locally assigned private IP addresses remains unchanged.”
  • The authors state this as an assumption.

    If a client's public IP changes but remains within the same Autonomous System (AS), the measurements are from the same network provided that the set of locally assigned private IP addresses remains unchanged.

    “We identify individual networks using two assumptions: (i) data points belong to the same network if the client reports the same public IP address, and (ii) if a client's public IP changes but remains within the same Autonomous System (AS), we treat the measurements as coming from the same network provided that the set of locally assigned private IP addresses remains unchanged.”
  • The paper relies on this without support.

    Peers by default request reservations with two relays.

    “This skew is expected, since peers by default request reservations with two relays.”
  • The authors state this as an assumption.

    Conservative values for port probing and opening operations are assumed because NAT devices maintain limited active session capacities and may interpret intensive port scanning as malicious behavior.

    “We assume conservative values for port probing and opening operations, as NAT devices maintain limited active session capacities and may interpret intensive port scanning as malicious behavior, potentially blocking the peer's IP address for extended periods.”
  • The authors state this as an assumption.

    The initiator is behind an EDM NAT but the listener is not.

    “If we assume that the initiator is behind an EDM NAT but the listener is not”
7 of 7

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

Each contradiction between two passages listed here was confirmed by an independent check.

  • Figure 7b caption reverses the plotted RTT ratio

    Minor

    The caption calls the ratio mean over standard deviation, while the plot labels it standard deviation over average. Those are reciprocal quantities.

  • Retry finding is attributed to H4 instead of H3a

    Minor

    Section 7.2 attributes diminishing returns from retries to validation of H4. The paper evaluates attempts and retries under H3a; H4 concerns Connection Reversal.

2 of 2

Cites

Flagged first, then by citations

9 of the 33 references couldn’t be matched to a known paper.

Cited by

Still being checked.

Authors
Trautwein, D., Ihle, C., Schubotz, M., Breitinger, C., & Gipp, B.
Affiliations
  • University of Göttingen (DE)
  • FIZ Karlsruhe – Leibniz Institute for Information Infrastructure (DE)
  • University of Göttingen, Göttingen, Germany
Venue
Proceedings of the 2026 ACM Internet Measurement Conference
Publisher
ACM
Published
2026-10-12
Pages
779-794
OpenAlex
W7154617627
Cited by
0
References
33
FWCI
0.00
Type
conference paper
Language
en
Open access
Locations
  • ACM Internet Measurement Conference (IMC) (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion, cc-by-sa)
  • GoeScholar The Publication Server of the Georg-August-Universität Göttingen (Georg-August-Universität Göttingen) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Peer-to-Peer Network Technologies
  • Physical Sciences › Computer Science › Computer Networks and Communications › Network Traffic and Congestion Control
  • Physical Sciences › Computer Science › Artificial Intelligence › Internet Traffic Analysis and Secure E-voting
Keywords
NAT traversal, IPFS, decentralized peer-to-peer networks, hole punching, large-scale measurement

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.

Claims read by deepseek-v4.1-flash under definition version 3 (extract-v3) on 2026-10-31.

Classified by jev-1.13-20260917 (gold-guideline-v0.2) on 2026-10-31.

Cited sources are checked by gpt-6-sol.

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