Toward Predicting Distributed Systems Dynamics

Systems of "building block" algorithms can guarantee that self-organizing systems eventually converge to a predictable state, but what of their dynamical behavior in environments with ongoing changes? To begin to address this challenge, we analyze a commonly used distributed distance estimation algorithm from a stability theory perspective, identifying key properties of monotonicity and dynamical behavior envelope. This allows standard stability theory analysis to be applied to predict the behavior of the algorithm in response to persistent perturbation, both in isolation and as part of a composite system, as demonstrated both analytically and in simulation.