Two Generals' Problem
In computing, the Two Generals' Problem is a thought experiment meant to illustrate the pitfalls and design challenges of attempting to coordinate an action by communicating over an unreliable link. In the experiment, two generals are only able to communicate with one another by sending a messenger through enemy territory. The experiment asks how they might reach an agreement on the time to launch an attack, while knowing that any messenger they send could be captured.
- Comment
- enIn computing, the Two Generals' Problem is a thought experiment meant to illustrate the pitfalls and design challenges of attempting to coordinate an action by communicating over an unreliable link. In the experiment, two generals are only able to communicate with one another by sending a messenger through enemy territory. The experiment asks how they might reach an agreement on the time to launch an attack, while knowing that any messenger they send could be captured.
- Depiction
- Has abstract
- enIn computing, the Two Generals' Problem is a thought experiment meant to illustrate the pitfalls and design challenges of attempting to coordinate an action by communicating over an unreliable link. In the experiment, two generals are only able to communicate with one another by sending a messenger through enemy territory. The experiment asks how they might reach an agreement on the time to launch an attack, while knowing that any messenger they send could be captured. The Two Generals' Problem appears often as an introduction to the more general Byzantine Generals problem in introductory classes about computer networking (particularly with regard to the Transmission Control Protocol, where it shows that TCP can't guarantee state consistency between endpoints and why this is the case), though it applies to any type of two-party communication where failures of communication are possible. A key concept in epistemic logic, this problem highlights the importance of common knowledge. Some authors also refer to this as the Two Generals' Paradox, the Two Armies Problem, or the Coordinated Attack Problem. The Two Generals' Problem was the first computer communication problem to be proved to be unsolvable. An important consequence of this proof is that generalizations like the Byzantine Generals problem are also unsolvable in the face of arbitrary communication failures, thus providing a base of realistic expectations for any distributed consistency protocols.
- Hypernym
- Experiment
- Is primary topic of
- Two Generals' Problem
- Label
- enTwo Generals' Problem
- Link from a Wikipage to another Wikipage
- Acknowledgement (data networks)
- Army
- Byzantine Generals
- Category:Distributed computing problems
- Category:Theory of computation
- Category:Thought experiments
- Common knowledge (logic)
- Communication
- Computer networking
- Consensus (computer science)
- Deterministic system
- Epistemic logic
- File:2-generals.svg
- General
- Jim Gray (computer scientist)
- Runner (war)
- Thought experiment
- Transmission Control Protocol
- Tree (graph theory)
- Uncertainty
- SameAs
- 2UJ9q
- m.0bfyz4
- Problema de los dos generales
- Problema di du generai
- Problema dos dois generais
- Problém dvou armád
- Problème des deux généraux
- Q2632674
- Two Generals' Problem
- Задача двох генералів
- Задача двух генералов
- בעיית שני הצבאות
- مسئله دو ژنرال
- معضلة الجنرالين
- 两军问题
- 二人の将軍問題
- 두 장군 문제
- Subject
- Category:Distributed computing problems
- Category:Theory of computation
- Category:Thought experiments
- Thumbnail
- WasDerivedFrom
- Two Generals' Problem?oldid=1117902361&ns=0
- WikiPageLength
- 12299
- Wikipage page ID
- 4058119
- Wikipage revision ID
- 1117902361
- WikiPageUsesTemplate
- Template:Reflist
- Template:Short description
- Template:Unsourced section
