CN107679148A - Session lookup method, device and the equipment of a kind of distributed file system - Google Patents

Abstract

Embodiments of the present invention provide a session search method, device, device, and computer-readable storage medium of a distributed file system, including receiving a message to be processed, and calculating a hash key value corresponding to the message to be processed according to the message to be processed; Find the hash linked list corresponding to the hash key value from the hash table according to the hash key value; judge whether the hash linked list has multiple nodes, if so, traverse the hash linked list according to the pending information, and find the session corresponding to the pending information; Move the session pointer to the head of the hash list. Since the next message to be processed is likely to belong to the same session as the current message to be processed when it arrives, the pointer of the session corresponding to the current message to be processed is moved to the head of the hash list. When processing the session corresponding to the message, the number of comparisons can be reduced, the search speed of the session can be increased, and the processing performance of the system can be improved.

Description

A session lookup method, device and equipment for a distributed file system

technical field

Embodiments of the present invention relate to the technical field of distributed file systems, and in particular, relate to a session search method, device, device, and computer-readable storage medium of a distributed file system.

Background technique

During the operation of the distributed file system, the communication between the various processes is completed through socket communication. After the process receives the message, it processes the message. The session is a basic unit of message processing, and a connection corresponds to a session. After receiving a message, it is necessary to find the session corresponding to the message, so as to proceed to the next processing flow. Usually, the session corresponding to the message is found through the hash table. The hash table includes multiple hash linked lists. Since the size of the hash table is limited, when a process has a large number of external connections, a large number of hash conflicts will occur, and each hash The sequence of multiple sessions in the linked list is fixed, which increases the number of comparisons in the session search process, increases the time required for session search, and reduces the processing performance of the system.

Therefore, how to provide a session lookup method, device, device, and computer-readable storage medium of a distributed file system that solves the above-mentioned technical problems has become a problem that those skilled in the art need to solve.

Contents of the invention

The purpose of the embodiments of the present invention is to provide a session search method, device, device, and computer-readable storage medium of a distributed file system, which can reduce the number of comparisons during use, increase the search speed of sessions, and thereby improve the processing performance of the system .

In order to solve the above technical problems, an embodiment of the present invention provides a session search method for a distributed file system, including:

receiving a message to be processed, and calculating a hash key value corresponding to the message to be processed according to the message to be processed;

Find the hash linked list corresponding to the hash key value from the hash table according to the hash key value;

Judging whether the hash linked list has multiple nodes, if so, traversing the hash linked list according to the information to be processed, and finding the session corresponding to the information to be processed;

Move the pointer of the session to the head of the hash list.

Optionally, the process of traversing the hash list according to the information to be processed to find the session corresponding to the information to be processed is:

The hash list is traversed according to the keyword in the information to be processed, and a session matching the keyword is found.

Optionally, the information to be processed includes source port number, destination port number, source IP address and destination IP address;

The process of calculating the hash key value corresponding to the message to be processed according to the message to be processed is:

Calculate the hash key value corresponding to the message to be processed according to the source port number, the destination port number, the source IP address and the destination IP address in the message to be processed.

Correspondingly, an embodiment of the present invention provides a session search device for a distributed file system, including:

A receiving module, configured to receive messages to be processed;

A calculation module, configured to calculate a hash key value corresponding to the message to be processed according to the message to be processed;

The search module is used to find the hash linked list corresponding to the hash key value from the hash table according to the hash key value;

A judging module, configured to judge whether the hash linked list has multiple nodes, and if so, trigger the traversal module;

The traversal module is configured to traverse the hash list according to the information to be processed, and find a session corresponding to the information to be processed;

The moving module is used to move the pointer of the session to the head of the hash list.

Optionally, the process of traversing the hash list according to the information to be processed to find the session corresponding to the information to be processed is:

The hash list is traversed according to the keyword in the information to be processed, and a session matching the keyword is found.

Optionally, the information to be processed includes source port number, destination port number, source IP address and destination IP address;

The process of calculating the hash key value corresponding to the message to be processed according to the message to be processed is:

Calculate the hash key value corresponding to the message to be processed according to the source port number, the destination port number, the source IP address and the destination IP address in the message to be processed.

An embodiment of the present invention provides a session search device for a distributed file system, including:

memory for storing computer programs;

A processor, configured to implement the steps of the above-mentioned session lookup method for a distributed file system when executing the computer program.

An embodiment of the present invention provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the session lookup method of the distributed file system as described above is implemented A step of.

