TY - GEN
T1 - Cost efficient design of survivable virtual infrastructure to recover from facility node failures
AU - Yu, Hongfang
AU - Anand, Vishal
AU - Qiao, Chunming
AU - Sun, Gang
PY - 2011
Y1 - 2011
N2 - As network virtualization becomes popular, the problem of efficiently mapping a virtual infrastructure (VI) over a substrate network while guaranteeing its survivability in the event of failures becomes increasingly important. In this paper, we study the survivable VI mapping problem to recover from facility node failures. We develop two solutions namely the 1-redundant scheme and the K-redundant scheme for surviving facility node failures while minimizing network resource costs. We also model the two schemes as a MILP problem and propose efficient heuristics based on the MILP formulations. We compare the efficiency of our solutions using simulation under various performance metrics.
AB - As network virtualization becomes popular, the problem of efficiently mapping a virtual infrastructure (VI) over a substrate network while guaranteeing its survivability in the event of failures becomes increasingly important. In this paper, we study the survivable VI mapping problem to recover from facility node failures. We develop two solutions namely the 1-redundant scheme and the K-redundant scheme for surviving facility node failures while minimizing network resource costs. We also model the two schemes as a MILP problem and propose efficient heuristics based on the MILP formulations. We compare the efficiency of our solutions using simulation under various performance metrics.
UR - https://www.scopus.com/pages/publications/80052179412
U2 - 10.1109/icc.2011.5962604
DO - 10.1109/icc.2011.5962604
M3 - Conference contribution
AN - SCOPUS:80052179412
SN - 9781612842332
T3 - IEEE International Conference on Communications
BT - 2011 IEEE International Conference on Communications, ICC 2011
T2 - 2011 IEEE International Conference on Communications, ICC 2011
Y2 - 5 June 2011 through 9 June 2011
ER -