CN109274593B - Information storage method and device - Google Patents

Information storage method and device Download PDF

Info

Publication number
CN109274593B
CN109274593B CN201811014961.2A CN201811014961A CN109274593B CN 109274593 B CN109274593 B CN 109274593B CN 201811014961 A CN201811014961 A CN 201811014961A CN 109274593 B CN109274593 B CN 109274593B
Authority
CN
China
Prior art keywords
linked list
chain table
attribute information
node
storage position
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.)
Active
Application number
CN201811014961.2A
Other languages
Chinese (zh)
Other versions
CN109274593A (en
Inventor
赵志伟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
New H3C Security Technologies Co Ltd
Original Assignee
New H3C Security Technologies Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by New H3C Security Technologies Co Ltd filed Critical New H3C Security Technologies Co Ltd
Priority to CN201811014961.2A priority Critical patent/CN109274593B/en
Publication of CN109274593A publication Critical patent/CN109274593A/en
Application granted granted Critical
Publication of CN109274593B publication Critical patent/CN109274593B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/74—Address processing for routing
    • H04L45/745—Address table lookup; Address filtering
    • H04L45/7453—Address table lookup; Address filtering using hashing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/16—Threshold monitoring
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/90—Buffering arrangements
    • H04L49/9015—Buffering arrangements for supporting a linked list
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/02—Capturing of monitoring data
    • H04L43/028—Capturing of monitoring data by filtering
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0876—Network utilisation, e.g. volume of load or congestion level
    • H04L43/0888—Throughput
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2441—Traffic characterised by specific attributes, e.g. priority or QoS relying on flow classification, e.g. using integrated services [IntServ]

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Storage Device Security (AREA)

Abstract

The embodiment of the application provides an information storage method and device, relates to the technical field of networks, and comprises the following steps: obtaining a message and obtaining attribute information of the message; connecting character strings corresponding to the obtained attribute information to form a new character string, and performing hash calculation on the new character string to obtain a first hash value; determining the storage position of the obtained attribute information in the preset hash chain table as a first storage position according to the first hash value and the size of the preset hash chain table; judging whether a first linked list node storing the obtained attribute information exists at a first storage position; if so, updating the statistical information stored in the first linked list node; if not, creating the linked list nodes according to the first storage position, storing the obtained attribute information to the created linked list nodes, and updating the statistical information stored in the created linked list nodes. By applying the scheme provided by the embodiment of the application, information storage can be realized in the flow table, and the throughput performance of the flow probe is improved.

Description

Information storage method and device
Technical Field
The present application relates to the field of network technologies, and in particular, to an information storage method and apparatus.
Background
The network-wide traffic analysis technology has become a very important means for analyzing network problems. Under the era background that the network scale is gradually enlarged, the speed is gradually increased and the network application is gradually complicated, the real-time statistics and analysis of the network session context are required.
Flow tracking is a basic technology for realizing real-time statistics and analysis, and is mainly used for collecting messages from a network and classifying the messages according to attribute information of the messages so as to count attribute information of flows, which is essentially the statistical analysis of flows. And then carrying out subsequent deeper statistics and analysis according to the attribute information of the stream.
In the prior art, a flow probe can be used for realizing flow tracking, but in this way, a flow table is required to be used for tracking and maintaining statistical information of network flows. Because the network has the characteristics of large message volume, high speed and the like, how to store the information of the network flow in the flow table after the flow table is established is directly related to the throughput performance of the flow probe.
In view of this, it is desirable to provide a scheme for storing information in the flow table.
Disclosure of Invention
An object of the embodiments of the present application is to provide an information storage method and apparatus, so as to implement information storage in a flow table, and improve throughput performance of a flow probe. The specific technical scheme is as follows:
in a first aspect, an embodiment of the present application provides an information storage method, where the method includes:
obtaining a message and obtaining attribute information of the message;
connecting character strings corresponding to the obtained attribute information to form a new character string, and performing hash calculation on the new character string to obtain a first hash value;
determining a storage position of the obtained attribute information in a preset hash chain table as a first storage position according to the first hash value and the size of the preset hash chain table, wherein the size of the preset hash chain table is a prime number;
judging whether a first linked list node storing the obtained attribute information exists at the first storage position or not;
if so, updating the statistical information stored in the first linked list nodes, wherein the statistical information stored in each linked list node is as follows: the obtained message attribute information is the message quantity of the attribute information stored in the linked list node;
if not, creating a linked list node according to the first storage position, storing the obtained attribute information to the created linked list node, and updating the statistical information stored in the created linked list node.
In a second aspect, an embodiment of the present application provides an information storage apparatus, including:
the information acquisition module is used for acquiring messages and acquiring attribute information of the messages;
the hash value calculation module is used for connecting character strings corresponding to the obtained attribute information to form a new character string and carrying out hash calculation on the new character string to obtain a first hash value;
the position determining module is used for determining the storage position of the obtained attribute information in a preset hash chain table as a first storage position according to the first hash value and the size of the preset hash chain table, wherein the size of the preset hash chain table is a prime number;
the node judgment module is used for judging whether a first linked list node storing the obtained attribute information exists at the first storage position, if so, the information updating module is triggered, and if not, the node creating module is triggered;
the information updating module is configured to update statistical information stored in the first linked list nodes, where the statistical information stored in each linked list node is: the obtained message attribute information is the message quantity of the attribute information stored in the linked list node;
the node creating module is used for creating a linked list node according to the first storage position;
and the first information storage module is used for storing the obtained attribute information to the created linked list node and updating the statistical information stored in the created linked list node.
In a third aspect, embodiments provide an electronic device comprising a processor and a machine-readable storage medium storing machine-executable instructions executable by the processor, the processor being caused by the machine-executable instructions to: the information storage method steps described in the embodiments of the present application are realized.
In a fourth aspect, embodiments of the present application provide a machine-readable storage medium storing machine-executable instructions that, when invoked and executed by a processor, cause the processor to: the information storage method steps described in the embodiments of the present application are realized.
As can be seen from the above, in the scheme provided in the embodiment of the present application, after a packet is obtained, attribute information of the packet is obtained, character strings corresponding to the obtained attribute information are connected to form a new character string, hash calculation is performed on the new character string to obtain a first hash value, a first storage location of the obtained attribute information in a preset hash chain is determined according to the first hash value and a size of the preset hash chain, when a first chain node storing the obtained attribute information exists at the first storage location, statistical information stored in the first chain node is updated, when a first chain node does not exist at the first storage location, a chain node is created according to the first storage location, the obtained attribute information is stored to the created chain node, and statistical information stored in the created chain node is updated. Therefore, if the flow table is constructed by adopting the preset hash chain table, information storage can be realized in the flow table by applying the scheme provided by the embodiment of the application; in addition, the size of the preset hash chain table is a prime number, and the prime number has no other factors except 1 and itself, so that when the scheme provided by the embodiment of the application is applied to storing the attribute information of the message, a relatively discrete hash value can be obtained, and the throughput performance of the flow probe can be improved.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a schematic flowchart of a first information storage method according to an embodiment of the present application;
fig. 2 is a schematic flowchart of a second information storage method according to an embodiment of the present application;
fig. 3 is a schematic flowchart of a third information storage method according to an embodiment of the present application;
FIG. 4 is a schematic structural diagram of an information storage device according to an embodiment of the present disclosure;
fig. 5 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Because the flow probe can be used for realizing flow tracking in the prior art, but a flow table is required to be used for tracking and maintaining statistical information of network flows in the mode, the embodiment of the application provides an information storage method for realizing information storage in the flow.
In one embodiment of the present application, there is provided an information storage method, including:
obtaining a message and obtaining attribute information of the message;
connecting character strings corresponding to the obtained attribute information to form a new character string, and performing hash calculation on the new character string to obtain a first hash value;
determining the storage position of the obtained attribute information in a preset hash chain table as a first storage position according to the first hash value and the size of the preset hash chain table, wherein the size of the preset hash chain table is a prime number;
judging whether a first linked list node storing the obtained attribute information exists at a first storage position;
if so, updating the statistical information stored in the first linked list nodes, wherein the statistical information stored in each linked list node is as follows: the obtained message attribute information is the message quantity of the attribute information stored in the linked list node;
if not, creating the linked list nodes according to the first storage position, storing the obtained attribute information to the created linked list nodes, and updating the statistical information stored in the created linked list nodes.
As can be seen from the above, if the flow table is constructed by using the preset hash chain table, information storage can be realized in the flow table by applying the scheme provided by this embodiment; in addition, the size of the hash chain table is preset to be a prime number, and the prime number does not have other factors except 1 and the prime number itself, so that when the scheme provided by the embodiment is applied to storing the attribute information of the message, a relatively discrete hash value can be obtained, and the throughput performance of the flow probe can be improved.
The information storage method provided by the embodiment of the present application is described in detail by specific embodiments below.
Fig. 1 is a schematic flowchart of a first information storage method provided in an embodiment of the present application, where the method includes:
s101: and acquiring the message and acquiring the attribute information of the message.
The attribute information of the packet may include five-tuple information or seven-tuple information of the packet.
In one embodiment, after obtaining the packet, information included in the five-tuple may be extracted from the packet: a source IP (Internet Protocol, Protocol for interconnection between networks) address, a source port number, a destination IP address, a destination port number, and a transport Protocol number.
In another embodiment, after the message is obtained, the information included in the seven-tuple can be further extracted from the message: source IP address, source port number, destination IP address, destination port number, transport protocol number, interface index, and TOS (Type of Service).
S102: and connecting character strings corresponding to the obtained attribute information to form a new character string, and performing hash calculation on the new character string to obtain a first hash value.
Because the type of each attribute information value of the message may be a numerical type or other types such as a character string, and the various types of the values can be converted into the character string type, the character strings corresponding to the obtained attribute information are sequentially connected end to end, and a new character string can be formed. For example, the destination port number of the packet takes the following values: 8080, it can be seen that the type of the value is a numeric value type, and the character string corresponding to 8080 is: "8080", which are not clearly distinguished from each other in specific numbers, are distinguished from each other in the form of data storage, that is, one is stored in an integer type or the like and one is stored in a character string type.
When the new character string is formed, the arrangement order of the character strings corresponding to the attribute information is not limited.
It is assumed that the obtained attribute information of the packet is quintuple information of the packet, and the character strings corresponding to each information in the quintuple are shown in table 1 below.
TABLE 1
Source IP address Source port number Destination IP address Destination port number Transport protocol number
10.10.10.10 80 11.11.11.11 8080 6
10.10.10.10 81 11.11.11.11 8079 6
The character strings formed by connecting the obtained attribute information are respectively:
10.10.10.108011.11.11.1180806、10.10.10.108111.11.11.1180796。
therefore, when the quintuple of the message changes, the obtained character string can directly reflect the change.
And because the hash algorithm is sensitive to the change of the processed character string, the obtained first hash value is different under the condition that the processed character string is changed.
For a hash algorithm in the prior art that takes the sum of values corresponding to five tuples of a packet as a hash value, assuming that the value corresponding to 10.10.10.10 is M and the value corresponding to 11.11.11.11 is N, the hash values calculated according to the information of the two sets of five tuples recorded in table 1 are:
M+N+80+8080+6＝M+N+8166
M+N+81+8079+6＝M+N+8166
it can be seen that the hash values calculated from the two sets of quintuple information recorded in table 1 are the same.
Therefore, compared with the prior art, in this step, the hash calculation is performed on the new character string obtained by connecting the character strings corresponding to the attribute information, and the obtained hash value can reflect the change of the message attribute information.
In an embodiment of the present application, when performing hash calculation on the character string, the BKDR algorithm may be used to perform hash calculation on the character string to obtain a first hash value.
Of course, other algorithms capable of performing hash calculation on the character string may be adopted to perform hash calculation on the formed new character string to obtain the first hash value. Such as the elfhsh algorithm, etc.
S103: and determining the storage position of the obtained attribute information in the preset hash chain table as a first storage position according to the first hash value and the size of the preset hash chain table. And the size of the preset hash chain table is a prime number.
The preset hash chain table may be a pre-created hash chain table. The preset hash chain table is used for storing the attribute information of the message.
Specifically, when the attribute information of the packet is stored in the preset hash chain table, the attribute information is stored in the chain table node at each storage position in the preset hash chain table.
Under the influence of factors such as a hash algorithm adopted when the first hash value is calculated, the size of the preset hash chain table and the like, the storage positions determined according to the size of the first hash value and the size of the preset hash chain table may be the same, that is, the same storage position in the preset hash chain table may need to store attribute information of a plurality of different messages, and because one chain table node is used for storing the attribute information of one message, a plurality of chain table nodes may be created at each storage position in the preset hash chain table.
In addition, messages with the same attribute information may exist in messages received by the electronic device serving as the execution main body, and in order to ensure that the information stored in the preset hash chain table is comprehensive and accurate, statistical information may also be stored in each chain table node so as to count the number of the messages with the same attribute information. The statistical information stored in each linked list node can be understood as: and the obtained message attribute information is the message quantity of the attribute information stored in the linked list node.
For each link table node, in addition to storing the attribute information of the packet and the statistical information, the uplink packet number, the downlink packet number, the uplink byte size, the downlink byte size, the stream start time, the stream end time, the application layer protocol, some attribute information of the application layer, and the like of the packet whose attribute information is the stored attribute information can be stored.
In an embodiment of the application, when determining the first storage location according to the first hash value and the size of the preset hash chain table, the first storage location may be obtained by calculating according to the following formula:
the first storage position is equal to the size of the first hash value% preset hash chain table
The symbol "%" represents the remainder of the operators.
In an embodiment of the present application, the size of the hash chain table is a prime number. Taking the calculation of the first storage location according to the formula as an example, when the size of the preset hash chain table is a prime number, because the prime number only has two factors of 1 and self, the probability that the calculated first storage location is the same can be greatly reduced, and further, the attribute information of different messages can be effectively prevented from being stored in the chain table node at the same storage location, so that the probability of the attribute information aggregation of the messages can be reduced, and the condition of storage location conflict when the attribute information of the messages is stored can be reduced.
In addition, in the application process, the specific value of the prime number used for representing the size of the hash chain table needs to be determined according to a specific application scenario.
S104: and judging whether a first linked list node storing the obtained attribute information exists at the first storage position, if so, executing S105, and if not, executing S106-S107.
Specifically, when determining whether the first linked list node exists at the first storage location, it may be determined whether the linked list node is created at the first storage location.
If the linked list node is not created, it can be directly determined that the first linked list node is not stored at the first storage position.
If the link list nodes are created, it is necessary to judge one by one whether the attribute information of the packet stored in each created link list node matches with the attribute information obtained in the above S101, if the link list nodes matching with the attribute information exist, it is judged that the first link list node exists at the first storage location, and if the link list nodes matching with the attribute information do not exist, it is judged that the first link list node does not exist at the first storage location.
S105: and updating the statistical information stored in the first linked list nodes.
Updating the statistics stored in the first linked list nodes may be by adding 1 on the basis of the stored statistics.
S106: and creating a linked list node according to the first storage position.
In an embodiment of the present application, when creating a linked list node according to a first storage location, the linked list node may be created directly at the first storage location.
In another embodiment of the present application, when creating a linked list node according to the first storage location, the linked list node may also be created in a secondary hash linked list created at the first storage location, and specific details are described in the following embodiments and will not be described in detail here.
S107: and storing the obtained attribute information to the created linked list node, and updating the statistical information stored in the created linked list node.
Since the link list node is newly created, updating the statistical information stored in the created link list node may be understood as initializing the stored statistical information, which is generally initialized to 1.
As can be seen from the above, in the scheme provided in this embodiment, after a packet is obtained, attribute information of the packet is obtained, character strings corresponding to the obtained attribute information are connected to form a new character string, hash calculation is performed on the new character string to obtain a first hash value, a first storage position of the obtained attribute information in a preset hash chain table is determined according to the first hash value and the size of the preset hash chain table, when a first chain table node storing the obtained attribute information exists at the first storage position, statistical information stored in the first chain table node is updated, when a first chain table node does not exist at the first storage position, a chain table node is created according to the first storage position, the obtained attribute information is stored to the created chain table node, and statistical information stored in the created chain table node is updated. Therefore, if the flow table is constructed by adopting the preset hash chain table, information storage can be realized in the flow table by applying the scheme provided by the embodiment; in addition, the size of the hash chain table is preset to be a prime number, and the prime number does not have other factors except 1 and the prime number itself, so that when the scheme provided by the embodiment is applied to storing the attribute information of the message, a relatively discrete hash value can be obtained, and the throughput performance of the flow probe can be improved.
In an embodiment of the present application, referring to fig. 2, a schematic flow chart of a second information storage method is provided, and compared with the embodiment shown in fig. 1, in this embodiment, the preset hash chain table is a primary hash chain table.
The step S104 of determining whether the first linked list node storing the obtained attribute information exists at the first storage location includes:
S104A: and judging whether a secondary hash chain table exists at the first storage position, if so, executing S104B, and if not, executing S104D.
And the level of the secondary hash chain table is positioned at the next level of the primary hash chain table.
That is, the hash chain may be created at each storage location of the preset hash chain. Since each storage location itself belongs to the preset hash chain table, the hash chain table created at each storage location is located at a level next to the level where the preset hash chain table is located.
Based on this, in the embodiments of the present application, for convenience of description, the preset hash chain is referred to as a primary hash chain, and the hash chain created at each storage location is referred to as a secondary hash chain.
S104B: and judging whether a first linked list node storing the obtained attribute information exists in the secondary hash linked list at the first storage position, if so, judging that the first linked list node exists at the first storage position, and executing S105, and if not, judging that the first linked list node does not exist at the first storage position, and executing S104C.
S104C: and creating a linked list node at a second storage position of the secondary hash linked list, storing the obtained attribute information to the created linked list node, and updating the statistical information stored in the created linked list node.
Wherein the second storage location is: and calculating the position for storing the obtained attribute information in the secondary hash chain table according to the hash value of the obtained attribute information and the size of the secondary hash chain table. The size of the secondary hash chain table may be a prime number or not.
Specifically, when a link table node is created at the second storage location of the created secondary hash link table according to the hash value of the obtained attribute information and the size of the secondary hash link table, the second storage location may be calculated according to the hash value of the obtained attribute information and the size of the secondary hash link table, and then the link table node is created at the second storage location of the created secondary hash link table.
The hash algorithm used for calculating the hash value of the obtained attribute information may be the same as or different from the hash algorithm used for calculating the first hash value in the embodiment shown in fig. 1, and this is not limited in this application.
In addition, the manner of calculating the second storage location according to the hash value of the obtained attribute information and the size of the secondary hash chain table is similar to the manner of calculating the first storage location according to the first hash value and the size of the preset hash chain table, and is not described here again.
S104D: it is determined that the first linked list node is not present at the first storage location.
For the above S106: and creating a linked list node according to the first storage position. In another embodiment of the present application, the above S106 may be implemented by the following steps S106A and S106B.
S106, 106A, under the condition that the preset condition for creating the secondary hash chain table is not met, creating chain table nodes at the first storage position.
S106, under the condition that the preset creating condition of the secondary hash chain table is met, the secondary hash chain table is created at the first storage position, and chain table nodes are created at the second storage position according to the hash value of the obtained attribute information and the size of the secondary hash chain table.
In an embodiment of the application, the preset condition for creating the secondary hash chain table may be: the second hash chain does not exist at the first storage location. Specifically, the process of determining whether the secondary hash chain table meets the creation condition may be as follows:
judging whether a second-level hash chain table exists at the first storage position;
if not, judging that the preset condition for creating the secondary hash chain table is met;
and if so, judging that the preset secondary hash chain table creating condition is not met.
That is to say, the corresponding secondary hash chain table is directly hung at each storage position in the primary hash chain table.
In another embodiment of the present application, the preset condition for creating the secondary hash chain table may be that the number of chain table nodes at the first storage location is greater than a preset threshold: . Specifically, the process of determining whether the secondary hash chain table meets the creation condition may be as follows:
judging whether the number of the linked list nodes created at the first storage position is greater than a preset threshold value or not;
if so, judging that a preset condition for creating a secondary hash chain table is met;
if not, judging that the preset condition for creating the secondary hash chain table is not met.
When the number of the linked list nodes created at the first storage position is greater than a preset threshold, it is indicated that the attribute information of the multiple messages is stored at the first storage position, that is, a storage position conflict occurs. When the number of the linked list nodes created at the first storage position is large, the storage position conflict situation is serious, so that the linked list nodes at the first storage position are longer in sequence, and when the attribute information stored in each linked list node is matched at the first storage position subsequently, the linked list nodes are required to be matched in sequence from the first linked list node, so that the matching speed is low, and the matching efficiency is low.
That is to say, in this embodiment, the secondary hash chain table is created at the first storage location only when the number of chain table nodes created at the first storage location is large, that is, the secondary hash chain table is created at the first storage location only when the location conflict at the first storage location is serious.
Specifically, the preset threshold may be determined according to specific hardware resources, and may be, for example, 10, 50, and so on. The present embodiment is not particularly limited.
On the basis of the above embodiment, in another embodiment of the present application, an identifier for characterizing the severity of a collision of the storage location may also be stored at each storage location of the preset hash chain table, and for convenience of description, the identifier is referred to as a collision number. When the linked list nodes created at the storage position do not reach the preset threshold, the value of the conflict number may be set as the number of the linked list nodes created at the storage position. When the number of the linked list nodes created at the storage position reaches the preset threshold, the value of the conflict number may be set to a preset value, for example, 0, and subsequently, if the attribute information needs to be stored at the storage position, a secondary hash linked list needs to be created to store the attribute information.
Thus, the above-mentioned S104A determines whether the second-level hash chain exists at the first storage location, and may determine whether the second-level hash chain exists at the first storage location by determining the value of the above-mentioned conflict number.
For example, the preset threshold is: 10, the preset values are: when the value of the conflict number is 0, judging that a secondary hash chain table exists at the first storage position; if the value of the conflict number is 5, it may be determined that the second-level hash chain table is not stored in the first storage location.
In order to ensure that the secondary hash chain table can be created at the first position in time, in one embodiment of the application, after the chain table node is created at the first storage position, whether a preset secondary hash chain table creation condition is met can be judged; if yes, creating a secondary hash chain table at the first storage position; storing the attribute information stored in the linked list node established at the first storage position into the linked list node in the secondary hash linked list according to the hash value of the attribute information stored in the linked list node established at the first storage position and the size of the secondary hash linked list; and deleting the linked list nodes of the secondary hash linked list in which the attribute information is stored from the first storage position.
In one implementation, the attribute information stored in all the linked list nodes created at the first storage location may be stored in the secondary hash linked list, and correspondingly, when deleting the linked list nodes, all the linked list nodes created at the first storage location are deleted from the first storage location.
In another implementation, the attribute information of the packet may be stored in a secondary hash chain table, and correspondingly, when deleting a chain table node, the chain table node storing the attribute information of the packet is deleted from the first storage location.
Specifically, when the attribute information stored in the link table node created at the first storage location is stored in the link table node in the secondary hash link table according to the hash value of the attribute information stored in the link table node created at the first storage location and the size of the secondary hash link table, the following steps a to C may be performed for each link table node created at the first storage location, respectively, so that the attribute information created in each link table node at the first storage location is stored in the link table node in the secondary hash link table.
For ease of description, each linked list node created at the first storage location is referred to as node M in steps A-C.
And step A, calculating a hash value corresponding to the attribute information stored in the node M.
In this step, the hash value may be calculated by using the hash algorithm based on the character string (e.g., BKDR algorithm), and the like, and the result of converting the attribute information stored in the node M into an integer and then accumulating the integer may be used as the hash value, and the like.
And step B, calculating the storage position of the attribute information stored in the node M in the secondary hash chain table by adopting the hash value obtained by calculation in the step A and the size of the secondary hash chain table.
For example, the following formula may be used to calculate the storage location of the attribute information stored in the node M in the secondary hash chain table:
and B, calculating the size of the hash value% secondary hash chain table obtained in the step A.
And step C, judging whether the linked list node used for storing the attribute information stored in the node M exists at the storage position obtained by calculation in the step B, if so, updating the statistical information stored in the linked list node, if not, creating the linked list node at the storage position obtained by calculation in the step B, and storing the attribute information stored in the node M in the created linked list node.
Specifically, when the link table nodes are created at each storage position of the secondary hash link table, the link table nodes can be created by adopting a sequential method.
It can be seen from the solutions provided in the above embodiments that, when information is stored in the preset hash chain table, a secondary hash chain table can be created at each storage location in the preset hash chain table, so that attribute information, statistical information, and the like of a packet can be stored in different storage locations of the secondary hash chain table.
In the prior art, attribute information of a packet is directly stored in a linked list node at each storage position in a preset hash linked list, and when a linked list node matched with the obtained attribute information at each storage position is searched, the linked list node can only be searched backwards one by one from the first linked list node at the storage position until each linked list node at the storage position is traversed, or the linked list node matched with the obtained attribute information is searched. The searching speed is slow and the efficiency is low.
In the solutions provided in the embodiments of the present application, after the attribute information of the packet is stored in different storage locations of the secondary hash chain table, when searching for a chain table node matched with the attribute information of the packet, the storage location for storing the packet attribute information in the secondary hash chain table may be calculated according to the hash value of the packet attribute information and the size of the secondary hash chain table, and then the storage location is directly searched for in the secondary hash chain table without searching for the chain table node one by one. And because the secondary hash chain table is the next hash chain table established at the storage position of the primary hash chain table, compared with the primary hash chain table, the message attribute information types stored in the secondary hash chain table can be greatly reduced, namely, the condition of storage position conflict in the secondary hash chain table can be greatly lightened, therefore, when the preset hash chain table, namely the storage position conflict in the primary hash chain table is serious, even if the storage position conflict still exists in the secondary hash chain table, the time consumed by sequentially matching the attribute information stored in each chain table node at the storage position can be reduced, and the efficiency of subsequent data searching is improved.
The information storage method provided by the embodiment of the present application is described in more detail by way of specific examples with reference to fig. 3.
S301: obtaining the message X and extracting the quintuple of the message X.
S302: and the character strings corresponding to the quintuple of the message X are sequentially connected in an end-to-end manner to form a new character string, the new character string is marked as a character string S, and the character string S is subjected to Hash calculation by adopting a BKDR algorithm to obtain a first Hash value V1.
S303: and calculating to obtain a first storage position of the quintuple extracted in the S301 in the preset hash chain table through a formula V1% L1.
The L1 is the size of the preset hash chain table, and the value of L1 is a prime number.
S304: judging whether a linked list node is established at the first storage position, if not, indicating that the first linked list node storing the quintuple extracted in the step S301 does not exist at the first storage position, executing the step S305, if the linked list node is established, then, not accurately determining whether the first linked list node exists at the first storage position, and executing the step S306.
S305: and creating a linked list node at the first storage position, storing the quintuple extracted in the step S301 in the linked list node, updating the statistical information stored in the created linked list node to be 1, and setting the conflict number for representing the conflict situation of the first storage position to be 1.
S306: and judging whether the number of conflicts is a preset value 0, if not, indicating that a secondary hash chain table is not established at the first storage position, executing S307, if so, indicating that the secondary hash chain table is established at the first storage position, and executing S311.
S307: starting from the first linked list node created at the first storage position, checking one by one whether the first linked list node is already stored, if the first linked list node exists, executing S308, and if the first linked list node does not exist, executing S309.
S308: and accumulating the statistical information stored in the first linked list nodes by 1.
S309: and creating a linked list node at the first storage position, storing the quintuple extracted in the step S301 in the linked list node, updating the statistical information stored in the created linked list node to be 1, and accumulating the number of conflicts by 1.
S310: and under the condition that the accumulated number of conflicts is greater than a preset threshold value, creating a secondary hash chain table at the first storage position, storing the quintuple stored in the chain table node created at the first storage position into the created secondary hash chain table, deleting all the chain table nodes created at the first storage position, and setting the number of conflicts to be a preset value 0.
S311: and obtaining the hash value of the five-tuple extracted in the S301, marking as V2, and calculating the second storage position of the five-tuple extracted in the S301 in the secondary hash chain table according to V2% L2.
The L2 is the size of the secondary hash chain.
S312: and starting from the first linked list node established at the second storage position, checking whether the first linked list node is already stored one by one, if the first linked list node exists, accumulating 1 by the statistical information stored in the first linked list node, if the first linked list node does not exist, establishing the linked list node at the second storage position, storing the quintuple extracted in the S301 in the linked list node, and updating the statistical information stored in the established linked list node to be 1.
Corresponding to the information storage method, the embodiment of the application provides an information storage device.
Fig. 4 provides a schematic structural diagram of a first information storage device, which includes:
an information obtaining module 401, configured to obtain a packet and obtain attribute information of the packet;
a hash value calculation module 402, configured to connect character strings corresponding to the obtained attribute information to form a new character string, and perform hash calculation on the new character string to obtain a first hash value;
a position determining module 403, configured to determine, according to the first hash value and a size of a preset hash chain table, a storage position of the obtained attribute information in the preset hash chain table as a first storage position, where the size of the preset hash chain table is a prime number;
a node determining module 404, configured to determine whether a first linked list node storing the obtained attribute information exists at the first storage location, if so, trigger the information updating module 405, and if not, trigger the node creating module 406;
the information updating module 405 is configured to update statistical information stored in the first linked list nodes, where the statistical information stored in each linked list node is: the obtained message attribute information is the message quantity of the attribute information stored in the linked list node;
the node creating module 406 is configured to create a linked list node according to the first storage location;
the first information storage module 407 is configured to store the obtained attribute information to the created linked list node, and update the statistical information stored in the created linked list node.
In an embodiment of the application, the hash value calculation module is specifically configured to connect character strings corresponding to the obtained attribute information to form a new character string, and perform hash calculation on the new character string by using a BKDR algorithm to obtain a first hash value.
As can be seen from the above, in the scheme provided in this embodiment, after a packet is obtained, attribute information of the packet is obtained, character strings corresponding to the obtained attribute information are connected to form a new character string, hash calculation is performed on the new character string to obtain a first hash value, a first storage position of the obtained attribute information in a preset hash chain table is determined according to the first hash value and the size of the preset hash chain table, when a first chain table node storing the obtained attribute information exists at the first storage position, statistical information stored in the first chain table node is updated, when a first chain table node does not exist at the first storage position, a chain table node is created according to the first storage position, the obtained attribute information is stored to the created chain table node, and statistical information stored in the created chain table node is updated. Therefore, if the flow table is constructed by adopting the preset hash chain table, information storage can be realized in the flow table by applying the scheme provided by the embodiment; in addition, the size of the hash chain table is preset to be a prime number, and the prime number does not have other factors except 1 and the prime number itself, so that when the scheme provided by the embodiment is applied to storing the attribute information of the message, a relatively discrete hash value can be obtained, and the throughput performance of the flow probe can be improved.
In an embodiment of the present application, compared with the embodiment shown in fig. 4, in this embodiment, the preset hash chain table is a primary hash chain table;
the node determining module 404 includes:
the table judging unit is used for judging whether a secondary hash chain table exists at the first storage position, if so, the node judging unit is triggered, and if not, the node judging unit is triggered;
the node judging unit is used for judging whether a first chain table node storing the obtained attribute information exists in the secondary hash chain table at the first storage position; if the first linked list node exists, judging that the first linked list node exists at the first storage position; if the first linked list node does not exist, judging that the first linked list node does not exist at the first storage position, creating the linked list node at a second storage position of the secondary hash linked list, storing the obtained attribute information to the created linked list node, and updating statistical information stored in the created linked list node, wherein the second storage position is as follows: calculating the position for storing the obtained attribute information in the secondary hash chain table according to the hash value of the obtained attribute information and the size of the secondary hash chain table;
the node determination unit is configured to determine that the first linked list node does not exist at the first storage location.
In an embodiment of the present application, the node creating module 406 includes:
the first node creating unit is used for creating a linked list node at the first storage position under the condition that a preset secondary hash linked list creating condition is not met;
the second node creating unit is used for creating the secondary hash chain table at the first storage position under the condition that a preset secondary hash chain table creating condition is met, and creating chain table nodes at the second storage position according to the hash value of the obtained attribute information and the size of the secondary hash chain table; wherein the second storage location is: and calculating the position for storing the obtained attribute information in the secondary hash chain table according to the hash value of the obtained attribute information and the size of the secondary hash chain table.
In an embodiment of the application, the preset condition for creating the secondary hash chain table is:
and the number of the linked list nodes at the first storage position is greater than a preset threshold value.
In an embodiment of the present application, the information storage apparatus may further include:
the condition judging module is used for judging whether the preset secondary hash chain table creating condition is met or not after chain table nodes are created at the first storage position, and if the preset secondary hash chain table creating condition is met, the chain table creating module is used for creating the chain table;
the linked list creating module is used for creating a secondary hash linked list at the first storage position;
the second information storage module is used for storing the attribute information stored in the linked list node established at the first storage position into the linked list node in the secondary hash linked list according to the hash value of the attribute information stored in the linked list node established at the first storage position and the size of the secondary hash linked list;
and the node deleting module is used for deleting the linked list nodes of the secondary hash linked list in which the attribute information is stored from the first storage position.
It can be seen from the solutions provided in the above embodiments that, when information is stored in the preset hash chain table, a secondary hash chain table can be created at each storage location in the preset hash chain table, so that attribute information, statistical information, and the like of a packet can be stored in different storage locations of the secondary hash chain table.
In the prior art, attribute information of a packet is directly stored in a linked list node at each storage position in a preset hash linked list, and when a linked list node matched with the obtained attribute information at each storage position is searched, the linked list node can only be searched backwards one by one from the first linked list node at the storage position until each linked list node at the storage position is traversed, or the linked list node matched with the obtained attribute information is searched. The searching speed is slow and the efficiency is low.
In the solutions provided in the embodiments of the present application, after the attribute information of the packet is stored in different storage locations of the secondary hash chain table, when searching for a chain table node matched with the attribute information of the packet, the storage location for storing the packet attribute information in the secondary hash chain table may be calculated according to the hash value of the packet attribute information and the size of the secondary hash chain table, and then the storage location is directly searched for in the secondary hash chain table without searching for the chain table node one by one. And because the secondary hash chain table is the next hash chain table established at the storage position of the primary hash chain table, compared with the primary hash chain table, the message attribute information types stored in the secondary hash chain table can be greatly reduced, namely, the condition of storage position conflict in the secondary hash chain table can be greatly lightened, therefore, when the preset hash chain table, namely the storage position conflict in the primary hash chain table is serious, even if the storage position conflict still exists in the secondary hash chain table, the time consumed by sequentially matching the attribute information stored in each chain table node at the storage position can be reduced, and the efficiency of subsequent data searching is improved.
Corresponding to the information storage method, the embodiment of the application also provides electronic equipment.
Fig. 5 is a schematic structural diagram of an electronic device according to an embodiment of the present application, where the electronic device includes: a processor 501 and a machine-readable storage medium 502, the machine-readable storage medium 502 storing machine-executable instructions executable by the processor 501, the processor 501 being caused by the machine-executable instructions to: the information storage method provided by the embodiment of the application is realized.
In one embodiment of the present application, there is provided an information storage method, including:
obtaining a message and obtaining attribute information of the message;
connecting character strings corresponding to the obtained attribute information to form a new character string, and performing hash calculation on the new character string to obtain a first hash value;
determining a storage position of the obtained attribute information in a preset hash chain table as a first storage position according to the first hash value and the size of the preset hash chain table, wherein the size of the preset hash chain table is a prime number;
judging whether a first linked list node storing the obtained attribute information exists at the first storage position or not;
if so, updating the statistical information stored in the first linked list nodes, wherein the statistical information stored in each linked list node is as follows: the obtained message attribute information is the message quantity of the attribute information stored in the linked list node;
if not, creating a linked list node according to the first storage position, storing the obtained attribute information to the created linked list node, and updating the statistical information stored in the created linked list node. .
It should be noted that other embodiments of the information storage method implemented by the processor 501 through machine executable instructions are the same as the embodiments mentioned in the previous embodiment of the method, and are not described herein again.
The machine-readable storage medium may include Random Access Memory (RAM) and may also include Non-Volatile Memory (NVM), such as at least one disk Memory. Alternatively, the machine-readable storage medium may be at least one memory device located remotely from the processor.
The Processor may be a general-purpose Processor, including a Central Processing Unit (CPU), a Network Processor (NP), and the like; but also Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components.
As can be seen from the above, if the flow table is constructed by using the preset hash chain table, information storage can be implemented in the flow table by applying the scheme provided in this embodiment; in addition, the size of the hash chain table is preset to be a prime number, and the prime number does not have other factors except 1 and the prime number itself, so that when the scheme provided by the embodiment is applied to storing the attribute information of the message, a relatively discrete hash value can be obtained, and the throughput performance of the flow probe can be improved.
In correspondence with the above information storage method, embodiments of the present application further provide a machine-readable storage medium storing machine-executable instructions, which, when invoked and executed by a processor, cause the processor to: the information storage method provided by the embodiment of the application is realized.
In one embodiment of the present application, there is provided an information storage method, including:
obtaining a message and obtaining attribute information of the message;
connecting character strings corresponding to the obtained attribute information to form a new character string, and performing hash calculation on the new character string to obtain a first hash value;
determining a storage position of the obtained attribute information in a preset hash chain table as a first storage position according to the first hash value and the size of the preset hash chain table, wherein the size of the preset hash chain table is a prime number;
judging whether a first linked list node storing the obtained attribute information exists at the first storage position or not;
if so, updating the statistical information stored in the first linked list nodes, wherein the statistical information stored in each linked list node is as follows: the obtained message attribute information is the message quantity of the attribute information stored in the linked list node;
if not, creating a linked list node according to the first storage position, storing the obtained attribute information to the created linked list node, and updating the statistical information stored in the created linked list node. .
It should be noted that other embodiments of the information storage method implemented by the machine-readable storage medium and causing the processor to implement are the same as the embodiments mentioned in the previous embodiment of the method, and are not described herein again.
As can be seen from the above, if the flow table is constructed by using the preset hash chain table, information storage can be implemented in the flow table by applying the scheme provided in this embodiment; in addition, the size of the hash chain table is preset to be a prime number, and the prime number does not have other factors except 1 and the prime number itself, so that when the scheme provided by the embodiment is applied to storing the attribute information of the message, a relatively discrete hash value can be obtained, and the throughput performance of the flow probe can be improved.
It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
All the embodiments in the present specification are described in a related manner, and the same and similar parts among the embodiments may be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the apparatus, electronic device, and machine-readable storage medium embodiments, since they are substantially similar to the method embodiments, the description is relatively simple, and reference may be made to some descriptions of the method embodiments for relevant points.
The above description is only for the preferred embodiment of the present application, and is not intended to limit the scope of the present application. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the present application are included in the protection scope of the present application.

Claims (14)

1. An information storage method, the method comprising:
obtaining a message and obtaining attribute information of the message;
connecting character strings corresponding to the obtained attribute information to form a new character string, and performing hash calculation on the new character string to obtain a first hash value;
determining a storage position of the obtained attribute information in a preset hash chain table as a first storage position according to the first hash value and the size of the preset hash chain table, wherein the size of the preset hash chain table is a prime number;
judging whether a first linked list node storing the obtained attribute information exists at the first storage position or not;
if so, updating the statistical information stored in the first linked list nodes, wherein the statistical information stored in each linked list node is as follows: the obtained message attribute information is the message quantity of the attribute information stored in the linked list node;
if not, creating a linked list node according to the first storage position, storing the obtained attribute information to the created linked list node, and updating the statistical information stored in the created linked list node.
2. The method of claim 1, wherein performing the hash calculation on the new string to obtain a hash value comprises:
and carrying out hash calculation on the new character string by adopting a BKDR algorithm to obtain a first hash value.
3. The method according to claim 1 or 2, wherein the preset hash chain table is a primary hash chain table;
the determining whether the first link list node storing the obtained attribute information exists at the first storage location includes:
judging whether a secondary hash chain table exists at the first storage position;
if the secondary hash chain table exists, judging whether a first chain table node storing the obtained attribute information exists in the secondary hash chain table at the first storage position; if the first linked list node exists, judging that the first linked list node exists at the first storage position; if the first linked list node does not exist, judging that the first linked list node does not exist at the first storage position, creating the linked list node at a second storage position of the secondary hash linked list, storing the obtained attribute information to the created linked list node, and updating statistical information stored in the created linked list node, wherein the second storage position is as follows: calculating the position for storing the obtained attribute information in the secondary hash chain table according to the hash value of the obtained attribute information and the size of the secondary hash chain table;
and if the secondary hash chain table does not exist, judging that the first chain table node does not exist at the first storage position.
4. The method of claim 1 or 2, wherein creating a linked list node from the first storage location comprises:
under the condition that a preset secondary hash chain table creating condition is not met, creating a chain table node at the first storage position;
under the condition that a preset secondary hash chain table creating condition is met, creating a secondary hash chain table at the first storage position, and creating a chain table node at the second storage position according to the hash value of the obtained attribute information and the size of the secondary hash chain table; wherein the second storage location is: and calculating the position for storing the obtained attribute information in the secondary hash chain table according to the hash value of the obtained attribute information and the size of the secondary hash chain table.
5. The method according to claim 4, wherein the preset secondary hash chain creation condition is:
and the number of the linked list nodes at the first storage position is greater than a preset threshold value.
6. The method of claim 5, after creating a linked list node at the first storage location, further comprising:
judging whether the preset condition for creating the secondary hash chain table is met or not;
if yes, creating a secondary hash chain table at the first storage position;
storing the attribute information stored in the linked list node established at the first storage position into the linked list node in the secondary hash linked list according to the hash value of the attribute information stored in the linked list node established at the first storage position and the size of the secondary hash linked list;
and deleting the linked list nodes of the secondary hash linked list in which the attribute information is stored from the first storage position.
7. An information storage apparatus, characterized in that the apparatus comprises:
the information acquisition module is used for acquiring messages and acquiring attribute information of the messages;
the hash value calculation module is used for connecting character strings corresponding to the obtained attribute information to form a new character string and carrying out hash calculation on the new character string to obtain a first hash value;
the position determining module is used for determining the storage position of the obtained attribute information in a preset hash chain table as a first storage position according to the first hash value and the size of the preset hash chain table, wherein the size of the preset hash chain table is a prime number;
the node judgment module is used for judging whether a first linked list node storing the obtained attribute information exists at the first storage position, if so, the information updating module is triggered, and if not, the node creating module is triggered;
the information updating module is configured to update statistical information stored in the first linked list nodes, where the statistical information stored in each linked list node is: the obtained message attribute information is the message quantity of the attribute information stored in the linked list node;
the node creating module is used for creating a linked list node according to the first storage position;
and the first information storage module is used for storing the obtained attribute information to the created linked list node and updating the statistical information stored in the created linked list node.
8. The apparatus according to claim 7, wherein the hash value calculation module is specifically configured to connect character strings corresponding to the obtained attribute information to form a new character string, and perform hash calculation on the new character string by using a BKDR algorithm to obtain the first hash value.
9. The apparatus according to claim 7 or 8, wherein the preset hash chain table is a primary hash chain table;
the node judgment module includes:
the table judging unit is used for judging whether a secondary hash chain table exists at the first storage position, if so, the node judging unit is triggered, and if not, the node judging unit is triggered;
the node judging unit is used for judging whether a first chain table node storing the obtained attribute information exists in the secondary hash chain table at the first storage position; if the first linked list node exists, judging that the first linked list node exists at the first storage position; if the first linked list node does not exist, judging that the first linked list node does not exist at the first storage position, creating the linked list node at a second storage position of the secondary hash linked list, storing the obtained attribute information to the created linked list node, and updating statistical information stored in the created linked list node, wherein the second storage position is as follows: calculating the position for storing the obtained attribute information in the secondary hash chain table according to the hash value of the obtained attribute information and the size of the secondary hash chain table;
the node determination unit is configured to determine that the first linked list node does not exist at the first storage location.
10. The apparatus of claim 7 or 8, wherein the node creation module comprises:
the first node creating unit is used for creating a linked list node at the first storage position under the condition that a preset secondary hash linked list creating condition is not met;
the second node creating unit is used for creating the secondary hash chain table at the first storage position under the condition that a preset secondary hash chain table creating condition is met, and creating chain table nodes at the second storage position according to the hash value of the obtained attribute information and the size of the secondary hash chain table; wherein the second storage location is: and calculating the position for storing the obtained attribute information in the secondary hash chain table according to the hash value of the obtained attribute information and the size of the secondary hash chain table.
11. The apparatus according to claim 10, wherein the preset secondary hash chain creation condition is:
and the number of the linked list nodes at the first storage position is greater than a preset threshold value.
12. The apparatus of claim 11, further comprising:
the condition judging module is used for judging whether the preset secondary hash chain table creating condition is met or not after chain table nodes are created at the first storage position, and if the preset secondary hash chain table creating condition is met, the chain table creating module is used for creating the chain table;
the linked list creating module is used for creating a secondary hash linked list at the first storage position;
the second information storage module is used for storing the attribute information stored in the linked list node established at the first storage position into the linked list node in the secondary hash linked list according to the hash value of the attribute information stored in the linked list node established at the first storage position and the size of the secondary hash linked list;
and the node deleting module is used for deleting the linked list nodes of the secondary hash linked list in which the attribute information is stored from the first storage position.
13. An electronic device comprising a processor and a machine-readable storage medium storing machine-executable instructions executable by the processor, the processor being caused by the machine-executable instructions to: carrying out the method steps of any one of claims 1 to 6.
14. A machine-readable storage medium having stored thereon machine-executable instructions that, when invoked and executed by a processor, cause the processor to: carrying out the method steps of any one of claims 1 to 6.
CN201811014961.2A 2018-08-31 2018-08-31 Information storage method and device Active CN109274593B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811014961.2A CN109274593B (en) 2018-08-31 2018-08-31 Information storage method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811014961.2A CN109274593B (en) 2018-08-31 2018-08-31 Information storage method and device

Publications (2)

Publication Number Publication Date
CN109274593A CN109274593A (en) 2019-01-25
CN109274593B true CN109274593B (en) 2021-06-04

Family

ID=65187020

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811014961.2A Active CN109274593B (en) 2018-08-31 2018-08-31 Information storage method and device

Country Status (1)

Country Link
CN (1) CN109274593B (en)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109962861B (en) * 2019-03-28 2022-02-25 新华三信息安全技术有限公司 Message statistical method and device
CN110995546B (en) * 2019-12-23 2022-02-25 锐捷网络股份有限公司 Message sampling method and device
CN112153696B (en) * 2020-09-25 2023-04-28 Oppo广东移动通信有限公司 RLC SDU segmentation processing method, device and terminal
CN112597158A (en) * 2020-12-17 2021-04-02 平安普惠企业管理有限公司 Data matching method and device, computer equipment and storage medium
CN113645140B (en) * 2021-07-06 2023-04-07 曙光信息产业(北京)有限公司 Message statistical method, device, storage medium and network equipment
CN113810392B (en) * 2021-08-30 2023-08-18 武汉思普崚技术有限公司 TOP ranking method, device and storage medium for massive data

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103023728A (en) * 2013-01-15 2013-04-03 中国人民解放军信息工程大学 Flow monitoring method
CN103647666A (en) * 2013-12-13 2014-03-19 北京中创信测科技股份有限公司 Method and apparatus for counting call detail record (CDR) messages and outputting results in real time
CN106095788A (en) * 2016-05-27 2016-11-09 杭州华三通信技术有限公司 A kind of date storage method and device
CN106888119A (en) * 2017-02-15 2017-06-23 金钱猫科技股份有限公司 A kind of method and system for obtaining terminal attribute

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101867607A (en) * 2010-05-21 2010-10-20 北京无限立通通讯技术有限责任公司 Distributed data access method, device and system

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103023728A (en) * 2013-01-15 2013-04-03 中国人民解放军信息工程大学 Flow monitoring method
CN103647666A (en) * 2013-12-13 2014-03-19 北京中创信测科技股份有限公司 Method and apparatus for counting call detail record (CDR) messages and outputting results in real time
CN106095788A (en) * 2016-05-27 2016-11-09 杭州华三通信技术有限公司 A kind of date storage method and device
CN106888119A (en) * 2017-02-15 2017-06-23 金钱猫科技股份有限公司 A kind of method and system for obtaining terminal attribute

Also Published As

Publication number Publication date
CN109274593A (en) 2019-01-25

Similar Documents

Publication Publication Date Title
CN109274593B (en) Information storage method and device
US7555548B2 (en) Method and apparatus for efficient data collection
US7072304B2 (en) Network path selection based on bandwidth
US8914320B2 (en) Graph generation method for graph-based search
CN106100997B (en) Network traffic information processing method and device
WO2020020098A1 (en) Network flow measurement method, network measurement device and control plane device
CN109088903A (en) A kind of exception flow of network detection method based on streaming
Liang et al. On the prefix granularity problem in NDN adaptive forwarding
Krenc et al. AS-level BGP community usage classification
KR100567320B1 (en) Flow generation method for Internet traffic measurement
JPWO2015182629A1 (en) Monitoring system, monitoring device and monitoring program
CN110932971A (en) Inter-domain path analysis method based on layer-by-layer reconstruction of request information
CN111193669B (en) Route management method and route management device
Hammerschmidt et al. Efficient learning of communication profiles from ip flow records
CN113127693B (en) Traffic data packet statistics method, device, equipment and storage medium
KR20060063544A (en) Apparatus and method for measuring per-flow information of traffic
CN111953552B (en) Data flow classification method and message forwarding equipment
CN112437022A (en) Network flow identification method, equipment and computer storage medium
CN108566335B (en) Network topology generation method based on NetFlow
CN107659653B (en) NDN network measurement data caching method and device, electronic equipment and storage medium
CN113347173B (en) Packet filtering method and device and electronic equipment
WO2017143986A1 (en) Method and device for determining resource indicator
CN111835599B (en) SketchLearn-based hybrid network measurement method, device and medium
Nakamura et al. Analysis of content availability at network failure in information-centric networking
JP4871775B2 (en) Statistical information collection device

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
GR01 Patent grant
GR01 Patent grant