Additionally, a superstabilizing algorithm will recover rapidly from a single change in the network topology (adding or removing one edge or node in the network).
Any self-stabilizing algorithm recovers from a change in the network topology – the system configuration after a topology change can be treated just like any other arbitrary starting configuration.
In the study of superstabilizing algorithms, special attention is paid to the time it takes to recover from a single change in the network topology.
The stabilization time of a superstabilizing algorithm is defined exactly as in the case of self-stabilizing algorithm: how long it takes to converge to a legitimate state from an arbitrary configuration.
Depending on the computational model, time is measured, e.g., in synchronous communication rounds or in asynchronous cycles.