Decomposing the Distortion Factor Φ: Myopic and Retry Branches of DTN Routing Efficiency
Decomposing the Distortion Factor Φ: Myopic and Retry Branches of DTN Routing Efficiency
We decompose the policy distortion factor Φ into myopic (topology-dependent) and retry (stochastic) branches via the scale-response ln(Φ) = β·E[H]. The myopic branch follows β_myopic = δ₀·E[H]·(1−exp(−p/p₀)) with δ₀ = 0.311, p₀ = 0.042 (R² = 0.68 on 105k configurations, 8 targets). The retry branch contributes only noise (R² = 0.006). The story is one dominant analytic branch plus a weak empirical correction. Validated on both synthetic orbital and real CRAWDAD social traces.
DTN, myopic routing, routing efficiency, decomposition, retry mechanism, sparse law, delay-tolerant networking, scale response, distortion factor
DTN, myopic routing, routing efficiency, decomposition, retry mechanism, sparse law, delay-tolerant networking, scale response, distortion factor
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!