Linear time distributed swap edge algorithms

•We address the failure of an edge e in a 2-connected network X, where communications are routed through its MST T.•The goal is to find an optimal substitute edge e′ to reconnect T after the failure. We study three optimization criteria.•We address the problem from time perspective: all algorithms work in linear time with respect to the height of the MST of X.•The presented solutions work in a totally asynchronous distributed system.