Embodiments of the present invention provide a session search method, device, device, and computer-readable storage medium of a distributed file system, including receiving a message to be processed, and calculating a hash key value corresponding to the message to be processed according to the message to be processed; Find the hash linked list corresponding to the hash key value from the hash table according to the hash key value; judge whether the hash linked list has multiple nodes, if so, traverse the hash linked list according to the pending information, and find the session corresponding to the pending information; Move the session pointer to the head of the hash list.

Determine the corresponding hash linked list from the hash table through the pending message. When the hash has multiple nodes, it means that a hash conflict occurs. It is necessary to traverse the hash linked list according to the current pending message, starting from the head of the hash linked list one by one. Compare until the session corresponding to the message to be processed is found, and move the pointer of the session to the head of the hash list. When the next message to be processed arrives, there is a high probability that it belongs to the same session as the current message to be processed. Therefore, when searching When identifying the session corresponding to the next message to be processed, the number of comparisons can be reduced, the search speed of the session can be improved, and the processing performance of the system can be improved.

Description of drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following will briefly introduce the prior art and the accompanying drawings that need to be used in the embodiments. Obviously, the accompanying drawings in the following description are only some of the present invention. Embodiments, for those of ordinary skill in the art, other drawings can also be obtained based on these drawings without any creative effort.

Fig. 1 is a schematic flow chart of a session search method of a distributed file system;

FIG. 2 is a schematic structural diagram of a session search device for a distributed file system provided by an embodiment of the present invention.

detailed description

Embodiments of the present invention provide a session search method, device, device, and computer-readable storage medium of a distributed file system, which can reduce the number of comparisons during use, increase session search speed, and thereby improve system processing performance.

In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments It is a part of embodiments of the present invention, but not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without making creative efforts belong to the protection scope of the present invention.

Please refer to FIG. 1 . FIG. 1 is a schematic flowchart of a session search method for a distributed file system provided by an embodiment of the present invention.

The method includes:

S11: Receive the message to be processed, and calculate the hash key value corresponding to the message to be processed according to the message to be processed;

It should be noted that the receiving end receives the pending message sent by the sending end. The pending message may include source port number, destination port number, source IP address and destination IP address. Find the corresponding session, and the hash table includes multiple hash linked lists, each hash linked list corresponds to a hash key value, so the receiving end can receive the source port number, destination port number, and source IP contained in the received information to be processed The information of the address and the destination IP address calculates the hash key value corresponding to the message to be processed, wherein, the receiving end can be a process, and the sending end can be another process, that is, the two processes communicate directly.

S12: Find the hash linked list corresponding to the hash key value from the hash table according to the hash key value;

Specifically, when the hash key value corresponding to the message to be processed is calculated, the corresponding hash linked list can be found from the hash table according to the hash key value.

S13: judging whether the hash linked list has multiple nodes, if so, proceed to S14;

S14: traverse the hash list according to the information to be processed, and find the session corresponding to the information to be processed;

It should be noted that after finding the corresponding hash linked list, the number of sessions contained in the hash linked list can be judged according to the nodes of the hash linked list, that is, when the number of nodes in the hash linked list is one, then the node corresponds to The session is the session corresponding to the current message to be processed. At this time, there is no need to compare and match, and the session is the session to be searched; when the number of nodes in the hash list is two or more, it means that the hash list contains For multiple sessions, it is necessary to find a session corresponding to the current pending information from the multiple sessions. In the specific search, it is compared one by one from the first session at the head of the hash linked list. The information to be processed contains a unique identification code, and each session also corresponds to a unique identification code. According to The identification code in the information to be processed is matched with the identification code in the hash list. When an identification code consistent with the identification code in the information to be processed is found, the session corresponding to the identification code is the session to be found.

S15: Move the session pointer to the head of the hash list.

It should also be noted that after finding the session corresponding to the current message to be processed, the pointer of the session is moved to the head of the hash list. According to the principle of time locality, when the next message to be processed arrives, there is a high probability that The current pending message belongs to the same session, so the number of comparisons and search time required to find the session corresponding to the next pending message will be greatly reduced, and the moving session pointer is simple and easy. Therefore, when a hash conflict occurs, the embodiment of the present invention can increase the search speed of the session, improve the processing performance of the entire cluster and the IOPS (that is, the number of read and write operations per second) in the small file scenario.

Further, in the above S14, the process of traversing the hash list according to the information to be processed, and finding the session corresponding to the information to be processed is as follows:

