K-content connectivity in data center networks

We define k-content connectivity as the reachability of at least one content from any point of a data center network under concurrent k-1 failures. A flexible content placement algorithm is proposed to achieve k-content connectivity.

[1]  M. Newman,et al.  Fast Approximation Algorithms for Finding Node-Independent Paths in Networks , 2001 .

[2]  Wanyi Gu,et al.  k-regular and k-(edge)-connected protection structures in optical transport networks , 2013, 2013 Optical Fiber Communication Conference and Exposition and the National Fiber Optic Engineers Conference (OFC/NFOEC).

[3]  M. Farhan Habib,et al.  Fault-tolerant virtual network mapping to provide Content Connectivity in optical networks , 2013, 2013 Optical Fiber Communication Conference and Exposition and the National Fiber Optic Engineers Conference (OFC/NFOEC).

[4]  M. Tornatore,et al.  Design of Disaster-Resilient Optical Datacenter Networks , 2012, Journal of Lightwave Technology.

[5]  Biswanath Mukherjee,et al.  A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks , 1996, IEEE J. Sel. Areas Commun..

[6]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[7]  Biswanath Mukherjee,et al.  Disaster-aware dynamic content placement in optical cloud networks , 2014, OFC 2014.