A distributed speed limit queue implementation method and device

By using a distributed speed limit queue with priority in a multi-core and multi-cue environment, using a tree storage structure and multiple independent subqueries, the problem that the existing technology cannot be used in a multi-cue concurrency system is solved, and traffic control is achieved and packets are efficiently sent.

CN114035924BActive Publication Date: 2024-11-26BEIJING TOPSEC NETWORK SECURITY TECH +2
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202111388829.X
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-11-22
Publication Date
2024-11-26
Estimated Expiration
2041-11-22

AI Technical Summary

Technical Problem

The prior art cannot effectively use distributed speed limit queues in multi-clue concurrency systems, resulting in the inability to achieve traffic control and efficient message transmission in a multi-core environment.

Method used

Adopt a distributed speed limit queue with priority, and through a tree storage structure and multiple independent subqueues, the incoming, caching and dequeuing of packets is realized. The classification filtering algorithm and status marking mechanism are used to ensure that in multiple cores Implement traffic control and efficient message sending in multiple clue scenarios.

Benefits of technology

In a multi-core and multi-cue environment, multiple clues are implemented to perform packet enqueuing, caching, dequeuing and sending operations at the same time, realizing traffic control management and efficient message sending, solving the problem that existing methods cannot be used.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114035924B_ABST
    Figure CN114035924B_ABST
Patent Text Reader

Abstract

The embodiment of the present application provides a distributed speed limit queue implementation method and device, which relates to the field of traffic scheduling technology. The method includes: when entering the queue, sending the message to the corresponding sub-queue for caching, and updating the queue status, the queue is a tree storage structure, including leaf-level nodes and container-level nodes, the container-level node is the parent node of the leaf-level node, and the leaf-level node includes multiple sub-queues for caching messages; when leaving the queue, without exceeding the limit rate of the current node, sending the message from the preset highest priority sub-queue with an available mark and updating the status mark of the current node and the parent node, through the distributed speed limit queue with priority, it can be used in multi-core multi-thread scenarios, solving the problem that the existing method cannot be used in a multi-thread concurrent system.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the technical field of traffic scheduling, and in particular to a method and device for implementing a distributed speed-limiting queue. Background Art

[0002] In a traditional single-CPU core system, there is usually only one thread for sending messages. The implementation of the outbound interface message queue is relatively simple and clear. The thread can send messages in the order of message entry / cache / outbound / send. With the development of CPU, network card hardware and system software, a device usually has multiple CPU cores, on which multiple concurrent threads can run simultaneously. A network card hardware interface can also provide multiple independent TX queues, which means that on a device, multiple concurrent threads can send and receive messages on a network interface at the same time. However, existing methods cannot be used in multi-thread concurrent systems. Summary of the invention

[0003] The purpose of the embodiments of the present application is to provide a method and device for implementing a distributed speed limit queue. Through a distributed speed limit queue with a priority, it can be used in a multi-core multi-thread scenario, solving the problem that the existing method cannot be used in a multi-thread concurrent system.

[0004] The present application provides a method for implementing a distributed rate limit queue, the method comprising:

[0005] When entering a queue, the message is sent to a corresponding subqueue for caching, and the queue state is updated. The queue is a tree storage structure, including leaf-level nodes and container-level nodes. The container-level node is the parent node of the leaf-level node. The leaf-level node includes multiple subqueues for caching messages.

[0006] When leaving the queue, if the rate limit of the current node is not exceeded, the message is sent from the sub-queue with the highest preset priority and available mark and the status marks of the current node and the parent node are updated.

[0007] In the above implementation process, a tree storage structure is set up, and multiple independent sub-queues are set on the leaf nodes to adapt to the multi-thread scenario, so that multiple threads can simultaneously execute message enqueue, cache, dequeue and send operations, realizing flow control management and efficient message sending in a multi-core environment, thereby solving the problem that the existing method cannot be used in a multi-thread concurrent system.

[0008] Further, sending the message into a corresponding subqueue for caching and updating a queue state includes:

