DocumentCode
2316937
Title
Reliable relaying with uncertain knowledge
Author
Lee, Jiwoong ; Walrand, Jean
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., Univ. of California at Berkeley, Berkeley, CA, USA
fYear
2009
fDate
13-15 May 2009
Firstpage
82
Lastpage
87
Abstract
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.
Keywords
hypercube networks; protocols; butterfly network; inconsistent belief; optimal coordination; reliable relay network; uncertain knowledge; Convergence; Delay; Distributed algorithms; Information analysis; Network topology; Nominations and elections; Performance analysis; Relays; Routing protocols; Uncertainty; Bounded Knowledge; Common Knowledge; Inconsistent Beliefs; Relay network; Reliable relaying;
fLanguage
English
Publisher
ieee
Conference_Titel
Game Theory for Networks, 2009. GameNets '09. International Conference on
Conference_Location
Istanbul
Print_ISBN
978-1-4244-4176-1
Electronic_ISBN
978-1-4244-4177-8
Type
conf
DOI
10.1109/GAMENETS.2009.5137387
Filename
5137387
Link To Document