Latency-Aware resource allocation over heterogeneous networks: a Lorentz-invariant market mechanism
Аннотация
We present a telecom-native auction mechanism for bandwidth and time-slot allocation across heterogeneous-delay networks, from low-Earth-orbit (LEO) satellite constellations to delay-tolerant deep-space relays. The Lorentz-Invariant Auction (LIA) treats bids as spacetime events and reweights reported values by the horizon slack —a causal quantity derived from earliest-arrival times relative to a public clearing horizon. The contribution is not merely another delay-equalization rule: relative to batching, synchronized clearing, and speed-bump designs, LIA combines a causal-ordering formulation, a uniquely exponential slack correction implied by a semigroup-style invariance axiom, and a critical-value implementation that is truthful in reported values once slacks are fixed by trusted infrastructure. We therefore state the incentive result in the exogenous-slack regime and separately analyze bounded slack-estimation error and endogenous-delay limitations. Under fixed feasible slacks, LIA is individually rational and achieves welfare at least $$e^{-\lambda \Delta }$$ relative to the optimal feasible allocation, where $$\Delta $$ is the slack spread. We evaluate LIA on STARLINK-200, INTERNET-100, and DSN-30 across 52,500 baseline instances with market sizes $$n\in \{10,20,30,40,50\}$$ and we run additional robustness sweeps. On Starlink and Internet, LIA remains near-efficient while yielding zero estimated pooled timing rent at $$\lambda =1\,\textrm{s}^{-1}$$ on the tested delay grids; on DSN, welfare is lower in thin markets but improves with depth. We also distinguish winner-determination time from the background cost of maintaining slack estimates and study robustness beyond iid noise through error-spread bounds and structured (distance-biased and subnetwork-correlated) noise models. These results support causal-slack weighting as an alternative to explicit delay equalization, subject to the stated measurement and online-completion assumptions.