Flow Migration on Multicore Network Processors: Load Balancing While Minimizing Packet Reordering

Abstract

Abstract-With ever increasing network traffic rates, multicore architectures for network processors have successfully provided performance improvements through high parallelism. However, naively allocating the network traffic to multiple cores without considering diversified application nature and flow locality results in issues such as packet reordering, load imbalance and inefficient cache usage. Consequently, these issues degrade the performance of latency sensitive network processors by dropping packets or delivering packets out of order. In this paper, we propose a packet scheduling scheme that considers the multiple dimensions of locality to improve the throughput of a network processor while minimizing out of order packets. Our scheduling policy tries to maintain packet order by maintaining the flow locality, minimizes the migration of flows from one core to another by identifying the aggressive flows, and partitions the cores among multiple services to gain instruction cache locality. The scheduler uses a novel low cost two-level caching scheme to identify top aggressive flows. Our light weight hardware implementation shows improvement of 60% in the number of packets dropped and 80% improvement in the out-of-order packet deliveries over previously proposed techniques.

Packet Reordering in the Era of 6G: Techniques, Challenges, and Applications

“…They allocate a unique mapping table for each service, use incremental hashing for scheduling, identify the highest data rate flow, and dynamically migrate scheduling. This approach effectively avoids packet reordering while maintaining synchronization between flow positions and cache positions, leading to improved network performance [62]. Another study proposes a method that sets buffers at the output ports of switches and adopts sorting strategies for per-hash groups.…”