How to communicate efficiently (Q750126)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: How to communicate efficiently |
scientific article; zbMATH DE number 4174309
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How to communicate efficiently |
scientific article; zbMATH DE number 4174309 |
Statements
How to communicate efficiently (English)
0 references
1990
0 references
The paper proposes an algorithm for the so-called decentralized consensus problem. In a network with n knots, information is to be gathered from all knots, synthesized, and the outcome must be made known to all knots. The goal is to minimize the global amount of communication. The presented strategy is based on finite geometries and achieves an amount of O(n log n).
0 references
computer networks
0 references
consensus problem
0 references
finite geometries
0 references
0.8063865
0 references
0.8063865
0 references
0.7975615
0 references
0 references
0 references
0 references
