Optimization methods and systems for multi-hop networks

Abstract

The application provides an optimization method and system of a multi-hop network, wherein the optimization method comprises the following steps: obtaining to-be-enqueued data of a link layer in the multi-hop network when a data enqueuing instruction is received, wherein the to-be-enqueued data comprises service flow data and forwarding flow data; calculating a first average enqueuing time of the to-be-enqueued data into a corresponding buffer queue; obtaining a second average enqueuing time of a current node; judging whether the first average enqueuing time is greater than or equal to the second average enqueuing time; and if yes, discarding corresponding to-be-enqueued data. The application can make the multi-hop network obtain better throughput and fairness.

Description

Technical Field

[0001] This invention relates to the field of communication network technology, and specifically to an optimization method and system for multi-hop networks. Background Technology

[0002] A wireless ad hoc network is a wireless network composed of wireless nodes without a central node. Each node in a wireless ad hoc network can act as both a router and a terminal, forming a multi-hop wireless ad hoc network.

[0003] In related technologies, the Distributed Coordination Function (DCF) in the IEEE 802.11 protocol is a standard used in the MAC layer of ad hoc networks, employing CSMA / CA technology. DCF can avoid conflicts caused by multiple nodes simultaneously accessing the network, enabling asynchronous data transmission. However, this approach suffers from fairness issues in multi-hop ad hoc networks where point-to-point and multi-hop services coexist. When the overall network traffic approaches saturation, multi-hop traffic decreases significantly compared to point-to-point traffic, resulting in poor throughput and fairness in multi-hop networks. Summary of the Invention

[0004] To address the aforementioned technical problems, this invention provides an optimization method and system for multi-hop networks, enabling them to achieve better throughput and fairness.

[0005] The technical solution adopted in this invention is as follows:

[0006] An optimization method for a multi-hop network includes the following steps: upon receiving a data enqueue instruction, acquiring the data to be enqueued at the link layer of the multi-hop network, wherein the data to be enqueued includes service flow data and forwarding flow data; calculating the first average enqueue time for the data to be enqueued to enter the corresponding buffer queue; acquiring the second average enqueue time of the current node; determining whether the first average enqueue time is greater than or equal to the second average enqueue time; if so, discarding the corresponding data to be enqueued.

[0007] In one embodiment of the present invention, before calculating the first average entry time of the data to be entered into the corresponding buffer queue, the method includes: obtaining the data source address of the data to be entered; determining whether the data to be entered has a corresponding buffer queue based on the data source address; and if not, creating the buffer queue corresponding to the data to be entered.

[0008] In one embodiment of the present invention, before calculating the first average entry time of the data to be entered into the corresponding buffer queue, the method further includes: when receiving a data transmission instruction, using a polling mechanism to access each buffer queue in sequence, and sending the corresponding data to be transmitted according to the result of the in-sequence access.

[0009] In one embodiment of the present invention, the polling mechanism is used to access each of the buffer queues in sequence, and the corresponding data to be sent is sent according to the result of the sequential access. This includes: determining whether the data to be sent exists in the current buffer queue; if the data to be sent does not exist in the current buffer queue, waiting in the current buffer queue for a preset time, and determining whether the data to be sent exists in the current buffer queue within the preset time; if the data to be sent exists in the current buffer queue within the preset time, sending the data to be sent, and continuing to query the next buffer queue; if the data to be sent does not exist in the current buffer queue within the preset time, continuing to query the next buffer queue.

[0010] An optimization system for a multi-hop network includes: a first acquisition module, configured to acquire data to be enqueued at the link layer of the multi-hop network upon receiving a data enqueue instruction, wherein the data to be enqueued includes service flow data and forwarding flow data; a calculation module, configured to calculate a first average enqueue time for the data to be enqueued to enter the corresponding buffer queue; a second acquisition module, configured to acquire a second average enqueue time for the current node; a judgment module, configured to determine whether the first average enqueue time is greater than or equal to the second average enqueue time; and a data processing module, configured to discard the corresponding data to be enqueued when the first average enqueue time is greater than or equal to the second average enqueue time.

[0011] In one embodiment of the present invention, before calculating the first average entry time of the data to be entered into the corresponding buffer queue, the calculation module is further configured to: obtain the data source address of the data to be entered; determine whether the data to be entered has a corresponding buffer queue based on the data source address; if not, create the buffer queue corresponding to the data to be entered.

