Simple and efficient local codes for distributed stable network construction
DOI10.1145/2611462.2611466zbMath1321.68029arXiv1309.6978MaRDI QIDQ5892129
Othon Michail, Paul G. Spirakis
Publication date: 3 September 2015
Published in: Distributed Computing, Proceedings of the 2014 ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.6978
population; fairness; stabilization; self-organization; structure formation; distributed protocol; network construction; homogeneous population; distributed network construction; interacting automata; random schedule
90B18: Communication networks in operations research
68M10: Network design and communication in computer systems
68Q45: Formal languages and automata
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68M14: Distributed systems
68M12: Network protocols
68W15: Distributed algorithms
Uses Software
