CN112751718B - Bandwidth adjustment method and device, terminal and storage medium - Google Patents
Bandwidth adjustment method and device, terminal and storage medium Download PDFInfo
- Publication number
- CN112751718B CN112751718B CN202110120340.8A CN202110120340A CN112751718B CN 112751718 B CN112751718 B CN 112751718B CN 202110120340 A CN202110120340 A CN 202110120340A CN 112751718 B CN112751718 B CN 112751718B
- Authority
- CN
- China
- Prior art keywords
- node
- path
- delay
- bandwidth
- network delay
- 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.)
- Active
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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the application discloses a bandwidth adjusting method, a device, equipment and a storage medium, wherein the method comprises the following steps: the routing table of the gateway is obtained, and the routing table is determined by utilizing the network delay between each node of the access gateway, and the routing table comprises the shortest network delay path from each node to the gateway, so that the shortest network delay can be realized by using the routing table for each node to interact, the network delay is effectively reduced, the size of load data of each node and the bandwidth allocated by the path segment contained in the shortest network delay path of each node can be further obtained, and further, the bandwidth is adjusted according to the size of the load data of each node and the bandwidth allocated by the path segment contained in the shortest network delay path of each node, so that the data transmission efficiency of a system formed by the gateway and each node can be further improved by adjusting the bandwidth.
Description
Technical Field
The present disclosure relates to the field of internet technologies, and in particular, to a bandwidth adjustment method and apparatus, a terminal, and a storage medium.
Background
At present, in intelligent terminals of intelligent home class, a data transmission protocol which can be used comprises 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 among the intelligent terminals in the local area network through the gateway, and the intelligent terminals in the local area network can also carry out communication interaction with a cloud server through the gateway.
However, at present, communication interaction based on zigbee protocols has the problems of large network delay and low data transmission efficiency.
Disclosure of Invention
The main objective of the present application is to provide a bandwidth adjustment 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:
obtaining a routing table of a gateway, wherein the routing table is determined by utilizing network delay among nodes accessed to the gateway, the network delay among the nodes and the gateway, and the routing table comprises the shortest network delay path from the nodes to the gateway;
acquiring the size of load data of each node and the bandwidth allocated by a path segment contained in the shortest network delay path of each node;
And carrying out bandwidth adjustment according to the size of the load data of each node and the bandwidth allocated by the path segment contained in the shortest network delay path of each node.
Optionally, the bandwidth adjusting according to the size of the load data of each node and the bandwidth allocated by the path segment included in the shortest network delay path of each node includes:
calculating 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 according to the size of the load data of the first node and the bandwidth allocated by the path segment contained in the shortest network delay path of the first node, wherein the first node is any one node in the nodes;
and carrying out bandwidth adjustment according to the communication time delay of each node.
Optionally, the calculating, according to the size of the load data of the first node and the bandwidth size allocated by the path segment included in the shortest network delay path of the first node, the 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 quotient values between the size of 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 respectively, and taking the quotient values as communication sub-delays of the path segments;
and summing the communication sub-delays of the path segments to obtain the communication delay of the first node.
Optionally, the bandwidth adjustment according to the communication delay of each node includes:
extracting the maximum communication delay and the 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 segment, and the node path segment is a node-to-node path segment;
and carrying out bandwidth adjustment 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 respective nodes includes:
comparing the communication time delays of the nodes, extracting the maximum communication time delay, and sequencing the nodes according to the sequence from small to large of the communication time delay 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, 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 respective nodes includes:
sequencing the communication time delays of the nodes according to the order from small to large to obtain a time delay sequence;
the Nth communication time delay in the time delay sequence is used as the maximum communication time delay and assigned to Tmax, the (n+1) th communication time delay in the time delay sequence is assigned to Tmin, N is the number of communication time delays, and the initial value of N is 0;
judging whether the number of path segments contained in the shortest network delay path of the node with Tmin is 1 or not;
if the shortest network delay path of the node with Tmin contains 1 number of path segments, n=n+1, and the n+1th communication delay in the delay sequence is assigned to Tmin; judging whether the Tmin is equal to the 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 shortest network delay path of the node with Tmin contains a number of path segments other than 1, then Tmin is determined to be the minimum communication delay.
Optionally, the performing bandwidth adjustment 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 larger than or equal to a preset threshold value;
when the time delay difference between the maximum communication time delay and the minimum communication time delay is larger than or equal to a preset time delay difference threshold value, bandwidth adjustment is carried out on a path segment in the shortest network delay path of the second node corresponding to the maximum communication time delay;
and after the bandwidth adjustment is completed, returning to the step of executing the bandwidth size allocated according to the size of the load data of the first node and the path segment contained in the shortest network delay path of the first node, and calculating the 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 until the delay difference between the maximum communication delay and the minimum communication delay is smaller than the preset threshold.
Optionally, the bandwidth adjustment for 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 number in the routing table from path segments contained in the shortest network delay path of the second node with the largest communication delay;
And increasing the bandwidth allocated to the target path segment by the second node according to a preset bandwidth increase and decrease rule, and decreasing the bandwidth allocated to the target path segment by other nodes except the second node in a node set, wherein the node set comprises nodes with the target path segment in the shortest network delay path.
Optionally, the obtaining the bandwidth size allocated by the path segment included in the shortest network delay path of each node includes:
determining a path segment contained in each node by utilizing 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 allocated to the path segments contained in the nodes by using the obtained total bandwidth size of each path segment and the occurrence times of each path segment.
To achieve the above object, a second aspect of the present application provides a bandwidth adjustment device, including:
a first obtaining module, configured to obtain a routing table of a gateway, where the routing table is determined by using a network delay between each node accessing the gateway, and the network delay between each node and the gateway, and the routing table includes a shortest network delay path from each node to the gateway;
The second acquisition module is used for acquiring the size of the load data of each node and acquiring the bandwidth size allocated by a path segment contained 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 by 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 adjustment method as in the first aspect.
To achieve the above object, a fourth aspect of the present application provides a computer device, including 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 bandwidth adjustment method as in the first aspect.
By adopting the embodiment of the application, the method has the following beneficial effects:
the application provides a bandwidth adjustment method, which comprises the following steps: the routing table of the gateway is obtained, and the routing table is determined by utilizing the network delay between each node of the access gateway, and the routing table comprises the shortest network delay path from each node to the gateway, so that the shortest network delay can be realized by using the routing table for each node to interact, the network delay is effectively reduced, the size of load data of each node and the bandwidth allocated by the path segment contained in the shortest network delay path of each node can be further obtained, and further, the bandwidth is adjusted according to the size of the load data of each node and the bandwidth allocated by the path segment contained in the shortest network delay path of each node, so that the data transmission efficiency of a 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 that are required in the embodiments or the description of the prior art will be briefly described below, it being obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Wherein:
FIG. 1 is a flow chart of a bandwidth adjustment method according to an embodiment of the present disclosure;
FIG. 2 is a schematic diagram of a shortest network delay path in an embodiment of the present application;
FIG. 3 is a schematic flow chart of a bandwidth adjustment method according to an embodiment of the present disclosure;
FIG. 4 is a flow chart illustrating the refinement step of step 304 in the embodiment shown in FIG. 3;
FIG. 5 is a schematic flow chart of a bandwidth adjustment method according to an embodiment of the present disclosure;
FIG. 6 is a block diagram of a bandwidth adjusting apparatus according to an embodiment of the present application;
fig. 7 is a block diagram of a computer device in an embodiment of the present application.
Detailed Description
The following description of the embodiments of the present application will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are only some, but not all, of the embodiments of the present application. All other embodiments, which can be made by one of ordinary skill in the art based on the embodiments herein without making any inventive effort, are intended to be within the scope of the present application.
In this embodiment of the present application, the intelligent terminal and the gateway may form a local area network, in which the intelligent terminal can access the gateway through a wireless transmission protocol, and interaction between the intelligent terminal and the intelligent terminal, or between the intelligent terminal and the cloud server is implemented by using the gateway, where the wireless transmission protocol may be a zigbee protocol, a bluetooth transmission protocol, or a near field communication protocol.
The intelligent terminal can be an intelligent refrigerator, an intelligent microwave oven, an intelligent purifier, an intelligent oven and the like, and in practical application, the devices which can be connected with the gateway can be called as intelligent terminals. In a possible scheme, the intelligent terminal can realize communication with a user terminal (such as a smart phone) through gateway networking; in another possible scheme, the intelligent terminal can communicate with other intelligent terminals, user terminals and the like through the gateway, and the application is not limited to applicable communication scenes.
The intelligent terminal may also be referred to as a node, and the node will be used for description, and will not be explained later.
Referring to fig. 1, a flow chart of a bandwidth adjustment method according to an embodiment of the present application is shown, where the method includes:
In an embodiment of the present application, the bandwidth adjustment method may be specifically implemented by a bandwidth adjustment device, where the bandwidth adjustment 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 adjustment device to implement the bandwidth adjustment method, and in a possible implementation, the device may be a gateway.
The gateway has a generated routing table, and the routing table is specifically determined by using network delay between each node of the access gateway, where the network delay between each node and the gateway includes shortest network delay paths from each node to the gateway, where one 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, wherein 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 it can be determined that the shortest network delay path of node 1 contains 3 path segments, wherein both ends of the path segments are node can be called node path segments, and one end of the path segments is gateway can be called gateway path segments.
For a better understanding of the shortest network delay path of the routing table in the embodiments of the present application, please refer to fig. 2, which is a schematic diagram of the shortest network delay path in the embodiments of the present application, wherein a gateway-based network topology structure includes a gateway and nodes 1 to 7, wherein an arrow direction indicates a data transmission direction, a number on the arrow indicates a network delay time (a unit of the network delay time is, for example, ms) for transmitting data, and the gateway can perform data interaction with a cloud server. It will be understood that, in the schematic diagram shown in fig. 2, the paths described by taking the example that the nodes send data to the gateway are taken as examples, and in practical application, if the gateway sends data to the nodes, the same paths may be used, but the transmission directions of the data are 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, after the gateway sends the data to the cloud server and receives the data fed back by the cloud server, the data needs to be sent to the node 1, and then the data can be transmitted by using the shortest network delay path in the opposite direction, that is, the gateway-node 2-node 1, so as to realize the data interaction between the node 1 and the cloud server.
102, acquiring the size of load data of each node and the bandwidth allocated by a path segment contained in the shortest network delay path of each node;
and 103, performing bandwidth adjustment according to the size of the load data of each node and the bandwidth allocated by the path segment included in the shortest network delay path of each node.
In this embodiment of the present application, 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 are also obtained, it may be understood that in actual execution, there is no necessary execution precedence relation between the step of obtaining the routing table and the step of obtaining the size of the load data of each node, or the size of the load data of each node may be obtained first, and then the routing table may be obtained, or both steps may be executed simultaneously. In one possible implementation, 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 negotiation interaction process, each node sends the size of the 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 a plurality of different nodes may comprise the same path segment, in which case the bandwidth of each node in the path segment needs to be allocated, so that the bandwidth allocated by the path segment comprised by the shortest network delay path of each node can be determined, for example, if the path segment a is used by only one shortest network delay path of the node B, the total bandwidth of the path segment a can be allocated to the node B, and if both the node B and the node C comprise the path segment D, the bandwidth of the path segment D can be allocated to the node B and the node C.
Further, bandwidth adjustment can be performed according to the size of the load data of each node and the bandwidth allocated by 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, from the perspective of the entire network topology of the gateway, the bandwidth allocated to the path segments included in each node in the network topology is adjusted, so that the data transmission efficiency of each node in the network topology of the gateway can be effectively improved.
In this embodiment of the present application, a routing table of a gateway may be obtained, where the routing table is determined by using a network delay between each node of an access gateway, and the routing table includes a shortest network delay path from each node to the gateway, so that each node may use the routing table to implement the shortest network delay in interaction, effectively reduce the network delay, and further, may further obtain a size of load data of each node and a bandwidth allocated to a path segment included in the shortest network delay path of each node, and further perform bandwidth adjustment according to the size of load data of each node and a bandwidth allocated to a path segment included in the shortest network delay path of each node, so that data transmission efficiency of a system formed by the gateway and each node may be further improved by adjusting the bandwidth.
In order to better understand the technical solution in the embodiments of the present application, the method for obtaining the routing table will be further described, which specifically includes:
in this embodiment of the present application, 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 by using the network delay from the node to the gateway and the network delay between the nodes, and based on a shortest path algorithm, where the shortest network delay path of each node forms the above routing table, and in a possible implementation, the shortest path algorithm may be a Dijstar algorithm.
Further, after detecting that there is a new third node access, the gateway may further determine a shortest network delay path of the third node, including: if the third node is detected to access the gateway, calculating network delay between the third node and other nodes of the accessed gateway, calculating network delay from the gateway to the third node, determining a shortest network delay path of the third node by utilizing a shortest path algorithm, and adding the shortest network delay path to a routing table, so that determination of the shortest network delay path of a new access node can be effectively realized.
It can be 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 largest total network delay is determined, the routing table is maintained by using the largest total network delay, specifically, the shortest network delay paths of all nodes in the routing table are used for performing data transmission once respectively, the actual delay time between each node and the gateway is obtained, whether a fourth node with the actual delay time longer than the largest total network delay exists in the actual delay time of each node is determined, if the fourth node exists, the shortest network delay path of the fourth node is deleted in the routing table, the delay between the fourth node and the gateway is redetermined, and the delay between the fourth node and other nodes is redetermined, and based on the shortest path algorithm, the delay between the fourth node and the gateway is used, the shortest network delay path of the fourth node is redetermined, the shortest network delay time of the fourth node is added into the routing table and the gateway is updated until the actual delay of the network delay is not longer than the actual delay of the gateway, and the actual delay of the gateway is updated until the actual delay of the network delay is equal to the actual delay of the gateway is reached.
It should be noted that, in the embodiment of the present application, since each node involved in the routing table needs to participate in the data transmission process, if a node is disconnected from the gateway, data transmission cannot be performed according to the shortest network delay path through the node, so that the gateway needs to monitor which nodes are disconnected from the gateway, so as to update the routing table in time, thereby ensuring the success rate of data transmission. Specifically, if the fifth node is monitored to be disconnected from the gateway, it is determined which nodes of the shortest network delay paths contain the fifth node and are deleted from the routing table, and the shortest network delay paths are redetermined, so that the routing table can be updated in time when the connection between the nodes and the gateway is disconnected.
The foregoing is a process of generating and updating a routing table, based on which please refer to fig. 3, which is another flow chart of the bandwidth adjustment method in the embodiment of the present application, including:
it should be noted that, the contents of step 301 and step 302 are similar to those of step 101 and step 102 in the embodiment shown in fig. 1, and the contents of the embodiment shown in fig. 1 may be referred to specifically, and will not be described herein.
Further, obtaining the bandwidth allocated by the path segment included in the shortest network delay path of each node may include: determining path segments contained in each node by utilizing the shortest network delay path of each node contained in the routing table; counting the occurrence times of each path segment in a routing table based on the path segments contained by each node; and obtaining the bandwidth size allocated to the path segment contained by each node by using the obtained total bandwidth size of each path segment and the occurrence times of each path segment. In a possible implementation manner, the total bandwidth size of a path segment may be divided by the number of occurrences of the path segment to obtain the bandwidth size of the node that the path segment is allocated to each shortest network delay path and includes the path segment, for example, if the path segment a occurs 4 times in the routing table, it means that the shortest network delay path with 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 a path segment may be obtained as follows:
after determining a path segment included in a routing table, for any one of the path segments, the gateway performs closed-loop transmission of bandwidth test data by using the path segment, so that the transmission duration of transmitting the bandwidth test data can be obtained, and determines the bandwidth size of the path segment by using the size and the transmission duration of the bandwidth test data, wherein the closed-loop transmission refers to that the gateway sends the bandwidth test data to one node in the path segment, the one node sends the bandwidth test data and a first time point of receiving the bandwidth test data to another node in the path segment, the other node in the path segment determines a second time point of 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 duration of the bandwidth test data by using the first time point and the second time point, and realize closed-loop transmission. For example, if the path segment is node a-node B, the gateway may send bandwidth test data to node a, node a sends the first point in time when the bandwidth test data is received and the bandwidth test data to node B, and node B feeds back the first point in time and the second point in time when the bandwidth test data is received to the gateway, so that the gateway can determine the transmission duration based on the first point in time and the second time and further determine the total bandwidth size between node a and node B. Alternatively, the bandwidth test data may perform multiple tests on the path segment in a gradually increasing manner, and obtain multiple total bandwidth sizes, and obtain the total bandwidth size of the path segment in a manner of averaging based on the multiple total bandwidth sizes.
and 304, bandwidth adjustment is carried out according to the communication time delay of each node.
In this embodiment of the present invention, for each node of an accessed gateway, a communication delay of each node is calculated, taking a first node as an example, a communication delay of the first node for transmitting load data of the first node to the gateway through its shortest network delay path may be calculated according to a size of load data of the first node and a bandwidth allocated by a path segment included in the shortest network delay path of the first node, and specifically, the calculation of the communication delay may include the following steps:
step a, calculating quotient values between the size of load data of the first node and the bandwidth sizes of path segments contained in the shortest network delay path of the first node respectively, and taking the quotient values as communication sub-delays of the path segments;
and b, carrying out summation calculation on the communication sub-delays of the path segments to obtain the communication delay of the first node.
The quotient between the size of the load data 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 through the mode.
In one possible implementation, the communication delay of the first node may be obtained according to the following formula:
wherein T represents communication delay of the first node, D represents the size of load data of the first node, K represents the total number of path segments contained in the shortest network delay path of the first node, i represents the ith path segment and BW i Representing the bandwidth size allocated by the i-th path segment of the first node.
Further, after the communication delay of each node is obtained, bandwidth adjustment can be performed according to the communication delay of each node. Referring to fig. 4, a flowchart of the refinement step of step 304 in the embodiment shown in fig. 3 includes:
In the embodiment of the present application, the specific implementation of step 401 is:
(1) The communication delays of the nodes can be compared, the maximum communication delay is extracted, and the types and the number of the types of the path segments contained in the shortest network delay path of each node are counted, wherein the types of the path segments comprise node path segments (namely, node-to-node path segments) and gateway path segments (node-to-gateway path segments).
(2) Sequencing all the nodes according to the sequence from small to large of the communication time delay to obtain a node sequence; traversing the node 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, determining that the communication delay of the traversed node is the minimum communication delay, and stopping continuing to traverse to execute the following procedure (3); if the shortest network delay path of the traversed node does not contain a node path segment, the traversed node is indicated to have only one path segment and is a gateway path segment from the node to the gateway, and the next node is traversed continuously until the minimum communication delay is determined.
It follows that the shortest network delay path of the node with the smallest communication delay is comprised of at least one node path segment.
(3) After the maximum communication delay and the minimum communication delay are obtained, further performing bandwidth adjustment, specifically:
and judging whether the delay difference between the maximum communication delay and the minimum communication delay is larger than or equal to a preset threshold value, if 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 layout of the communication delays of the nodes is not balanced enough, and the bandwidth of a path segment in the shortest network delay path of the second node corresponding to the maximum communication delay can be adjusted so as to reduce the delay difference between the maximum communication delay and the minimum communication delay, thereby achieving the purpose of integrally improving the data transmission efficiency of the network topology structure of the gateway. In addition, when the delay difference between the maximum communication delay and the minimum communication delay is smaller than the preset delay difference threshold, the layout of the communication delays of the nodes is balanced, and data communication can be started to be executed, and at this time, the bandwidth size of the path segment of the shortest network delay path contained by each node is the bandwidth size used in the follow-up actual data transmission.
It can be understood that, after each bandwidth adjustment is completed, it needs to be verified whether the delay difference between the maximum communication delay and the minimum communication delay in the communication delays of the nodes obtained by calculation based on the adjusted bandwidth is smaller than the preset threshold, that is, after each bandwidth adjustment is completed, the above step 301 is performed again until the 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, bandwidth adjustment is performed 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 section with the largest occurrence number in a routing table from path sections contained in the shortest network delay path of the second node with the largest communication delay, increasing the bandwidth allocated to the target path section by the second node according to a preset bandwidth increasing and decreasing rule, and decreasing the bandwidth allocated to the target path section by other nodes except the second node in a node set, wherein the node set contains nodes with the target path section in the shortest network delay path, and the occurrence number of the target path section is larger than 1. For example, the shortest network delay path of the second node includes a path segment a, a path segment b, and a path segment c, where the number of occurrences of the path segment a is 2, the number of occurrences of the path segment b is 3, the number of occurrences of the path segment c is 4, it is determined that the path segment c is the target path segment with the largest number of occurrences, and the shortest network delay path of the 4 nodes includes the path segment c, as it is known from the foregoing embodiment, the bandwidth allocated to the target path segment c by the 4 nodes is BWc/4, where BWc represents the total bandwidth of the target path segment c, and the bandwidth allocated to the target path segment c by the second node may be increased, for example, the bandwidth allocated to the target path segment c by the other three nodes may be increased from BWc/4 to BWc/3, and the bandwidth allocated to the target path segment c by the other three nodes may be decreased from BWc/4 to 2BWc/9. In practical application, the ratio of the increase in the bandwidth allocated to the target path segment c of the second node may be set as required, which is not limited herein.
It can be understood that after the bandwidth of the target path segment with the largest occurrence number in the second node is increased and the bandwidth allocated by other nodes with the target path segment is reduced, the communication delay of the second node and other nodes is calculated again 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 value can be determined by using the communication delay of each node in the topology structure of the gateway, if so, the bandwidth adjustment is finished, and if so, the bandwidth adjustment step is returned until the delay difference is smaller than the preset threshold value.
It should be noted that, the node after updating the bandwidth still calculates the communication delay by using the above formula 1, and the specific formula may be as follows:
wherein T represents communication time delay of the node after bandwidth updating, D represents size of load data of the node after bandwidth updating and BW i Representing the bandwidth size, L, allocated by the ith path segment in the shortest network delay path of the node after bandwidth updating m-n Path segments representing changes in bandwidth in the shortest network delay path of the node after the bandwidth is updated,
the bandwidth after the change of the path segment with the changed bandwidth is represented, and a represents the bandwidth change coefficient.
It can be understood that, when data is transmitted, the larger the bandwidth is, the faster the transmission speed is, the smaller the bandwidth is, the slower the transmission speed is, for the 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 structure of the gateway is more balanced, the whole communication delay of the second node needs to be directly reduced by increasing the bandwidth and increasing the target path segment with the maximum occurrence number (minimum bandwidth) when the bandwidth is increased, the effect of reducing the communication delay is better, and the purpose that the delay difference between the maximum communication delay and the minimum communication delay is smaller than the preset threshold can be achieved as soon as possible.
It may be understood that if the second node has two or more target path segments with the same number of occurrences and the maximum number of occurrences, the bandwidth allocated to one of the target path segments or the multiple target path segments may be selectively adjusted, and in practical application, the number of adjusted target path segments may be selected according to needs, which is not limited herein.
It may be understood that, after the bandwidth adjustment is completed, the gateway sends the adjusted bandwidth size to each node, and taking the sixth node as an example, the identifier of the path initial node that may be the shortest network delay path including the sixth node and the correspondence relationship between the path initial node and the bandwidth size allocated by the path segment including the sixth node in the shortest network delay path are sent to the sixth node. For example, if the shortest network delay path of the node a is the node a-node B-node C-gateway, the node a is the path initial identifier of the shortest network delay path, and if the sixth node is the node B, the corresponding relationship between the identifier of the node a and the bandwidth size allocated to the path segment of the node a (node a-node B) and the corresponding relationship between the identifier of the node a and the bandwidth size allocated to the path segment of the node a (node B-node C) are transmitted to the node B.
It should be noted that, when a node sends a data packet as a path initial identifier, the shortest network delay path of the node may be carried 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 the next node may determine a path segment based on the node and the next node, and find the above-mentioned correspondence by using the determined identifiers of the path segment and the path initial node, so as to determine the bandwidth size that can be used when transmitting the data packet in the path segment, and transmit the data packet to the next node according to the bandwidth size, so as to implement data transmission.
In order to better understand the technical solution in the embodiments of the present application, please refer to fig. 5, which is another flow chart of the bandwidth adjustment method in the embodiments of the present application, including:
It should be noted that, in the embodiment shown in fig. 5, the contents are mostly similar to those in the embodiments shown in fig. 3 and 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 calculated, the communication delays of each node are sequenced in order 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 assigned to Tmax, where the value of N is the number of communication delays, and it can be understood that N is also the total number of nodes of the access gateway. Meanwhile, the (n+1) th communication delay in the delay sequence is assigned to Tmin, N belongs to N, 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, namely the minimum value of the communication delay.
Further, it is determined whether the number of path segments included in the shortest network delay path of the node having Tmin is 1, if not, it is indicated 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, the Tmin is determined to be the minimum communication delay according to the determination requirement of the minimum communication delay, if the number of path segments included in the shortest network delay path of the node having Tmin is 1, it is indicated that the shortest network delay path of the node having Tmin includes only one gateway path segment, it does not meet the determination requirement of the minimum communication delay, at this time, n=n+1 may be caused, n+1th communication delay in the delay sequence is assigned to Tmin, after the n+1th communication delay is assigned to Tmin, it is determined whether in is equal to Tmax, if Tmin is equal to Tmax, it is indicated that the last communication delay in the sequence has been assigned to Tmin, or it is indicated that communication delay that has at least one communication delay is the same as tmx (for example, if Tmin has 10, it is not 5, and if there is a time delay in the maximum communication delay is not equal to 5), it may be determined that the communication delay is not be equal to be 5, and thus, if the communication delay of the communication delays of the nodes in the network delay has a maximum distribution is not equal to be determined to have a maximum value, and a value.
For example, if there are 5 communication delays in the delay list, after assigning the 1 st (0+1, n being 0 at this time) communication delay to Tmin, if the number of path segments included in the shortest network delay path of the node having Tmin is determined to be 1, let n=0+1, then n=1, n+1=2, i.e. the 2 nd communication delay is assigned to Tmin, if Tmin is not equal to Tmax, and if the number of path segments included in the shortest network delay path of the node having Tmin is determined to be 1, then n=1+1, n=2, n+1=3, i.e. the 3 rd communication delay is assigned to Tmin, and so on until the minimum communication delay is determined, or the assignment of Tmin is ended when tmin=tmax is determined.
In the embodiment of the invention, the minimum communication time delay is found by an assignment mode, and the method has the advantages of high speed and convenient implementation.
Referring to fig. 6, a schematic structural diagram of a bandwidth adjusting apparatus according to an embodiment of the present application, the apparatus includes:
a first obtaining module 601, configured to obtain a routing table of a gateway, where the routing table is determined by using network delay between each node of an access gateway and the network delay between each node 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 a size of load data of each node, and obtain a bandwidth size allocated to a path segment included in a shortest network delay path of each node;
and the adjusting module 603 is configured to adjust the bandwidth according to the size of the load data of each node and the bandwidth allocated by the path segment included in the shortest network delay path of each node.
The second acquisition module comprises a third acquisition module and a fourth acquisition module, wherein the third acquisition module is used for acquiring the size of load data of each node, and the fourth acquisition module is used for: determining a path segment contained in each node by utilizing 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 allocated to the path segments contained in the nodes by using the obtained total bandwidth size of each path segment and the occurrence times 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 specific reference may be made to the foregoing method embodiment, which is not repeated herein.
In this embodiment of the present application, since the routing table is determined by using the network delay between each node of the access gateway, and the routing table includes the shortest network delay path from each node to the gateway, the routing table is used to implement the shortest network delay between each node and the gateway, so that the network delay can be effectively reduced, and further, 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 can be obtained, and further, bandwidth adjustment is performed 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, so that 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:
the computing module is used for computing 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 according to the size of the load data of the first node and the bandwidth size distributed by the path segment contained in the shortest network delay path of the first node, wherein the first node is any node in the nodes;
And the first adjusting module is used for adjusting the bandwidth according to the communication time delay of each node.
The computing module is specifically configured to: calculating quotient values between the size of 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 respectively, and taking the quotient values as communication sub-delays of the path segments; and summing the communication sub-delays of the path segments to obtain the communication delay of the first node.
Further, the first adjustment module includes:
the extraction module is used for extracting the maximum communication delay and the 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 segment, and the node path segment is a node-to-node path segment;
and the second adjustment module is used for adjusting the bandwidth according to the maximum communication delay and the minimum communication delay.
Wherein the second adjustment module comprises:
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;
a third adjustment module, configured to adjust a bandwidth of a path segment in a shortest network delay path of the second node corresponding to the maximum communication delay 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;
And the return module is used for returning to the execution calculation module after the bandwidth adjustment is completed until the time delay difference between the maximum communication time delay and the minimum communication time delay is smaller than the preset threshold value.
The third adjusting module is specifically configured to: selecting a target path segment with the largest occurrence number in the routing table from path segments contained in the shortest network delay path of the second node with the largest communication delay; and increasing the bandwidth allocated to the target path segment by the second node according to a preset bandwidth increase and decrease rule, and decreasing the bandwidth allocated to the target path segment by other nodes except the second node in a node set, wherein the node set comprises nodes with the target path segment in the shortest network delay path.
FIG. 7 illustrates an internal block diagram of a computer device in one embodiment. The computer device may in particular 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. The memory includes a nonvolatile 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 a processor, causes the processor to implement the steps of the method embodiments described above. The internal memory may also have stored therein a computer program which, when executed by a processor, causes the processor to perform the steps of the method embodiments described above. It will be appreciated by those skilled in the art that the structure shown in fig. 7 is merely a block diagram of some of the structures associated with the present application and is not limiting of the computer device to which the present application may be applied, and that a particular computer device may include more or fewer components than shown, or may combine certain components, or have a different arrangement of components.
In one embodiment, a computer device is provided that includes a memory and a processor, the memory storing a computer program that, when executed by the processor, causes the processor to perform the steps of the bandwidth adjustment method embodiments described above.
In one embodiment, a computer-readable storage medium is provided, storing a computer program that, when executed by a processor, causes the processor to perform the steps of the bandwidth adjustment method embodiments described above.
Those skilled in the art will appreciate that all or part of the processes in the methods of the above embodiments may be implemented by a computer program for instructing relevant hardware, where the program may be stored in a non-volatile computer readable storage medium, and where the program, when executed, may include processes in the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the various embodiments provided herein may include non-volatile and/or volatile memory. The nonvolatile 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), memory bus direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), among others.
The technical features of the above embodiments may be arbitrarily combined, and all possible combinations of the technical features in the above embodiments are not described for brevity of description, however, as long as there is no contradiction between the combinations of the technical features, they should be considered as the scope of the description.
The above examples only represent a few embodiments of the present application, which are described in more detail and are not to be construed as limiting the scope of the present application. It should be noted that it would be apparent to those skilled in the art that various modifications and improvements could be made without departing from the spirit of the present application, which would be within the scope of the present application. Accordingly, the scope of protection of the present application is to be determined by the claims appended hereto.
Claims (10)
1. A method of bandwidth adjustment, the method comprising:
obtaining a routing table of a gateway, wherein the routing table is determined by utilizing network delay among nodes accessed to the gateway, the network delay among the nodes and the gateway, and the routing table comprises the shortest network delay path from the nodes to the gateway;
Acquiring the size of load data of each node and the bandwidth allocated by a path segment contained in the shortest network delay path of each node;
performing bandwidth adjustment according to the size of the load data of each node and the bandwidth allocated by the path segment included in the shortest network delay path of each node;
the bandwidth adjustment is performed according to the size of the load data of each node and the bandwidth allocated by the path segment included in the shortest network delay path of each node, and the method includes:
calculating 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 according to the size of the load data of the first node and the bandwidth allocated by the path segment contained in the shortest network delay path of the first node, wherein the first node is any one node in the nodes;
and carrying out bandwidth adjustment according to the communication time delay of each node.
2. The method of claim 1, wherein calculating the 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 based on the size of the load data of the first node and the bandwidth allocated by the path segment included in the shortest network delay path of the first node comprises:
Calculating quotient values between the size of 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 respectively, and taking the quotient values as communication sub-delays of the path segments;
and summing the communication sub-delays of the path segments to obtain the communication delay of the first node.
3. The method according to claim 1, wherein said adjusting the bandwidth according to the communication delay of each node comprises:
extracting the maximum communication delay and the 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 segment, and the node path segment is a node-to-node path segment;
and carrying out bandwidth adjustment according to the maximum communication time delay and the minimum communication time delay.
4. A method according to claim 3, wherein said extracting a maximum communication latency and a minimum communication latency from the communication latencies of the respective nodes comprises:
comparing the communication time delays of the nodes, extracting the maximum communication time delay, and sequencing the nodes according to the sequence from small to large of the communication time delay 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, 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.
5. The method of claim 3, wherein said adjusting the bandwidth based on 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 larger than or equal to a preset threshold value;
when the time delay difference between the maximum communication time delay and the minimum communication time delay is larger than or equal to a preset time delay difference threshold value, bandwidth adjustment is carried out on a path segment in the shortest network delay path of the second node corresponding to the maximum communication time delay;
and after the bandwidth adjustment is completed, returning to the step of executing the bandwidth size allocated according to the size of the load data of the first node and the path segment contained in the shortest network delay path of the first node, and calculating the 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 until the delay difference between the maximum communication delay and the minimum communication delay is smaller than the preset threshold.
6. The method of claim 5, wherein performing bandwidth adjustment on a path segment in a shortest network delay path of the second node corresponding to the maximum communication delay comprises:
selecting a target path segment with the largest occurrence number in the routing table from path segments contained in the shortest network delay path of the second node with the largest communication delay;
and increasing the bandwidth allocated to the target path segment by the second node according to a preset bandwidth increase and decrease rule, and decreasing the bandwidth allocated to the target path segment by other nodes except the second node in a node set, wherein the node set comprises nodes with the target path segment in the shortest network delay path.
7. The method of claim 1, wherein said obtaining the bandwidth size allocated by the path segment included in the shortest network delay path of each node comprises:
determining a path segment contained in each node by utilizing 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 allocated to the path segments contained in the nodes by using the obtained total bandwidth size of each path segment and the occurrence times of each path segment.
8. A bandwidth adjustment device, the device comprising:
a first obtaining module, configured to obtain a routing table of a gateway, where the routing table is determined by using a network delay between each node accessing the gateway, and the network delay between each node and the gateway, and the routing table includes a shortest network delay path from each node to the gateway;
the second acquisition module is used for acquiring the size of the load data of each node and acquiring the bandwidth size allocated by a path segment contained in the shortest network delay path of each node;
the adjustment module is used for carrying out bandwidth adjustment according to the size of the load data of each node and the bandwidth allocated by the path segment contained in the shortest network delay path of each node;
the adjusting module is specifically configured to:
calculating 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 according to the size of the load data of the first node and the bandwidth allocated by the path segment contained in the shortest network delay path of the first node, wherein the first node is any one node in the nodes;
And carrying out bandwidth adjustment according to the communication time delay of each node.
9. A computer readable storage medium storing a computer program, which when executed by a processor causes the processor to perform the steps of the method according to any one of claims 1 to 7.
10. A computer device comprising a memory and a processor, wherein the memory stores a computer program which, when executed by the processor, causes the processor to perform the steps of the method of any of claims 1 to 7.
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 CN112751718A (en) | 2021-05-04 |
| CN112751718B true 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) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113868109B (en) * | 2021-09-30 | 2024-04-19 | 山东云海国创云计算装备产业创新中心有限公司 | Method, apparatus, device and readable medium for evaluating performance of multiprocessor interconnection |
| CN113949741B (en) * | 2021-10-14 | 2023-07-21 | 北京奇艺世纪科技有限公司 | Scheduling method, scheduling device, electronic equipment and storage medium |
| CN114006764B (en) * | 2021-11-02 | 2023-09-26 | 北京天融信网络安全技术有限公司 | Deployment method and device of safety network element based on super fusion system |
| CN115002007B (en) * | 2022-05-18 | 2023-12-19 | 北京达佳互联信息技术有限公司 | Network delay discriminating method, device, electronic equipment and storage medium |
Citations (3)
| 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 |
| 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 |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100973695B1 (en) * | 2008-08-14 | 2010-08-04 | 숭실대학교산학협력단 | Shortest Path Decision Using Node Device and Spanning Tree |
| US10554538B2 (en) * | 2017-09-12 | 2020-02-04 | Adara Networks, Inc. | Dynamic link state routing protocol |
-
2021
- 2021-01-28 CN CN202110120340.8A patent/CN112751718B/en active Active
Patent Citations (3)
| 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 |
| 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 |
Non-Patent Citations (1)
| Title |
|---|
| 基于链路带宽的分布式存储系统框架及动态负载均衡技术;何遵文等;《北京理工大学学报》;20170915(第09期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112751718A (en) | 2021-05-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112751718B (en) | Bandwidth adjustment method and device, terminal and storage medium | |
| US12155738B2 (en) | System and method for joint dynamic forwarding and caching in content distribution networks | |
| US7355977B1 (en) | Method and system for a weighted allocation table | |
| US10728154B2 (en) | Flow table processing method and apparatus | |
| CN117354230B (en) | Routing path determining method, device, equipment and medium of bidirectional topological network | |
| CN112087382B (en) | Service routing method and device | |
| CN110674942A (en) | Bandwidth management method and device, electronic equipment and readable storage medium | |
| CN111132299A (en) | Resource allocation method and device for relay system | |
| US20170006088A1 (en) | Connection method and communication device | |
| US20170019463A1 (en) | Communication system, communication device and communication method | |
| CN110621052A (en) | Multipath routing optimization method | |
| WO2015101363A1 (en) | System and method for traffic engineering using link buffer status | |
| CN112637061B (en) | Dynamic multi-factor path calculation method based on heuristic algorithm | |
| CN112104566B (en) | Processing method and device for load balancing | |
| CN111935781B (en) | Control method, network system and related device of data sharing network | |
| JP2019521609A (en) | Method and device for obtaining path information of data packet | |
| CN114006861A (en) | Link aggregation load balancing method and device and storage medium | |
| CN105681112A (en) | Method of realizing multi-level committed access rate control and related device | |
| CN110996350B (en) | Ad hoc network routing method and device, and electronic equipment | |
| US20250016103A1 (en) | Session-based load balancing | |
| CN110012502A (en) | Data transmission control method, communication system and machine-readable storage medium | |
| US20240284302A1 (en) | Transmission path improving method in a mesh network, electronic device and computer-readable storage medium | |
| CN115996244A (en) | Method, apparatus, storage medium and computer program product for forwarding messages | |
| Monsakul | SRAD: Smart Routing Algorithm Design for Supporting IoT Network Architecture | |
| CN119276773A (en) | Network path selection method, device, network equipment, medium and program product |
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 |