According to the keyword in the information to be processed, the hash list is traversed to find the session matching the keyword.

It should be noted that the identification code contained in the message to be processed can be a keyword, so the keyword in the message to be processed can be matched one by one with the keyword in the hash table to find the corresponding keyword , so as to find the session corresponding to the message to be processed.

Further, the information to be processed in the above S14 includes source port number, destination port number, source IP address and destination IP address;

The process of calculating the hash key value corresponding to the message to be processed according to the message to be processed is:

Calculate the hash key value corresponding to the message to be processed according to the source port number, destination port number, source IP address and destination IP address in the message to be processed.

It should be noted that the information to be processed in the embodiment of the present invention includes not only the above information, but also other information, which is not limited. In addition, the embodiment of the present invention is not limited to calculating the hash key value corresponding to the message to be processed according to the source port number, the destination port number, the source IP address and the destination IP address, but also can calculate the hash key value corresponding to the message to be processed according to other parameters. The hash key value is not limited.

The embodiment of the present invention provides a method for searching a session of a distributed file system, including receiving a message to be processed, and calculating a hash key value corresponding to the message to be processed according to the message to be processed; The hash linked list corresponding to the hash key value; determine whether the hash linked list has multiple nodes, if so, traverse the hash linked list according to the information to be processed, and find the session corresponding to the pending information; move the pointer of the session to the head of the hash linked list department.

Determine the corresponding hash linked list from the hash table through the pending message. When the hash has multiple nodes, it means that a hash conflict occurs. It is necessary to traverse the hash linked list according to the current pending message, starting from the head of the hash linked list one by one. Compare until the session corresponding to the message to be processed is found, and move the pointer of the session to the head of the hash list. When the next message to be processed arrives, there is a high probability that it belongs to the same session as the current message to be processed. Therefore, when searching When identifying the session corresponding to the next message to be processed, the number of comparisons can be reduced, the search speed of the session can be improved, and the processing performance of the system can be improved.

Correspondingly, the embodiment of the present invention also discloses a session search device for a distributed file system. Please refer to FIG. 2 for details. FIG. 2 is a schematic structural diagram of a session search device for a distributed file system provided by an embodiment of the present invention. On the basis of above-mentioned embodiment:

The unit includes:

Receiving module 1, configured to receive messages to be processed;

Calculation module 2, used to calculate the hash key value corresponding to the message to be processed according to the message to be processed;

The search module 3 is used to find the hash linked list corresponding to the hash key value from the hash table according to the hash key value;

Judgment module 4, used to judge whether the hash linked list has multiple nodes, if so, trigger the traversal module 5;

The traversal module 5 is used to traverse the hash linked list according to the information to be processed to find the session corresponding to the information to be processed;

The moving module 6 is used to move the pointer of the session to the head of the hash list.

Optionally, the process of traversing the hash list according to the information to be processed to find the session corresponding to the information to be processed is:

According to the keyword in the information to be processed, the hash list is traversed to find the session matching the keyword.

Optionally, the information to be processed includes source port number, destination port number, source IP address and destination IP address;

The process of calculating the hash key value corresponding to the message to be processed according to the message to be processed is:

Calculate the hash key value corresponding to the message to be processed according to the source port number, destination port number, source IP address and destination IP address in the message to be processed.

It should be noted that the embodiment of the present invention determines the corresponding hash linked list from the hash table through the message to be processed. When the hash has multiple nodes, it means that a hash conflict occurs, and the hash linked list needs to be traversed according to the current message to be processed , compare one by one from the head of the hash list until the session corresponding to the message to be processed is found, and move the pointer of the session to the head of the hash list. When the next message to be processed arrives, there is a high probability that it will be the same message as the current message belong to the same session, therefore, when looking for the session corresponding to the next message to be processed, the number of comparisons can be reduced, the search speed of the session can be improved, and the processing performance of the system can be improved.

In addition, for the specific introduction of the session lookup method of the distributed file system involved in the embodiment of the present invention, please refer to the above method embodiment, and the present application will not repeat it here.

An embodiment of the present invention provides a session search device for a distributed file system, including:

memory for storing computer programs;

The processor is configured to implement the steps of the above-mentioned session search method for the distributed file system when executing the computer program.

An embodiment of the present invention provides a computer-readable storage medium. A computer program is stored on the computer-readable storage medium. When the computer program is executed by a processor, the steps of the above-mentioned session search method for a distributed file system are implemented.

