A fault-tolerant forwarding strategy for interest-based information centric networks

We show that the forwarding strategies in the named data networking (NDN) architecture and the original content centric networking (CCN) architecture cannot ensure that Interests return the requested data objects when routing-table loops exist in a stable or dynamic network. We also show that no correct Interest forwarding strategy that allows Interest aggregation can be designed solely on the basis of identifying Interests uniquely in order to detect Interest loops. We introduce SIFAH (Strategy for Interest Forwarding and Aggregation with Hop-Counts). SIFAH prevents or detects Interest loops when Interests are aggregated or forwarded over one or multiple paths. As a result, it is far more efficient than the forwarding strategy in NDN and the original CCN proposal. SIFAH operates by having forwarding information bases (FIB) store the next hops and number of hops to named content prefixes, and by using Interests that state the names of requested content and hop counts that reflect the information in their FIBs.

[1]  J. J. Garcia-Luna-Aceves,et al.  Name-based content routing in information centric networks using distance information , 2014, ICN '14.

[2]  Syed Obaid Amin,et al.  NLSR: named-data link state routing protocol , 2013, ICN '13.

[3]  Van Jacobson,et al.  Networking named content , 2009, CoNEXT '09.

[4]  Tracy Camp,et al.  A taxonomy of distributed termination detection algorithms , 1998, J. Syst. Softw..

[5]  J. J. Garcia-Luna-Aceves.  Efficient multi-source multicasting in Information Centric Networks , 2015, 2015 12th Annual IEEE Consumer Communications and Networking Conference (CCNC).

[6]  J. J. Garcia-Luna-Aceves,et al.  A unified approach to loop-free routing using distance vectors or link states , 1989, SIGCOMM '89.

[7]  Nikos Fotiou,et al.  A Survey of Information-Centric Networking Research , 2014, IEEE Communications Surveys & Tutorials.

[8]  Edsger W. Dijkstra,et al.  Termination Detection for Diffusing Computations , 1980, Inf. Process. Lett..

[9]  J. J. Garcia-Luna-Aceves,et al.  A Protocol for Scalable Loop-Free Multicast Routing , 1997, IEEE J. Sel. Areas Commun..

[10]  Bengt Ahlgren,et al.  A survey of information-centric networking , 2012, IEEE Communications Magazine.

[11]  Alexander Afanasyev,et al.  Adaptive forwarding in named data networking , 2012, CCRV.

[12]  Hamid R. Sadjadpour,et al.  ICEMAN: A System for Efficient, Robust and Secure Situational Awareness at the Network Edge , 2013, MILCOM 2013 - 2013 IEEE Military Communications Conference.

[13]  J. J. Garcia-Luna-Aceves,et al.  Understanding optimal caching and opportunistic caching at "the edge" of information-centric networks , 2014, ICN '14.

[14]  A. J. M. van Gasteren,et al.  Derivation of a Termination Detection Algorithm for Distributed Computations , 1983, Inf. Process. Lett..

[15]  Al Morton,et al.  Standardized active measurements on a tier 1 IP backbone , 2003, IEEE Commun. Mag..

[16]  J. J. Garcia-Luna-Aceves,et al.  Dynamics of distributed shortest-path routing algorithms , 1991, SIGCOMM '91.

[17]  J. J. Garcia-Luna-Aceves,et al.  A simple approximation to minimum-delay routing , 1999, SIGCOMM '99.

[18]  Alexander Afanasyev,et al.  journal homepage: www.elsevier.com/locate/comcom , 2022 .

[19]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[20]  J. J. Garcia-Luna-Aceves,et al.  Robust content dissemination in disrupted environments , 2008, CHANTS '08.

[21]  Patrick Crowley,et al.  Named data networking , 2014, CCRV.