[0009] Determine the leaf node where the message needs to be cached by using a classification filtering algorithm, so as to store the message in the subqueue;

[0010] Determine whether the mark state of the subqueue is an available state;

[0011] If not, update the marking state of the subqueue to unavailable, trace back to the corresponding parent node, and change the marking state of the parent node.

[0012] In the above implementation process, each clue sends the message to the corresponding subqueue for buffering and updates the corresponding marking state.

[0013] Furthermore, sending a message from a preset subqueue with the highest priority and an available mark and updating the status marks of the current node and the parent node without exceeding the limit rate of the current node includes:

[0014] Determine whether the rate exceeds the current node's limit;

[0015] If not, determine whether it is a container node;

[0016] If not, search the subqueue with the highest priority and available tag from the subqueues and send the message;

[0017] Update the number of sent messages of the current subqueue and the corresponding parent node.

[0018] In the above implementation process, when dequeuing, it is necessary to send a message from the subqueue of the leaf-level node and determine whether it exceeds the limit rate. After the sending is successful, the value of the number of bytes of the sent message of the current leaf-level node and all its parent nodes in the tree structure is updated.

[0019] Further, the sending of the message from the preset highest priority subqueue with an available mark and updating the status marks of the current node and the parent node without exceeding the limit rate of the current node includes:

[0020] If the rate exceeds the limit of the current node, the queue status marks of the current node and the parent node are updated, and the status marks include empty, available and unavailable.

[0021] In the above implementation process, if the limit rate is exceeded, the state is marked as unavailable.

[0022] Further, sending the message from the preset subqueue with the highest priority and an available mark includes:

[0023] If the current node is a container-level node, an available leaf-level node is searched for according to priority and it is re-determined whether the node rate of the leaf-level node exceeds the limit rate.

[0024] In the above implementation process, since the container-level node does not have a cache function, it cannot send messages, and it is necessary to find an available leaf-level node based on the priority.

[0025] Further, sending the message from the preset subqueue with the highest priority and an available mark includes:

[0026] Find the sub-queue with the highest priority according to the priority number to determine whether the sub-queue can send the message;

[0027] If not, continue searching for the next highest priority subqueue until a subqueue with an available tag is found, and send the message from the subqueue.

[0028] In the above implementation process, a search is performed level by level according to the priority until an available subqueue is found to send the message.

[0029] The embodiment of the present application also provides a distributed speed limit queue implementation device, the device comprising:

[0030] An entry module is used to send the message into a corresponding subqueue for caching and update the queue state when entering the queue. The queue is a tree storage structure, including leaf-level nodes and container-level nodes. The container-level node is the parent node of the leaf-level node. The leaf-level node includes multiple subqueues for caching messages.

[0031] The dequeue module is used to send messages from the preset highest priority subqueue with an available mark and update the status marks of the current node and the parent node when dequeuing without exceeding the limit rate of the current node.

[0032] In the above implementation process, a tree storage structure is set up, and multiple independent sub-queues are set on the leaf nodes to adapt to the multi-thread scenario, so that multiple threads can simultaneously execute message enqueue, cache, dequeue and send operations, realizing flow control management and efficient message sending in a multi-core environment, thereby solving the problem that the existing method cannot be used in a multi-thread concurrent system.

[0033] Furthermore, the enqueue module comprises:

[0034] A storage module, used for determining the leaf node where the message needs to be cached by using a classification filtering algorithm, so as to store the message in the sub-queue;

[0035] A judging module, used to judge whether the marking state of the subqueue is an available state;

[0036] The status marking module is used to update the marking status of the sub-queue to unavailable if it is unavailable, trace back the corresponding parent node, and change the marking status of the parent node.

[0037] In the above implementation process, each clue sends the message to the corresponding subqueue for buffering and updates the corresponding marking state.

[0038] An embodiment of the present application further provides an electronic device, the electronic device comprising a memory and a processor, the memory being used to store a computer program, the processor running the computer program to enable the electronic device to execute any of the above-mentioned distributed speed limit queue implementation methods.

