One of the key enablers of the digital society is a highly reliable information infrastructure that can ensure resiliency to a wide range of failures and attacks. In cloud networks, replicas of various content are located at geographically distributed data centers, thus inherently enhancing cloud network reliability through diversification and redundancy of user accessibility to the content. However, cloud networks rely on optical network infrastructure which can be a target of deliberate link cuts that may cause service disruption on a massive scale. This paper investigates the dependency between the extent of damage caused by link cuts and a particular replica placement solution, as a fundamental prerequisite of resilient cloud network design that lacks systematic theoretical quantification and understanding. To quantify the vulnerability of optical cloud networks based on anycast communication to targeted link cuts, we propose a new metric called Average Content Accessibility (ACA). Using this metric, we analyze the impact of the number and the placement of content replicas on cloud network resiliency and identify the best and the worst case scenarios for networks of different sizes and connectivity. We evaluate the efficiency of simultaneous and sequential targeted link cuts, the latter reassessing link criticality between subsequent cuts to maximize disruption. Comparison with Average Two-Terminal Reliability (A2TR), an existing robustness measure for unicast networks, shows great discrepancy in the vulnerability results, indicating the need for new measures tailored to anycast-based networks.
[1]
Ian H. Witten,et al.
Data mining - practical machine learning tools and techniques, Second Edition
,
2005,
The Morgan Kaufmann series in data management systems.
[2]
Zsigmond Szilárd,et al.
Physical-layer security in evolving optical networks
,
2016,
IEEE Communications Magazine.
[3]
Paulo P. Monteiro,et al.
Compact Models for Critical Node Detection in Telecommunication Networks
,
2018,
Electron. Notes Discret. Math..
[4]
Antoine Dutot,et al.
GraphStream: A Tool for bridging the gap between Complex Systems and Dynamic Graphs
,
2008,
ArXiv.
[5]
Suresh Rai,et al.
Distributed Computing Network Reliability
,
1990
.
[6]
Massimo Marchiori,et al.
Error and attacktolerance of complex network s
,
2004
.
[7]
J. M. Simmons,et al.
Optical Network Design and Planning
,
2008
.
[8]
T. Killingback,et al.
Attack Robustness and Centrality of Complex Networks
,
2013,
PloS one.
[9]
Jacek Rak,et al.
Reliable anycast and unicast routing: protection against attacks
,
2013,
Telecommun. Syst..
[10]
Matthew Roughan,et al.
The Internet Topology Zoo
,
2011,
IEEE Journal on Selected Areas in Communications.
[11]
José-Luis Marzo,et al.
Robustness Comparison of 15 Real Telecommunication Networks: Structural and Centrality Measurements
,
2016,
Journal of Network and Systems Management.
[12]
C. Pavan,et al.
How reliable are the real-world optical transport networks?
,
2015,
IEEE/OSA Journal of Optical Communications and Networking.