Optimal Distributed Replacement Paths

Abstract

We study the replacement paths problem in the $\mathsf{CONGEST}$ model of distributed computing. Given an $s$-$t$ shortest path $P$, the goal is to compute, for every edge $e$ in $P$, the shortest-path distance from $s$ to $t$ avoiding $e$. For unweighted directed graphs, we establish the tight randomized round complexity bound for this problem as $\tilde{\hat{I}}˜(n^{2/3}+D)$ by showing matching upper and lower bounds. Our upper bound extends to $(1+\hat{I}\mu )$-approximation for weighted directed graphs. Our lower bound applies even to the second simple shortest path problem, which asks only for the smallest replacement path length. These results improve upon the very recent work of Manoharan and Ramachandran (SIROCCO 2024), who showed a lower bound of $\tilde{\hat{I}}\text{c◯}(n^{1/2}+D)$ and an upper bound of $\tilde{O}(n^{2/3}+\sqrt{n{h}_{st}}+D)$, where $h_{st}$ is the number of hops in the given $s$-$t$ shortest path $P$.

PODC 2025