[0039] An embodiment of the present application further provides a readable storage medium, wherein the readable storage medium stores computer program instructions, and when the computer program instructions are read and executed by a processor, any of the above-mentioned distributed speed limit queue implementation methods is executed. BRIEF DESCRIPTION OF THE DRAWINGS

[0040] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required for use in the embodiments of the present application will be briefly introduced below. It should be understood that the following drawings only show certain embodiments of the present application and therefore should not be regarded as limiting the scope. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.

[0041] Figure 1 A flowchart of a distributed speed limit queue implementation method provided in an embodiment of the present application;

[0042] Figure 2 A schematic diagram of a tree-like speed limit queue structure provided in an embodiment of the present application;

[0043] Figure 3 A schematic diagram of the structure of a leaf-level node provided in an embodiment of the present application;

[0044] Figure 4 A schematic diagram of the structure of a container-level node provided in an embodiment of the present application;

[0045] Figure 5 A schematic diagram of the queue entry process of a distributed speed limit queue provided in an embodiment of the present application;

[0046] Figure 6 A flow chart of the dequeueing of a distributed speed-limited queue provided in an embodiment of the present application;

[0047] Figure 7 A structural block diagram of a distributed speed limit queue implementation device provided in an embodiment of the present application;

[0048] Figure 8 A structural block diagram of another distributed speed limit queue implementation device provided in an embodiment of the present application.

[0049] icon:

[0050] 100-queue entry module; 101-storage module; 102-judgment module; 103-first state marking module; 200-queue exit module; 201-rate judgment module; 202-second state marking module; 203-container node judgment module; 204-search module; 205-message sending module. DETAILED DESCRIPTION

[0051] The technical solutions in the embodiments of the present application will be described below in conjunction with the drawings in the embodiments of the present application.

[0052] It should be noted that similar reference numerals and letters represent similar items in the following drawings, so once an item is defined in one drawing, it does not need to be further defined and explained in subsequent drawings. At the same time, in the description of this application, the terms "first", "second", etc. are only used to distinguish the description and cannot be understood as indicating or implying relative importance.

[0053] Example 1

[0054] Please see Figure 1 , Figure 1 A flow chart of a distributed speed limit queue implementation method provided in an embodiment of the present application. The method uses a distributed speed limit queue with priority to perform message entry / cache / dequeue / send operations, meeting the needs of multi-core and multi-thread scenarios, and realizing flow control management and efficient message sending in multi-core and multi-thread scenarios.

[0055] A tree storage structure is adopted, and an independent sub-queue is set for each message sending thread on the leaf node to adapt to multi-thread scenarios, so that multiple threads can perform message enqueue, cache, dequeue and send operations at the same time.

[0056] Specifically, in the tree storage structure, nodes are divided into two categories: leaf-level nodes that support caching, and container-level nodes that do not support caching. Leaf-level nodes can cache messages but cannot include other nodes. Container-level nodes cannot cache messages but can include other leaf-level nodes or container-level nodes as their child nodes, such as Figure 2 As shown, it is a schematic diagram of a tree-like speed limit queue structure, where A and B are container-level nodes, and C, D, E, and F are leaf-level nodes.

[0057] like Figure 3The figure shows the structure of the leaf-level node. The leaf-level node is set with information such as queue limit rate, time interval cycle, maximum number of bytes, priority, queue status, parent node, and number of bytes of sent messages, and provides an independent cache sub-queue and status mark for each clue. Each leaf-level node contains N sub-queues, and the priority is used for the order selection when the message is out of the queue.

[0058] like Figure 4 As shown, it is a schematic diagram of the structure of the container-level node. The container-level node is set with information such as queue limit rate, time interval period, maximum number of bytes, priority, queue status, parent node, child node and number of bytes of sent messages, and a status mark is provided for each clue.

[0059] Specifically, the queue limit rate is the number of bytes per second; the time interval period, that is, the maximum number of bytes allowed to pass is cleared at a certain interval. For example, 100M bytes are allowed to pass in 1 second, and then they are cleared and recounted after 1 second; the maximum number of bytes means the upper limit of the number of bytes allowed to pass within the time interval period, which can be calculated by the queue limit rate and the time interval period; the status flag includes empty, available, and unavailable. When the status flag is empty or available, the message can be cached in the corresponding subqueue.

