Network data management method based on one-way parallel multiple chain lists and system thereof

Abstract

The invention discloses a network data management method based on one-way parallel multiple chain lists. The method includes the following steps: S100, receiving link flow copied by a light split device, analyzing the link flow packet by packet, and obtaining a quintuple unit of each packet; recording arrival time of each packet; S200, hashing each quintuple unit to a flow identification (ID); judging whether the current packets corresponding to the quintuple units are synthesizer (SYN) packets; S300, reading out tablebody data of the current packets from SD Ram and Block Ram; comparing the tablebody data with the quintuple units corresponding to the packets to confirm whether the packets corresponding to the quintuple units are matched with the tablebody. The network data management method based on the one-way parallel multiple chain lists and the system of the network data management method based on the one-way parallel multiple chain lists achieve packet-by-packet treatment in the flow management through a simple algorithm, effectively control inactivity timeout flow, and is high in algorithm efficiency, short in time consumption, low to cost due to the fact that field programmable gata array (FPGA) is adopted to process the core, and convenient to popularize and use.

Description

technical field [0001] The invention relates to a network data management method, in particular to a network data management method and system based on a one-way parallel multi-link list. Background technique [0002] Stream management is an important control method that can provide users with detailed information about streams and is the basis of many stream-related applications. According to the sampling method, flow management includes: packet-by-packet processing and sampling processing. Only a part of the flow is managed during sampling processing. No matter what sampling method is used, information loss will inevitably exist, which will bring loopholes in supervision. Therefore, packet-by-packet is often used in practical applications. The basic requirements for packet-by-packet processing in flow management are: the processing of each packet reaches the line speed; the information of flow management needs to be fed back to the user in time; and millions of flows are ...

AI Technical Summary

Problems solved by technology

Although arranging the doubly-linked list in time sequence is very efficient when dealing with inactive timeout streams, it increases the time consumption of the update operation, essentially decomposing the original search time when traversing the linked list into each update operation

The doubly-linked list is suitable for software processing, suitable for network processor-centered architectures, and difficult to apply to FPGA-based architectures

Images