A Practical Packet Reordering Mechanism with Flow Granularity for Parallelism Exploiting in Network Processors

Authors:
Beibei Wu;Yang Xu;Hongbin Lu;Bin Liu
Affiliations:
Tsinghua University, Beijing, P.R. China;Tsinghua University, Beijing, P.R. China;Tsinghua University, Beijing, P.R. China;Tsinghua University, Beijing, P.R. China
Venue:
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03
Year:
2005

Citing 1
Cited 2

Packet reordering is not pathological network behavior

IEEE/ACM Transactions on Networking (TON)

Sequence-preserving parallel IP lookup using multiple SRAM-based pipelines

Journal of Parallel and Distributed Computing
A hardware packet re-sequencer unit for network processors

ARCS'08 Proceedings of the 21st international conference on Architecture of computing systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Network processors (NP) are usually designed to exploit packet level parallelism where system throughput is aggregated by multiple CPU cores. A serious problem in such a system is Packet Disordering (PD), which may deteriorate network performance greatly. To address the PD problem, a practical reordering mechanism is put forward in this paper. Different from the traditional reordering methods such as in ATM networks, it uses a centralcontrolled chain-based mechanism to implement packet reordering with flow granularity. We verify it in FPGA and carry out a series of experiments, where the results show that system throughput can be influenced greatly by traffic patterns. We also demonstrate that the reordering with flow granularity is quite requisite in NP, which can increase the system throughput to a great extent compared to the conventional method with global granularity.