Failure-Aware Protection for Many-to-Many Routing in Content Centric Networks

Network communications can easily be disrupted by the failure of networking equipment, ranging from a single accidental link cut, to a wide swath of links and nodes wiped out simultaneously by a natural disaster. To mitigate the impact of these failures, survivability solutions involving precomputed backup paths can be used to help maintain connectivity and reduce service downtime. Further improvements to reliability can be gained through the use of on-path caching inherent in Content Centric Networking (CCN). CCN is an alternative networking paradigm that puts the focus on efficiently providing consumers access over the network to content held by producers. As content is returned from a producer, it can be cached at the intermediate routers, allowing that content to be replicated and forwarded out to all known consumers asking for that content. We aim to improve the reliability of CCN by proposing routing algorithms for connecting many consumers to a set of producers with paths that are survivable in respect to a flexibly-sized failure set. These survivable routes are enhanced through the use of failure aware on-path caching that allows consumers to access content even after the primary connections to producers are severed.

[1]  Alexis Kwasinski,et al.  Effects of Hurricanes Isaac and Sandy on Data and Communications Power Infrastructure , 2013 .

[2]  Julia Kastner,et al.  Survivable Networks Algorithms For Diverse Routing , 2016 .

[3]  Phuong Luu Vo,et al.  The performance of caching strategies in content centric networking , 2017, 2017 International Conference on Information Networking (ICOIN).

[4]  David Hutchison,et al.  Resilience and survivability in communication networks: Strategies, principles, and survey of disciplines , 2010, Comput. Networks.

[5]  D. Habibi,et al.  K Pairs of Disjoint Paths Algorithm for Protection in WDM Optical Networks , 2005, 2005 Asia-Pacific Conference on Communications.

[6]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[7]  J. Cheriyan,et al.  Approximation algorithms for minimum-cost k-( S , T ) connected digraphs , 2010 .

[8]  G. Ellinas,et al.  Protection of multicast sessions in WDM mesh optical networks , 2005, OFC/NFOEC Technical Digest. Optical Fiber Communication Conference, 2005..

[9]  Gil Zussman,et al.  Network vulnerability to single, multiple, and probabilistic physical attacks , 2010, 2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE.

[10]  Robert E. Tarjan,et al.  A quick method for finding shortest pairs of disjoint paths , 1984, Networks.

[11]  Morteza Karimzadeh,et al.  Utilizing ICN/CCN for Service and VM Migration Support in Virtualized LTE Systems , 2014, CLOSER.

[12]  J. Y. Yen,et al.  Finding the K Shortest Loopless Paths in a Network , 2007 .

[13]  Ahmed E. Kamal,et al.  Dynamic Provisioning of Optical Networks with Many-to-Many Traffic Grooming , 2010, 2010 Proceedings of 19th International Conference on Computer Communications and Networks.

[14]  T. Lindvall ON A ROUTING PROBLEM , 2004, Probability in the Engineering and Informational Sciences.

[15]  Yuan Cao,et al.  Groupcast in Wavelength-Routed WDM Networks , 2006, Journal of Lightwave Technology.

[16]  Min Wook Kang,et al.  An opportunistic forwarding scheme for ICN in disaster situations , 2017, 2017 International Conference on Information and Communication Technology Convergence (ICTC).

[17]  Chuang Lin,et al.  Content delivery networks: a bridge between emerging applications and future IP networks , 2010, IEEE Network.

[18]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[19]  Georgios Ellinas,et al.  Protection algorithms for groupcast sessions in transparent optical networks with mesh topologies , 2013, 2013 17th International Conference on Optical Networking Design and Modeling (ONDM).

[20]  Abdelhamid Mellouk,et al.  Performance Analysis of Caching and Forwarding Strategies in Content Centric Networking , 2017, GLOBECOM 2017 - 2017 IEEE Global Communications Conference.