Symmetry Breaking in Anonymous Networks: Characterizations
نویسندگان
چکیده
We characterize exactly the cases in which it is possible to elect a leader in an anonymous network of processors by a deterministic algorithm, and we show that for every network there is a weak election algorithm (i.e., if election is impossible all processors detect this fact in a distributed way).
منابع مشابه
Deterministic Leader Election Among Disoriented Anonymous Sensors
We address the Leader Election (LE) problem in networks of anonymous sensors sharing no kind of common coordinate system. Leader Election is a fundamental symmetry breaking problem in distributed computing. Its goal is to assign value 1 (leader) to one of the entities and value 0 (non-leader) to all others. In this paper, assuming n > 1 disoriented anonymous sensors, we provide a complete chara...
متن کاملComputability in Anonymous Networks: Revocable vs. Irrecovable Outputs [Full Version]
What can be computed in an anonymous network, where nodes are not equipped with unique identifiers? It turns out that the answer to this question depends on the commitment of the nodes to their first computed output value: Two classes of problems solvable in anonymous networks are defined, where in the first class nodes are allowed to revoke their outputs and in the second class they are not. T...
متن کاملComputability in Anonymous Networks: Revocable vs. Irrecovable Outputs
What can be computed in an anonymous network, where nodes are not equipped with unique identifiers? It turns out that the answer to this question depends on the commitment of the nodes to their first computed output value: Two classes of problems solvable in anonymous networks are defined, where in the first class nodes are allowed to revoke their outputs and in the second class they are not. T...
متن کاملLatest Developments on the Bess Model
The idea of a strongly interacting sector as responsible for the electroweak symmetry breaking is tested through an effective lagrangian description, called the BESS model, constructed on the standing point of custodial symmetry and gauge invariance, without specifing any dynamical scheme. Key-Words : electroweak symmetry breaking. Number of figures : 4 October 1994 CPT-94/P.3075 anonymous ftp ...
متن کاملTime Optimal Self-Stabilizing Spanning Tree Algorithms
This thesis presents time-optimal self-stabilizing algorithms for distributed spanning tree computation in asynchronous networks. We present both a randomized algorithm for anonymous networks as well as a deterministic version for ID-based networks. Our protocols are the rst to be time-optimal (i.e. stabilize in time O(diameter)) without any prior knowledge of the network size or diameter. Both...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996