CN112751718A - Bandwidth adjusting method and device, terminal and storage medium - Google Patents
Bandwidth adjusting method and device, terminal and storage medium Download PDFInfo
- Publication number
- CN112751718A CN112751718A CN202110120340.8A CN202110120340A CN112751718A CN 112751718 A CN112751718 A CN 112751718A CN 202110120340 A CN202110120340 A CN 202110120340A CN 112751718 A CN112751718 A CN 112751718A
- Authority
- CN
- China
- Prior art keywords
- node
- path
- delay
- bandwidth
- communication
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0896—Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities
Abstract
The embodiment of the application discloses a bandwidth adjusting method, a bandwidth adjusting device, equipment and a storage medium, wherein the method comprises the following steps: obtaining a routing table of the gateway, wherein the routing table is determined by utilizing the network delay between each node of the access gateway and the network delay between each node and the gateway, and the routing table comprises the shortest network delay path from each node to the gateway, therefore, the routing table can be used to realize the shortest network delay, effectively reduce the network delay, and further, the size of the load data of each node and the bandwidth size allocated to the path segment included in the shortest network delay path of each node can be obtained, and further according to the size of the load data of each node and the bandwidth size allocated to the path segment contained in the shortest network delay path of each node, making bandwidth adjustment, the data transmission efficiency of the system formed by the gateway and each node can be further improved by adjusting the bandwidth.
Description
Technical Field
The present application relates to the field of internet technologies, and in particular, to a bandwidth adjusting method and apparatus, a terminal, and a storage medium.
Background
At present, in intelligent terminals of smart homes, a usable data transmission protocol includes a zigbee protocol, the intelligent terminals can be accessed into a local area network of a gateway through the zigbee protocol, communication interaction can be realized between the intelligent terminals in the local area network through the gateway, and the intelligent terminals in the local area network can also perform communication interaction with a cloud server through the gateway.
However, at present, the zigbee protocol-based communication interaction has the problems of large network delay and low data transmission efficiency.
Disclosure of Invention
The present application mainly aims to provide a bandwidth adjusting method and apparatus, a terminal, and a storage medium, which can solve the problems of large network delay and low data transmission efficiency in the prior art.
To achieve the above object, a first aspect of the present application provides a bandwidth adjustment method, including:
acquiring a routing table of a gateway, wherein the routing table is determined by utilizing network delay between nodes accessed to the gateway and the network delay between each node and the gateway, and the routing table comprises the shortest network delay path from each node to the gateway;
acquiring the size of load data of each node and acquiring the bandwidth size distributed by a path segment contained in the shortest network delay path of each node;
and adjusting the bandwidth according to the size of the load data of each node and the bandwidth allocated to the path section contained in the shortest network delay path of each node.
Optionally, the performing bandwidth adjustment according to the size of the load data of each node and the bandwidth allocated to the path segment included in the shortest network delay path of each node includes:
calculating a communication delay of the first node for transmitting the load data of the first node to the gateway through the shortest network delay path of the first node according to the size of the load data of the first node and the bandwidth size allocated to a path section included in the shortest network delay path of the first node, wherein the first node is any one of the nodes;
and adjusting the bandwidth according to the communication time delay of each node.
Optionally, the calculating, according to a size of the load data of the first node and a size of a bandwidth allocated to a path segment included in the shortest network delay path of the first node, a communication delay of the first node for transmitting the load data of the first node to the gateway through the shortest network delay path of the first node includes:
calculating a quotient value between the size of the load data of the first node and the bandwidth size of each path segment contained in the shortest network delay path of the first node, and taking the quotient value as the communication sub-delay of each path segment;
and summing the communication sub-delays of the path sections to obtain the communication delay of the first node.
Optionally, the adjusting the bandwidth according to the communication delay of each node includes:
extracting a maximum communication delay and a minimum communication delay from the communication delay of each node, wherein the shortest network delay path of the node with the minimum communication delay comprises at least one node path section, and the node path section is a node-to-node path section;
and adjusting the bandwidth according to the maximum communication time delay and the minimum communication time delay.
Optionally, the extracting the maximum communication delay and the minimum communication delay from the communication delays of the nodes includes:
comparing the communication time delay of each node, extracting the maximum communication time delay, and sequencing the nodes according to the sequence of the communication time delay from small to large to obtain a node sequence;
and traversing the node sequence according to a sequence from small to large, if the shortest network delay path of the traversed node comprises at least one node path segment, determining the communication delay of the traversed node as the minimum delay, stopping traversing, and if the shortest network delay path of the traversed node does not comprise the node path segment, continuing traversing the next node until the minimum communication delay is determined.
Optionally, the extracting the maximum communication delay and the minimum communication delay from the communication delays of the nodes includes:
sequencing the communication time delay of each node from small to large to obtain a time delay sequence;
taking the Nth communication delay in the delay sequence as the maximum communication delay, assigning the maximum communication delay to Tmax, assigning the (N + 1) th communication delay in the delay sequence to Tmin, wherein N is the number of the communication delays, and the initial value of N is 0;
judging whether the number of path sections contained in the shortest network delay path of the node with the Tmin is 1 or not;
if the number of path segments included in the shortest network delay path with the node of Tmin is 1, making n equal to n +1, and assigning the (n + 1) th communication delay in the delay sequence to Tmin; judging whether Tmin is equal to Tmax, if the Tmin is not equal to the Tmax, returning to the step of judging whether the number of path segments contained in the shortest network delay path of the node with the Tmin is 1, and if the Tmin is equal to the Tmax, determining that data communication can be started;
if the number of path segments included in the shortest network delay path of the node having Tmin is not 1, Tmin is determined as the minimum communication delay.
Optionally, the adjusting the bandwidth according to the maximum communication delay and the minimum communication delay includes:
judging whether the time delay difference between the maximum communication time delay and the minimum communication time delay is greater than or equal to a preset threshold value or not;
when the delay difference between the maximum communication delay and the minimum communication delay is greater than or equal to a preset delay difference threshold, performing bandwidth adjustment on a path segment in the shortest network delay path of the second node corresponding to the maximum communication delay;
and after the bandwidth adjustment is finished, returning to execute the steps of distributing the bandwidth according to the size of the load data of the first node and the path section contained in the shortest network delay path of the first node, and calculating the communication time delay of the first node for transmitting the load data of the first node to the gateway through the shortest network delay path of the first node until the time delay difference between the maximum communication time delay and the minimum communication time delay is less than the preset threshold value.
Optionally, the performing bandwidth adjustment on the path segment in the shortest network delay path of the second node corresponding to the maximum communication delay includes:
selecting a target path segment with the largest occurrence frequency in the routing table from the path segments contained in the shortest network delay path of the second node with the largest communication delay;
and increasing the bandwidth size allocated to the target path segment by the second node according to a preset bandwidth increasing and decreasing rule, and decreasing the bandwidth size allocated to the target path segment by other nodes except the second node in a node set, wherein the node set comprises the node with the target path segment in the shortest network delay path.
Optionally, the obtaining the bandwidth size allocated to the path segment included in the shortest network delay path of each node includes:
determining a path segment contained in each node by using the shortest network delay path contained in the routing table of each node;
counting the occurrence times of each path segment in the routing table based on the path segments contained in each node;
and obtaining the bandwidth size distributed to the path segments contained in each node by using the obtained total bandwidth size of each path segment and the occurrence frequency of each path segment.
To achieve the above object, a second aspect of the present application provides a bandwidth adjusting apparatus, including:
a first obtaining module, configured to obtain a routing table of a gateway, where the routing table is determined by using network delays between nodes accessing the gateway, and the network delays between the nodes and the gateway are determined, and the routing table includes a shortest network delay path from each node to the gateway;
a second obtaining module, configured to obtain the size of the load data of each node, and obtain the bandwidth allocated to the path segment included in the shortest network delay path of each node;
and the adjusting module is used for adjusting the bandwidth according to the size of the load data of each node and the bandwidth allocated to the path segment contained in the shortest network delay path of each node.
To achieve the above object, a third aspect of the present application provides a computer-readable storage medium storing a computer program, which, when executed by a processor, causes the processor to perform the steps of the bandwidth adjusting method according to the first aspect.
To achieve the above object, a fourth aspect of the present application provides a computer device, comprising a memory and a processor, the memory storing a computer program, the computer program, when executed by the processor, causing the processor to perform the steps of the bandwidth adjusting method according to the first aspect.
By adopting the embodiment of the application, the following beneficial effects are achieved:
the application provides a bandwidth adjusting method, which comprises the following steps: obtaining a routing table of the gateway, wherein the routing table is determined by utilizing the network delay between each node of the access gateway and the network delay between each node and the gateway, and the routing table comprises the shortest network delay path from each node to the gateway, therefore, the routing table can be used to realize the shortest network delay, effectively reduce the network delay, and further, the size of the load data of each node and the bandwidth size allocated to the path segment included in the shortest network delay path of each node can be obtained, and further according to the size of the load data of each node and the bandwidth size allocated to the path segment contained in the shortest network delay path of each node, making bandwidth adjustment, the data transmission efficiency of the system formed by the gateway and each node can be further improved by adjusting the bandwidth.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Wherein:
fig. 1 is a schematic flowchart of a method for adjusting bandwidth in an embodiment of the present application;
FIG. 2 is a diagram illustrating a shortest network delay path in an embodiment of the present application;
fig. 3 is another schematic flow chart of a bandwidth adjustment method in the embodiment of the present application;
FIG. 4 is a schematic flow chart of the step of refining step 304 in the embodiment shown in FIG. 3;
fig. 5 is another schematic flow chart illustrating a bandwidth adjustment method according to an embodiment of the present application;
fig. 6 is a block diagram illustrating a structure of a bandwidth adjusting apparatus according to an embodiment of the present application;
fig. 7 is a block diagram of a computer device according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
In this embodiment of the application, the intelligent terminal and the gateway may form a local area network, in the local area network, the intelligent terminal may access the gateway through a wireless transmission protocol, and the gateway is used to realize interaction between the intelligent terminal and the intelligent terminal, or between the intelligent terminal and the cloud server, where the wireless transmission protocol may be a zigbee protocol, a bluetooth transmission protocol, or other near field communication protocols.
The intelligent terminal can be an intelligent refrigerator, an intelligent microwave oven, an intelligent purifier, an intelligent oven and other devices, and in practical application, the devices which can be accessed to the gateway can be called the intelligent terminal. In a possible scheme, the intelligent terminal can be networked through the gateway to realize communication with a user terminal (such as a smart phone); in another possible scheme, the intelligent terminal can communicate with other intelligent terminals, the user terminal and the like through the gateway, and the application does not limit the applicable communication scene.
The intelligent terminal may also be referred to as a node, which will be described below without further explanation.
Please refer to fig. 1, which is a flowchart illustrating a bandwidth adjusting method according to an embodiment of the present application, the method includes:
in this embodiment, the foregoing bandwidth adjusting method may be specifically implemented by a bandwidth adjusting device, where the bandwidth adjusting device is a program module and is stored in a computer readable storage medium of a device, and a processor in the device may call and execute the bandwidth adjusting device to implement the foregoing bandwidth adjusting method.
The gateway has a generated routing table, and the routing table is determined by using network delays between nodes of the access gateway and network delays between the nodes and the gateway, and the routing table includes a shortest network delay path from each node to the gateway, where a shortest network delay path may include at least one path segment, for example, if the shortest network delay path of the node 1 is: node 1-node 2-node 3-gateway, where node 1 to node 2 are one path segment, node 2 to node 3 are one path segment, and node 3 to gateway are one path segment, so that it can be determined that the shortest network delay path of node 1 includes 3 path segments, where both ends of a path segment are nodes and can be called node path segments, and one end of a path segment is a gateway and can be called gateway path segment.
To better understand the shortest network delay path of the routing table in the embodiment of the present application, please refer to fig. 2, which is a schematic diagram of the shortest network delay path in the embodiment of the present application, wherein a network topology based on a gateway includes a gateway and nodes 1 to 7, where an arrow direction indicates a transmission direction of data, a number on the arrow indicates a network delay time (unit of the network delay time is, for example, ms) existing in the transmission data, and the gateway can perform data interaction with a cloud server. It should be understood that, in the schematic diagram shown in fig. 2, a path is described by taking an example of sending data to a gateway by a node, and in practical applications, the same path may be used if the gateway sends data to the node, except that the transmission direction of the data is opposite. For example, if the node 1 needs to send data to the gateway, the shortest network delay path node 1-node 2-gateway is used, the gateway sends the data to the cloud server, and after receiving the data fed back by the cloud server, the data needs to be sent to the node 1, and the reverse shortest network delay path, that is, the gateway-node 2-node 1, may be used to transmit the data, so as to implement data interaction between the node 1 and the cloud server.
102, acquiring the size of load data of each node, and acquiring the bandwidth size distributed by a path segment contained in the shortest network delay path of each node;
and 103, adjusting the bandwidth according to the size of the load data of each node and the bandwidth allocated to the path segment included in the shortest network delay path of each node.
In the embodiment of the present application, the size of the load data of each node and the size of the bandwidth allocated to the path segment included in the shortest network delay path of each node are also obtained, and it can be understood that, in the actual implementation, there is no inevitable execution precedence relationship between the step of obtaining the routing table and the step of obtaining the size of the load data of each node, the size of the load data of each node may be obtained first, and then the routing table is obtained, or the two steps may be executed simultaneously. In a possible implementation manner, the gateway may obtain the size of the load data of each node by: after obtaining the shortest network delay path of each node, the gateway performs negotiation interaction with each node by using the shortest network delay path based on a handshake protocol, and in the process of the negotiation interaction, each node sends the size of load data to be sent to the gateway, so that the gateway can obtain the size of the load data of each node.
Further, the shortest network delay path of multiple different nodes may include the same path segment, in this case, the bandwidth of each node in the path segment needs to be allocated, so that the bandwidth size allocated to the path segment included in the shortest network delay path of each node can be determined, for example, if the path segment a is used by only the shortest network delay path of one node B, the total bandwidth of the path segment a may be allocated to the node B, and if both the node B and the node C include the path segment D, the bandwidth of the path segment D may be allocated to the node B and the node C.
Further, the bandwidth can be adjusted according to the size of the load data of each node and the bandwidth allocated to the path segment included in the shortest network delay path of each node.
It can be understood that, in the embodiment of the present application, the bandwidth of the path segment allocation included in each node in the network topology is adjusted from the perspective of the entire network topology of the gateway, so that the data transmission efficiency of each node in the network topology of the gateway can be effectively improved.
In the embodiment of the present application, a routing table of the gateway may be obtained, since the routing table is determined by utilizing the network delay between each node of the access gateway and the network delay between each node and the gateway, and the routing table includes the shortest network delay path from each node to the gateway, therefore, the routing table can be used to realize the shortest network delay, effectively reduce the network delay, and further, the size of the load data of each node and the bandwidth size allocated to the path segment included in the shortest network delay path of each node can be obtained, and further according to the size of the load data of each node and the bandwidth size allocated to the path segment contained in the shortest network delay path of each node, making bandwidth adjustment, the data transmission efficiency of the system formed by the gateway and each node can be further improved by adjusting the bandwidth.
In order to better understand the technical solution in the embodiment of the present application, the following further introduces the method for obtaining the routing table, which specifically includes:
in this embodiment, if there is no routing table in the gateway, the gateway may send a data packet to a node that has accessed the gateway, determine a delay from the node to the gateway by sending the data packet, and the gateway may further control the node that has accessed the gateway to send the data packet to other nodes respectively to determine a network delay between the nodes, and then determine a shortest network delay path from each node to the gateway and the network delay between the nodes based on a shortest path algorithm, where the shortest network delay path of each node constitutes the routing table.
Further, after detecting that a new third node accesses, the gateway may further determine a shortest network delay path of the third node, including: if the third node is detected to be accessed into the gateway, calculating the network delay between the third node and other nodes accessed into the gateway, calculating the network delay from the gateway to the third node, and determining the shortest network delay path of the third node by using the shortest path algorithm and adding the shortest network delay path into the routing table, so that the determination of the shortest network delay path of a new access node can be effectively realized.
It is understood that the shortest network delay path of a node means that the network delay generated by the node performing data transmission through the path is the smallest, so that the total network delay of the shortest network delay path of each node can be determined, the maximum total network delay can be determined, and the routing table can be maintained by using the maximum total network delay, specifically, data transmission can be performed once by using the shortest network delay path of each node in the routing table, the actual delay duration between each node and the gateway can be obtained, and it can be determined whether a fourth node whose actual delay duration is greater than the maximum total network delay exists in the actual delay duration of each node, if the fourth node exists, the shortest network delay path of the fourth node is deleted in the routing table, and the delay between the fourth node and the gateway and the delay between the fourth node and other nodes can be re-determined, and based on a shortest path algorithm, by using the delay between the fourth node and the gateway and the delay between the fourth node and other nodes, re-determining the shortest network delay path of the fourth node and adding the shortest network delay path into the routing table, and continuing to execute the process of determining the maximum total network delay and comparing the actual delay duration between each node and the gateway until the actual delay duration of no node is greater than the corresponding maximum total network delay, so that the routing table can be updated when a new node accesses the gateway by the method.
It should be noted that, in this embodiment of the present application, because each node involved in the routing table needs to participate in the data transmission process, if a node disconnects from the gateway, data transmission cannot be performed according to the shortest network delay path through the node, and therefore, the gateway also needs to monitor which nodes disconnect from the gateway, so as to update the routing table in time, so as to ensure the success rate of data transmission. Specifically, if it is monitored that the fifth node is disconnected from the gateway, it is determined which node has the shortest network delay path including the fifth node and is deleted from the routing table, and the shortest network delay path is re-determined, so that the routing table can be updated in time when the connection between the node and the gateway is disconnected.
Based on the above, referring to fig. 3, it is another schematic flow chart of the bandwidth adjusting method in the embodiment of the present application, which includes:
301, obtaining a routing table of a gateway, where the routing table is determined by using network delay between nodes of an access gateway and network delay between each node and the gateway, and the routing table includes a shortest network delay path from each node to the gateway;
it should be noted that the contents of step 301 and step 302 are similar to the contents of step 101 and step 102 in the embodiment shown in fig. 1, and specifically refer to the contents in the embodiment shown in fig. 1, which is not described herein again.
Further, obtaining the bandwidth size allocated to the path segment included in the shortest network delay path of each node may include: determining a path section contained in each node by using the shortest network delay path of each node contained in the routing table; counting the occurrence times of each path segment in the routing table based on the path segments contained in each node; and obtaining the bandwidth size distributed to the path segments contained in each node by using the obtained total bandwidth size of each path segment and the occurrence frequency of each path segment. In a feasible implementation manner, the total bandwidth size of the path segment may be divided by the number of occurrences of the path segment, so as to obtain the bandwidth size of the path segment allocated to each shortest network delay path including the node of the path segment, for example, if the path segment a occurs 4 times in the routing table, it indicates that the shortest network delay path of 4 node bs includes the path segment, and if the bandwidth size of the path segment is C, the bandwidth size of each node B is C/4.
Further, the total bandwidth size of the path segment may be obtained as follows:
after determining the path segments contained in the routing table, the gateway performs closed-loop transmission of bandwidth test data by using the path segment for any one of the path segments, so that a transmission time length for transmitting the bandwidth test data can be obtained, and determines the bandwidth size of the path segment by using the size and the transmission time length of the bandwidth test data, wherein the closed-loop transmission refers to that the gateway transmits the bandwidth test data to one node in the path segment, the one node transmits the bandwidth test data and a first time point for receiving the bandwidth test data to another node in the path segment, the other node in the path segment determines a second time point for receiving the bandwidth test data, and feeds back the first time point and the second time point to the gateway, so that the gateway can determine the transmission time length for transmitting the bandwidth test data by using the first time point and the second time point, and closed loop transmission is realized. For example, if the path segment is node a-node B, the gateway may send bandwidth test data to node a, node a sends a first time point at which the bandwidth test data is received and the bandwidth test data to node B, and node B feeds back the first time point and a second time point at which the bandwidth test data is received to the gateway, so that the gateway can determine the transmission duration based on the first time point and the second time point and further determine the total bandwidth size between node a and node B. Optionally, the bandwidth test data may be used to test the path segment for multiple times in a gradually increasing manner, obtain multiple total bandwidth sizes, and obtain the total bandwidth size of the path segment in a manner of averaging the multiple total bandwidth sizes.
and step 304, adjusting the bandwidth according to the communication time delay of each node.
In an embodiment of the present invention, for each node that has accessed a gateway, a communication delay of each node is calculated, and taking the first node as an example, the communication delay of the first node transmitting the load data of the first node to the gateway through the shortest network delay path thereof may be calculated according to the size of the load data of the first node and the size of a bandwidth allocated to a path segment included in the shortest network delay path of the first node, where specifically, the calculation of the communication delay may include the following steps:
step a, calculating the quotient value between the size of the load data of the first node and the bandwidth size of each path segment contained in the shortest network delay path of the first node, and taking the quotient value as the communication sub-delay of each path segment;
and b, summing the communication sub-delays of the path sections to obtain the communication delay of the first node.
The quotient between the load data size of the first node and the bandwidth size of each path segment included in the shortest network delay path of the first node can be calculated first, the corresponding quotient is used as the communication sub-delay of each path segment of the first node, and the communication sub-delays of each path segment are summed to obtain the communication delay of the first node, so that the communication delay of each node can be obtained by the above method.
In one possible implementation, the communication delay of the first node may be obtained according to the following formula:
wherein, T represents the communication delay of the first node, D represents the size of the load data of the first node, K represents the total number of path segments included in the shortest network delay path of the first node, i represents the ith path segment, BWiIndicating the size of the bandwidth allocated by the ith path segment of the first node.
Further, after the communication delay of each node is obtained, the bandwidth may be adjusted according to the communication delay of each node. Referring to FIG. 4, a flow chart of the step of refining step 304 in the embodiment shown in FIG. 3 is shown, which includes:
and step 402, adjusting the bandwidth according to the maximum communication delay and the minimum communication delay.
In the embodiment of the present application, the specific implementation of step 401 is:
(1) the communication delays of the nodes can be compared to extract the maximum communication delay, and the types and the number of the types of the path segments included in the shortest network delay path of each node are counted, wherein the types of the path segments include node path segments (i.e., node-to-node path segments) and gateway path segments (node-to-gateway path segments).
(2) Sequencing all the nodes according to the sequence of communication delay from small to large to obtain a node sequence; traversing the node sequence according to the sequence from small to large: if the shortest network delay path of the traversed node comprises at least one node path segment, the shortest network delay path of the traversed node comprises the at least one node path segment and one gateway path segment, the communication delay of the traversed node is determined to be the minimum communication delay, and the following process (3) is stopped to be continuously traversed; if the shortest network delay path of the traversed node does not contain a node path segment, it indicates that the traversed node has only one path segment and is a gateway path segment from the node to the gateway, and the next node is continuously traversed until the minimum communication delay is determined.
It follows that the shortest network delay path of the node having the smallest communication delay contains at least one node path segment.
(3) After the maximum communication delay and the minimum communication delay are obtained, further performing bandwidth adjustment, specifically:
whether the delay difference between the maximum communication delay and the minimum communication delay is larger than or equal to a preset threshold value or not can be judged, when the delay difference between the maximum communication delay and the minimum communication delay is larger than or equal to the preset delay difference threshold value, the fact that the layout of the communication delays of the nodes is not balanced is indicated, and the bandwidth of a path section in the shortest network delay path of the second node corresponding to the maximum communication delay can be adjusted, so that the delay difference between the maximum communication delay and the minimum communication delay is reduced, and the purpose of integrally improving the data transmission efficiency of the network topology structure of the gateway is achieved. In addition, when the delay difference between the maximum communication delay and the minimum communication delay is smaller than the preset delay difference threshold, it indicates that the layout of the communication delays of the nodes is balanced, and data communication may be started, and at this time, the bandwidth size of the path segment of the shortest network delay path included in each node is the bandwidth size used in the subsequent actual data transmission.
It can be understood that after each bandwidth adjustment is completed, it is required to verify whether a delay difference between a maximum communication delay and a minimum communication delay in communication delays of each node calculated based on the adjusted bandwidth is smaller than a preset threshold, that is, after the bandwidth adjustment is completed, the step 301 is executed again until a delay difference between the maximum communication delay and the minimum communication delay is smaller than the preset threshold.
Further, when the delay difference between the maximum communication delay and the minimum communication delay is greater than or equal to a preset threshold, performing bandwidth adjustment on a path segment in the shortest network delay path of the second node corresponding to the maximum communication delay, which may specifically be: selecting a target path segment with the largest occurrence frequency in a routing table from path segments contained in the shortest network delay path of a second node with the largest communication time delay, increasing the bandwidth size distributed to the target path segment by the second node according to a preset bandwidth increasing and reducing rule, and reducing the bandwidth size distributed to the target path segment by other nodes except the second node in a node set, wherein the node set contains the nodes with the target path segment in the shortest network delay path, and the occurrence frequency of the target path segment is more than 1. For example, the shortest network delay path of the second node comprises path segment a, path segment b, and path segment c, and the number of occurrences of path segment a is 2, the number of occurrences of path segment b is 3, the number of occurrences of path segment c is 4, it is determined that the path segment c is the target path segment with the largest occurrence number and the shortest network delay path with 4 nodes includes the path segment c, as can be seen from the description in the foregoing embodiment, the 4 nodes are allocated bandwidth of BWc/4 in the target path segment c, the BWc indicates the total bandwidth size of the target path segment c, the bandwidth of the second node in the target path segment c may be increased, for example, the bandwidth size of the target path segment c may be increased from BWc/4, to BWc/3, and the size of the bandwidth allocated by the target path segment c of the other three nodes is reduced from BWc/4 to 2 BWc/9. It should be noted that, in practical applications, the increase ratio of the bandwidth size allocated to the target path segment c of the second node may be set according to needs, and is not limited herein.
It can be understood that, after the bandwidth of the target path segment with the largest occurrence frequency in the second node is increased and the bandwidth allocated to other nodes having the target path segment is decreased, the communication delays of the second node and other nodes are recalculated to update the communication delay, and whether the delay difference between the maximum communication delay and the minimum communication delay is smaller than a preset threshold can be determined by using the communication delay of each node in the topology of the gateway, if so, the adjustment of the bandwidth is finished, and if so, the step of adjusting the bandwidth is returned until the delay difference is smaller than the preset threshold.
It should be noted that, the node after updating the bandwidth still uses the above formula 1 to calculate the communication delay, and the specific formula may be as follows:
wherein T represents the communication time delay of the node after bandwidth updating, D represents the load data size and BW of the node after bandwidth updatingiBandwidth size, L, allocated to ith path segment in shortest network delay path representing node after bandwidth updatem-nA path segment representing a bandwidth change in the shortest network delay path of the node after updating the bandwidth,
the bandwidth size after the path section with the changed bandwidth is shown, and a shows a bandwidth change coefficient.
It can be understood that, during data transmission, the larger the bandwidth is, the faster the transmission speed is, the smaller the bandwidth is, the slower the transmission speed is, for a second node with the maximum communication delay, if the communication delay of the second node needs to be reduced, so that the communication delay of each node in the network topology of the gateway is more balanced, the whole communication delay of the second node needs to be directly reduced by increasing the bandwidth, and when the bandwidth is increased, by increasing a target path segment with the largest occurrence frequency (with the smallest bandwidth), and the effect of reducing the communication delay is better, so that the purpose that the delay difference between the maximum communication delay and the minimum communication delay is smaller than a preset threshold value can be achieved as soon as possible.
It can be understood that, if two or more target path segments with the same occurrence number and the largest occurrence number exist in the second node, one of the target path segments or the bandwidth allocated to multiple target path segments may be selected to be adjusted, and in practical applications, the number of the adjusted target path segments may be selected according to needs, which is not limited herein.
It can be understood that, after completing the bandwidth adjustment, the gateway sends the adjusted bandwidth size to each node, taking the sixth node as an example, the identifier of the path initial node, which may be the shortest network delay path including the sixth node, sent to the sixth node is in a corresponding relationship with the bandwidth size allocated to the path segment including the sixth node in the shortest network delay path. For example, if the shortest network delay path of node a is node a-node B-node C-gateway, node a is the initial path identifier of the shortest network delay path, and if the sixth node is node B, the corresponding relationship between the identifier of node a and the bandwidth size allocated to the path segment of node a (node a-node B) and the corresponding relationship between the identifier of node a and the bandwidth size allocated to the path segment of node a (node B-node C) will be sent to node B.
It should be noted that, when a node sends a data packet as a path initial identifier, the node may carry the shortest network delay path of the node in the data packet, so that each node that receives the data packet may determine a path initial node based on the shortest network delay path in the data packet, and a next node, and may determine a path segment based on the node and the next node, and search the above correspondence relationship by using the identifiers of the determined path segment and the path initial node, so as to determine the bandwidth size that can be used when the data packet is transmitted in the path segment, and transmit the data packet to the next node according to the bandwidth size, so as to implement data transmission.
For better understanding of the technical solution in the embodiment of the present application, please refer to fig. 5, which is another schematic flow chart of the bandwidth adjusting method in the embodiment of the present application, including:
509, judging whether the delay difference between the maximum communication delay and the minimum communication delay is greater than or equal to a preset threshold, if so, executing a step 510, and if not, executing a step 511;
in step 511, data communication is started.
It should be noted that the contents in the embodiment shown in fig. 5 are mostly similar to the contents in the embodiments shown in fig. 3 and fig. 4, and the difference is that the manner of determining the maximum communication delay and the minimum communication delay is as follows:
in the embodiment shown in fig. 5, after the communication delay of each node of the access gateway is obtained through calculation, the communication delays of the nodes are sorted from small to large to obtain a delay sequence, and the nth communication delay in the delay sequence is used as the maximum communication delay and is assigned to Tmax, where the value of N is the number of the communication delays, and it can be understood that N is also the total number of the nodes of the access gateway. Meanwhile, the (N + 1) th communication delay in the delay sequence is assigned to Tmin, N belongs to N, and the initial value of N is 0, and it can be understood that the communication delay initially assigned to Tmin is the 1 st communication delay in the delay sequence, that is, the minimum value of the communication delay.
Further, it is determined whether the shortest network delay path of the node having Tmin includes a path segment whose number is 1, if not 1, it indicates that the shortest network delay path of the node having Tmin includes at least one node path segment in addition to one gateway path segment, and meets the determination requirement of the minimum communication delay, it may be determined that Tmin is the minimum communication delay, if the shortest network delay path of the node having Tmin includes a path segment whose number is 1, it indicates that the shortest network delay path of the node having Tmin includes only one gateway path segment, and does not meet the determination requirement of the minimum communication delay, at this time, it may be determined that n is n +1, the n +1 th communication delay in the delay sequence is assigned to Tmin, after the n +1 th communication delay is assigned to Tmin, it is determined whether Tmin is equal to Tmax, if Tmin is equal to Tmin, it indicates that the last communication delay in the delay sequence has been assigned to Tmin, or, a communication delay having at least one communication delay equal to Tmax is indicated (for example, if there are 10 communication delays in the delay list and Tmin is assigned after 5 th communication delay is assigned to Tmin, then Tmin is determined to be Tmax, which indicates that the 5 th to 10 th communication delays are all the same in size, and the distribution of the communication delays is balanced), therefore, it may be determined that there is no minimum communication delay in the communication delays of the nodes, the bandwidth of the nodes does not need to be adjusted, and the gateway may start to perform data communication.
For example, if there are 5 communication delays in the delay list, after assigning the 1 st (0+1, where n is 0) communication delay to Tmin, if it is determined that the number of path segments included in the shortest network delay path having a node of Tmin is 1, then n is 0+1, then n is 1, n +1 is 2, that is, the 2 nd communication delay is assigned to Tmin, if Tmin is not equal to Tmax, and if it is determined that the number of path segments included in the shortest network delay path having a node of Tmin is 1, then n is 1+1, then n is 2, n +1 is 3, that is, the 3 rd communication delay is assigned to Tmin, and so on until the minimum communication delay is determined, or the assignment to Tmin is ended if it is determined that Tmin is Tmax.
In the embodiment of the invention, the minimum communication time delay is searched in a value assignment mode, and the method has the advantages of high speed and convenience in implementation.
Please refer to fig. 6, which is a schematic structural diagram of a bandwidth adjusting apparatus according to an embodiment of the present application, the apparatus including:
a first obtaining module 601, configured to obtain a routing table of a gateway, where the routing table is determined by using network delays between nodes of an access gateway and network delays between the nodes and the gateway, and the routing table includes a shortest network delay path from each node to the gateway;
a second obtaining module 602, configured to obtain the size of load data of each node, and obtain the bandwidth size allocated to a path segment included in the shortest network delay path of each node;
the adjusting module 603 is configured to perform bandwidth adjustment according to the size of the load data of each node and the bandwidth allocated to the path segment included in the shortest network delay path of each node.
The second obtaining module comprises a third obtaining module and a fourth obtaining module, the third obtaining module is used for obtaining the size of the load data of each node, and the fourth obtaining module is used for: determining a path segment contained in each node by using the shortest network delay path contained in the routing table of each node; counting the occurrence times of each path segment in the routing table based on the path segments contained in each node; and obtaining the bandwidth size distributed to the path segments contained in each node by using the obtained total bandwidth size of each path segment and the occurrence frequency of each path segment.
It can be understood that, the modules involved in the bandwidth adjusting apparatus in the embodiment shown in fig. 6 are similar to those described in the foregoing method embodiment, and specifically refer to the contents in the foregoing method embodiment, which is not described herein again.
In the embodiment of the present application, since the routing table is determined by using the network delay between each node of the access gateway, the network delay between each node and the gateway, and the routing table contains the shortest network delay path from each node to the gateway, therefore, the routing table can be used to realize the shortest network delay, effectively reduce the network delay, and further, the size of the load data of each node and the bandwidth size allocated to the path segment included in the shortest network delay path of each node can be obtained, and further according to the size of the load data of each node and the bandwidth size allocated to the path segment contained in the shortest network delay path of each node, making bandwidth adjustment, the data transmission efficiency of the system formed by the gateway and each node can be further improved by adjusting the bandwidth.
Further, the adjusting module 603 includes:
a calculating module, configured to calculate, according to a size of load data of a first node and a bandwidth size allocated to a path segment included in a shortest network delay path of the first node, a communication delay for the first node to transmit the load data of the first node to the gateway through the shortest network delay path of the first node, where the first node is any one of the nodes;
and the first adjusting module is used for adjusting the bandwidth according to the communication time delay of each node.
Wherein, the calculation module is specifically configured to: calculating a quotient value between the size of the load data of the first node and the bandwidth size of each path segment contained in the shortest network delay path of the first node, and taking the quotient value as the communication sub-delay of each path segment; and summing the communication sub-delays of the path sections to obtain the communication delay of the first node.
Further, the first adjusting module comprises:
an extracting module, configured to extract a maximum communication delay and a minimum communication delay from the communication delay of each node, where a shortest network delay path of a node having the minimum communication delay includes at least one node path segment, and the node path segment is a node-to-node path segment;
and the second adjusting module is used for adjusting the bandwidth according to the maximum communication time delay and the minimum communication time delay.
Wherein, the second adjustment module includes:
the judging module is used for judging whether the time delay difference between the maximum communication time delay and the minimum communication time delay is larger than or equal to a preset threshold value or not;
a third adjusting module, configured to, when a delay difference between the maximum communication delay and the minimum communication delay is greater than or equal to a preset delay difference threshold, perform bandwidth adjustment on a path segment in a shortest network delay path of the second node corresponding to the maximum communication delay;
and the returning module is used for returning to the execution calculation module after the bandwidth adjustment is finished until the time delay difference between the maximum communication time delay and the minimum communication time delay is smaller than the preset threshold value.
Wherein the third adjusting module is specifically configured to: selecting a target path segment with the largest occurrence frequency in the routing table from the path segments contained in the shortest network delay path of the second node with the largest communication delay; and increasing the bandwidth size allocated to the target path segment by the second node according to a preset bandwidth increasing and decreasing rule, and decreasing the bandwidth size allocated to the target path segment by other nodes except the second node in a node set, wherein the node set comprises the node with the target path segment in the shortest network delay path.
FIG. 7 is a diagram illustrating an internal structure of a computer device in one embodiment. The computer device may specifically be a gateway. As shown in fig. 7, the computer device includes a processor, a memory, and a network interface connected by a system bus. Wherein the memory includes a non-volatile storage medium and an internal memory. The non-volatile storage medium of the computer device stores an operating system and may also store a computer program, which, when executed by the processor, causes the processor to carry out the steps of the above-described method embodiments. The internal memory may also store a computer program, which, when executed by the processor, causes the processor to perform the steps of the above-described method embodiments. Those skilled in the art will appreciate that the architecture shown in fig. 7 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, as particular computing devices may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
In an embodiment, a computer device is proposed, comprising a memory and a processor, the memory storing a computer program, which, when executed by the processor, causes the processor to perform the steps of the above-mentioned bandwidth adjustment method embodiments.
In one embodiment, a computer-readable storage medium is provided, which stores a computer program, which, when executed by a processor, causes the processor to perform the steps of the above-described bandwidth adjustment method embodiments.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a non-volatile computer-readable storage medium, and can include the processes of the embodiments of the methods described above when the program is executed. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the present application. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.
Claims (11)
1. A method of bandwidth adjustment, the method comprising:
acquiring a routing table of a gateway, wherein the routing table is determined by utilizing network delay between nodes accessed to the gateway and the network delay between each node and the gateway, and the routing table comprises the shortest network delay path from each node to the gateway;
acquiring the size of load data of each node and acquiring the bandwidth size distributed by a path segment contained in the shortest network delay path of each node;
and adjusting the bandwidth according to the size of the load data of each node and the bandwidth allocated to the path section contained in the shortest network delay path of each node.
2. The method according to claim 1, wherein the performing bandwidth adjustment according to the size of the load data of each node and the bandwidth allocated to the path segment included in the shortest network delay path of each node comprises:
calculating a communication delay of the first node for transmitting the load data of the first node to the gateway through the shortest network delay path of the first node according to the size of the load data of the first node and the bandwidth size allocated to a path section included in the shortest network delay path of the first node, wherein the first node is any one of the nodes;
and adjusting the bandwidth according to the communication time delay of each node.
3. The method according to claim 2, wherein the calculating a communication delay of the first node for transmitting the load data of the first node to the gateway through the shortest network delay path of the first node according to the size of the load data of the first node and the size of the bandwidth allocated to the path segment included in the shortest network delay path of the first node comprises:
calculating a quotient value between the size of the load data of the first node and the bandwidth size of each path segment contained in the shortest network delay path of the first node, and taking the quotient value as the communication sub-delay of each path segment;
and summing the communication sub-delays of the path sections to obtain the communication delay of the first node.
4. The method of claim 2, wherein the adjusting the bandwidth according to the communication delay of each node comprises:
extracting a maximum communication delay and a minimum communication delay from the communication delay of each node, wherein the shortest network delay path of the node with the minimum communication delay comprises at least one node path section, and the node path section is a node-to-node path section;
and adjusting the bandwidth according to the maximum communication time delay and the minimum communication time delay.
5. The method of claim 4, wherein the extracting the maximum communication delay and the minimum communication delay from the communication delays of the nodes comprises:
comparing the communication time delay of each node, extracting the maximum communication time delay, and sequencing the nodes according to the sequence of the communication time delay from small to large to obtain a node sequence;
and traversing the node sequence according to a sequence from small to large, if the shortest network delay path of the traversed node comprises at least one node path segment, determining the communication delay of the traversed node as the minimum delay, stopping traversing, and if the shortest network delay path of the traversed node does not comprise the node path segment, continuing traversing the next node until the minimum communication delay is determined.
6. The method of claim 4, wherein the adjusting the bandwidth according to the maximum communication latency and the minimum communication latency comprises:
judging whether the time delay difference between the maximum communication time delay and the minimum communication time delay is greater than or equal to a preset threshold value or not;
when the delay difference between the maximum communication delay and the minimum communication delay is greater than or equal to a preset delay difference threshold, performing bandwidth adjustment on a path segment in the shortest network delay path of the second node corresponding to the maximum communication delay;
and after the bandwidth adjustment is finished, returning to execute the steps of distributing the bandwidth according to the size of the load data of the first node and the path section contained in the shortest network delay path of the first node, and calculating the communication time delay of the first node for transmitting the load data of the first node to the gateway through the shortest network delay path of the first node until the time delay difference between the maximum communication time delay and the minimum communication time delay is less than the preset threshold value.
7. The method of claim 6, wherein the performing bandwidth adjustment on the path segment in the shortest network delay path of the second node corresponding to the maximum communication delay comprises:
selecting a target path segment with the largest occurrence frequency in the routing table from the path segments contained in the shortest network delay path of the second node with the largest communication delay;
and increasing the bandwidth size allocated to the target path segment by the second node according to a preset bandwidth increasing and decreasing rule, and decreasing the bandwidth size allocated to the target path segment by other nodes except the second node in a node set, wherein the node set comprises the node with the target path segment in the shortest network delay path.
8. The method according to claim 1, wherein the obtaining the bandwidth size allocated to the path segment included in the shortest network delay path of each node comprises:
determining a path segment contained in each node by using the shortest network delay path contained in the routing table of each node;
counting the occurrence times of each path segment in the routing table based on the path segments contained in each node;
and obtaining the bandwidth size distributed to the path segments contained in each node by using the obtained total bandwidth size of each path segment and the occurrence frequency of each path segment.
9. A bandwidth adjustment apparatus, the apparatus comprising:
a first obtaining module, configured to obtain a routing table of a gateway, where the routing table is determined by using network delays between nodes accessing the gateway, and the network delays between the nodes and the gateway are determined, and the routing table includes a shortest network delay path from each node to the gateway;
a second obtaining module, configured to obtain the size of the load data of each node, and obtain the bandwidth allocated to the path segment included in the shortest network delay path of each node;
and the adjusting module is used for adjusting the bandwidth according to the size of the load data of each node and the bandwidth allocated to the path segment contained in the shortest network delay path of each node.
10. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, causes the processor to carry out the steps of the method according to any one of claims 1 to 8.
11. A computer device comprising a memory and a processor, characterized in that the memory stores a computer program which, when executed by the processor, causes the processor to carry out the steps of the method according to any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110120340.8A CN112751718B (en) | 2021-01-28 | 2021-01-28 | Bandwidth adjustment method and device, terminal and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110120340.8A CN112751718B (en) | 2021-01-28 | 2021-01-28 | Bandwidth adjustment method and device, terminal and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112751718A true CN112751718A (en) | 2021-05-04 |
| CN112751718B CN112751718B (en) | 2023-05-12 |
Family
ID=75653303
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110120340.8A Active CN112751718B (en) | 2021-01-28 | 2021-01-28 | Bandwidth adjustment method and device, terminal and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112751718B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113868109A (en) * | 2021-09-30 | 2021-12-31 | 山东云海国创云计算装备产业创新中心有限公司 | Method, apparatus, device and readable medium for performance evaluation of multiprocessor interconnect |
| CN113949741A (en) * | 2021-10-14 | 2022-01-18 | 北京奇艺世纪科技有限公司 | Scheduling method, scheduling device, electronic equipment and storage medium |
| CN114006764A (en) * | 2021-11-02 | 2022-02-01 | 北京天融信网络安全技术有限公司 | Deployment method and device of safety network element based on super-fusion system |
| CN115002007A (en) * | 2022-05-18 | 2022-09-02 | 北京达佳互联信息技术有限公司 | Network delay judging method and device, electronic equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2003078555A (en) * | 2001-09-04 | 2003-03-14 | Nec Corp | Adaptive network load distribution system and packet switching device |
| US20100040070A1 (en) * | 2008-08-14 | 2010-02-18 | Chang-Jin Suh | Node device and method for deciding shortest path using spanning tree |
| CN102238684A (en) * | 2011-08-01 | 2011-11-09 | 南京邮电大学 | Routing method based on bandwidth and delay bi-objective optimization |
| CN106201356A (en) * | 2016-07-14 | 2016-12-07 | 北京理工大学 | A kind of dynamic data dispatching method based on link available bandwidth state |
| US20190081884A1 (en) * | 2017-09-12 | 2019-03-14 | Adara Networks, Inc. | Dynamic link state routing protocol |
-
2021
- 2021-01-28 CN CN202110120340.8A patent/CN112751718B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2003078555A (en) * | 2001-09-04 | 2003-03-14 | Nec Corp | Adaptive network load distribution system and packet switching device |
| US20100040070A1 (en) * | 2008-08-14 | 2010-02-18 | Chang-Jin Suh | Node device and method for deciding shortest path using spanning tree |
| CN102238684A (en) * | 2011-08-01 | 2011-11-09 | 南京邮电大学 | Routing method based on bandwidth and delay bi-objective optimization |
| CN106201356A (en) * | 2016-07-14 | 2016-12-07 | 北京理工大学 | A kind of dynamic data dispatching method based on link available bandwidth state |
| US20190081884A1 (en) * | 2017-09-12 | 2019-03-14 | Adara Networks, Inc. | Dynamic link state routing protocol |
Non-Patent Citations (1)
| Title |
|---|
| 何遵文等: "基于链路带宽的分布式存储***框架及动态负载均衡技术", 《北京理工大学学报》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113868109A (en) * | 2021-09-30 | 2021-12-31 | 山东云海国创云计算装备产业创新中心有限公司 | Method, apparatus, device and readable medium for performance evaluation of multiprocessor interconnect |
| CN113868109B (en) * | 2021-09-30 | 2024-04-19 | 山东云海国创云计算装备产业创新中心有限公司 | Method, apparatus, device and readable medium for evaluating performance of multiprocessor interconnection |
| CN113949741A (en) * | 2021-10-14 | 2022-01-18 | 北京奇艺世纪科技有限公司 | Scheduling method, scheduling device, electronic equipment and storage medium |
| CN113949741B (en) * | 2021-10-14 | 2023-07-21 | 北京奇艺世纪科技有限公司 | Scheduling method, scheduling device, electronic equipment and storage medium |
| CN114006764A (en) * | 2021-11-02 | 2022-02-01 | 北京天融信网络安全技术有限公司 | Deployment method and device of safety network element based on super-fusion system |
| CN114006764B (en) * | 2021-11-02 | 2023-09-26 | 北京天融信网络安全技术有限公司 | Deployment method and device of safety network element based on super fusion system |
| CN115002007A (en) * | 2022-05-18 | 2022-09-02 | 北京达佳互联信息技术有限公司 | Network delay judging method and device, electronic equipment and storage medium |
| CN115002007B (en) * | 2022-05-18 | 2023-12-19 | 北京达佳互联信息技术有限公司 | Network delay discriminating method, device, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112751718B (en) | 2023-05-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112751718A (en) | Bandwidth adjusting method and device, terminal and storage medium | |
| US10251091B2 (en) | Traffic offloading method and apparatus | |
| US7355977B1 (en) | Method and system for a weighted allocation table | |
| WO2017025021A1 (en) | Method and device for processing flow table | |
| CN110134896B (en) | Monitoring process and intelligent caching method of proxy server | |
| CN109617810B (en) | Data transmission method and device | |
| CN114157603A (en) | Congestion control method, device, equipment and storage medium | |
| CN110674942A (en) | Bandwidth management method and device, electronic equipment and readable storage medium | |
| CN109274589B (en) | Service transmission method and device | |
| CN114374647A (en) | Planning method and device for time-sensitive service flow and route combined scheduling | |
| CN114143270A (en) | Bandwidth adjusting method and device | |
| JP2020080059A (en) | Evaluation device, evaluation method and evaluation program | |
| Mahmud et al. | Coupled multipath bbr (C-mpbbr): a efficient congestion control algorithm for multipath TCP | |
| CN106255228B (en) | Method for establishing network connection, terminal equipment and node equipment | |
| CN116896511B (en) | Special line cloud service speed limiting method, device, equipment and storage medium | |
| KR101929804B1 (en) | Method and Apparatus for Managing Session Resource | |
| US10374944B2 (en) | Quality of service for data transmission | |
| CN113453285B (en) | Resource adjusting method, device and storage medium | |
| CN108737119A (en) | A kind of data transmission method, apparatus and system | |
| US11575601B2 (en) | Network device and packet processing method using same | |
| US9876728B2 (en) | Packet processing apparatus, packet processing method, and packet processing system | |
| CN110012502B (en) | Data transmission control method, communication system, and machine-readable storage medium | |
| WO2002071699A1 (en) | System, method and mesuring node for determining a worst case gap-count value in a multi-station network | |
| CN110996350B (en) | Ad hoc network routing method and device, and electronic equipment | |
| CN114095449A (en) | Flow control method, network device and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |