The south zone: distributed algorithms for alliances

Authors:
M. C. Dourado;L. D. Penso;D. Rautenbach;J. L. Szwarcfiter
Affiliations:
Instituto de Matemática, NCE, and COPPE, Universidade Federal do Rio de Janeiro, Rio de Janeiro, RJ, Brazil;Institut für Optimierung und Operations Research, Fakultät für Mathematik und Wirtschaftswissenschaften, Universität Ulm, Ulm, Germany;Institut für Optimierung und Operations Research, Fakultät für Mathematik und Wirtschaftswissenschaften, Universität Ulm, Ulm, Germany;Instituto de Matemática, NCE, and COPPE, Universidade Federal do Rio de Janeiro, Rio de Janeiro, RJ, Brazil
Venue:
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Year:
2011

Citing 21
Cited 0

A trade-off between space and efficiency for routing tables

Journal of the ACM (JACM)
Concurrency and availability as dual properties of replicated atomic data

Journal of the ACM (JACM)
Self-stabilization

ACM Computing Surveys (CSUR)
How to allocate network centers

Journal of Algorithms
Fast distributed construction of small k-dominating sets and applications

Journal of Algorithms
Self-stabilization

Self-stabilization
Multicast communication: protocols and applications

Multicast communication: protocols and applications
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Average probe complexity in quorum systems

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Self-Stabilizing Local Mutual Exclusion and Daemon Refinement

DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Constant-time distributed dominating set approximation

Proceedings of the twenty-second annual symposium on Principles of distributed computing
A distributed algorithm to find k-dominating sets

Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Quorum placement in networks to minimize access delays

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Quorum placement in networks: minimizing network congestion

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Distributed Protocols for Defensive and Offensive Alliances in Network Graphs Using Self-Stabilization

ICCTA '07 Proceedings of the International Conference on Computing: Theory and Applications
Irreversible k-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion

Discrete Applied Mathematics
Brief announcement: on reversible and irreversible conversions

DISC'10 Proceedings of the 24th international conference on Distributed computing
Minimum dominating set approximation in graphs of bounded arboricity

DISC'10 Proceedings of the 24th international conference on Distributed computing
Irreversible conversion of graphs

Theoretical Computer Science
Distance-k information in self-stabilizing algorithms

SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present novel results on and efficient deterministic as well as randomized synchronous message-passing distributed algorithms for generalized graph alliances, a new concept incorporating and expanding previous ones. An alliance is here a group of nodes of a connected network or a population fulfilling certain thresholds for their neighbourhood. More precisely, every node outside and inside the alliance must have a minimum number of neighbours inside the alliance. A threshold function defining this number may be specific to each node. We are interested in finding minimal alliances of generalized type: the threshold function might be any. We also investigate conditions in which it is possible to have anonymity, a praised property in population protocols.