[0012] In one embodiment of the present invention, the data processing module is further configured to: upon receiving a data transmission instruction, use a polling mechanism to access each of the buffer queues in sequence, and transmit the corresponding data to be transmitted according to the result of the sequential access.

[0013] In one embodiment of the present invention, the data processing module is specifically configured to: determine whether the data to be sent exists in the current buffer queue; if the data to be sent does not exist in the current buffer queue, wait in the current buffer queue for a preset time, and determine whether the data to be sent exists in the current buffer queue within the preset time; if the data to be sent exists in the current buffer queue within the preset time, send the data to be sent, and continue to query the next buffer queue; if the data to be sent does not exist in the current buffer queue within the preset time, continue to query the next buffer queue.

[0014] The beneficial effects of this invention are:

[0015] This invention enables multi-hop networks to achieve better throughput and fairness by adjusting the inbound rate of different data streams into the buffer queue of the link layer. Attached Figure Description

[0016] Figure 1 This is a flowchart of an optimization method for multi-hop networks according to an embodiment of the present invention;

[0017] Figure 2 This is a block diagram of an optimization system for a multi-hop network according to an embodiment of the present invention. Detailed Implementation

[0018] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0019] Figure 1 This is a flowchart of an optimization method for multi-hop networks according to an embodiment of the present invention.

[0020] like Figure 1 As shown, the optimization method for multi-hop networks according to an embodiment of the present invention includes the following steps:

[0021] S1, upon receiving a data entry instruction, acquires the data to be entered into the link layer of the multi-hop network, including service flow data and forwarding flow data.

[0022] S2, calculate the first average entry time for the data to be entered into the corresponding buffer queue.

[0023] In one embodiment of the present invention, before calculating the first average entry time of the data to be entered into the corresponding buffer queue, the data source address of the data to be entered can be obtained first, and it can be determined whether the data to be entered has a corresponding buffer queue based on the data source address. If the data to be entered does not have a corresponding buffer queue, a buffer queue for the data to be entered can be created.

[0024] Specifically, during the data enqueueing process, when each piece of data to be enqueued arrives, the data source address of the data to be enqueued is checked, and it is determined whether a corresponding buffer queue exists for that data. If no corresponding buffer queue exists, a buffer queue for the data to be enqueued is created locally first, then the data to be enqueued is enqueued, and the enqueue time t of the data to be enqueued is recorded. i (1) If a corresponding buffer queue exists, the data to be enqueued is directly enqueued, and the enqueuing time of the data to be enqueued is recorded.

[0025] Furthermore, this can be based on the entry time t of the first data packet of the recorded data to be entered. i (1) and the entry time t of the last data packet i (l) Calculate the first average entry time t for the data to be entered into the buffer queue. i The first average entry time t can be calculated using the following formula. i :

[0026]

[0027] Where k is the number of data packets to be enqueued, a is the initial parameter, i is the number of the buffer queue (i = 1, 2, ..., l), and l is the number of data packets already enqueued.

[0028] S3, obtain the second average entry time of the current node.

[0029] Specifically, the second average enqueue time t of the current node can be calculated using the following formula:

[0030]

[0031] Where N is the number of buffer queues.

[0032] S4, determine whether the first average entry time is greater than or equal to the second average entry time.

[0033] S5, if so, discard the corresponding data to be added to the column.

[0034] Specifically, in a multi-hop network, locally generated service flow data arrives at the queue faster than forwarded flow data, resulting in a faster enqueueing speed and an imbalance in enqueueing rates among different flows. To address this, in this embodiment of the invention, the first average enqueueing time t is calculated separately... i Second average entry time Then, the first average entry time t i Second average entry time Compare the results. If the first average entry time t i Greater than or equal to the second average entry time Then discard the corresponding data to be added; if the first average entry time t i Less than the second average entry time Then the data to be enqueued is enqueued. Thus, by using a decision-making method based on average arrival time, the enqueue rate of data streams with different speeds is adjusted, so that the amount of queued data for each stream can be kept basically consistent, thereby enabling the multi-hop network to achieve better throughput and fairness.

