CN107749828A - IP packet deliveries acquisition method, device, terminal device and storage medium - Google Patents
IP packet deliveries acquisition method, device, terminal device and storage medium Download PDFInfo
- Publication number
- CN107749828A CN107749828A CN201710927157.2A CN201710927157A CN107749828A CN 107749828 A CN107749828 A CN 107749828A CN 201710927157 A CN201710927157 A CN 201710927157A CN 107749828 A CN107749828 A CN 107749828A
- Authority
- CN
- China
- Prior art keywords
- data
- lock
- packet
- queue
- transient node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/622—Queue service order
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/6245—Modifications to standard FIFO or LIFO
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/16—Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
Abstract
The present invention discloses a kind of IP packet deliveries acquisition method, comprises the following steps, S0：Lock-free queue initializes；S1：IP data acquisitions；S2：IP data distributions；S3：IP digital independents and reduction.A kind of device, including：Initialization module：Initialized for lock-free queue；Data acquisition module：For IP data acquisitions；Data distribution module：For IP data distributions；Data restoring module：For IP digital independents and reduction.A kind of terminal device, including memory, processor and the computer program that can be run in the memory and on the processor is stored in, the step of IP packet deliveries collection is realized described in the computing device during computer program.The present invention has been decoupled the handling process of data acquisition and data flow reduction, while the effectively number of reduction one process processing data stream, has been improved Data Stream Processing efficiency and reduce data flow in the holding time of internal memory so as to reduce internal memory loss by device.
Description
Technical field
The present invention relates to big data processing technology field, specifically a kind of IP packet deliveries acquisition method, device, terminal
Equipment and storage medium.
Background technology
With the quick popularization of internet, various data are with the explosive increase of geometry level, in the big data epoch, how
The inside Quick Acquisition restoring data stream turns into a big hot topic technology under big flow.
Data flow collection is often one process collection, need to safeguard substantial amounts of thread pool, to safeguard substantial amounts of session among this
With the stationary problem of each thread, internal memory loss or performance bottleneck are easily caused.
The content of the invention
In order to solve the above problems, the present invention provides a kind of IP packet deliveries acquisition method, device, terminal device and deposited
Storage media, the pressure of stream reduction capture program can be reduced, is quickly analyzed and processed IP messages in the angle of application layer, shape
Line up into similar RSS more and be symmetrical, be distributed to different processes and carry out data classification processing, utilize the money of operating system
Source is allocated, and reduces the session number and Thread Count and then reduction EMS memory occupation, the ability for improving data acquisition of each process.
A kind of IP packet deliveries acquisition method of the present invention, comprises the following steps：
S0：Lock-free queue initializes：A shared section key is opened up, N number of parallel lock-free queue is created in shared section key,
For IP packet deliveries, wherein N is 2n, into S1 steps；
S1：IP data acquisitions：IP packet P are gathered, parsing P obtains four-tuple, and HASH-Id, root are calculated according to four-tuple
It is X to obtain modulus value to N number of lock-free queue modulus according to HASH-Id, and wherein X obtaining value method can ensure the homologous chummage of data,
Into S2 steps；
S2：IP data distributions：P is sent to lock-free queue X with the mode of batch transmission, into S3 steps；
S3：IP digital independents and reduction：N number of stream reduction process is initialized, each process individually depends on a lock-free queue
X, formed without lock concurrent operations, then carry out digital independent and reduction.
Further, in S0 steps, lock-free queue uses Kfifo data structures, is the internal storage structure of an annular.
Further, in S1 steps, four-tuple is source ip, place ip, source port and egress mouth.
Further, in S1 steps, HASH-Id obtains X using equation below value：X=(saddr^daddr^
SourcePort^destPort) ＆ (N-1), wherein, saddr is source ip, and daddr is place ip, and sourcePort is source port,
DestPort is egress mouth, and N is queue number, and it is arranged to 2 n powers, and X is that four-tuple carries out ' XOR ' and operates and taken
Mould (complementation) operates.
Further, in S2 steps, P is sent into queue X with the mode of batch transmission is specially：
S21：Transient node is opened up in memory field, and P length is added to data length and interim section in transient node
The maximum length of point is compared, if the data length that P length is added in transient node is less than or equal to transient node most
Long length, then into S23；If the data length that P length is added in transient node is more than the maximum length of transient node, enter
Enter S22；
S22：Data in transient node are write into queue X, into S23；
S23：P is write into transient node, the packet mark number in transient node adds 1.
Further, in S3 steps, data acquisition is specially：
S31：N number of stream reduction process is initialized, each process individually depends on a queue X, recycles KFIFO algorithms to be formed
Without lock concurrent operations；
S32：The data in transient node are read, obtain ip data messages, data message is carried out according to tcp/ip agreements
Reduction.
Invention additionally discloses a kind of IP packet deliveries harvester, including
Initialization module：Initialized for lock-free queue；
Data acquisition module：For IP data acquisitions；
Data distribution module：For IP data distributions；
Data restoring module：For IP digital independents and reduction.
Invention additionally discloses a kind of IP packet deliveries acquisition terminal equipment, including memory, processor and it is stored in
In the memory and the computer program that can run on the processor, described in the computing device during computer program
The step of realizing the collection of IP packet deliveries.
Invention additionally discloses a kind of computer-readable recording medium, the computer-readable recording medium storage has computer
Program, the computer program realize the step of IP packet deliveries gather when being executed by processor.Beneficial effects of the present invention：
By IP packet delivery harvesters, the handling process of data acquisition and data flow reduction is decoupled, has been had simultaneously
Effect reduce one process processing data stream number, improve Data Stream Processing efficiency and reduce data flow internal memory holding time from
And reduce internal memory loss.
Brief description of the drawings
Fig. 1 is the method flow diagram of the embodiment of the present invention one；
Fig. 2 is the system structure diagram of the embodiment of the present invention two.
Embodiment
To further illustrate each embodiment, the present invention is provided with accompanying drawing.These accompanying drawings are the invention discloses the one of content
Point, it can coordinate the associated description of specification to explain the operation principles of embodiment mainly to illustrate embodiment.Coordinate ginseng
These contents are examined, those of ordinary skill in the art will be understood that other possible embodiments and advantages of the present invention.In figure
Component be not necessarily to scale, and similar element numbers are conventionally used to indicate similar component.
In conjunction with the drawings and specific embodiments, the present invention is further described.The present invention be applied to intruding detection system,
The network flow datas such as virus characteristic filtration system reduce.
Embodiment one：
Refer to shown in Fig. 1, the invention provides a kind of IP packet deliveries acquisition method, comprise the following steps：S0：Nothing
Lock queue initialization：System opens up a shared section key, N number of parallel lock-free queue is created in shared section key, for IP numbers
Distribute according to bag, wherein N is 2n, lock-free queue uses Kfifo data structures, is the internal storage structure of an annular.
Specifically, Kfifo is a kind of " First In First Out " data structure, it is real to employ buffer circle
It is existing, there is provided the byte stream service of a non-boundary.Use the benefit of buffer circle for, after a data element is used up,
Remainder data element need not move its storage location, and efficiency is improved so as to reduce copy.Importantly, kfifo is employed
The shared queue for the single production/mono- consumption mode realized parallel without lock technology, kfifo need not lock synchronous.
Specific procedure is：
Lock-free queue head MyRingHead, queue element (QE) information MyMsgNode, queuing message operation class are defined first
RingOp, RingOp carry out being operated without lock for data using kfifo.
Lock-free queue head MyRingHead
| Attribute-name | Implication |
| WriteHead | Point to the array index of next write-in |
| ReadHead | Point to the array index of next reading |
Queue element (QE) information MyMsgNode
| Attribute-name | Implication |
| BufLen | Data length |
| PacketNum | Packet number |
| Buf | Buffering area |
Queuing message operates class RingOp, and being operated without lock for data is carried out using kfifo
| Attribute-name | Implication |
| MyMsgNode | Transient node, for caching parcel |
| MyRingHead* | Shared drive address, data head, for home position |
| MyMsgNode[2n]* | Shared drive address, data queue |
| Write() | Write a node |
| Read() | Read a node |
Circulation array -- the generator based on shared drive is created again
The continuous memory headroom of 2n MyMsgNode+MyRingHead length LEN is opened up first, is initialized as 2n
MyMsgNode arrays, and MyRingHead is set to 0.
Opening space function is：Shm_id=shmget (KEY, LEN, IPC_CREAT | IPC_EXCL)；
Obtaining data leading address function is：PHeadAddr*=(char*) shmat (m_shm_id, NULL, 0).
Further according to configuring condition, N number of memory queue RingOp [N] is initialized, RingOp memory fields are attached in shared
Deposit area：
RingOp.MyRingHead=pHeadAddr
RingOp.MyMsgNode=pHeadAddr+sizeof (MyRingHead)
Lock-free queue based on shared drive since then, generator's operation have created completion.
Here N is 2 n powers, and subsequently modulo operation substitutes modulo operation raising according to his characteristic with operation again
Efficiency.
Into S1 steps；
S1：IP data acquisitions：IP packet P are gathered, parsing P obtains four-tuple, and HASH-Id, root are calculated according to four-tuple
It is X to obtain modulus value to N number of lock-free queue modulus according to HASH-Id, and wherein X obtaining value method can ensure the homologous chummage of data,
Formula is as follows, and the bi-directional hash values for ensureing same session must be consistent, otherwise in data flow processing module
It will be unable to reduce complete session.Wherein four-tuple is source ip, place ip, source port, egress mouth.HASH-Id uses equation below
Value obtains X：X=(saddr^daddr^sourcePort^destPort) ＆ (N-1), wherein, saddr is source ip, and daddr is
Place ip, sourcePort are source port, and destPort is egress mouth, and N is queue number, and it is arranged to 2 n powers, and X is quaternary
Group progress ' XOR ' operate and carry out modulus (complementation) operation.Into S2 steps；
S2：IP data distributions：P is sent to lock-free queue X with the mode of batch transmission, into S3 steps；
S3：IP digital independents and reduction：N number of stream reduction process is initialized, each process individually depends on a lock-free queue
X, formed without lock concurrent operations, then carry out digital independent and reduction.
In the present embodiment, in S2 steps, P is sent into queue X with the mode of batch transmission is specially：
S21：Transient node is opened up in memory field, and P length is added to data length and interim section in transient node
The maximum length of point is compared, if the data length that P length is added in transient node is less than or equal to transient node most
Long length, then into S23；If the data length that P length is added in transient node is more than the maximum length of transient node, enter
Enter S22；
S22：Data in transient node are write into queue X, into S23；
S23：P is write into transient node, the packet mark number in transient node adds 1.
Specific procedure is：
B1) if RingOp [x] .MyMsgNode.BufLen is less than maximum length plus P length, P is written to
MyMsgNode transient nodes, RingOp [x] .MyMsgNode.PacketNum adds 1, without data distribution.
B2) if RingOp [x] .MyMsgNode.BufLen is more than maximum length plus P length, write-in behaviour is performed
Make, transient node MyMsgNode execution Write be written to queue, null clear operation is carried out to RingOp [x] .MyMsgNode,
B1 operations are performed again.
It is mainly to reduce the read-write operation of data using batch transmission mode, reduces the loss of internal memory, program is improved with this
Performance.
In the present embodiment, in S3 steps, data acquisition is specially：
S31：N number of stream reduction process is initialized, each process individually depends on a queue X, recycles KFIFO algorithms to be formed
Without lock concurrent operations；
S32：The data in transient node are read, obtain ip data messages, data message is carried out according to tcp/ip agreements
Reduction.
Specific procedure is：
A. initialization flow reduction process -- consumer
N number of stream reduction process is initialized, each process individually depends on a queue X, formed " single producer-mono- consumer "
Model, recycle KFIFO algorithms to be formed without lock concurrent operations.
B. data acquisition
RingOp [X] reads a node data MyMsgNode, traversal MyMsgNode.PacketNum processing ip data
Message, the reduction of data message is carried out according to tcp/ip agreements.
Embodiment two：
As shown in Fig. 2 the present embodiment proposes a kind of IP packet deliveries harvester, including
Initialization module：Initialized for lock-free queue；
Data acquisition module：For IP data acquisitions；
Data distribution module：For IP data distributions；
Data restoring module：For IP digital independents and reduction.
The present embodiment also proposes a kind of IP packet deliveries acquisition terminal equipment, including memory, processor and storage
In the memory and the computer program that can run on the processor, computer program described in the computing device
Step in Shi Shixian above method embodiments of the embodiment of the present invention, such as step the methods of step S0-S3 shown in Fig. 1.Or
Person, the function of each module/unit in above-mentioned each device embodiment is realized described in the computing device during computer program, such as
Realize the function of the modules such as above-mentioned initialization module, data acquisition module, data distribution module and data restoring module.
Wherein, memory includes shared drive, shared section key create have it is N number of parallel without lock Kfifo queues, for IP
Data distribution, the i.e. data by the collection of IP packet captures module write lock-free queue.Processor includes data restoring module, uses
In IP digital independents and reduction.
Further, as an executable scheme, the IP packet deliveries acquisition terminal equipment can be desktop
The computing devices such as computer, notebook, palm PC and cloud server.The IP packet deliveries acquisition terminal equipment can wrap
Include, but be not limited only to, processor, memory.It will be understood by those skilled in the art that above-mentioned IP packet deliveries acquisition terminal is set
Standby composition structure is only the example of IP packet delivery acquisition terminal equipment, does not form and IP packet deliveries are gathered eventually
The restriction of end equipment, it can include, than above-mentioned more or less parts, either combining some parts or different parts,
Such as the IP packet deliveries acquisition terminal equipment can also include input-output equipment, network access equipment, bus etc., this
Inventive embodiments are not limited this.
Further, as an executable scheme, alleged processor can be CPU (Central
Processing Unit, CPU), it can also be other general processors, digital signal processor (Digital Signal
Processor, DSP), it is application specific integrated circuit (Application Specific Integrated Circuit, ASIC), existing
Into programmable gate array (Field-Programmable Gate Array, FPGA) or other PLDs, discrete
Door or transistor logic, discrete hardware components etc..General processor can be that microprocessor or the processor also may be used
To be any conventional processor etc., the processor is the control centre of the IP packet deliveries acquisition terminal equipment, profit
With various interfaces and the various pieces of the whole IP packet deliveries acquisition terminal equipment of connection.
The memory can be used for storing the computer program and/or module, and the processor is by running or performing
The computer program and/or module being stored in the memory, and the data being stored in memory are called, described in realization
The various functions of IP packet delivery acquisition terminal equipment.The memory can mainly include storing program area and data storage
Area, wherein, storing program area can storage program area, the application program needed at least one function；Storage data field can store
Created data etc. are used according to mobile phone.In addition, memory can include high-speed random access memory, can also include
Nonvolatile memory, such as hard disk, internal memory, plug-in type hard disk, intelligent memory card (Smart Media Card, SMC), safety
Digital (Secure Digital, SD) card, flash card (Flash Card), at least one disk memory, flush memory device or
Other volatile solid-state parts.
The present embodiment also proposes a kind of computer-readable recording medium, and the computer-readable recording medium storage has calculating
Machine program, the computer program realizes the above method of embodiment of the present invention when being executed by processor the step of.
If module/unit of the IP packet deliveries acquisition terminal integration of equipments is real in the form of SFU software functional unit
Now and as independent production marketing or in use, it can be stored in a computer read/write memory medium.Based on so
Understanding, the present invention realizes all or part of flow in above-described embodiment method, can also be instructed by computer program
Related hardware is completed, and described computer program can be stored in a computer-readable recording medium, the computer program
When being executed by processor, can be achieved above-mentioned each embodiment of the method the step of.Wherein, the computer program includes computer
Program code, the computer program code can be source code form, object identification code form, executable file or some centres
Form etc..The computer-readable medium can include：Can carry the computer program code any entity or device,
Recording medium, USB flash disk, mobile hard disk, magnetic disc, CD, computer storage, read-only storage (ROM, Read-Only
Memory), random access memory (RAM, Random Access Memory), electric carrier signal, telecommunication signal and software
Distribution medium etc..It should be noted that the content that includes of the computer-readable medium can be according to making laws in jurisdiction
Appropriate increase and decrease is carried out with the requirement of patent practice, such as in some jurisdictions, according to legislation and patent practice, computer
Computer-readable recording medium does not include electric carrier signal and telecommunication signal.
The present invention a kind of IP packet deliveries acquisition method, device, terminal device and storage medium, by having decoupled data
Collection and the handling process of data flow reduction, while the number of one process processing data stream is effectively reduced, improve Data Stream Processing
Efficiency and reduction data flow are lost in the holding time of internal memory so as to reduce internal memory.
Although specifically showing and describing the present invention with reference to preferred embodiment, those skilled in the art should be bright
In vain, do not departing from the spirit and scope of the present invention that appended claims are limited, in the form and details can be right
The present invention makes a variety of changes, and is protection scope of the present invention.
Claims (9)
- A kind of 1. IP packet deliveries acquisition method, it is characterised in that：Comprise the following steps：S0：Lock-free queue initializes：A shared section key is opened up, N number of parallel lock-free queue is created in shared section key, is used for IP packet deliveries, wherein N are 2n, into S1 steps；S1：IP data acquisitions：IP packet P are gathered, parsing P obtains four-tuple, and HASH-Id is calculated according to four-tuple, according to It is X that HASH-Id, which obtains modulus value to N number of lock-free queue modulus, and wherein X obtaining value method can ensure the homologous chummage of data, enter Enter S2 steps；S2：IP data distributions：P is sent to lock-free queue X with the mode of batch transmission, into S3 steps；S3：IP digital independents and reduction：N number of stream reduction process is initialized, each process individually depends on a lock-free queue X, shape Cheng Wusuo concurrent operations, then carry out digital independent and reduction.
- 2. IP packet deliveries acquisition method as claimed in claim 1, it is characterised in that：In S0 steps, lock-free queue uses Kfifo data structures, it is the internal storage structure of an annular.
- 3. IP packet deliveries acquisition method as claimed in claim 1, it is characterised in that：In S1 steps, four-tuple be source ip, Place ip, source port and egress mouth.
- 4. IP packet deliveries acquisition method as claimed in claim 1, it is characterised in that：In S1 steps, HASH-Id is using such as Lower formula value obtains X：X=(saddr^daddr^sourcePort^destPort) ＆ (N-1), wherein, saddr is source ip, Daddr is place ip, and sourcePort is source port, and destPort is egress mouth, and N is queue number, and it is arranged to 2 n powers, X is that four-tuple carries out ' XOR ' and operates and carry out modulus (complementation) operation.
- 5. IP packet deliveries acquisition method as claimed in claim 1, it is characterised in that：In S2 steps, with batch transmission P is sent to queue X by mode：S21：Open up transient node in memory field, and P length is added into data length in transient node and transient node Maximum length is compared, if the data length that P length is added in transient node is less than or equal to most greatly enhancing for transient node Degree, then into S23；If the data length that P length is added in transient node is more than the maximum length of transient node, enter S22；S22：Data in transient node are write into queue X, into S23；S23：P is write into transient node, the packet mark number in transient node adds 1.
- 6. IP packet deliveries acquisition method as claimed in claim 5, it is characterised in that：In S3 steps, data acquisition is specific For：S31：N number of stream reduction process is initialized, each process individually depends on a queue X, recycles KFIFO algorithms to be formed without lock Concurrent operations；S32：The data in transient node are read, obtain ip data messages, the reduction of data message is carried out according to tcp/ip agreements.
- A kind of 7. IP packet deliveries harvester, it is characterised in that：IncludingInitialization module：Initialized for lock-free queue；Data acquisition module：For IP data acquisitions；Data distribution module：For IP data distributions；Data restoring module：For IP digital independents and reduction.
- 8. a kind of IP packet deliveries acquisition terminal equipment, including memory, processor and it is stored in the memory simultaneously The computer program that can be run on the processor, it is characterised in that：It is real during computer program described in the computing device Now such as the step of claim 1-6 methods describeds.
- 9. a kind of computer-readable recording medium, the computer-readable recording medium storage has computer program, and its feature exists In：Realized when the computer program is executed by processor such as the step of claim 1-6 methods describeds.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710927157.2A CN107749828A (en) | 2017-10-09 | 2017-10-09 | IP packet deliveries acquisition method, device, terminal device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710927157.2A CN107749828A (en) | 2017-10-09 | 2017-10-09 | IP packet deliveries acquisition method, device, terminal device and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107749828A true CN107749828A (en) | 2018-03-02 |
Family
ID=61254726
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710927157.2A Pending CN107749828A (en) | 2017-10-09 | 2017-10-09 | IP packet deliveries acquisition method, device, terminal device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107749828A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111416825A (en) * | 2020-03-24 | 2020-07-14 | 河南信大网御科技有限公司 | Inter-thread lock-free log management method and system, terminal and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080186918A1 (en) * | 2006-12-05 | 2008-08-07 | Qualcomm Incorporated | Method and system for reducing backhaul utilization during base station handoff in wireless networks |
| CN101795230A (en) * | 2010-02-23 | 2010-08-04 | 西安交通大学 | Network flow recovery method |
| CN101853149A (en) * | 2009-03-31 | 2010-10-06 | 张力 | Method and device for processing single-producer/single-consumer queue in multi-core system |
| CN101977162A (en) * | 2010-12-03 | 2011-02-16 | 电子科技大学 | Load balancing method of high-speed network |
| CN104468412A (en) * | 2014-12-04 | 2015-03-25 | 东软集团股份有限公司 | RSS-based network session data packet distribution method and system |
-
2017
- 2017-10-09 CN CN201710927157.2A patent/CN107749828A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080186918A1 (en) * | 2006-12-05 | 2008-08-07 | Qualcomm Incorporated | Method and system for reducing backhaul utilization during base station handoff in wireless networks |
| CN101853149A (en) * | 2009-03-31 | 2010-10-06 | 张力 | Method and device for processing single-producer/single-consumer queue in multi-core system |
| CN101795230A (en) * | 2010-02-23 | 2010-08-04 | 西安交通大学 | Network flow recovery method |
| CN101977162A (en) * | 2010-12-03 | 2011-02-16 | 电子科技大学 | Load balancing method of high-speed network |
| CN104468412A (en) * | 2014-12-04 | 2015-03-25 | 东软集团股份有限公司 | RSS-based network session data packet distribution method and system |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111416825A (en) * | 2020-03-24 | 2020-07-14 | 河南信大网御科技有限公司 | Inter-thread lock-free log management method and system, terminal and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107566206B (en) | Flow measuring method, equipment and system | |
| Mu et al. | IP routing processing with graphic processors | |
| CN103946803B (en) | The processor queued up with efficient operation | |
| DE102018212253A1 (en) | THROTTLE FOR BANDWIDTH BALANCED DATA TRANSMISSIONS | |
| CN112929299B (en) | SDN cloud network implementation method, device and equipment based on FPGA accelerator card | |
| US20210336883A1 (en) | Systems for providing an lpm implementation for a programmable data plane through a distributed algorithm | |
| CN108228649A (en) | For the method and apparatus of data access | |
| CN107124286A (en) | A kind of mass data high speed processing, the system and method for interaction | |
| CN103488717B (en) | Lock-free data gathering method and lock-free data gathering device | |
| WO2021136313A1 (en) | Attack and defense confrontation-based e-mail system security evaluation method and apparatus | |
| CN107025142A (en) | A kind of cross-thread message delivery method, device and electronic equipment | |
| CN106503008A (en) | File memory method and device and file polling method and apparatus | |
| CN106502875A (en) | A kind of daily record generation method and system based on cloud computing | |
| CN109344126A (en) | Processing method, device, storage medium and the electronic device of textures | |
| CN115917473A (en) | System for building data structure by using highly extensible algorithm realized by distributed LPM | |
| CN106407226B (en) | A kind of data processing method, backup server and storage system | |
| CN104283736B (en) | A kind of network communication five-tuple Fast Match Algorithm based on improvement automatic state machine | |
| CN110324204A (en) | A kind of high speed regular expression matching engine realized in FPGA and method | |
| CN107749828A (en) | IP packet deliveries acquisition method, device, terminal device and storage medium | |
| CN107682266A (en) | Matching process and device, the computer-readable recording medium of flow table item | |
| US20220166718A1 (en) | Systems and methods to prevent packet reordering when establishing a flow entry | |
| CN107273187A (en) | Reading position acquisition methods and device, computer installation, readable storage medium storing program for executing | |
| DE102018214014A1 (en) | Delayed increment for high frequency counter | |
| CN106899558A (en) | The treating method and apparatus of access request | |
| CN107277062A (en) | The method for parallel processing and device of packet |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180302 |