TY - GEN
T1 - A binary vote based comparison of simple majority and hierarchical decision for survivable networks
AU - Kamhoua, Charles A.
AU - Kwiat, Kevin A.
AU - Park, Joon S.
N1 - Funding Information:
This research was performed while Charles Kamhoua and Joon Park held a National Research Council Research Associateship Award at the Air Force Research Laboratory. This research was supported by the Air Force Office of Scientific Research (AFOSR). Approved for Public Release; Distribution Unlimited: 88ABW-2011-6296 Dated 05 December 2011.
PY - 2012
Y1 - 2012
N2 - Nodes are replicated in fault-tolerant networks not only to increase the aggregate decision reliability but also to survive the failure of a subset of those nodes. A simple majority rule is the most common aggregate decision rule. One may believe that a simple majority rule may not be optimal when node replication is performed in organization following a hierarchical structure like a corporation or a military command. This research shows that if the node's observations are better than random, then a simple majority rule is better than a hierarchical decision. Moreover, even though there are a few compromised nodes that falsify their vote, a simple majority rule will still be superior. However, a hierarchical decision process is more scalable and the vote can be aggregated faster. This paper also proposed a technique based on the law of diminishing marginal utility to calculate the optimum number of nodes in a decision process.
AB - Nodes are replicated in fault-tolerant networks not only to increase the aggregate decision reliability but also to survive the failure of a subset of those nodes. A simple majority rule is the most common aggregate decision rule. One may believe that a simple majority rule may not be optimal when node replication is performed in organization following a hierarchical structure like a corporation or a military command. This research shows that if the node's observations are better than random, then a simple majority rule is better than a hierarchical decision. Moreover, even though there are a few compromised nodes that falsify their vote, a simple majority rule will still be superior. However, a hierarchical decision process is more scalable and the vote can be aggregated faster. This paper also proposed a technique based on the law of diminishing marginal utility to calculate the optimum number of nodes in a decision process.
KW - binary voting
KW - fault-tolerant Network
KW - hierarchical decision process
KW - network security
KW - reliability
KW - survivability
UR - http://www.scopus.com/inward/record.url?scp=84865156887&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84865156887&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-30111-7_85
DO - 10.1007/978-3-642-30111-7_85
M3 - Conference contribution
AN - SCOPUS:84865156887
SN - 9783642301100
T3 - Advances in Intelligent and Soft Computing
SP - 883
EP - 896
BT - Advances in Computer Science, Engineering and Applications - Proceedings of the Second International Conference on Computer Science, Engineering and Applications, ICCSEA 2012
T2 - 2nd International Conference on Computer Science, Engineering and Applications, ICCSEA 2012
Y2 - 25 May 2012 through 27 May 2012
ER -