Multicast is an efficient way to realize one-to-many group communications in large-scale networks such as the Internet. However, the deployment of IP multicast services over the Internet has not been as rapid as expected and needed. Excepting the fatal defects in designing IPv4 address structure. Another main reason that contributes to this slow deployment is the lack of carrier-grade multicast-enabled switches and routers that can be as to scale as their unicast counterparts. Implementing a high-performance switch/router relies on a polynomial-time group membership query algorithm within the Packet Forwarding Engines (PFEs) to determine whether or not a packet is forwarded through an egress. Among these, Bloom filter (BF)-based and Residue Number System (RNS)-based are being considered as two representations of the membership query algorithms. However, both approaches suffer from some fatal weaknesses such as space and time inefficiencies, especially for a carrier-grade PFE with high port-density features. According to similar properties of the prime theorem, we propose a simplified forwarding scheme in this paper, named Per-Port Prime Filter Array (P3FA). The simulation results indicate that the P3FA can significantly improve space efficiencies under specific lower egress-diversities conditions. Under the same space constraints, compared with the SVRF, the multicast time efficiencies, the unicast time efficiency of the P3FA are respectively increased by 12x-17234x and 19x-2038x at a range of port-densities 16-1024, but at the expense of hardware cost, which increased by \r{ho}/2x. A PFE designer that attempts to adopt P3FA should trade-off between required performance and cost.

中文翻译：

---

P3FA：具有低出口多样性的统一单播/多播转发

组播是在 Internet 等大规模网络中实现一对多组通信的有效方式。然而，在 Internet 上部署 IP 多播服务并没有像预期和需要的那样迅速。排除设计IPv4地址结构的致命缺陷。导致这种缓慢部署的另一个主要原因是缺乏支持多播的运营商级交换机和路由器，这些交换机和路由器可以像其单播对应物一样扩展。实现高性能交换机/路由器依赖于数据包转发引擎 (PFE) 内的多项式时间组成员资格查询算法来确定数据包是否通过出口转发。其中，基于布隆过滤器（BF）和基于残差数系统（RNS）被认为是成员查询算法的两种表示。然而，这两种方法都存在一些致命的弱点，例如空间和时间效率低下，特别是对于具有高端口密度特性的运营商级 PFE。根据素数定理的类似性质，我们在本文中提出了一种简化的转发方案，命名为每端口素数滤波器阵列（P3FA）。仿真结果表明，在特定的较低出口多样性条件下，P3FA 可以显着提高空间效率。在相同的空间约束下，与SVRF相比，P3FA的组播时间效率、单播时间效率分别提高了12x-17234x和19x-2038x，端口密度为16-1024，但代价是硬件成本，增加了 \r{ho}/2x。尝试采用 P3FA 的 PFE 设计人员应该在所需的性能和成本之间进行权衡。这两种方法都存在一些致命的弱点，例如空间和时间效率低下，特别是对于具有高端口密度特性的运营商级 PFE。根据素数定理的类似性质，我们在本文中提出了一种简化的转发方案，命名为每端口素数滤波器阵列（P3FA）。仿真结果表明，在特定的较低出口多样性条件下，P3FA 可以显着提高空间效率。在相同的空间约束下，与SVRF相比，P3FA的组播时间效率、单播时间效率分别提高了12x-17234x和19x-2038x，端口密度为16-1024，但代价是硬件成本，增加了 \r{ho}/2x。尝试采用 P3FA 的 PFE 设计人员应该在所需的性能和成本之间进行权衡。这两种方法都存在一些致命的弱点，例如空间和时间效率低下，特别是对于具有高端口密度特性的运营商级 PFE。根据素数定理的类似性质，我们在本文中提出了一种简化的转发方案，命名为每端口素数滤波器阵列（P3FA）。仿真结果表明，在特定的较低出口多样性条件下，P3FA 可以显着提高空间效率。在相同的空间约束下，与SVRF相比，P3FA的组播时间效率、单播时间效率分别提高了12x-17234x和19x-2038x，端口密度为16-1024，但代价是硬件成本，增加了 \r{ho}/2x。尝试采用 P3FA 的 PFE 设计人员应该在所需的性能和成本之间进行权衡。