Mathematical Models for Network Card Packet Buffering Simulation

Objectives: Current network card buffer optimizations are focusing on optimal configuration of transmission's sender with singular buffer. However, there exists receiver-oriented network card module with multiple buffers. In our research, we mirrored PF_RING, which alters the traditional packet processing that requires copying the packets to application space. Methods/Statistical Analysis: PF_RING provides buffers for higher layer applications to access packets directly. Findings: Each buffer's capacity, transmission size, packet size, number of packets, and number of applications give raise to the question on the number of buffers required, because it affects the duration of packets read by the applications. Optimal number of buffers is therefore needed to generate minimum packet reading duration of the applications. Application/Improvements: We propose mathematical models to represent the simulation of packet buffering in a multibuffer receiver's network card. Our simulation models are used to determine the optimal number of buffers for specific network transmission with distinct properties, which include transmission size, packet size, and number of packets.

[1]  Lei Gao,et al.  A Dynamic Round-Robin Packet Scheduling Algorithm , 2013 .

[2]  Reuven Cohen,et al.  A Dynamic Approach for Efficient TCP Buffer Allocation , 2002, IEEE Trans. Computers.

[3]  Rainer Leupers,et al.  Optimized buffer allocation in multicore platforms , 2014, 2014 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[4]  Abhijit S. Pandya,et al.  Buffer allocation optimization in ATM switching networks using ALOPEX algorithm , 1999, Neurocomputing.