[0035] Understandably, unlike local business data, the time interval between arrivals of forwarded stream data in the queue is relatively long (local data generally arrives continuously). Therefore, the queue of forwarded stream data has more idle time, and the forwarded stream queue is likely to be empty during the polling process. To address this, this invention introduces an appropriate delay to wait for the arrival of forwarded data.

[0036] Specifically, in one embodiment of the present invention, when an instruction to send data is received, a polling mechanism can be used to access each buffer queue in sequence, and the corresponding data to be sent can be sent according to the result of the sequential access.

[0037] Specifically, it can determine whether there is data to be sent in the current buffer queue. If there is data to be sent, it is sent out, and the system continues to query the next buffer queue. If there is no data to be sent in the current buffer queue, it can wait in the current buffer queue for a preset time and determine whether there is data to be sent within the preset time. If there is data to be sent in the current buffer queue within the preset time, it is sent out, and the system continues to query the next buffer queue. If there is still no data to be sent in the current buffer queue within the preset time, the system continues to query the next buffer queue. The preset time can be set as the first average enqueue time.

[0038] Therefore, this invention combines a polling queue mechanism with packet estimation of the arrival queue. Based on the arrival speed of each stream of data, it determines whether the current packet should be enqueued. When polling an empty queue, a waiting mechanism is added. The waiting time is the average arrival time interval of the queue, ensuring that each stream of data has an equal opportunity to obtain channel transmission, thus enabling multi-hop networks to achieve better throughput and fairness.

[0039] In summary, the optimization method for multi-hop networks according to embodiments of the present invention obtains the data to be enqueued at the link layer of the multi-hop network when a data enqueue instruction is received, calculates the first average enqueue time for the data to be enqueued to enter the corresponding buffer queue, then obtains the second average enqueue time of the current node and determines whether the first average enqueue time is greater than or equal to the second average enqueue time. If so, the corresponding data to be enqueued is discarded. Thus, the multi-hop network can achieve better throughput and fairness.

[0040] To implement the optimization method for multi-hop networks described in the above embodiments, this invention also proposes an optimization system for multi-hop networks.

[0041] like Figure 2 As shown, the multi-hop network optimization system of this embodiment includes: a first acquisition module 10, a calculation module 20, a second acquisition module 30, a judgment module 40, and a data processing module 50. The acquisition module 10 is used to acquire the data to be enqueued at the link layer in the multi-hop network when a data enqueue instruction is received. The data to be enqueued includes service flow data and forwarding flow data. The calculation module 20 is used to calculate the first average enqueue time for the data to be enqueued to enter the corresponding buffer queue. The second acquisition module 30 is used to acquire the second average enqueue time of the current node. The judgment module 40 is used to determine whether the first average enqueue time is greater than or equal to the second average enqueue time. The data processing module 50 is used to discard the corresponding data to be enqueued when the first average enqueue time is greater than or equal to the second average enqueue time.

[0042] In one embodiment of the present invention, before calculating the first average entry time of the data to be entered into the corresponding buffer queue, the calculation module 20 can also obtain the data source address of the data to be entered, and determine whether the data to be entered has a corresponding buffer queue based on the data source address. If the data to be entered does not have a corresponding buffer queue, a buffer queue for the data to be entered can be created.

[0043] Specifically, during the data enqueueing process, when each piece of data to be enqueued arrives, the data source address of the data to be enqueued is checked, and it is determined whether a corresponding buffer queue exists for that data. If no corresponding buffer queue exists, a buffer queue for the data to be enqueued is created locally first, then the data to be enqueued is enqueued, and the enqueue time t of the data to be enqueued is recorded. i (1) If a corresponding buffer queue exists, the data to be enqueued is directly enqueued, and the enqueuing time of the data to be enqueued is recorded.

[0044] Furthermore, the calculation module 20 can calculate based on the entry time t of the first data packet of the recorded data to be entered. i (1) and the entry time t of the last data packeti (l) Calculate the first average entry time t for the data to be entered into the buffer queue. i The first average entry time t can be calculated using the following formula. i :

[0045]

[0046] Where k is the number of data packets to be enqueued, a is the initial parameter, i is the number of the buffer queue (i = 1, 2, ..., l), and l is the number of data packets already enqueued.

