TY - GEN
T1 - Cloud computing infrastructure robustness
T2 - 2012 International Conference on Computing, Networking and Communications, ICNC'12
AU - Rao, Nageswara S.V.
AU - Poole, Stephen W.
AU - He, Fei
AU - Zhuang, Jun
AU - Ma, Chris Y.T.
AU - Yau, David K.Y.
PY - 2012
Y1 - 2012
N2 - A cloud computing infrastructure typically consists of a number of sites that house servers and are connected to the Internet. Its operation critically depends both on cyber components, including servers and routers, and physical components, including fiber and power routes. Both types of components are subject to attacks of different kinds and frequencies, which must be accounted for the initial provisioning and subsequent operation of the infrastructure. The cyber and physical components may be individually attacked and defended, and the infrastructure is required to provide an aggregate computational capacity C. We present a game-theoretic approach for the provisioning and operation of the infrastructure under uniform cost models. We first show that the Nash Equilibrium under different formulations to be computable in polynomial time, and derive provisioning choices to ensure the capacity C with probability P S. Then, we derive conditions for reinforcing the infrastructure, and show that higher robustness levels are achieved by limiting the disclosure of information about the infrastructure.
AB - A cloud computing infrastructure typically consists of a number of sites that house servers and are connected to the Internet. Its operation critically depends both on cyber components, including servers and routers, and physical components, including fiber and power routes. Both types of components are subject to attacks of different kinds and frequencies, which must be accounted for the initial provisioning and subsequent operation of the infrastructure. The cyber and physical components may be individually attacked and defended, and the infrastructure is required to provide an aggregate computational capacity C. We present a game-theoretic approach for the provisioning and operation of the infrastructure under uniform cost models. We first show that the Nash Equilibrium under different formulations to be computable in polynomial time, and derive provisioning choices to ensure the capacity C with probability P S. Then, we derive conditions for reinforcing the infrastructure, and show that higher robustness levels are achieved by limiting the disclosure of information about the infrastructure.
UR - http://www.scopus.com/inward/record.url?scp=84859902392&partnerID=8YFLogxK
U2 - 10.1109/ICCNC.2012.6167441
DO - 10.1109/ICCNC.2012.6167441
M3 - Conference contribution
AN - SCOPUS:84859902392
SN - 9781467300094
T3 - 2012 International Conference on Computing, Networking and Communications, ICNC'12
SP - 34
EP - 38
BT - 2012 International Conference on Computing, Networking and Communications, ICNC'12
Y2 - 30 January 2012 through 2 February 2012
ER -