Data networks
A hundred impossibility proofs for distributed computing
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Some aspects of the parallel and distributed iterative algorithms—a survey
Automatica (Journal of IFAC)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Hi-index | 0.00 |
The motivation for this paper is to analyze the effect of information uncertainty on the design and performance of protocols. The paper considers two types of situations. The first is when different nodes in the network have bounded knowledge about what other nodes know. The second, called common knowledge about inconsistent beliefs, is when the information is inconsistent but everyone knows it. Situations of bounded or inconsistent information arise naturally in networks because the state of these systems changes and nodes take time to learn of those changes. The specific problem that the paper explores is the relaying of packets in a simple butterfly network. Despite its apparent simplicity, this problem enables to illustrate key features of situations of uncertain knowledge that arise in networks. The paper presents two impossibility facts and one possibility fact, in the latter of which a scheme that enables optimal coordination given persisting imperfection in knowledge is introduced.