[0047] In one embodiment of the present invention, the second acquisition module 30 can calculate the second average entry time of the current node using the following formula.

[0048]

[0049] Where N is the number of buffer queues.

[0050] In one embodiment of the present invention, in a multi-hop network, locally generated service flow data arrives at the queue faster than forwarded flow data, and therefore has a faster enqueueing speed, resulting in an imbalance in enqueueing rates among different flows. Therefore, in this embodiment of the present invention, after calculating the first average enqueueing time t... i Second average entry time Then, the first average entry time t i Second average entry time Compare the results. If the first average entry time t i Greater than or equal to the second average entry time Then discard the corresponding data to be added; if the first average entry time t i Less than the second average entry time Then the data to be enqueued is enqueued. Thus, by using a decision-making method based on average arrival time, the enqueue rate of data streams with different speeds is adjusted, so that the amount of queued data for each stream can be kept basically consistent, thereby enabling the multi-hop network to achieve better throughput and fairness.

[0051] Understandably, unlike local business data, the time interval between arrivals of forwarded stream data in the queue is relatively long (local data generally arrives continuously). Therefore, the queue of forwarded stream data has more idle time, and the forwarded stream queue is likely to be empty during the polling process. To address this, this invention introduces an appropriate delay to wait for the arrival of forwarded data.

[0052] Specifically, in one embodiment of the present invention, when the data processing module 50 receives an instruction to send data, it can use a polling mechanism to access each buffer queue in sequence and send the corresponding data to be sent according to the result of the sequential access.

[0053] Specifically, the data processing module 50 can determine whether there is data to be sent in the current buffer queue. If there is data to be sent in the current buffer queue, the data is sent out, and the system continues to query the next buffer queue. If there is no data to be sent in the current buffer queue, the system can wait in the current buffer queue for a preset time and determine whether there is data to be sent in the current buffer queue within the preset time. If there is data to be sent in the current buffer queue within the preset time, the data is sent out, and the system continues to query the next buffer queue. If there is still no data to be sent in the current buffer queue within the preset time, the system continues to query the next buffer queue. The preset time can be set as the first average enqueue time.

[0054] Therefore, this invention combines a polling queue mechanism with packet estimation of the arrival queue. Based on the arrival speed of each stream of data, it determines whether the current packet should be enqueued. When polling an empty queue, a waiting mechanism is added. The waiting time is the average arrival time interval of the queue, ensuring that each stream of data has an equal opportunity to obtain channel transmission, thus enabling multi-hop networks to achieve better throughput and fairness.

[0055] In summary, the multi-hop network optimization system according to the embodiments of the present invention obtains the data to be enqueued in the link layer of the multi-hop network when the acquisition module receives the data enqueue instruction, calculates the first average enqueue time for the data to be enqueued into the corresponding buffer queue through the calculation module, and then obtains the second average enqueue time of the current node through the second acquisition module and judges whether the first average enqueue time is greater than or equal to the second average enqueue time through the judgment module. If so, the data processing module discards the corresponding data to be enqueued. Thus, the multi-hop network can achieve better throughput and fairness.

[0056] In the description of this invention, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of indicated technical features. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. "A plurality of" means two or more, unless otherwise explicitly specified.

[0057] In this invention, unless otherwise explicitly specified and limited, the terms "installation," "connection," "linking," and "fixing," etc., should be interpreted broadly. For example, they can refer to a fixed connection, a detachable connection, or an integral part; they can refer to a mechanical connection or an electrical connection; they can refer to a direct connection or an indirect connection through an intermediate medium; they can refer to the internal communication of two components or the interaction between two components. Those skilled in the art can understand the specific meaning of the above terms in this invention according to the specific circumstances.

[0058] In this invention, unless otherwise explicitly specified and limited, "above" or "below" the second feature can mean that the first feature is in direct contact with the second feature, or that the first feature is in indirect contact with the second feature through an intermediate medium. Furthermore, "above," "over," and "on top" of the second feature can mean that the first feature is directly above or diagonally above the second feature, or simply that the first feature is at a higher horizontal level than the second feature. "Below," "below," and "under" the second feature can mean that the first feature is directly below or diagonally below the second feature, or simply that the first feature is at a lower horizontal level than the second feature.