[0060] In the tree structure, the priority of each node is preset when configuring the node. The priority can be described by an integer. The larger the value, the lower the priority. The priority needs to be set when creating the node, and dynamic adjustment is not supported afterwards.

[0061] Based on the above structural settings of leaf-level nodes and container-level nodes, the method specifically includes the following steps:

[0062] Step S100: When entering a queue, the message is sent to a corresponding subqueue for caching, and the queue state is updated. The queue is a tree storage structure, including leaf-level nodes and container-level nodes. The container-level node is the parent node of the leaf-level node. The leaf-level node includes multiple subqueues for caching messages.

[0063] This step may specifically include:

[0064] Step S101: using a classification filtering algorithm to determine the leaf node where the message needs to be cached, so as to store the message in the sub-queue;

[0065] Step S102: determining whether the mark state of the subqueue is an available state;

[0066] Step S103: If not, update the marking state of the subqueue to unavailable, trace back the corresponding parent node, and change the marking state of the parent node.

[0067] like Figure 5 The figure shows the process flow of entering the distributed speed-limited queue. When a message enters the queue, the classification and filtering algorithm is first used to determine which leaf-level node the message needs to be cached in. Each thread (equivalent to a thread) sends the message to the subqueue corresponding to the thread in the leaf queue for caching; it is determined whether the mark state of the leaf queue is marked as a message to be sent, that is, whether the mark state of the subqueue is available. If it is unavailable, the mark state of the subqueue is unavailable, the number of message bytes in the subqueue is recorded, and the parent node is traced back and its corresponding mark state is changed.

[0068] In addition, for the classification and filtering algorithm, for example, the message can be classified according to the protocol, function and address of the message and the leaf-level node and the corresponding sub-queue that the message needs to be cached can be determined, and no limitation is made here.

[0069] Step S200: When leaving the queue, if the rate limit of the current node is not exceeded, the message is sent from the sub-queue with the highest preset priority and the available mark, and the status marks of the current node and the parent node are updated.

[0070] When a message is out of the queue, in the current leaf-level node, if the rate exceeds the limit, the current message is discarded. If the rate does not exceed the limit, the message is sent directly from the queue. When the message is sent successfully, an atomic operation is used to update the value of the number of bytes of the message sent in this leaf-level node and all its parent nodes in the tree structure.

[0071] Specifically, Figure 6 As shown in FIG. 1 , it is a flow chart of the dequeueing of a distributed speed-limited queue, and the steps specifically include:

[0072] Step S201: Determine whether the current rate of the current node exceeds the limit rate of the current node;

[0073] Step S202: If it exceeds, it is necessary to update the status mark of the current node and retroactively update the status mark in its parent node;

[0074] Step S203: If not, determine whether the current node is a container-level node;

[0075] Step S204: if the current node is a container-level node, then search for the next available child node with an available mark and the highest priority according to the priority, and return to step S201 to re-determine whether the rate of the child node exceeds the limit rate;

[0076] Step S205: If the current node is a leaf-level node, find a subqueue with an available mark and the highest priority from the subqueues of the leaf-level node, send a message from it, then update the current subqueue and retroactively modify the number of sent messages of the parent node.

[0077] If all subqueues in the container queue cannot send messages, the current process ends.

[0078] In the scenario of multi-core and multi-thread, this method describes a distributed rate-limited queue with priority, so that multiple threads can execute message enqueue / cache / dequeue / send operations simultaneously, realizing flow control management and efficient message sending in a multi-core environment.

[0079] Example 2

[0080] The present application embodiment provides a distributed speed limit queue implementation device, such as Figure 7 As shown, it is a structural block diagram of a distributed speed limit queue implementation device, which may specifically include but is not limited to:

