In control-plane of optical packet forwarding engines (OPFEs), the group-membership query algorithm determines the egress through which a packet should be forwarded. To implement a high-performance multicast-enabled switch/router, a super-fast group-membership query algorithm is the key element within the PFEs which require the following essential properties: high link-bandwidth, high port-density, high forwarding speed, high scalability, and affordable cost. Current group-membership query approaches such as Bloom filter (BF) and Scalar-Pair Vectors Routing and Forwarding (SVRF) still suffer from serious weaknesses in terms of the space/time inefficiency, false-positive error, and low maintainability, etc. To accommodate these weaknesses, we propose an improved forwarding scheme–M-way Scaler-matrix and Vectors Routing and Forwarding (M-way SVRF) by re-examining the idea of the original SVRF. The M-way SVRF divides a ρ-bit port identifier into M-sub-blocks in the memory unit, thus element's keys belonging to distinct sub-blocks are able to reuse relatively smaller identical prime keys. Compared to previous works, simulation results show that the membership queries can be partitioned to leverage task parallelism, and better performance in the aspects of memory consumption and computational complexity, especially when the port-density of optical PFE is sufficiently high.

在光包转发引擎 (OPFE) 的控制平面中，组成员查询算法确定应通过其转发包的出口。为了实现高性能的多播交换机/路由器，超快速组成员查询算法是 PFE 中的关键元素，它需要以下基本属性：高链路带宽、高端口密度、高转发速度、高可扩展性和可承受的成本。当前的组成员查询方法，如布隆过滤器（BF）和标量对向量路由转发（SVRF），在空间/时间效率低、误报错误和可维护性低等方面仍然存在严重缺陷。为了适应这些弱点，我们提出了一种改进的转发方案——M-way Scaler-matrix and Vectors Routing and Forwarding ( M -way SVRF) 通过重新审视原始 SVRF 的思想。M-way SVRF将一个ρ位端口标识符划分为内存单元中的M个子块，因此属于不同子块的元素的密钥能够重用相对较小的相同主密钥。与以往的工作相比，仿真结果表明，可以对成员查询进行分区以利用任务并行性，并在内存消耗和计算复杂度方面具有更好的性能，特别是当光学 PFE 的端口密度足够高时。