[0059] In the description of this specification, the references to terms such as "one embodiment," "some embodiments," "example," "specific example," or "some examples," etc., indicate that a specific feature, structure, material, or characteristic described in connection with that embodiment or example is included in at least one embodiment or example of the present invention. In this specification, the illustrative expressions of the above terms do not necessarily refer to the same embodiment or example. Furthermore, the specific features, structures, materials, or characteristics described may be combined in any suitable manner in one or more embodiments or examples. Moreover, without contradiction, those skilled in the art can combine and integrate the different embodiments or examples described in this specification, as well as the features of different embodiments or examples.

[0060] Any process or method description in the flowchart or otherwise herein can be understood as representing a module, segment, or portion of code comprising one or more executable instructions for implementing a particular logical function or process, and the scope of the preferred embodiments of the invention includes additional implementations in which functions may be performed not in the order shown or discussed, including substantially simultaneously or in reverse order depending on the functions involved, as will be understood by those skilled in the art to which embodiments of the invention pertain.

[0061] The logic and / or steps represented in the flowchart or otherwise described herein, for example, can be considered as a ordered list of executable instructions for implementing logical functions, and can be embodied in any computer-readable medium for use by, or in conjunction with, an instruction execution system, system, or device (such as a computer-based system, a processor-including system, or other system that can fetch and execute instructions from, an instruction execution system, system, or device). For the purposes of this specification, "computer-readable medium" can be any system that can contain, store, communicate, propagate, or transmit programs for use by, or in conjunction with, an instruction execution system, system, or device. More specific examples (a non-exhaustive list) of computer-readable media include: electrical connections having one or more wires (electronic systems), portable computer disk drives (magnetic systems), random access memory (RAM), read-only memory (ROM), erasable and editable read-only memory (EPROM or flash memory), fiber optic systems, and portable optical disc read-only memory (CDROM). Alternatively, the computer-readable medium may be paper or other suitable media on which the program can be printed, since the program can be obtained electronically, for example, by optically scanning the paper or other medium, followed by editing, interpreting, or otherwise processing as necessary, and then stored in a computer memory.

[0062] It should be understood that various parts of the present invention can be implemented in hardware, software, firmware, or a combination thereof. In the above embodiments, multiple steps or methods can be implemented in software or firmware stored in memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, it can be implemented using any one or a combination of the following techniques known in the art: discrete logic circuits having logic gates for implementing logical functions on data signals, application-specific integrated circuits (ASICs) having suitable combinational logic gates, programmable gate arrays (PGAs), field-programmable gate arrays (FPGAs), etc.

[0063] Those skilled in the art will understand that all or part of the steps of the methods in the above embodiments can be implemented by a program instructing related hardware. The program can be stored in a computer-readable storage medium, and when executed, the program includes one or a combination of the steps of the method embodiments.

[0064] Furthermore, the functional units in the various embodiments of the present invention can be integrated into a processing module, or each unit can exist physically separately, or two or more units can be integrated into a module. The integrated module can be implemented in hardware or as a software functional module. If the integrated module is implemented as a software functional module and sold or used as an independent product, it can also be stored in a computer-readable storage medium.

[0065] Although embodiments of the present invention have been shown and described above, it is understood that the above embodiments are exemplary and should not be construed as limiting the present invention. Those skilled in the art can make changes, modifications, substitutions and variations to the above embodiments within the scope of the present invention.

Claims

1. A method of optimizing a multi-hop network, characterized in that, The method comprises the following steps: Upon receiving a data enqueuing instruction, obtaining link layer data to be enqueued in the multi-hop network, wherein the data to be enqueued comprises service flow data and forwarding flow data; calculating a first average enqueuing time of the data to be enqueued into a corresponding buffer queue; wherein, before calculating the first average enqueuing time of the data to be enqueued into the corresponding buffer queue, the following steps are included: obtaining a data source address of the data to be enqueued; judging whether the data to be enqueued has a corresponding buffer queue according to the data source address; if not, creating the corresponding buffer queue of the data to be enqueued, enqueuing the data to be enqueued, and recording the enqueuing time of the data to be enqueued; if there is a corresponding buffer queue, the data to be enqueued is directly enqueued, and the enqueuing time of the data to be enqueued is recorded; wherein, the first average enqueuing time of the data to be enqueued into the buffer queue is calculated according to the enqueuing time of the first data packet and the enqueuing time of the last data packet of the data to be enqueued, and the first average enqueuing time is calculated by the following formula: ， wherein, is the enqueue time of the first data packet, is the enqueue time of the last data packet, k is the number of data packets to be enqueued, a is an initial parameter, i is the number of the buffer queue, i = 1, 2,..., l , l is the number of enqueued data packets; obtaining a second average enqueuing time of the current node; wherein, the second average enqueuing time of the current node is calculated by the following formula: wherein, is the second average arrival time, N is the number of buffers in the queue. judging whether the first average enqueuing time is greater than or equal to the second average enqueuing time; if yes, discarding the corresponding data to be enqueued.