[0081] The queue entry module 100 is used to send the message to the corresponding subqueue for caching and update the queue state when entering the queue. The queue is a tree storage structure, including leaf-level nodes and container-level nodes. The container-level node is the parent node of the leaf-level node. The leaf-level node includes multiple subqueues for caching messages.

[0082] The dequeue module 200 is used to send a message from a preset subqueue with the highest priority and an available mark and update the status mark of the current node and the corresponding parent node when dequeuing without exceeding the limit rate of the current node.

[0083] like Figure 8 As shown, it is a structural block diagram of another distributed speed limit queue implementation device, wherein the queue entry module 100 includes:

[0084] The storage module 101 is used to determine the leaf node where the message needs to be cached by using a classification filtering algorithm, so as to store the message in the sub-queue;

[0085] A determination module 102 is used to determine whether the marking state of the subqueue is an available state;

[0086] The first status marking module 103 is used to update the marking status of the subqueue to unavailable if it is unavailable, trace back the corresponding parent node, and change the marking status of the parent node.

[0087] The dequeue module 200 includes:

[0088] Rate determination module 201: determines whether the current rate of the current node exceeds the limit rate of the current node;

[0089] Second status marking module 202: if exceeded, it is necessary to update the status mark of the current node and retroactively update the status mark in its parent node;

[0090] Container node determination module 203: if not exceeded, determine whether the current node is a container-level node;

[0091] Search module 204: if the current node is a container-level node, search for the next available child node with an available mark and the highest priority according to the priority, and return to step S201 to re-determine whether the rate of the child node exceeds the limit rate;

[0092] Message sending module 205: If the current node is a leaf node, find the subqueue with the available mark and the highest priority from the subqueues, send a message from it, then update the current node and retroactively modify the number of sent messages of the parent node.

[0093] An embodiment of the present application further provides an electronic device, which includes a memory and a processor, wherein the memory is used to store a computer program, and the processor runs the computer program to enable the electronic device to execute the distributed speed limit queue implementation method described in Example 1.

[0094] The embodiment of the present application further provides a readable storage medium, wherein the readable storage medium stores computer program instructions. When the computer program instructions are read and executed by a processor, the distributed speed limit queue implementation method described in Embodiment 1 is executed.

[0095] In several embodiments provided in the present application, it should be understood that the disclosed devices and methods can also be implemented in other ways. The device embodiments described above are merely schematic. For example, the flowcharts and block diagrams in the accompanying drawings show the possible architecture, functions and operations of the devices, methods and computer program products according to multiple embodiments of the present application. In this regard, each box in the flowchart or block diagram can represent a module, a program segment or a part of a code, and the module, a program segment or a part of a code contains one or more executable instructions for implementing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two consecutive boxes can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram and / or flowchart, and the combination of boxes in the block diagram and / or flowchart can be implemented with a dedicated hardware-based system that performs a specified function or action, or can be implemented with a combination of dedicated hardware and computer instructions.

[0096] In addition, the functional modules in the various embodiments of the present application may be integrated together to form an independent part, or each module may exist separately, or two or more modules may be integrated to form an independent part.

