CN118055449B - Multipath wireless network control method and device and computer equipment - Google Patents
Multipath wireless network control method and device and computer equipment Download PDFInfo
- Publication number
- CN118055449B CN118055449B CN202410454588.1A CN202410454588A CN118055449B CN 118055449 B CN118055449 B CN 118055449B CN 202410454588 A CN202410454588 A CN 202410454588A CN 118055449 B CN118055449 B CN 118055449B
- Authority
- CN
- China
- Prior art keywords
- node
- data
- parameter
- control instruction
- rhythm control
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/08—Load balancing or load distribution
- H04W28/09—Management thereof
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/08—Load balancing or load distribution
- H04W28/09—Management thereof
- H04W28/0958—Management thereof based on metrics or performance parameters
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to the field of communications technologies, and in particular, to a method, an apparatus, and a computer device for controlling a wireless network with multiple paths. The method comprises the following steps: determining a node of target data aimed by user operation; sending a rhythm control instruction to each node, calculating node coefficients of the nodes and sequencing; selecting the node connection of the first ordering and sending a data request; if the difference between the node coefficient of the newly connected node and the node coefficient of the next node in the sequence is smaller than a first preset value, the newly connected node is connected with the next node, and a data request is sent; receiving the returned data of each connected node; and repeatedly judging the nodes in the arrangement until the difference of the node coefficients is larger than or equal to a first preset value or no node in the sequence is continuously judged, and retransmitting the rhythm control instruction until the parameters of the combined data of all the returned data are consistent with the target data parameters. The invention solves the problems that the efficiency of data transmission is reduced and the experience effect of a user is affected in the data transmission process due to abnormal paths.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a method, an apparatus, and a computer device for controlling a wireless network with multiple paths.
Background
Load balancing is a technique that distributes network traffic, workload, or requests to multiple servers or resources. The goals of load balancing include distributing load, improving performance, achieving high availability, and having extensibility. From the perspective of the carrier supporting load balancing, load balancing can be divided into hardware load balancing and software load balancing. Hardware load balancing as shown in fig. 1, the load balancing function is implemented by special hardware devices, such as the four-layer load balancer and the seven-layer load balancer in fig. 1.
Software load balancing refers to installing load balancing software on an operating system, finding a path from a plurality of paths by using a load balancing algorithm, and sending a user request to a certain server of a back-end cluster through the path.
In this way, if the path is abnormal or crowded in the data transmission process, the operating system will fail to access or load slowly, and needs to find a new path again, which will definitely reduce the efficiency of data transmission and affect the experience effect of the user.
Disclosure of Invention
In view of the foregoing, it is desirable to provide a wireless network control method, apparatus, and computer device for multipath.
The embodiment of the invention is realized in such a way that a multi-path wireless network control method comprises the following steps:
s101, sending a query request to a domain name resolution server according to target data aimed at by user operation;
S102, receiving a domain name resolution result returned by a domain name resolution server, and determining nodes in the domain name resolution result;
S103, sending a rhythm control instruction to each node, calculating node coefficients of the nodes according to returned data of the rhythm control instruction, and sequencing the nodes from large to small according to the node coefficients;
s104, selecting the first node for connection, and sending a data request to the connected node according to the rhythm control instruction and the target data parameter;
S105, judging whether the difference between the node coefficient of the newly connected node and the node coefficient of the next node in the sequence of the newly connected node is smaller than a first preset value, if so, connecting with the next node, and sending a data request to the newly connected node according to a rhythm control instruction and a target data parameter;
s106, receiving the returned data of each connected node and disconnecting the node which receives the returned data;
S107, repeating the steps S105-S106 until the difference between the node coefficient of the latest connected node and the node coefficient of the next node in the sequence of the latest connected node is larger than or equal to a first preset value or no node in the sequence is continued to judge;
S108, repeating S103-S107 until the parameters of the combined data of all the returned data are consistent with the target data parameters;
The rhythm control instruction comprises a return data termination parameter and a test instruction.
In one embodiment, the present invention provides a multi-path radio network control apparatus, including:
the query domain name module is used for sending a query request to the domain name resolution server according to target data aimed by user operation;
The receiving result module is used for receiving the domain name resolution result returned by the domain name resolution server and determining nodes in the domain name resolution result;
the calculation coefficient module is used for sending a rhythm control instruction to each node, calculating node coefficients of the nodes according to return data of the rhythm control instruction, and sequencing the nodes from large to small according to the node coefficients;
the first sending module is used for selecting the first node for connection and sending a data request to the connected node according to the rhythm control instruction and the target data parameter;
the second sending module is used for judging whether the difference between the node coefficient of the latest connected node and the node coefficient of the next node in the sequence of the latest connected node is smaller than a first preset value, if so, the second sending module is connected with the next node, and sends a data request to the newly connected node according to a rhythm control instruction and a target data parameter;
the data receiving module is used for receiving the returned data of each connected node and disconnecting the node which receives the returned data;
The rhythm control instruction comprises a return data termination parameter and a test instruction.
In one embodiment, the present invention provides a computer device, including a memory and a processor, where the memory stores a computer program, and the computer program when executed by the processor causes the processor to perform the steps of a multipath radio network control method as described above.
According to the multipath wireless network control method provided by the embodiment of the invention, the access node of the target data is determined by sending a query request to the domain name resolution server according to the target data aimed at by user operation; sending a rhythm control instruction to each node, calculating node coefficients of the nodes according to returned data of the rhythm control instruction, and sequencing the nodes from large to small according to the node coefficients; selecting the first node for connection, and sending a data request to the connected node according to the rhythm control instruction and the target data parameter; judging whether the difference between the node coefficient of the latest connected node and the node coefficient of the next node in the sequence of the latest connected node is smaller than a first preset value, if so, connecting the latest connected node with the next node, and sending a data request to the newly connected node according to a rhythm control instruction and a target data parameter; receiving the returned data of each connected node and disconnecting the node which receives the returned data; and repeatedly judging the nodes in the arrangement until the difference between the node coefficient of the latest connected node and the node coefficient of the next node in the sequence of the latest connected node is larger than or equal to a first preset value or no node in the sequence is continuously judged, and retransmitting the rhythm control instruction until the parameters of the combined data of all the returned data are consistent with the target data parameters. In the process of data transmission, a plurality of sections of different return data are obtained from different nodes according to the rhythm control instruction, and target data aimed by user operation is obtained from all the return data. In the data transmission process, data are acquired from a plurality of paths, the connection time of each path is extremely short, and the problems that the access failure or the loading of an operating system is slow and a new path needs to be searched again because the path is abnormal or crowded in the data transmission process by using a single path are solved, so that the data transmission efficiency is reduced, and the experience effect of a user is influenced are solved.
Drawings
FIG. 1 is an application environment diagram of hardware load balancing;
Fig. 2 is an application environment diagram of a multi-path radio network control method provided in one embodiment;
Fig. 3 is a flow chart of a method of controlling a multi-path wireless network in one embodiment;
fig. 4 is a logic diagram of a method of controlling a multi-path wireless network according to one embodiment;
Fig. 5 is a block diagram of a method of controlling a multi-path wireless network according to an embodiment;
FIG. 6 is a block diagram of the internal architecture of a computer device in one embodiment.
Detailed Description
The present invention will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present invention more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention.
It will be understood that the terms "first," "second," and the like, as used herein, may be used to describe various elements, but these elements are not limited by these terms unless otherwise specified. These terms are only used to distinguish one element from another element. For example, a first xx script may be referred to as a second xx script, and similarly, a second xx script may be referred to as a first xx script, without departing from the scope of this disclosure.
Fig. 2 is an application environment diagram of a multipath wireless network control method according to an embodiment.
As shown in fig. 3 and fig. 4, in one embodiment, a method for controlling a wireless network with multiple paths is provided, which specifically includes the following steps:
s101, sending a query request to a domain name resolution server according to target data aimed at by user operation;
S102, receiving a domain name resolution result returned by a domain name resolution server, and determining nodes in the domain name resolution result;
S103, sending a rhythm control instruction to each node, calculating node coefficients of the nodes according to returned data of the rhythm control instruction, and sequencing the nodes from large to small according to the node coefficients;
s104, selecting the first node for connection, and sending a data request to the connected node according to the rhythm control instruction and the target data parameter;
S105, judging whether the difference between the node coefficient of the newly connected node and the node coefficient of the next node in the sequence of the newly connected node is smaller than a first preset value, if so, connecting with the next node, and sending a data request to the newly connected node according to a rhythm control instruction and a target data parameter;
s106, receiving the returned data of each connected node and disconnecting the node which receives the returned data;
S107, repeating the steps S105-S106 until the difference between the node coefficient of the latest connected node and the node coefficient of the next node in the sequence of the latest connected node is larger than or equal to a first preset value or no node in the sequence is continued to judge;
S108, repeating S103-S107 until the parameters of the combined data of all the returned data are consistent with the target data parameters;
The rhythm control instruction comprises a return data termination parameter and a test instruction.
In this embodiment, the user operation may be an operation of clicking a link or inputting a website, or the like. After the user operates, the webpage can jump, and the loading data or the downloading data of the webpage after jumping is the data required by the user, namely the target data. The data content of the target data is unknown, but the target data parameter is known, and the target data parameter may be the data amount of the target data or the like. For example, if the user clicks on the download link, the amount of the target data is a known value. In general, the target data parameter and the returned data termination parameter in the rhythm control command represent the same parameter, for example, the data amount.
In this embodiment, sending a query request to the domain name resolution server, receiving the domain name resolution result returned by the domain name resolution server is a normal operation of DNS, and is not expanded here.
In this embodiment, a node may be understood as an IP address, for example, a user clicks on a link to a web page jump, where the link has a domain name, and the domain name corresponds to a plurality of IP addresses.
In this embodiment, the rhythm control instruction includes a returned data termination parameter and a test instruction, where the returned data termination parameter may be parameters such as a data amount of returned data, and the test instruction is used to test a node coefficient of a node, where the higher the node coefficient is, the better the communication quality of the node is, and if the node coefficient is 0, the node cannot communicate.
In this embodiment, the return data of the rhythm control command includes data such as a transmission time stamp and the number of other transmitting terminals connected to the node.
In this embodiment, after the node is connected, a data request is sent to the node, and the node sends corresponding backhaul data after receiving the data request, where the data request not only requests the node to send backhaul data, but also has a relationship to the location of the backhaul data of the node in the target data. For example, the target parameter is the data size of the target data, the returned data termination parameter is the data size of the returned data, the a node returned data is the first segment of the target data, the B node returned data is the second segment of the target data, the data sizes of the two returned data are the same, but the contents represented by the returned data are different. So the data requests received by each node are different from each other, and the data requests need to be retransmitted unless one node does not transmit the returned data or the returned data is wrong. Each data request needs to be regenerated according to the condition of the returned data and the sent request data, and the nodes also need to be connected one by one. Only one data request is sent for one node per connection.
In this embodiment, for the nodes in the ordering, if the difference of the node coefficients between two adjacent nodes is too large, it means that the communication quality of the nodes after the ordering is greatly reduced, and only the node coefficients are close, the latter can be connected and data requests can be sent. This is to ensure the speed and security of data generation. So that the newly connected node and the next node can be connected with the next node only if the difference between the node coefficients of the newly connected node and the next node is smaller than the first preset value, otherwise, the rhythm control command is resent, and the steps of S103 and the following are repeated. The node coefficient is a number less than or equal to 1, so the first preset value may be set between 0.01 and 0.1.
In this embodiment, for a node, after a data request is sent to the node, that is, after the node receives the data request, the node sends the backhaul data, and in the process from sending the data request to receiving the backhaul data, the node keeps the communication connection state all the time, and is disconnected after receiving the backhaul data. When receiving the returned data of one node, the method does not affect the sending of the data request to other nodes or the receiving of the returned data of other nodes. That is, after the data request is sent to the node a, the data request is continuously sent to the node B, and the backhaul data of the node a is received at the same time, and when the backhaul data of the node a is not completely received yet, the data request is sent to the node C, and the backhaul data of the node B is received at the same time.
In this embodiment, for example, there are 3 nodes in the ordering, if the difference between the node coefficients of the 2 nd node and the 3 rd node is greater than or equal to the first preset value, the data request is not sent to the 3 rd node, but the rhythm control command is resent, and the nodes are reordered. If every two adjacent nodes meet the requirement, the data request can be sent, after the data request is sent by 3 nodes, the rhythm control instruction is resent, and the nodes are reordered.
In this embodiment, for example, the returned data termination parameter in the rhythm control instruction is the data size of the returned data, which is set to 1M, and represents that each time the returned data is only 1M, the target data parameter is the data size of the target data, the target data parameter is 10M, if the number of nodes is 10, and the node coefficients of two nodes connected in the sequence meet the requirement, the data request sent to the first node is the 1M data size in the returned target data required by the first node, and if the 1M data size is the first 1M data size in the target data and is received, the subsequent data request is not required to repeat the first 1M data size in the target data. It is understood that the 10M data amount is divided into 10 parts, each of which is 1M, but the data is different every 1M. Therefore, 10 parts of the returned data are required, so that 10M of the combined data of the returned data is only required, and the sending of the rhythm control command is stopped at the moment, and the data are not transmitted any more.
According to the multipath wireless network control method provided by the embodiment of the invention, the access node of the target data is determined by sending a query request to the domain name resolution server according to the target data aimed at by user operation; sending a rhythm control instruction to each node, calculating node coefficients of the nodes according to returned data of the rhythm control instruction, and sequencing the nodes from large to small according to the node coefficients; selecting the first node for connection, and sending a data request to the connected node according to the rhythm control instruction and the target data parameter; judging whether the difference between the node coefficient of the latest connected node and the node coefficient of the next node in the sequence of the latest connected node is smaller than a first preset value, if so, connecting the latest connected node with the next node, and sending a data request to the newly connected node according to a rhythm control instruction and a target data parameter; receiving the returned data of each connected node and disconnecting the node which receives the returned data; and repeatedly judging the nodes in the arrangement until the difference between the node coefficient of the latest connected node and the node coefficient of the next node in the sequence of the latest connected node is larger than or equal to a first preset value or no node in the sequence is continuously judged, and retransmitting the rhythm control instruction until the parameters of the combined data of all the returned data are consistent with the target data parameters. In the process of data transmission, a plurality of sections of different return data are obtained from different nodes according to the rhythm control instruction, and target data aimed by user operation is obtained from all the return data. In the data transmission process, data are acquired from a plurality of paths, the connection time of each path is extremely short, and the problems that the access failure or the loading of an operating system is slow and a new path needs to be searched again because the path is abnormal or crowded in the data transmission process by using a single path are solved, so that the data transmission efficiency is reduced, and the experience effect of a user is influenced are solved.
In one embodiment, the calculating the node coefficient of the node according to the returned data of the rhythm control instruction includes:
Calculating the return time t i of the return data of each rhythm control instruction;
Obtaining an efficiency factor p i of each node according to the returned data of each rhythm control instruction;
For t i, judging whether t i is greater than a first preset time, if so, setting t i as the first preset time;
From the following components Obtaining a node coefficient x i of each node;
Where i is the sequence number of the node, t max is the maximum value of t i in the first preset time, p max is the maximum value in p i, k 1 is the preset time proportion, and k 2 is the preset efficiency proportion.
In this embodiment, if a node fails during transmission, the transmission time of the return data of the rhythm control instruction or the return data of the rhythm control instruction cannot be transmitted is long. For this node, it should be essentially excluded, so the first preset time is set, where the first preset time is the limit return time of the return data of each rhythm control instruction, and t i is greater than or equal to the first preset time, where it is regarded that the node cannot transmit the return data of the rhythm control instruction or the return data transmission time of the rhythm control instruction is longer, if the node cannot transmit the return data of the rhythm control instruction, it may also happen that t i has no value, if t i has no value, which represents t i infinity, and also t i is regarded as being greater than the first preset time, and t i is set as the first preset time. The first preset time is set to be 2-3 times of the average return time of the return data of the law control command in the history record according to the specific situation.
In the present embodiment, the shorter the backhaul time is, the better the communication quality of the node in terms of time is, the longer the backhaul time is, the worse the communication quality of the node in terms of time is, so the communication quality is improvedThe communication quality of the node in time is obtained, for example, when t i is t max, the communication quality of the node in time is 0. If t i is set to the first preset time, since the first preset time is much longer than t max, the communication quality of the node in terms of time is negative. Higher efficiency factors represent better communication quality of the node in terms of data transmission, so thatThe communication quality of the node in terms of data transmission is obtained,Is a positive data less than or equal to 1 ifAnd if the node is negative, the node is later in the sequence, and the difference between the node coefficients of the node and the node with the earlier sequence is larger, and the data request is not transmitted to the node according to the judgment relation between the node coefficients.
In this embodiment, k 1 and k 2 are the duty ratios of the balance nodes in terms of time and data transmission, and the sum of k 1 and k 2 is 1, which may be set to 0.5, or may be emphasized in one aspect according to the specific situation, that is, the proportion of one aspect is increased.
In one embodiment, the calculating the return time t i of the return data of each rhythm control instruction includes:
Acquiring a data transmission time stamp a i of return data of each rhythm control instruction;
acquiring the data processing time b i of each node according to the returned data of each rhythm control instruction;
determining a time stamp c i at which the return data of each of the rhythm control instructions starts to be received;
From the following components The return time t i of the return data of each rhythm control instruction is obtained.
In this embodiment, a i is a timestamp added before return of the return data of the rhythm control instruction. b i generates data for the return data of the rhythm control instruction to the point in time when the return data begins, which is related to the respective data processing speed of each node, i.e., the data processing cycle of the node's own CPU. Relevant identification data may be added to the return data of the rhythm control instruction to obtain the data processing cycle of the node CPU to determine b i.
In one embodiment, the obtaining the efficiency factor p i of each node according to the returned data of each rhythm control instruction includes:
Acquiring the node connection quantity w i of the return data of each rhythm control instruction;
From the following components The efficiency factor p i for each node is obtained.
In this embodiment, the number of node connections is also large, which means that the number of clients connected to the node is large, the larger the probability of communication transmission, the more data to be processed, and the smaller the efficiency factor. The node connection number of the node can be obtained by adding relevant identification data to the return data of the rhythm control instruction.
In one embodiment, the sending the data request to the connected node according to the rhythm control command and the target data parameter includes:
S501, acquiring a return data termination parameter in a rhythm control instruction;
s502, judging whether the target data parameters have marked parameter segments, if not, dividing the target data parameters according to the returned data termination parameters to obtain a plurality of parameter segments;
s503, randomly selecting a section of parameter section and marking the selected parameter section;
s504, generating a data request according to the returned data termination parameter and the selected parameter segment and sending the data request to the connected node;
s505, if the target data parameter has marked parameter segments, the target parameters corresponding to unmarked parameter segments in the target data parameter are divided again according to the returned data termination parameters to obtain a plurality of parameter segments, and S503-S504 are executed.
In this embodiment, for example, the return data termination parameter in the rhythm control instruction is the data size of the return data, which is set to 1M, and represents that the return data is only 1M each time, the target data parameter is the data size of the target data, the target data parameter is 10M, and the target data parameter is divided according to the return data termination parameter, that is, the 10M is divided into 10 segments, each segment is 1M, and the position of each segment of the target data parameter segment in the target data is determined. If the first segment parameter is selected, it is marked. The order of selection may be sequentially subsequent from the start of the target data.
In this embodiment, in S502, if the data request of the node that has already undergone one-time ordering is sent and the parameter segments are not all marked yet, the parameter segments that have already been marked need to be excluded in the new one-time ordering, so that duplicate sending is solved. The setting value of the return data termination parameter in each sent rhythm control instruction is unchanged, for example, the last sorting is set to be 1M, and the next sorting is also set to be 1M, so that the aim of dividing target data parameters is facilitated, if 10M is divided into 10 sections, each section of 1M, in the last sorting, the 2 nd section of the parameter section to the 8 th section of the parameter section already send corresponding data requests, the remaining 1 st section of the parameter request and the 9 th section of the parameter section are just 1M, and the positions of the parameter section and the parameter section in each sorting can be guaranteed to be identical by keeping the setting value unchanged. Therefore, in S505, the target parameters corresponding to the unmarked parameter segments in the target data parameters are re-divided according to the returned data termination parameters, the obtained parameter segments are essentially identical, and the positions of the parameter segments in the target data parameters are unchanged, but the marked parameters are simply excluded from the generation of the data request of this time.
In this embodiment, for example, the backhaul data termination parameter is a data size, and then the backhaul data termination parameter determines the data size of the backhaul data, and the parameter segment determines the location of the backhaul data in the target data.
In one embodiment, the determining whether the difference between the node coefficients of the newly connected node and the next node in the sequence of the newly connected node is smaller than a first preset value further includes:
and judging whether the difference between the coefficients of the newly connected node and the first node is larger than a second preset value, if so, directly executing S108.
In this embodiment, the ordering of the nodes is performed according to the node coefficients from large to small, and the first preset value is used to obtain the returned data from the nodes with similar node coefficients, but as the ordering is performed later, the difference between the following nodes and the first node will be larger and larger, but two adjacent nodes still conform to the situation that the node coefficients are smaller than the first preset value, so that a second preset value needs to be set to determine whether to stop the connection of the next ordering nodes.
In this embodiment, the second preset value may be set to 1.5-3 times the first preset value.
In the present embodiment, if the difference between the coefficients of the newly connected node and the first node is not greater than the second preset value, no operation is required, and S105 and the following steps are performed.
In one embodiment, the sending the data request to the newly connected node according to the rhythm control command and the target data parameter includes:
Screening out marked parameter segments;
Randomly selecting a parameter section from unlabeled parameter sections and marking the selected parameter section;
and generating a data request according to the returned data termination parameter and the selected parameter segment and sending the data request to the newly connected node.
In this embodiment, a parameter segment is randomly selected from unlabeled parameter segments, which is generally selected sequentially, so that the position of the parameter segment in the target data parameter is relatively conveniently determined.
In this embodiment, the data requests generated in the data requests between different nodes are different due to the difference of the selected parameter segments. If the selected parameter segments are identical, the data requests will be identical, and the selected parameter segments are identical, typically when the data request sent before has been determined to be unable to receive the backhaul data from the node of the data request, and need to be retransmitted.
In one embodiment, the receiving the backhaul data of each connected node and disconnecting the node that has received the backhaul data includes:
for each connected node, after sending a data request to the connected node, judging whether the returned data of the connected node is received within a second preset time, if not, canceling the mark of the parameter section corresponding to the data request, and disconnecting the connection relationship with the connected node;
if the returned data of the connected node is received within the second preset time, determining the transmission parameters of the returned data of the connected node;
judging whether the transmission parameters of the returned data of the connected nodes are consistent with the termination parameters of the returned data, if not, canceling the marks of the parameter segments corresponding to the data request, and disconnecting the connection relationship with the connected nodes;
and if the transmission parameters of the returned data of the connected nodes are consistent with the termination parameters of the returned data, determining the positions of the returned data in the combined data of all the returned data according to the positions of the parameter segments corresponding to the data request in the target data parameters, and disconnecting the connected nodes.
In this embodiment, if the second preset time does not receive the returned data of the node, it may be considered that the node cannot transmit the returned data of the rhythm control instruction. The marking of the corresponding parameter segment is cancelled so that the data request can be regenerated. The second preset time may be the same as the first preset time.
In this embodiment, in order to determine whether the transmission parameter of the backhaul data is consistent with the backhaul data termination parameter when the backhaul data is received because the data is transmitted with a packet loss or other factors such as a signal during the transmission process, for example, the backhaul data termination parameter is 1M, and the transmission parameter of the backhaul data must also be 1M. If the parameters are inconsistent, the marking of the corresponding parameter segment is canceled, the data request is regenerated, and the returned data with inconsistent transmission parameters and the returned data termination parameters is cleared. If the parameters are consistent, the returned data is reserved, and the position of the returned data in the target data can be determined because the parameter segment corresponding to the data request of the returned data is fixed in the position of the target data parameter. For example, the parameter segment is 1M data of the 2 nd segment, and then the back transmission data is also 2M data in the target data.
In this embodiment, after the transmission of the backhaul data is completed, the connection relationship of the node is disconnected, and the same node can be reconnected in the next ordering.
As shown in fig. 5, in one embodiment, a radio network control apparatus for multipath is provided, which may specifically include:
the query domain name module is used for sending a query request to the domain name resolution server according to target data aimed by user operation;
The receiving result module is used for receiving the domain name resolution result returned by the domain name resolution server and determining nodes in the domain name resolution result;
the calculation coefficient module is used for sending a rhythm control instruction to each node, calculating node coefficients of the nodes according to return data of the rhythm control instruction, and sequencing the nodes from large to small according to the node coefficients;
the first sending module is used for selecting the first node for connection and sending a data request to the connected node according to the rhythm control instruction and the target data parameter;
the second sending module is used for judging whether the difference between the node coefficient of the latest connected node and the node coefficient of the next node in the sequence of the latest connected node is smaller than a first preset value, if so, the second sending module is connected with the next node, and sends a data request to the newly connected node according to a rhythm control instruction and a target data parameter;
the data receiving module is used for receiving the returned data of each connected node and disconnecting the node which receives the returned data;
The rhythm control instruction comprises a return data termination parameter and a test instruction.
In this embodiment, the parameter determining module is configured to determine whether parameters of the combined data of all the returned data are consistent with the target data parameters. And when the parameters of the combined data of all the returned data are consistent with the target data parameters, stopping sending the rhythm control instruction, and not transmitting the data.
In this embodiment, each module of the multipath wireless network control device is modularized in the method of the present invention, and for specific explanation of each module, please refer to the corresponding content of the method of the present invention, the embodiments of the present invention are not described herein again.
FIG. 6 illustrates an internal block diagram of a computer device in one embodiment. As shown in fig. 6, the computer device includes a processor, a memory, a network interface, an input device, and a display screen 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, where the computer program when executed by a processor may cause the processor to implement a multipath wireless network control method provided by an embodiment of the present invention. The internal memory may also store a computer program, which when executed by the processor, causes the processor to execute a multipath wireless network control method provided by the embodiment of the present invention. The display screen of the computer equipment can be a liquid crystal display screen or an electronic ink display screen, the input device of the computer equipment can be a touch layer covered on the display screen, can also be keys, a track ball or a touch pad arranged on the shell of the computer equipment, and can also be an external keyboard, a touch pad or a mouse and the like.
It will be appreciated by those skilled in the art that the structure shown in FIG. 6 is merely a block diagram of some of the structures associated with the present inventive arrangements and is not limiting of the computer device to which the present inventive arrangements may be applied, and that a particular computer device may include more or fewer components than shown, or may combine some of the components, or have a different arrangement of components.
In one embodiment, a multipath radio network control apparatus provided in an embodiment of the present invention may be implemented in the form of a computer program, which may be executed on a computer device as shown in fig. 6. The memory of the computer device may store various program modules constituting the multi-path radio network controller, such as a query domain name module, a reception result module, a calculation coefficient module, a first transmission module, a second transmission module, and a reception data module shown in fig. 5. The computer program of each program module causes the processor to execute the steps of a multi-path radio network control method according to each embodiment of the present invention described in the present specification.
For example, the computer apparatus shown in fig. 6 may perform step S101 through a query domain name module in a multi-path radio network controller as shown in fig. 5; the computer device may execute step S102 by receiving the result module; the computer device may execute step S103 by calculating the coefficient module; the computer device may execute step S104 through the first sending module; the computer device may execute step S105 through the second transmission module; the computer device may perform step S106 by receiving the data module.
In one embodiment, a computer device is presented, the computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the following steps when executing the computer program:
s101, sending a query request to a domain name resolution server according to target data aimed at by user operation;
S102, receiving a domain name resolution result returned by a domain name resolution server, and determining nodes in the domain name resolution result;
S103, sending a rhythm control instruction to each node, calculating node coefficients of the nodes according to returned data of the rhythm control instruction, and sequencing the nodes from large to small according to the node coefficients;
s104, selecting the first node for connection, and sending a data request to the connected node according to the rhythm control instruction and the target data parameter;
S105, judging whether the difference between the node coefficient of the newly connected node and the node coefficient of the next node in the sequence of the newly connected node is smaller than a first preset value, if so, connecting with the next node, and sending a data request to the newly connected node according to a rhythm control instruction and a target data parameter;
s106, receiving the returned data of each connected node and disconnecting the node which receives the returned data;
S107, repeating the steps S105-S106 until the difference between the node coefficient of the latest connected node and the node coefficient of the next node in the sequence of the latest connected node is larger than or equal to a first preset value or no node in the sequence is continued to judge;
S108, repeating S103-S107 until the parameters of the combined data of all the returned data are consistent with the target data parameters;
The rhythm control instruction comprises a return data termination parameter and a test instruction.
In one embodiment, a computer readable storage medium is provided, having a computer program stored thereon, which when executed by a processor causes the processor to perform the steps of:
s101, sending a query request to a domain name resolution server according to target data aimed at by user operation;
S102, receiving a domain name resolution result returned by a domain name resolution server, and determining nodes in the domain name resolution result;
S103, sending a rhythm control instruction to each node, calculating node coefficients of the nodes according to returned data of the rhythm control instruction, and sequencing the nodes from large to small according to the node coefficients;
s104, selecting the first node for connection, and sending a data request to the connected node according to the rhythm control instruction and the target data parameter;
S105, judging whether the difference between the node coefficient of the newly connected node and the node coefficient of the next node in the sequence of the newly connected node is smaller than a first preset value, if so, connecting with the next node, and sending a data request to the newly connected node according to a rhythm control instruction and a target data parameter;
s106, receiving the returned data of each connected node and disconnecting the node which receives the returned data;
S107, repeating the steps S105-S106 until the difference between the node coefficient of the latest connected node and the node coefficient of the next node in the sequence of the latest connected node is larger than or equal to a first preset value or no node in the sequence is continued to judge;
S108, repeating S103-S107 until the parameters of the combined data of all the returned data are consistent with the target data parameters;
The rhythm control instruction comprises a return data termination parameter and a test instruction.
It should be understood that, although the steps in the flowcharts of the embodiments of the present invention are shown in order as indicated by the arrows, these steps are not necessarily performed in order as indicated by the arrows. The steps are not strictly limited to the order of execution unless explicitly recited herein, and the steps may be executed in other orders. Moreover, at least some of the steps in various embodiments may include multiple sub-steps or stages that are not necessarily performed at the same time, but may be performed at different times, nor do the order in which the sub-steps or stages are performed necessarily performed in sequence, but may be performed alternately or alternately with at least a portion of the sub-steps or stages of other steps or other steps.
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 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 (SYNCHLINK) DRAM (SLDRAM), memory bus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), among others.
The technical features of the above-described embodiments may be arbitrarily combined, and all possible combinations of the technical features in the above-described 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 foregoing examples illustrate only a few embodiments of the invention and are described in detail herein without thereby limiting the scope of the invention. It should be noted that it will be apparent to those skilled in the art that several variations and modifications can be made without departing from the spirit of the invention, which are all within the scope of the invention.
Claims (7)
1. A method for controlling a multi-path wireless network, the method comprising:
s101, sending a query request to a domain name resolution server according to target data aimed at by user operation;
S102, receiving a domain name resolution result returned by a domain name resolution server, and determining nodes in the domain name resolution result;
S103, sending a rhythm control instruction to each node, calculating node coefficients of the nodes according to returned data of the rhythm control instruction, and sequencing the nodes from large to small according to the node coefficients;
s104, selecting the first node for connection, and sending a data request to the connected node according to the rhythm control instruction and the target data parameter;
S105, judging whether the difference between the node coefficient of the newly connected node and the node coefficient of the next node in the sequence of the newly connected node is smaller than a first preset value, if so, connecting with the next node, and sending a data request to the newly connected node according to a rhythm control instruction and a target data parameter;
s106, receiving the returned data of each connected node and disconnecting the node which receives the returned data;
S107, repeating the steps S105-S106 until the difference between the node coefficient of the latest connected node and the node coefficient of the next node in the sequence of the latest connected node is larger than or equal to a first preset value or no node in the sequence is continued to judge;
S108, repeating S103-S107 until the parameters of the combined data of all the returned data are consistent with the target data parameters;
The rhythm control instruction comprises a return data termination parameter and a test instruction;
The node coefficient of the node is calculated according to the returned data of the rhythm control instruction, and the node coefficient comprises:
Calculating the return time t i of the return data of each rhythm control instruction;
Obtaining an efficiency factor p i of each node according to the returned data of each rhythm control instruction;
For t i, judging whether t i is greater than a first preset time, if so, setting t i as the first preset time;
From the following components Obtaining a node coefficient x i of each node;
Wherein i is the sequence number of the node, t max is the maximum value of t i in a first preset time, p max is the maximum value in p i, k 1 is the preset time proportion, and k 2 is the preset efficiency proportion;
the calculating the return time t i of the return data of each rhythm control command includes:
Acquiring a data transmission time stamp a i of return data of each rhythm control instruction;
acquiring the data processing time b i of each node according to the returned data of each rhythm control instruction;
determining a time stamp c i at which the return data of each of the rhythm control instructions starts to be received;
From the following components Obtaining return time t i of return data of each rhythm control instruction;
The obtaining the efficiency factor p i of each node according to the returned data of each rhythm control instruction includes:
Acquiring the node connection quantity w i of the return data of each rhythm control instruction;
From the following components The efficiency factor p i for each node is obtained.
2. The method according to claim 1, wherein the transmitting the data request to the connected node according to the rhythm control command and the target data parameter comprises:
S501, acquiring a return data termination parameter in a rhythm control instruction;
s502, judging whether the target data parameters have marked parameter segments, if not, dividing the target data parameters according to the returned data termination parameters to obtain a plurality of parameter segments;
s503, randomly selecting a section of parameter section and marking the selected parameter section;
s504, generating a data request according to the returned data termination parameter and the selected parameter segment and sending the data request to the connected node;
s505, if the target data parameter has marked parameter segments, the target parameters corresponding to unmarked parameter segments in the target data parameter are divided again according to the returned data termination parameters to obtain a plurality of parameter segments, and S503-S504 are executed.
3. The method according to claim 1, wherein the determining whether a difference between node coefficients of a newly connected node and a next node in the ranking of the newly connected node is smaller than a first preset value further comprises:
and judging whether the difference between the coefficients of the newly connected node and the first node is larger than a second preset value, if so, directly executing S108.
4. The method according to claim 2, wherein the transmitting the data request to the newly connected node according to the rhythm control command and the target data parameter comprises:
Screening out marked parameter segments;
Randomly selecting a parameter section from unlabeled parameter sections and marking the selected parameter section;
and generating a data request according to the returned data termination parameter and the selected parameter segment and sending the data request to the newly connected node.
5. The method of claim 4, wherein the receiving the backhaul data of each connected node and disconnecting the node that has received the backhaul data comprises:
for each connected node, after sending a data request to the connected node, judging whether the returned data of the connected node is received within a second preset time, if not, canceling the mark of the parameter section corresponding to the data request, and disconnecting the connection relationship with the connected node;
if the returned data of the connected node is received within the second preset time, determining the transmission parameters of the returned data of the connected node;
judging whether the transmission parameters of the returned data of the connected nodes are consistent with the termination parameters of the returned data, if not, canceling the marks of the parameter segments corresponding to the data request, and disconnecting the connection relationship with the connected nodes;
and if the transmission parameters of the returned data of the connected nodes are consistent with the termination parameters of the returned data, determining the positions of the returned data in the combined data of all the returned data according to the positions of the parameter segments corresponding to the data request in the target data parameters, and disconnecting the connected nodes.
6. A multi-path radio network control apparatus, comprising:
the query domain name module is used for sending a query request to the domain name resolution server according to target data aimed by user operation;
The receiving result module is used for receiving the domain name resolution result returned by the domain name resolution server and determining nodes in the domain name resolution result;
the calculation coefficient module is used for sending a rhythm control instruction to each node, calculating node coefficients of the nodes according to return data of the rhythm control instruction, and sequencing the nodes from large to small according to the node coefficients;
the first sending module is used for selecting the first node for connection and sending a data request to the connected node according to the rhythm control instruction and the target data parameter;
the second sending module is used for judging whether the difference between the node coefficient of the latest connected node and the node coefficient of the next node in the sequence of the latest connected node is smaller than a first preset value, if so, the second sending module is connected with the next node, and sends a data request to the newly connected node according to a rhythm control instruction and a target data parameter;
the data receiving module is used for receiving the returned data of each connected node and disconnecting the node which receives the returned data;
The rhythm control instruction comprises a return data termination parameter and a test instruction;
The node coefficient of the node is calculated according to the returned data of the rhythm control instruction, and the node coefficient comprises:
Calculating the return time t i of the return data of each rhythm control instruction;
Obtaining an efficiency factor p i of each node according to the returned data of each rhythm control instruction;
For t i, judging whether t i is greater than a first preset time, if so, setting t i as the first preset time;
From the following components Obtaining a node coefficient x i of each node;
Wherein i is the sequence number of the node, t max is the maximum value of t i in a first preset time, p max is the maximum value in p i, k 1 is the preset time proportion, and k 2 is the preset efficiency proportion;
the calculating the return time t i of the return data of each rhythm control command includes:
Acquiring a data transmission time stamp a i of return data of each rhythm control instruction;
acquiring the data processing time b i of each node according to the returned data of each rhythm control instruction;
determining a time stamp c i at which the return data of each of the rhythm control instructions starts to be received;
From the following components Obtaining return time t i of return data of each rhythm control instruction;
The obtaining the efficiency factor p i of each node according to the returned data of each rhythm control instruction includes:
Acquiring the node connection quantity w i of the return data of each rhythm control instruction;
From the following components The efficiency factor p i for each node is obtained.
7. A computer device comprising a memory and a processor, the memory having stored therein a computer program which, when executed by the processor, causes the processor to perform the steps of a multi-path radio network control method as claimed in any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410454588.1A CN118055449B (en) | 2024-04-16 | 2024-04-16 | Multipath wireless network control method and device and computer equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410454588.1A CN118055449B (en) | 2024-04-16 | 2024-04-16 | Multipath wireless network control method and device and computer equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN118055449A CN118055449A (en) | 2024-05-17 |
| CN118055449B true CN118055449B (en) | 2024-07-30 |
Family
ID=91054147
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410454588.1A Active CN118055449B (en) | 2024-04-16 | 2024-04-16 | Multipath wireless network control method and device and computer equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN118055449B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109167703A (en) * | 2018-08-29 | 2019-01-08 | 百度在线网络技术（北京）有限公司 | unmanned vehicle data monitoring method, device, equipment and storage medium |
| CN112838903A (en) * | 2020-12-31 | 2021-05-25 | 广东大普通信技术有限公司 | Clock synchronization method, equipment and storage medium |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11106719B2 (en) * | 2019-02-22 | 2021-08-31 | International Business Machines Corporation | Heuristic dimension reduction in metadata modeling |
| CN110138837B (en) * | 2019-04-15 | 2021-12-28 | 平安科技（深圳）有限公司 | Request processing method and device, computer equipment and storage medium |
-
2024
- 2024-04-16 CN CN202410454588.1A patent/CN118055449B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109167703A (en) * | 2018-08-29 | 2019-01-08 | 百度在线网络技术（北京）有限公司 | unmanned vehicle data monitoring method, device, equipment and storage medium |
| CN112838903A (en) * | 2020-12-31 | 2021-05-25 | 广东大普通信技术有限公司 | Clock synchronization method, equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN118055449A (en) | 2024-05-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9699028B2 (en) | Method and device for updating client | |
| CN112153170B (en) | Method, device and equipment for accessing server and storage medium | |
| US8165013B2 (en) | Networked computer with gateway selection | |
| CN111752582B (en) | Software updating method and device in local area network and electronic equipment | |
| US20160269232A1 (en) | Network management apparatus and network management method | |
| CN111431871B (en) | Processing method and device of TCP (Transmission control protocol) semi-transparent proxy | |
| CN112039710B (en) | Service fault processing method, terminal equipment and readable storage medium | |
| US20210365223A1 (en) | Log printing method, system and server | |
| CN118055449B (en) | Multipath wireless network control method and device and computer equipment | |
| CN111698281A (en) | Resource downloading method and device, electronic equipment and storage medium | |
| CN102025782A (en) | Point-to-point communication method, device and system | |
| CN110995779A (en) | Method and system for caching network resources at mobile client, server and medium | |
| JP5109901B2 (en) | Session data sharing method | |
| CN119225640A (en) | Data storage method | |
| JP6100384B2 (en) | Information processing system, server device, information processing method, and program | |
| CN115022278B (en) | CDN processing method and system | |
| CN111078311A (en) | Middleware control operation method and system | |
| CN110474954B (en) | Block chain-based file sharing method and device, computer equipment and readable storage medium | |
| CN110086574B (en) | Message processing method and device, computer equipment and storage medium | |
| US20090259712A1 (en) | Distributed processing device, distributed processing method, and program | |
| CN113918326A (en) | Request processing method and device | |
| CN112104521A (en) | Request timeout monitoring method and device, computer equipment and storage medium | |
| CN110784518A (en) | Static resource acquisition method and device | |
| CN110932980B (en) | Communication method, terminal, and computer-readable storage medium | |
| CN113806060B (en) | Information processing method, radio frequency unit, communication node, electronic device, and 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 |