TY - GEN
T1 - Defense strategies and expected capacity of high performance computing infrastructures
AU - Rao, Nageswara S.V.
AU - Ma, Chris Y.T.
AU - Imam, Neena
AU - He, Fei
N1 - Publisher Copyright:
© 2019 Association for Computing Machinery.
PY - 2019/1/4
Y1 - 2019/1/4
N2 - We consider high performance computing infrastructures consisting of multiple sites connected over a wide-area network. These sites house heterogeneous computing systems, network elements and local-area connections, and the wide-area network plays a critical, asymmetric role of providing the vital connectivity between them. We model this infrastructure as a recursive system of systems, wherein the basic systems at the finest levels are composed of discrete cyber and physical components. These components may be disabled by cyber and physical disruptions, and their reinforcements protect against them albeit at a cost. We utilize results from a game formulation based on (i) characterizing the disruptions between systems at each level of recursion using aggregate failure correlation functions, and within basic systems using the multiplier functions, and (ii) using utility functions expressed in terms of the number of basic system components attacked and reinforced. At Nash Equilibrium, we derive expressions for the expected capacity of the infrastructure given by the number of computing nodes that are operational and connected to the network.
AB - We consider high performance computing infrastructures consisting of multiple sites connected over a wide-area network. These sites house heterogeneous computing systems, network elements and local-area connections, and the wide-area network plays a critical, asymmetric role of providing the vital connectivity between them. We model this infrastructure as a recursive system of systems, wherein the basic systems at the finest levels are composed of discrete cyber and physical components. These components may be disabled by cyber and physical disruptions, and their reinforcements protect against them albeit at a cost. We utilize results from a game formulation based on (i) characterizing the disruptions between systems at each level of recursion using aggregate failure correlation functions, and within basic systems using the multiplier functions, and (ii) using utility functions expressed in terms of the number of basic system components attacked and reinforced. At Nash Equilibrium, we derive expressions for the expected capacity of the infrastructure given by the number of computing nodes that are operational and connected to the network.
KW - Aggregated correlation function
KW - Composite utility functions
KW - Game theory
KW - High performance computing infrastructure
KW - Nash Equilibrium
KW - Networked systems
UR - http://www.scopus.com/inward/record.url?scp=85060919114&partnerID=8YFLogxK
U2 - 10.1145/3288599.3288625
DO - 10.1145/3288599.3288625
M3 - Conference contribution
AN - SCOPUS:85060919114
T3 - ACM International Conference Proceeding Series
SP - 143
EP - 147
BT - ICDCN 2019 - Proceedings of the 2019 International Conference on Distributed Computing and Networking
PB - Association for Computing Machinery
T2 - 20th International Conference on Distributed Computing and Networking, ICDCN 2019
Y2 - 4 January 2019 through 7 January 2019
ER -