Multi-data packet file bubble sorting method

A bubble sorting and multi-packet technology, applied in electrical components, digital transmission systems, user identity/authority verification, etc., can solve problems such as huge data package files, insufficient system resources, difficult calculation and sorting, etc., and achieve high sorting efficiency , Simplify the reading process and reduce the burden

Pending Publication Date: 2022-01-21
COLASOFT
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The conventional sorting algorithm is to read the data packets into the memory, and perform standard bubble sorting according to the time of the data packets. However, due to the huge data packet files (up to nearly TB level) and insufficient system resources (memory), the calculation sorting Difficulty, unable to implement memory bubble sort

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Multi-data packet file bubble sorting method
  • Multi-data packet file bubble sorting method
  • Multi-data packet file bubble sorting method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0039] This embodiment discloses a method for bubble sorting of multi-packet files, as a basic implementation of the present invention, such as figure 1 shown, including the following steps:

[0040] S1, Preliminary reading of files: When data packets are collected, some out-of-sequence may be caused. In order to prevent the timing of partial confusion when saving data packets, all data packet files to be sorted are traversed in turn, and each data packet is read. The timestamp of the first data packet of the file (the so-called timestamp of the first data packet is specifically the timestamp of the smallest data packet in the current packet file. In order to ensure that the data packet is the smallest, it is necessary to read more Take several data packets, take the minimum value of the timestamp) and the timestamp of the last data packet (the so-called timestamp of the last data packet, specifically the timestamp of the largest data packet in the current packet file, reverse...

Embodiment 2

[0047] This embodiment discloses a method for bubble sorting multi-packet files, as a basic implementation of the present invention, that is, in Example 1, the preliminary sorting of files includes the following steps:

[0048] S21, generating several data collection channels based on the central processing unit, each data collection channel corresponds to a timeline, and the timelines corresponding to all data collection channels are parallel and equal;

[0049] S22. Read the data packet files based on each data collection channel, and sort the data packet files in each data collection channel according to the size of the time on the corresponding timeline without overlapping time periods.

[0050] S23. Store and record the sorting status of the data package files.

[0051] Such as figure 2 As shown, in a certain actual situation, the data package files to be sorted include A1 file, A2 file, B1 file, B2 file, B3 file, C1 file, C2 file and D file, and A1 file, A2 file, B1 fi...

Embodiment 3

[0053] This embodiment discloses a method for bubble sorting of multi-packet files, as a basic implementation of the present invention, that is, in Example 2, the time batch division includes the following steps:

[0054] S31, comparing the size of the start time of the first data packet file in all data acquisition channels, and selecting the corresponding position of the minimum start time to automatically generate a time node;

[0055] S32, in each data acquisition channel, a time node is automatically generated between every two adjacent data packet files;

[0056] S33, comparing the size of the end time of the last data packet file in all data acquisition channels, and selecting the corresponding position of the largest end time to automatically generate a time node;

[0057] S34, sort all the time nodes set in steps S21-S23 from small to large, and judge whether there is at least one start time of any data packet file between every two adjacent time nodes; if it exists, ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention relates to the technical field of network data packet sorting, in particular to a multi-data packet file bubble sorting method, which comprises the following steps of: preliminarily reading files, preliminarily sorting the files, dividing time batches, sequentially reading the files according to the time batches, and performing file bubble sorting in sequence. According to the technical scheme, the data messages in the data packet file are reordered completely according to real moments, so that subsequent attack behavior discovery and redisk are facilitated; in order to avoid too many file handles opened at the same time, part of files needing to be concerned are selectively opened according to batches, and resource waste caused by the file handles irrelevant to time is avoided; according to the method, the pre-reading strategy is executed for each data packet file, the participated sorting process is carried out in the memory, the sorting efficiency is high, the data packet files are recombined after being split, the sizes of the files participating in bubble sorting are limited, and a good foundation is laid for rapidly sorting and replaying the multiple data packet files.

Description

technical field [0001] The invention relates to the technical field of network data packet sorting, in particular to a method for bubble sorting multi-packet files. Background technique [0002] Generally, network attacks are divided into multiple stages, such as information collection, intrusion, vulnerability exploitation, lateral movement, etc., and the traffic generated by the attack to be accurately captured at each stage needs to be in different locations (for example: information collection in Internet egress, lateral movement in the user's internal network) captures network packets and saves them as packet files. However, if you want to reproduce the complete attack chain and study its attack methods repeatedly to take defensive measures, you need to repeatedly replay the captured data traffic (keep the timestamp of the original data packet), and The data packet file of the attack link is integrated and analyzed. [0003] Since the data packet files collected at di...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): H04L9/40H04L9/32H04L67/568H04L49/9057
CPCH04L63/1441H04L9/3297H04L49/9057H04L2463/121
Inventor 徐文勇田红伟王伟旭
Owner COLASOFT
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap