Issues in Self-Stabilization.

Rightnow this page is under construction.

Please be patient with us.

The following issues have played important role in the design and impossibility results of Self-Stabilizing systems.

This list of issues is in no way complete and exhaustive. We are in the process of building up the list and make separate pages dealing with each of these issues. Each separate page will contain references to papers that deal with these issues.

• Whether the processors have unique identifiers or not. Anonymous networks vs Networks of distinguishable processors.

• In case of ring networks, if the rings are oriented or not. Oriented vs Unoriented rings.

• For oriented rings, if they are Unidirectional or not. Unidirectional vs Bidirectional.

• If the protocols assume any knowledge of the size or any bound on the size of the network or not. Knowledge of network size.

• Whether there is a leader in the network or not. Existence of leader.

• If the protocol is uniform or not. Uniform vs Nonuniform protocols.

• If the protocol is deterministic or not. Deterministic vs Randomized protocols.

• If the underlying model of distributed computation uses shared memory models or message passing. Message passing vs Shared memory models.

• If the adversary is distributed deamon, Central deamon or some other kind of adversary. Adversary oriented view of self-stabilization.