[Nfd-dev] two relevant papers from jj

k claffy kc at caida.org
Wed Mar 23 11:57:41 PDT 2016

Title: Enabling Correct Interest Forwarding and Retransmissions in a Content
  Centric Network
Authors: J.J. Garcia-Luna-Aceves, Maziar Mirzazad-Barijough
Categories: cs.NI
  We show that the mechanisms used in the name data networking (NDN) and the
original content centric networking (CCN) architectures may not detect Interest
loops, even if the network in which they operate is static and no faults occur.
Furthermore, we show that no correct Interest forwarding strategy can be
defined that allows Interest aggregation and attempts to detect Interest
looping by identifying Interests uniquely. We introduce SIFAH (Strategy for
Interest Forwarding and Aggregation with Hop-Counts), the first Interest
forwarding strategy shown to be correct under any operational conditions of a
content centric network. SIFAH operates by having forwarding information bases
(FIBs) store the next hops and number of hops to named content, and by having
each Interest state the name of the requested content and the hop count from
the router forwarding an Interest to the content. We present the results of
simulation experiments using the ndnSIM simulator comparing CCN and NDN with
SIFAH. The results of these experiments illustrate the negative impact of
undetected Interest looping when Interests are aggregated in CCN and NDN, and
the performance advantages of using SIFAH.
\\ ( http://arxiv.org/abs/1603.06012 ,  657kb)
Date: Sat, 19 Mar 2016 04:03:01 GMT   (4155kb,D)

Title: A Light-Weight Forwarding Plane for Content-Centric Networks
Authors: J.J. Garcia-Luna-Aceves, Maziar Mirzazad-Barijough
Categories: cs.NI
  We present CCN-DART, a more efficient forwarding approach for content-centric
networking (CCN) than named data networking (NDN) that substitutes Pending
Interest Tables (PIT) with Data Answer Routing Tables (DART) and uses a novel
approach to eliminate forwarding loops. The forwarding state required at each
router using CCN-DART consists of segments of the routes between consumers and
content providers that traverse a content router, rather than the Interests
that the router forwards towards content providers. Accordingly, the size of a
DART is proportional to the number of routes used by Interests traversing a
router, rather than the number of Interests traversing a router. We show that
CCN-DART avoids forwarding loops by comparing distances to name prefixes
reported by neighbors, even when routing loops exist. Results of simulation
experiments comparing CCN-DART with NDN using the ndnSIM simulation tool show
that CCN-DART incurs 10 to 20 times less storage overhead.
\\ ( http://arxiv.org/abs/1603.06044 ,  4155kb)

More information about the Nfd-dev mailing list