Abstract
The paper revisits the performance evaluation of caching in a Named Data Networking (NDN) router where the content store (CS) is supplemented by a pending interest table (PIT) which aggregates requests for a given content that arrive within the download delay. We extend prior work on caching with non-zero download delay by proposing a novel mathematical framework that is applicable to general traffic models and alternative cache insertion policies. Specifically we consider the impact of time locality in demand due to finite content lifetimes and we evaluate the use of an LRU filter to improve CS hit rate performance. The analysis is used to demonstrate that the impact of the PIT on upstream bandwidth reduction is significant only for relatively small content catalogues or high average request rate per content. We also show that the filter can be counterproductive when contents have finite lifetimes and traffic intensity is low.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call