A data structure management method and device

Abstract

The present invention proposes a data structure management method and device. The management method includes: acquiring information of m linked list items in a linked list, wherein m is a positive integer; acquiring information of m linked list items according to information of m linked list items Activity; compare the activity of m linked list items, and delete the linked list item with the smallest activity. The present invention obtains the information of m linked list items in the linked list, and according to the information of m linked list items, obtains the activity of m linked list items, and compares the activity of m linked list items, and deletes the linked list item with the smallest activity. The invention deletes linked list items according to activity, which not only considers the time factor, but also considers the factor of data transmission, so as to avoid deleting the connection or valid connection whose data has not arrived for a long time due to network congestion and other reasons.

Description

technical field [0001] The present invention relates to the communication field, in particular to a data structure management method and device. Background technique [0002] With the rapid development of the network, the network environment is becoming more and more complex, and it is more difficult to guarantee the original order of the data transmitted in the network. At the same time, the data structure connected to the server usually adopts the sequence table structure, for the insertion and deletion of the sequence table, etc. The operation time complexity is O(n), where n is the length of the linear table. However, when the concurrent server uses the sequential table structure to store the connected clients, the efficiency of the sequential table structure is not efficient enough. [0003] At the same time, the elimination strategy usually uses the LRU (Least Recently Used) algorithm to disconnect the connection that has not been transmitted for the longest time. Howe...

AI Technical Summary

Problems solved by technology

[0003] At the same time, the elimination strategy usually uses the LRU (Least Recently Used) algorithm to disconnect the connection that has not been transmitted for the longest time. However, this elimination algorithm may delete (eliminate) long-term data due to network congestion and other reasons. There are no incoming connections. In addition, the elimination algorithm does not consider the impact of the number of data transmissions on transmission. At the same time, in the case of DDos (Distributed Denial of Service) attacks, this algorithm is also easy to delete active and effective connections.

Images