[0097] If the function is implemented in the form of a software function module and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application can be essentially or partly embodied in the form of a software product that contributes to the prior art. The computer software product is stored in a storage medium and includes several instructions for a computer device (which can be a personal computer, server, or network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk, and other media that can store program codes.

[0098] The above description is only an embodiment of the present application and is not intended to limit the scope of protection of the present application. For those skilled in the art, the present application may have various changes and variations. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present application should be included in the scope of protection of the present application. It should be noted that similar reference numerals and letters represent similar items in the following drawings, so once an item is defined in one drawing, it does not need to be further defined and explained in the subsequent drawings.

[0099] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any technician familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

[0100] It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the sentence "comprise a ..." do not exclude the existence of other identical elements in the process, method, article or device including the elements.

Claims

1. A distributed speed limit queue implementation method, characterized in that: The method comprises: When entering a queue, the message is sent to the corresponding subqueue for caching, and the queue status is updated. The queue is a tree storage structure, including leaf-level nodes and container-level nodes. The container-level node is the parent node of the leaf-level node. The leaf-level node includes multiple subqueues for caching messages; the leaf-level node can cache messages but cannot accommodate other nodes, and the container-level node cannot cache messages but can accommodate other leaf-level nodes or container-level nodes as its own child nodes; When leaving the queue, if the rate limit of the current node is not exceeded, the message is sent from the preset sub-queue with the highest priority and available mark and the status mark of the current node and the parent node is updated: Determine whether the current rate of the current node exceeds the limit rate of the current node; If the rate does not exceed the current node's limit, determine whether it is a container-level node; If the current node is not a container-level node, search for the highest priority subqueue with an available mark from the subqueues and send the message; update the number of sent messages of the current subqueue and the corresponding parent node; if the current node is a container-level node, search for available leaf-level nodes according to priority and re-determine whether the node rate of the leaf-level node exceeds the limit rate; If the rate limit of the current node is exceeded, the queue status marks of the current node and the parent node are updated, and the status marks include empty, available, and unavailable.

2. The distributed speed limit queue implementation method according to claim 1, characterized in that: The sending of the message into the corresponding sub-queue for caching and updating the queue state includes: Determine the leaf node where the message needs to be cached by using a classification filtering algorithm, so as to store the message in the subqueue; Determine whether the mark state of the subqueue is an available state; If not, update the marking state of the subqueue to unavailable, trace back to the corresponding parent node, and change the marking state of the parent node.

3. The distributed speed limit queue implementation method according to claim 1, characterized in that: The sending of the message from the subqueue with the highest preset priority and an available mark includes: Find the sub-queue with the highest priority according to the priority number to determine whether the sub-queue can send the message; If not, continue searching for the next highest priority subqueue until a subqueue with an available tag is found, and send the message from the subqueue.

4. A distributed speed limit queue implementation device, characterized in that: The device comprises: An entry module is used to send the message to the corresponding subqueue for caching and update the queue status when entering the queue. The queue is a tree storage structure, including leaf-level nodes and container-level nodes. The container-level node is the parent node of the leaf-level node. The leaf-level node includes multiple subqueues for caching messages. The leaf-level node can cache messages but cannot accommodate other nodes. The container-level node cannot cache messages but can accommodate other leaf-level nodes or container-level nodes as its own child nodes. The dequeue module is used to send the message from the preset highest priority subqueue with available mark and update the status mark of the current node and the parent node when dequeuing, without exceeding the limit rate of the current node; The dequeue module comprises: The rate determination module is used to determine whether the current rate of the current node exceeds the limit rate of the current node; Container node judgment module: used to judge whether it is a container-level node if the rate does not exceed the limit rate of the current node; Message sending module: if the current node is not a container-level node, it searches for the subqueue with the highest priority and available mark from the subqueues and sends the message; it updates the number of sent messages of the current subqueue and the corresponding parent node; Search module: used for searching available leaf-level nodes according to priority and re-determining whether the node rate of the leaf-level node exceeds the limit rate if the current node is a container-level node; The second status marking module is used to update the status mark of the current node if the rate exceeds the limit of the current node, and the status mark includes empty, available and unavailable.

5. The distributed speed limit queue implementation device according to claim 4, characterized in that: The enqueue module includes: A storage module, used for determining the leaf node where the message needs to be cached by using a classification filtering algorithm, so as to store the message in the sub-queue; A judging module, used to judge whether the marking state of the subqueue is an available state; The status marking module is used to update the marking status of the sub-queue to unavailable if it is unavailable, trace back the corresponding parent node, and change the marking status of the parent node.

6. An electronic device, characterized in that: The electronic device comprises a memory and a processor, the memory is used to store a computer program, and the processor runs the computer program to enable the electronic device to execute the distributed speed limit queue implementation method according to any one of claims 1 to 3.

7. A readable storage medium, characterized in that: The readable storage medium stores computer program instructions, and when the computer program instructions are read and executed by a processor, the distributed speed limit queue implementation method according to any one of claims 1 to 3 is executed.