2. The optimization method of a multi-hop network according to claim 1, characterized in that, Further comprising: Upon receiving a data sending instruction, using a polling mechanism to sequentially access each buffer queue, and sending corresponding data to be sent according to the sequential access result.

3. The optimization method of a multi-hop network according to claim 2, characterized in that, Using the polling mechanism to sequentially access each buffer queue, and sending corresponding data to be sent according to the sequential access result, comprising: judging whether the current buffer queue has the data to be sent; if the current buffer queue does not have the data to be sent, waiting for a preset time in the current buffer queue, and judging whether the current buffer queue has the data to be sent within the preset time; if the current buffer queue has the data to be sent within the preset time, sending the data to be sent, and continuing to inquire the next buffer queue; if the current buffer queue does not have the data to be sent within the preset time, continuing to inquire the next buffer queue.

4. An optimization system for a multi-hop network, characterized by, comprising: a first obtaining module, the first obtaining module is used for obtaining data to be enqueued in the multi-hop network when receiving a data enqueuing instruction, wherein the data to be enqueued comprises service flow data and forwarding flow data; The computing module is configured to calculate a first average enqueuing time of the to-be-enqueued data into the corresponding buffer queue; before calculating the first average enqueuing time of the to-be-enqueued data into the corresponding buffer queue, the computing module is further configured to: acquire a data source address of the to-be-enqueued data; determine whether the to-be-enqueued data exists in the corresponding buffer queue according to the data source address; if not, create the buffer queue corresponding to the to-be-enqueued data, enqueue the to-be-enqueued data, and record the enqueuing time of the to-be-enqueued data; if the corresponding buffer queue exists, directly enqueue the to-be-enqueued data, and record the enqueuing time of the to-be-enqueued data; wherein the first average enqueuing time of the to-be-enqueued data into the buffer queue is calculated according to the enqueuing time of the first data packet and the enqueuing time of the last data packet of the to-be-enqueued data, and the first average enqueuing time is calculated by the following formula: ， wherein, is the enqueue time of the first data packet, is the enqueue time of the last data packet, k is the number of data packets to be enqueued, a is an initial parameter, i is the number of the buffer queue, i = 1, 2,..., l , l is the number of enqueued data packets; The second acquisition module is configured to acquire a second average enqueuing time of the current node; The judging module is configured to determine whether the first average enqueuing time is greater than or equal to the second average enqueuing time; the judging module is specifically configured to calculate the second average enqueuing time of the current node by the following formula: wherein, is the second average arrival time, N is the number of buffers in the queue. The data processing module is configured to discard the corresponding to-be-enqueued data when the first average enqueuing time is greater than or equal to the second average enqueuing time.

5. The system for optimization of multi-hop networks according to claim 4, characterized in that, The data processing module is further configured to: When a sending data instruction is received, sequentially access each buffer queue by using a polling mechanism, and send the corresponding to-be-sent data according to the sequentially accessed result.

6. The system for optimization of multi-hop networks according to claim 5, characterized in that, The data processing module is specifically configured to: Determine whether the current buffer queue exists the to-be-sent data; If the current buffer queue does not exist the to-be-sent data, wait for a preset time in the current buffer queue, and determine whether the current buffer queue exists the to-be-sent data within the preset time; If the current buffer queue exists the to-be-sent data within the preset time, send the to-be-sent data, and continue to inquire the next buffer queue; If the current buffer queue does not exist the to-be-sent data within the preset time, continue to inquire the next buffer queue.

Images