Many next generation Internet architectures exist in the literature for addressing various issues like increasing traffic, mobility and efficient content dissemination. One such emerging fundamental design is Information Centric Networking (ICN). The Pending Interest Table (PIT) is one of the essential components of the ICN forwarding plane responsible for the stateful routing in ICN. Optimal size of the PIT is essential for the efficient performance of the network and the enhanced consumer experience. Therefore, the optimal sizing of the PIT under various network conditions is an important and challenging problem. To this end, this paper models the PIT of a router as a $GI/M/c/N$ queue. The model has (i) a general arrival process to accommodate the diverse nature of traffic, (ii) a service time model which takes into account the caching at the content stores and the mobility of producers, and (iii) a sojourn time distribution which is used to characterize the content delivery time at the consumers. Using the $GI/M/c/N$ queueing model, we formulate an optimization problem to minimize the PIT size while subjecting the interest drop probability to an upper bound. The accuracy of our analytical model is demonstrated using simulations on different Internet Service Provider (ISP) topologies across a wide range of system parameters.

中文翻译：

---

具有移动生产商的ICN的最佳未决利息表大小

文献中存在许多下一代Internet体系结构，用于解决各种问题，例如增加流量，移动性和有效的内容分发。这样的新兴基础设计之一就是以信息为中心的网络（ICN）。未决利益表（PIT）是ICN转发平面的重要组成部分之一，负责ICN中的状态路由。PIT的最佳大小对于网络的有效性能和增强的消费者体验至关重要。因此，在各种网络条件下优化PIT的大小是一个重要且具有挑战性的问题。为此，本文将路由器的PIT建模为 $ GI / M / c / N $ 队列。该模型具有（i）一个通用的到达过程，以适应流量的不同性质；（ii）一个服务时间模型，其中考虑了内容存储库中的缓存和生产者的移动性；以及（iii）停留时间分布，该时间用于表征消费者的内容交付时间。使用 $ GI / M / c / N $ 排队模型，我们制定了一个优化问题，以使PIT大小最小化，同时使降息概率处于上限。我们的分析模型的准确性通过在广泛的系统参数上对不同Internet服务提供商（ISP）拓扑进行仿真得到了证明。