Per-application in-memory storage¶

Many NDN applications need to publish data packets. A data packet may have a FreshnessPeriod which indicates how long a node (local fowarders and routers) should wait after the arrival of this data before marking it as stale. As stated in NDN-TLV spec:

Note that the stale data is still valid data; the expiration of FreshnessPeriod only means that the producer may have produced newer data.

The inconsistency between the actually validity of a data packet and its FreshnessPeriod comes from the unpredictability of the future.
In some cases, the data producer cannot predict when a data packet will be replaced by a new version of data packet.
One extreme solution is to set FreshnessPeriod of the unpredictable data packet to 0,
so that whenever the data is request, the interest will be forwarded to the original producer to check whether a new version of data packet has been generated or not.

Fortunately, some data packets are relatively static (i.e., it occasionally changes) and can benefit from network caching.
The FreshnessPeriod becomes a tradeoff between network caching and data freshness.
As a result, during the FreshnessPeriod, the producer will not be bothered by interests for the same data packet.
However, after the FreshnessPeriod, when all the cached copies become stale, the producer should be prepared to receive the interests again.
If, at that time, the data is still valid, the producer should return the same data packet to refresh the cached copies.

It seems that it is beneficial to keep a copy of the valid data packet at the producer side, otherwise the producer has to generate/sign the data packet again and again.
The copy of the valid data packet cannot be stored in the ContentStore of local nfd, because current ContentStore can only tell fresh or stale data, but cannot tell valid or invalid data.
Instead, it is better to provide the storage inside the app, i.e., in-memory storage.

We list several use cases of the in-memory storage.

Use cases¶

PIB Service¶

PIB provides the public information about identities, keys, and certificates.
For example, one may ask PIB for the system default key.
And PIB's reply should be valid until the system default key is changed.
Since PIB cannot predict when the system default key will be changed,
it is more reasonable to set a relatively short FreshnessPeriod for the reply.
As a result, after every FreshnessPeriod, PIB may receive an interest for the system default key, because the cached copy in ContentStore is marked as stale.

In this case, PIB can benefit from the in-memory storage.
By putting the reply into the in-memory storage, PIB can avoid repeatedly generating the same data packet.

Nack¶

When the producer want to explicitly tell consumer some data does not exist for now, it may use the nack data.
However, the producer may not know when the requested data will be generated.
With the same logic, the producer can generate a nack data with short FreshnessPeriod,
and put it into the in-memory storage to avoid repeatedly generating the same nack.
When the requested data has been generated, the producer can replace the nack with the new data in the in-memory storage.

ChronoChat¶

For chatroom discovery, each chatroom needs to publish the chatroom-info data.
Chatroom-info must have finite FreshnessPeriod, so that after FreshnessPeriod, the chatroom-refresh interest will reach one of the chatroom participants.
If the chatroom-info has not changed yet, it is not necessary to generate a new chatroom-info data.

The FreshnessPeriod of a chat message can be set to infinite. However, ContentStore may not guarantee to keep all the chat messages even if they are fresh.
An in-memory storage can help here as a guaranteed storage as long as the process is running.

NLSR¶

NLSR LSA is the same as ChronoChat chat message.

Design Goal¶

The goal of InMemoryStorage is to allow an application instance to keep a copy of valid data packets in its own memory.
The InMemoryStorage is useful in two general cases:

• when data packets have been generated without incoming interest;
• when the lifetime of a data packet is longer than the FreshnessPeriod of the data packet.

For an application that may run into either of the two cases, it can create an InMemoryStorage instance within itself
and insert the data packets into the InMemoryStorage.
When the app receives an incoming interest, the app may first look up matched data packet in the InMemoryStorage to avoid generating the same data packet again.

Data packets in an InMemoryStorage is explicitly managed by the app.
A data packet can be either inserted into or erased from the InMemoryStorage.
In other words, the only way to change a data packet in an InMemoryStorage is to erase the data packet from the InMemoryStorage.

Although ideally, the InMemoryStorage should find a data packet that can match the incoming interest,
the actual matching procedure can be simpler, i.e., the InMemoryStorage may not need to handle selectors.
The reason behind this is that the app, as the data producer, should know what is the most appropriate data packet to return.
Therefore, among five types of selectors that have been defined for interest packet, some of them can be ignored

• MustBeFresh: the app, as the end of the interest forwarding path, should always return the data packet that is currently valid.
• ChildSelector: rightmost child selector is usually used to retrieve the latest version of the data packet, so if the app can guarantee that only the latest version of the data packet exists in the InMemoryStorage, rightmost child selector is not needed. The default behavior of InMemoryStorage is to find the leftmost child.
• :

Looking up a data packet in InMemoryStorage is done by pure longest name prefix matching.
When there are more matched data packets, the first one in canonical order will be returned.

An InMemoryStorage instance is created within an application instance, and is destroyed when the application instance ends.
Therefore, the lifetime of the InMemoryStorage instance is no longer than the lifetime of the application instance.
The data packets stored in the InMemoryStorage will also be eliminated if the data packets are not backed up in some persistent storage (e.g., hard disk, repo, etc.) before the InMemoryStorage is destroyed.

This implies that a data packet is uniquely identified by its name and implicit digest,
so that a data packet in InMemoryStorage cannot be overwritten by another data packet with the same name.

Whether selectors should be processed is still in discussion.
For now, among the five selectors, four are not needed

Interface¶

Core Methods¶

The core methods of InMemoryStorage is defined as:

class InMemoryStorage 
{
  void 
  insert(const Data& data);

  void 
  erase(const Name& prefix);

  shared_ptr<const Data> 
  find(const Name& name);

  // not supported for now
  // shared_ptr<const Data> 
  // find(const Interest& interest);
};

insert¶

Once a data is inserted into InMemoryStorage, it will stay in the storage

erase¶

find¶

Helper Methods¶

Reference¶

There is another type of local storage, which is different from in-memory storage, called Managed ContentStore