Each embodiment in this specification is described in a progressive manner, each embodiment focuses on the difference from other embodiments, and the same and similar parts of each embodiment can be referred to each other. As for the device disclosed in the embodiment, since it corresponds to the method disclosed in the embodiment, the description is relatively simple, and for the related part, please refer to the description of the method part.

It should also be noted that in this specification, relative terms such as first and second are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply that these entities or operations There is no such actual relationship or order between the operations. Furthermore, the term "comprises", "comprises" or any other variation thereof is intended to cover a non-exclusive inclusion such that a process, method, article, or apparatus comprising a set of elements includes not only those elements, but also includes elements not expressly listed. other elements of or also include elements inherent in such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising a ..." does not exclude the presence of additional identical elements in the process, method, article or apparatus comprising said element.

Professionals can further realize that the units and algorithm steps of the examples described in conjunction with the embodiments disclosed herein can be implemented by electronic hardware, computer software or a combination of the two. In order to clearly illustrate the possible For interchangeability, in the above description, the composition and steps of each example have been generally described according to their functions. Whether these functions are executed by hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art may use different methods to implement the described functions for each specific application, but such implementation should not be regarded as exceeding the scope of the present invention.

The steps of the methods or algorithms described in conjunction with the embodiments disclosed herein may be directly implemented by hardware, software modules executed by a processor, or a combination of both. Software modules can be placed in random access memory (RAM), internal memory, read-only memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, removable disk, CD-ROM, or any other Any other known storage medium.

The above description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the invention. Therefore, the present invention will not be limited to the embodiments shown herein, but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims (8)

1. A kind of 1. session lookup method of distributed file system, it is characterised in that including：

   Receive pending message, and hash key assignments corresponding with the pending message is calculated according to the pending message；

   Hash chained lists corresponding with the hash key assignments are found from hash tables according to the hash key assignments；

   Judge whether the hash chained lists have multiple nodes, if it is, according to the pending information to the hash chains Table is traveled through, and finds session corresponding with the pending information；

   The pointer of the session is moved to the head of the hash chained lists.
2. 2. the session lookup method of distributed file system according to claim 1, it is characterised in that described in the foundation Pending information travels through to the hash chained lists, and the process for finding session corresponding with the pending information is：

   The hash chained lists are traveled through according to the keyword in the pending information, found and the keyword match Session.
3. 3. the session lookup method of distributed file system according to claim 2, it is characterised in that the pending letter Breath includes source port number, destination slogan, source IP address and purpose IP address；

   It is described hash key assignments corresponding with the pending message is calculated according to the pending message process be：

   Calculated according to source port number, destination slogan, source IP address and the purpose IP address in the pending information and institute State hash key assignments corresponding to pending message.
4. 4. device is searched in a kind of session of distributed file system, it is characterised in that including：

   Receiving module, for receiving pending message；

   Computing module, for calculating hash key assignments corresponding with the pending message according to the pending message；

   Searching modul, for finding hash chained lists corresponding with the hash key assignments from hash tables according to the hash key assignments；

   Judge module, for judging whether the hash chained lists have multiple nodes, if it is, triggering spider module；

   The spider module, for being traveled through according to the pending information to the hash chained lists, find and wait to locate with described Manage session corresponding to information；

   Mobile module, for the pointer of the session to be moved to the head of the hash chained lists.
5. 5. the session lookup method of distributed file system according to claim 4, it is characterised in that described in the foundation Pending information travels through to the hash chained lists, and the process for finding session corresponding with the pending information is：

   The hash chained lists are traveled through according to the keyword in the pending information, found and the keyword match Session.
6. 6. the session lookup method of distributed file system according to claim 5, it is characterised in that the pending letter Breath includes source port number, destination slogan, source IP address and purpose IP address；

   It is described hash key assignments corresponding with the pending message is calculated according to the pending message process be：

   Calculated according to source port number, destination slogan, source IP address and the purpose IP address in the pending information and institute State hash key assignments corresponding to pending message.
7. 7. equipment is searched in a kind of session of distributed file system, it is characterised in that including：

   Memory, for storing computer program；

   Processor, the distributed document as described in claims 1 to 3 any one is realized during for performing the computer program The step of session lookup method of system.
8. 8. a kind of computer-readable recording medium, it is characterised in that be stored with computer on the computer-readable recording medium Program, the distributed field system as described in claims 1 to 3 any one is realized when the computer program is executed by processor The step of session lookup method of system.