[Nfd-dev] A Light-Weight Forwarding Plane for Content-Centric Networks

[Junxiao Shi]

Dear folks

I've read CCN-DART paper.

CCN-DART eliminates the storage overhead of Pending Interest Table by
adding a "*destination-and-return token (dart)*" into every Interest and
Data packet, and use this token to identify which downstream a Data or Nack
should be returned to.
When a router forwards an Interest to an upstream, it adds a *dart* to the
Interest packet, and remember this *dart* in a DART table along with the
downstream faceId and the *dart* in the incoming Interest. When the
upstream responds with Data or Nack, the same *dart* must appear in the
Data or Nack packet, so that the router can lookup its DART, and return the
Data or Nack to the downstream face with the *dart* that is recognized by
the downstream.
The major difference from PIT is that: the lifetime of a PIT entry is
between forwarding the Interest and when the Data comes back, but the
lifetime of a DART entry is much longer: as long as there's no FIB change,
the same DART entry can serve all Interest from the same downstream face
and going toward the same producer (called "anchor" in the paper).

CCN-DART requires loop-free routing. It also contains solutions to prevent
persistent loops before routing converges, but I did not read that part.
CCN-DART assumes Interest name exactly matches Data name, although I
believe the protocol also works when Interest name is a prefix of Data name.
It seems that CCN-DART is incompatible with many forwarding strategies
because it does not keep per-Interest states.
It seems that CCN-DART cannot detect unsolicited Data because it does not
remember whether a downstream has expressed an Interest; in other words, a
malicious producer could push large amounts of unsolicited Data across the
network toward a consumer.

Yours, Junxiao

On Wed, Mar 23, 2016 at 11:57 AM, k claffy <kc at caida.org> wrote:

>
> 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)
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.lists.cs.ucla.edu/pipermail/nfd-dev/attachments/20160723/1418b145/attachment.html>