CN112291747B - Network congestion control method and device, electronic equipment and storage medium - Google Patents
Network congestion control method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN112291747B CN112291747B CN202011273453.3A CN202011273453A CN112291747B CN 112291747 B CN112291747 B CN 112291747B CN 202011273453 A CN202011273453 A CN 202011273453A CN 112291747 B CN112291747 B CN 112291747B
- Authority
- CN
- China
- Prior art keywords
- hop
- network
- link
- target
- source node
- 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
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/30—Services specially adapted for particular environments, situations or purposes
- H04W4/40—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P]
-
- 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/021—Traffic management, e.g. flow control or congestion control in wireless networks with changing topologies, e.g. ad-hoc networks
-
- 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/0284—Traffic management, e.g. flow control or congestion control detecting congestion or overload during communication
-
- 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/0289—Congestion control
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The application provides a network congestion control method and device, electronic equipment and a storage medium, wherein the method comprises the steps of obtaining single-hop delay and a single-hop delay threshold of any link in a network; wherein the single-hop delay threshold is related to the maximum packet loss rate allowed by the network; judging whether network congestion occurs according to the single-hop time delay threshold and the single-hop time delay; if network congestion occurs, determining a target source node corresponding to the data flow in the link, and controlling the rate generated by the target source node; according to the embodiment of the application, the single-hop delay threshold value used for judging whether the network congestion occurs is related to the maximum data packet loss rate allowed by the network, so that the delay constraint of the whole network can be divided to each link, the data flow overtime rate can be effectively reduced on the premise that the data transmission meets the end-to-end delay constraint requirement, and the network throughput is improved.
Description
Technical Field
The present application relates to the field of information security technologies, and in particular, to a method and an apparatus for controlling network congestion, an electronic device, and a storage medium.
Background
Unmanned aerial vehicle has the characteristics such as deployment convenience, flexibility height, with low costs, is applied to military affairs and civilian field more and more. A multi-unmanned aerial vehicle system is established in an Ad-Hoc mode, namely an unmanned aerial vehicle self-organizing network (FANETs), and has better flexibility and expandability compared with a multi-unmanned aerial vehicle network in a cellular mode, and meanwhile, the unmanned aerial vehicle network gets rid of the limitation of regions on ground base station deployment, and the goal that fewer base stations cover a larger area is achieved.
Since the link state is unpredictable due to the high mobility of the drone, it is difficult to limit the end-to-end transmission delay within a given threshold, and therefore, in an application in which the delay is limited, congestion on a path may increase the end-to-end transmission delay and reduce data transmission performance, thereby causing packet timeout and retransmission at a MAC (Media Access Control) layer or an upper layer. Moreover, the rapid change of the network topology and the poor wireless channel can cause unstable packet transmission delay and packet loss rate, which brings challenges to delay-aware congestion control in FANETs.
Disclosure of Invention
In view of the above problems, the present application is proposed to provide a network congestion control method and apparatus, an electronic device, and a storage medium that overcome or at least partially solve the above problems, including:
a network congestion control method is applied to an Ad-Hoc network, the network comprises a plurality of nodes, and a link is arranged between two nodes; the method comprises the following steps:
acquiring single-hop time delay of any link and a single-hop time delay threshold corresponding to the link; the single-hop delay threshold is related to the maximum data packet loss rate allowed by the network;
judging whether network congestion occurs according to the single-hop time delay threshold and the single-hop time delay;
and if network congestion occurs, determining a target source node corresponding to the data flow in the link, and controlling the generation rate of the target source node.
Optionally, the step of obtaining the single-hop delay of any link includes:
acquiring the fusion rate and the data flow capacity of any link;
and calculating the single-hop time delay of the link according to the fusion rate and the data flow capacity.
Optionally, the step of obtaining the single-hop delay threshold corresponding to the link includes:
constructing a delay interruption probability model related to the single-hop delay;
acquiring the maximum data packet loss rate allowed by the network;
and calculating to obtain the single-hop time delay threshold according to the maximum data packet loss rate allowed by the network and the delay interruption probability model.
Optionally, the step of determining whether network congestion occurs according to the single-hop delay threshold and the single-hop delay includes:
and when the single-hop delay is larger than the single-hop delay threshold, determining that network congestion occurs.
Optionally, the step of controlling the generation rate of the target source node includes:
constructing a utility function of the network;
determining constraints of the utility function;
determining a target solution of the utility function maximization according to the constraint condition;
obtaining a target generation rate of the target source node according to the target solution;
and controlling the generation rate of the target source node by adopting the target generation rate.
Optionally, the step of determining a target solution for maximizing the utility function according to the constraint condition includes:
the constraint condition is subjected to a transformation process,
according to the processed constraint conditions, expressing the utility function maximization in a Lagrange dual form to obtain a corresponding dual function;
decomposing the dual function according to the characteristics of the dual function to obtain a first decomposition function;
and processing the first decomposition function to obtain a target solution.
Optionally, the target solution is related to a state of a transmission link in a transmission path of the data stream; the step of obtaining the target generation rate of the target source node according to the target solution includes:
acquiring state information of the transmission link;
obtaining a target generation rate of the target source node according to the state information of the transmission link and the target solution;
wherein the step of obtaining the status information of the transmission link includes:
receiving an adjustment value for a maximum allowable packet loss rate for the network;
calculating a first single-hop time delay threshold value of the transmission link according to the adjusting value;
acquiring a first fusion rate of the transmission link;
and determining the state information of the transmission link according to the first single-hop time delay threshold and the first fusion rate.
A network congestion control device is applied to an Ad-Hoc network, the network comprises a plurality of nodes, and links are arranged between the two nodes; the device comprises:
the first acquisition module is used for acquiring the single-hop time delay of any link and the single-hop time delay threshold value corresponding to the link; the single-hop delay threshold is related to the maximum data packet loss rate allowed by the network;
the first judgment module is used for judging whether network congestion occurs according to the single-hop time delay threshold and the single-hop time delay;
and the first control module is used for determining a target source node corresponding to the data flow in the link and controlling the generation rate of the target source node when network congestion occurs.
Optionally, the first obtaining module includes:
the first obtaining submodule is used for obtaining the fusion rate and the data flow capacity of any link;
and the first calculation submodule is used for calculating the single-hop time delay of the link according to the fusion rate and the data flow capacity.
Optionally, the first obtaining module includes:
the first construction submodule is used for constructing a delay interruption probability model related to the single-hop delay;
the second obtaining submodule is used for obtaining the maximum data packet loss rate allowed by the network;
and the second calculation submodule is used for calculating and obtaining the single-hop time delay threshold according to the maximum data packet loss rate allowed by the network and the delay interruption probability model.
Optionally, the first determining module is specifically configured to:
and when the single-hop delay is larger than the single-hop delay threshold, determining that network congestion occurs.
Optionally, the first control module includes:
a second construction submodule for constructing a utility function of the network;
the first determining submodule is used for determining a constraint condition of the utility function;
the second determining submodule is used for determining a target solution of the utility function maximization according to the constraint condition;
a third determining submodule, configured to obtain a target generation rate of the target source node according to the target solution;
and the rate control submodule is used for controlling the generation rate of the target source node by adopting the target generation rate.
Optionally, the second determining sub-module includes:
a first processing submodule for performing a transformation process on the constraint condition,
the second processing submodule is used for expressing the utility function maximization in a Lagrangian dual form according to the processed constraint condition to obtain a corresponding dual function;
the third processing submodule is used for decomposing the dual function according to the characteristics of the dual function to obtain a first decomposition function;
and the fourth processing submodule is used for processing the first decomposition function to obtain a target solution.
Optionally, the target solution relates to a state of a transmission link in a transmission path of the data stream; the rate control sub-module includes:
the third obtaining submodule is used for obtaining the state information of the transmission link;
the fourth obtaining submodule is used for obtaining the target generation rate of the target source node according to the state information of the transmission link and the target solution;
wherein the third obtaining sub-module includes:
a first receiving submodule, configured to receive an adjustment value for a maximum packet loss rate allowed by the network;
the third calculation submodule is used for calculating a first single-hop time delay threshold value of the transmission link according to the adjusting value;
a fifth obtaining submodule, configured to obtain a first fusion rate of the transmission link;
and the sixth obtaining submodule is used for determining the state information of the transmission link according to the first single-hop time delay threshold and the first fusion rate.
An electronic device comprising a processor, a memory and a computer program stored on the memory and being executable on the processor, the computer program, when executed by the processor, implementing the steps of the method as described above.
A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the method as set forth above.
The application has the following advantages:
in the embodiment of the application, the single-hop delay and the single-hop delay threshold of any link in a network are obtained; wherein the single-hop delay threshold is related to the maximum packet loss rate allowed by the network; judging whether network congestion occurs according to the single-hop time delay threshold and the single-hop time delay; if network congestion occurs, determining a target source node corresponding to the data flow in the link, and controlling the rate generated by the target source node; according to the embodiment of the application, the single-hop delay threshold value used for judging whether the network congestion occurs is related to the maximum data packet loss rate allowed by the network, so that the delay constraint of the whole network can be divided to each link, the data flow overtime rate can be effectively reduced on the premise that the data transmission meets the end-to-end delay constraint requirement, and the network throughput is improved.
Drawings
In order to more clearly illustrate the technical solutions of the present application, the drawings needed to be used in the description of the present application will be briefly introduced below, and it is apparent that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without inventive labor.
Fig. 1 is a flowchart illustrating steps of a network congestion control method according to an embodiment of the present application;
fig. 2 is a block diagram of a network congestion control apparatus according to an embodiment of the present application.
Detailed Description
In order to make the aforementioned objects, features and advantages of the present application more comprehensible, the present application is described in further detail with reference to the accompanying drawings and the detailed description. It is to be understood that the embodiments described are only a few embodiments of the present application and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Referring to fig. 1, a flowchart illustrating steps of a network congestion control method according to an embodiment of the present application is shown, where the method may be applied to an Ad-Hoc network, which is a multi-hop, centerless, Ad-Hoc wireless network, also called a multi-hop network, an infrastructure-less network, or an Ad-Hoc network. The entire network has no fixed infrastructure, each node is mobile, and can dynamically maintain contact with other nodes in any manner. A link is connected between two nodes.
In this embodiment, the method may specifically include the following steps:
In the embodiment of the application, the single-hop delay and the single-hop delay threshold of any link in a network are obtained; wherein the single-hop delay threshold is related to the maximum packet loss rate allowed by the network; judging whether network congestion occurs according to the single-hop time delay threshold and the single-hop time delay; if network congestion occurs, determining a target source node corresponding to the data flow in the link, and controlling the rate generated by the target source node; according to the embodiment of the application, the single-hop delay threshold value used for judging whether the network congestion occurs is related to the maximum data packet loss rate allowed by the network, so that the delay constraint of the whole network can be divided to each link, the data flow overtime rate can be effectively reduced on the premise that the data transmission meets the end-to-end delay constraint requirement, and the network throughput is improved.
Hereinafter, the performance profiling method in the present exemplary embodiment will be further described.
In step 101, acquiring a single-hop delay of any link and a single-hop delay threshold corresponding to the link; the single-hop delay threshold is associated with a maximum packet loss rate allowed by the network.
The single-hop latency associated with a link refers to the time required for a data stream traversing the link to travel from one end node to another end node of the link. The single-hop delay threshold refers to the upper bound of the single-hop delay of the link.
In this embodiment, the network system may obtain the single-hop delay of any one link and the single-hop delay threshold corresponding to the link.
The obtaining of the single-hop delay of the link can be realized by the following sub-steps:
acquiring the fusion rate and the data flow capacity of any link;
and calculating the single-hop time delay of the link according to the fusion rate and the data flow capacity.
The fusion rate is related to the generation rate of all data streams passing through the link at the same time, and may be obtained by the prior art, which is not limited in this application. The data flow capacity refers to the amount of data flow that the link is allowing through.
In the embodiment of the application, a single-hop delay model may be pre-constructed, after the fusion rate and the data stream capacity of any link are obtained, the fusion rate and the data stream capacity are input into the pre-constructed single-hop delay model, and the model outputs the corresponding single-hop delay.
Specifically, the process of constructing the single-hop delay model in advance is as follows:
the link set in the network is represented by L, a single link is represented by L, and the rate of generating a data stream s by any source node is represented by rsIndicating that the set of data streams in the network is denoted by S, the set of links that the data stream S traverses from the source node that generated the data stream S to the destination node is denoted by l (S), and the set of data streams that traverse link l is denoted by S (l), assuming the capacity c of each link in the network during the time interval Δ tlThe length of the data stream follows an exponential distribution with a mean value K, and the single-hop delay model on the link l within the time interval Δ t can be expressed as follows:
wherein d islRepresents the single-hop delay of the data transmission on link l;
indicating the fusion rate over link l.
In this embodiment, obtaining the single-hop delay threshold of the link may be implemented by the following sub-steps:
constructing a delay interruption probability model related to the single-hop delay;
acquiring the maximum data packet loss rate allowed by the network;
and calculating to obtain the single-hop time delay threshold according to the maximum data packet loss rate allowed by the network and the delay interruption probability model.
The delay interruption probability model may be considered as a probability model that a single-hop delay of a data stream in the link exceeds a single-hop delay threshold, and may be specifically represented as follows:
wherein the content of the first and second substances,
representing a single hop delay threshold.
Substituting P by the maximum packet loss rate epsilon allowed by the networkthIt is possible to obtain:
the expression of the single-hop delay threshold value obtained by transformation is as follows:
wherein o islIs the accumulated delay error of the data stream through other links before it reaches link l.
By using
The delay threshold value of the data stream s set by the network passing through the link set L(s) can be defined as the initial value of the single-hop delay threshold value
By using
Substitution
An initial value of epsilon can be calculated and the single hop delay error can be expressed as
By coincidence | HlI represents the hop number of the data stream s from the source node to the link l, and can obtain
When the network tends to be in a stable state within a certain time, the path passed by the data stream s satisfies the condition
According to the method and the device, the delay threshold value on each hop of link is evaluated by using the delay interruption probability model, so that the message quantity transmitted between nodes can be reduced, and the utilization rate of network bandwidth is improved; due to the generation of the rate rsWith a single-hop delay threshold
In relation to this, obtaining an accurate delay threshold value at each link in time can accelerate the convergence rate of the generation rate of each data stream, and improve the network performance.
In step 102, whether network congestion occurs is determined according to the single-hop delay threshold and the single-hop delay.
In this embodiment, when the single-hop delay of any one link is greater than the single-hop delay threshold, it may be considered that network congestion occurs on a path of a data flow passing through the link.
In step 103, if network congestion occurs, a target source node corresponding to the data flow in the link is determined, and the generation rate of the target source node is controlled.
When network congestion occurs, it is necessary to control the rate at which the corresponding target source node generates the data stream, that is, to control the generation rate of the target source node.
The delay constraint condition in the network affects data transmission, and the delay constraint condition is related to the data flow generation rate of the source node and the maximum data packet loss rate allowed by the network, and there is a constraint between the data flow on the same link and the data flow capacity of the link. Therefore, in the process of controlling the generation rate of the target source node, the embodiment of the present application, in combination with the consideration of the performance of the whole network, finds the generation rate of the data stream, that is, the generation rate of the target source node, which can meet the delay constraint condition and the link capacity constraint. The method can be realized by the following steps:
constructing a utility function of the network;
determining constraints of the utility function;
determining a target solution of the utility function maximization according to the constraint condition;
obtaining a target generation rate of the target source node according to the target solution;
and controlling the generation rate of the target source node by adopting the target generation rate.
Wherein the step of determining the target solution for maximizing the utility function according to the constraint condition may include the following sub-steps:
carrying out transformation processing on the constraint conditions;
according to the processed constraint conditions, expressing the utility function maximization in a Lagrange dual form to obtain a corresponding dual function;
decomposing the dual function according to the characteristics of the dual function to obtain a first decomposition function;
and processing the first decomposition function to obtain a target solution.
In particular, the utility function of the network may be represented as U (r)s) Wherein U (r)s)＝wlog(rs) And w is a constant. The constraint conditions comprise data flow capacity constraint of a single link and time delay constraint of end-to-end data flow; the specific form of utility function maximization P1 can be expressed as:
P1:
according to utility function U (r)s) The convex property of P1 is known to be convex optimization through the linear relation of the constraint conditions.
In this embodiment, to solve the problem that the link coupling relationship generated by the constraint condition increases the complexity of the problem, the constraint condition may be
Introducing an auxiliary variable
As the single-hop delay threshold of each link and making the inequality hold, two inequalities can be used
And
representing constraints
Combined single-hop delay model
Inequality can be obtained
The following inequality is further obtained:
because of the fact that
Is greater than 0, inequality
Is established by inequality
Replacing constraints
P1 can be converted into the following form:
P2:
a lagrange multiplier vector γ can be introduced, and the lagrange dual form of P2 is expressed, and the dual function is obtained as follows:
the recombination can result in:
using the equivalence between-max and min, the dual function D can be decomposed into a first decomposition function D1And a second decomposition function D2Respectively, as follows:
the target solution that can be mathematically transformed for the decomposition function D1 can be expressed as:
the target solution is related to the value of the Lagrange multiplier, the value of the Lagrange multiplier can be used for representing the state information of the link, and when the controlled object is the target source node, L(s) in the target solution is a set of transmission links in a transmission path of the data stream generated by the target source node; the target solution is thus related to the state of the transmission link in the transmission path of the data stream.
The value of the lagrange multiplier at the nth iteration is:
where β is the step factor, and operation [ ] + denotes x ═ max {0, x }, in this embodiment, the constant step size may be selected to speed up the convergence speed of the algorithm.
Further, due to the second decomposition function D2The existence of the medium constraint condition causes the sum of single-hop time delay on the transmission path of the data flow to exceed the time delay threshold value
Therefore, the time-out rate of the data flow can be reduced by adjusting the value of the maximum packet loss rate allowed by the network, and the step of obtaining the target generation rate of the target source node according to the target solution comprises:
acquiring state information of the transmission link;
obtaining a target generation rate of the target source node according to the state information of the transmission link and the target solution;
wherein the step of obtaining the status information of the transmission link includes:
receiving an adjustment value for a maximum allowable packet loss rate for the network;
calculating a first single-hop time delay threshold value of the transmission link according to the adjusting value;
acquiring a first fusion rate of the transmission link;
and determining the state information of the transmission link according to the first single-hop time delay threshold and the first fusion rate.
Specifically, the network system may obtain state information of a transmission link in a transmission path of a data stream generated by the target source node, and more specifically, the target source node may obtain state information of a transmission link corresponding to the generated data stream, that is, a value of a lagrangian multiplier, and in a first iteration, the lagrangian multiplier may be initialized, and in other iterations, a value of the lagrangian multiplier in a current iteration is obtained, and the state information is substituted into a target solution, so that a value of the target solution, that is, a target generation rate of the target source node may be obtained. The network system can also receive the adjusted maximum data packet loss rate allowed by the network; more specifically, the transmission link may adjust the maximum packet loss rate allowed by the network according to the amount of data streams correctly received by the receiving node; then according to the model
Calculating a first single-hop delay threshold of a transmission link; and single-hop delay errors in the transmission link through which the data stream passes, i.e. single-hop delay errors in the transmission link can be obtained
And further calculates the accumulated error
Where o is 0, the initial value of the single-hop delay error is considered to be 0. Finally, substituting the first single-hop time delay threshold value and the first fusion rate in the transmission link into the calculation formula
The values of the lagrangian multipliers for this iteration, i.e. the status information of the transmission link, can be calculated.
And controlling the generation rate of the target source node by using the target generation rate.
According to the method and the device, the congestion control problem of delay constraint is formalized into the network utility maximization problem, then the Lagrangian duality method and the delay interruption probability model are comprehensively utilized, the network utility maximization problem of delay constraint is decomposed into two subproblems with lower complexity, corresponding solutions are obtained through the gradient descent method and the probability model, the data quantity needing to be transmitted in the problem solving process is effectively reduced, and the calculation time is saved. In addition, in the process of controlling the generation rate of the source node, each link is allowed to optimize transmission performance according to the single-hop time delay threshold value obtained by the link, the dynamic topological structure characteristics of FANETs are well adapted, the average data packet timeout rate is effectively reduced by 5%, and the network throughput is improved by about 10%.
Referring to fig. 2, a block diagram of a network congestion control apparatus provided in an embodiment of the present application is shown, and is applied to an Ad-Hoc network, where the network includes a plurality of nodes and a link is provided between two of the nodes; in this embodiment, the apparatus may specifically include the following modules:
a first obtaining module 201, configured to obtain a single-hop delay of any link and a single-hop delay threshold corresponding to the link; the single-hop delay threshold is related to the maximum data packet loss rate allowed by the network;
a first determining module 202, configured to determine whether network congestion occurs according to the single-hop delay threshold and the single-hop delay;
the first control module 203 is configured to determine a target source node corresponding to a data flow in the link when network congestion occurs, and control a generation rate of the target source node.
Optionally, the first obtaining module 201 includes:
the first obtaining submodule is used for obtaining the fusion rate and the data flow capacity of any link;
and the first calculation submodule is used for calculating the single-hop time delay of the link according to the fusion rate and the data flow capacity.
Optionally, the first obtaining module 201 includes:
the first construction submodule is used for constructing a delay interruption probability model related to the single-hop delay;
the second obtaining submodule is used for obtaining the maximum data packet loss rate allowed by the network;
and the second calculation submodule is used for calculating and obtaining the single-hop time delay threshold according to the maximum data packet loss rate allowed by the network and the delay interruption probability model.
Optionally, the first determining module 202 is specifically configured to:
and when the single-hop delay is larger than the single-hop delay threshold, determining that network congestion occurs.
Optionally, the first control module 203 includes:
a second construction submodule for constructing a utility function of the network;
the first determining submodule is used for determining a constraint condition of the utility function;
the second determining submodule is used for determining a target solution of the utility function maximization according to the constraint condition;
a third determining submodule, configured to obtain a target generation rate of the target source node according to the target solution;
and the rate control submodule is used for controlling the generation rate of the target source node by adopting the target generation rate.
Optionally, the second determining sub-module includes:
a first processing submodule for performing a transformation process on the constraint condition,
the second processing submodule is used for expressing the utility function maximization in a Lagrangian dual form according to the processed constraint condition to obtain a corresponding dual function;
the third processing submodule is used for decomposing the dual function according to the characteristics of the dual function to obtain a first decomposition function;
and the fourth processing submodule is used for processing the first decomposition function to obtain a target solution.
Optionally, the target solution relates to a state of a transmission link in a transmission path of the data stream; the rate control sub-module includes:
the third obtaining submodule is used for obtaining the state information of the transmission link;
the fourth obtaining submodule is used for obtaining the target generation rate of the target source node according to the state information of the transmission link and the target solution;
wherein the third obtaining sub-module includes:
a first receiving submodule, configured to receive an adjustment value for a maximum packet loss rate allowed by the network;
the third calculation submodule is used for calculating a first single-hop time delay threshold value of the transmission link according to the adjusting value;
a fifth obtaining submodule, configured to obtain a first fusion rate of the transmission link;
and the sixth obtaining submodule is used for determining the state information of the transmission link according to the first single-hop time delay threshold and the first fusion rate.
For the device embodiment, since it is basically similar to the method embodiment, the description is simple, and for the relevant points, refer to the partial description of the method embodiment.
The embodiment of the application also discloses an electronic device, which comprises a processor, a memory and a computer program stored on the memory and capable of running on the processor, wherein when the computer program is executed by the processor, the steps of the network congestion control method of the embodiment are realized.
The embodiment of the application also discloses a computer readable storage medium, wherein a computer program is stored on the computer readable storage medium, and when the computer program is executed by a processor, the steps of the network congestion control method of the embodiment are realized.
The embodiments in the present specification are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other.
As will be appreciated by one of skill in the art, embodiments of the present application may be provided as a method, apparatus, or computer program product. Accordingly, embodiments of the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, embodiments of the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
Embodiments of the present application are described with reference to flowchart illustrations and/or block diagrams of methods, terminal devices (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing terminal to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing terminal, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing terminal to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing terminal to cause a series of operational steps to be performed on the computer or other programmable terminal to produce a computer implemented process such that the instructions which execute on the computer or other programmable terminal provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While preferred embodiments of the present application have been described, additional variations and modifications of these embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including the preferred embodiment and all such alterations and modifications as fall within the true scope of the embodiments of the application.
Finally, it should also be noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or terminal that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or terminal. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or terminal that comprises the element.
The network congestion control method, the network congestion control apparatus, the electronic device and the storage medium provided by the present application are introduced in detail, and a specific example is applied in the present application to explain the principle and the implementation of the present application, and the description of the above embodiment is only used to help understand the method and the core idea of the present application; meanwhile, for a person skilled in the art, according to the idea of the present application, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present application.
Claims (9)
1. A network congestion control method is applied to an Ad-Hoc network, wherein the network comprises a plurality of nodes, and links are arranged between the nodes; the method comprises the following steps:
acquiring single-hop time delay of any link and a single-hop time delay threshold corresponding to the link; the single-hop delay threshold is related to the maximum data packet loss rate allowed by the network;
judging whether network congestion occurs according to the single-hop time delay threshold and the single-hop time delay;
if network congestion occurs, determining a target source node corresponding to the data flow in the link, and controlling the generation rate of the target source node;
the controlling the generation rate of the target source node includes:
constructing a utility function of the network;
determining constraints of the utility function;
determining a target solution of the utility function maximization according to the constraint condition;
obtaining a target generation rate of the target source node according to the target solution;
and controlling the generation rate of the target source node by adopting the target generation rate.
2. The method according to claim 1, wherein the step of obtaining the single-hop delay of any link comprises:
acquiring the fusion rate and the data flow capacity of any link;
and calculating the single-hop time delay of the link according to the fusion rate and the data flow capacity.
3. The method according to claim 2, wherein the step of obtaining the single-hop delay threshold corresponding to the link comprises:
constructing a delay interruption probability model related to the single-hop delay;
acquiring the maximum data packet loss rate allowed by the network;
and calculating to obtain the single-hop time delay threshold according to the maximum data packet loss rate allowed by the network and the delay interruption probability model.
4. The method according to claim 1, wherein the step of determining whether network congestion occurs according to the single-hop delay threshold and the single-hop delay comprises:
and when the single-hop delay is larger than the single-hop delay threshold, determining that network congestion occurs.
5. The method of claim 1, wherein the step of determining a target solution for maximizing the utility function according to the constraint comprises:
the constraint condition is subjected to a transformation process,
according to the processed constraint conditions, expressing the utility function maximization in a Lagrange dual form to obtain a corresponding dual function;
decomposing the dual function according to the characteristics of the dual function to obtain a first decomposition function;
and processing the first decomposition function to obtain a target solution.
6. The method of claim 5, wherein the target solution relates to a state of a transmission link in a transmission path of the data stream; the step of obtaining the target generation rate of the target source node according to the target solution includes:
acquiring state information of the transmission link;
obtaining a target generation rate of the target source node according to the state information of the transmission link and the target solution;
wherein the step of obtaining the status information of the transmission link includes:
receiving an adjustment value for a maximum allowable packet loss rate for the network;
calculating a first single-hop time delay threshold value of the transmission link according to the adjusting value;
acquiring a first fusion rate of the transmission link;
and determining the state information of the transmission link according to the first single-hop time delay threshold and the first fusion rate.
7. A network congestion control apparatus is applied to an Ad-Hoc network, the network comprises a plurality of nodes, and links are arranged between the nodes; the device comprises:
the first acquisition module is used for acquiring the single-hop time delay of any link and the single-hop time delay threshold value corresponding to the link; the single-hop delay threshold is related to the maximum data packet loss rate allowed by the network;
the first judgment module is used for judging whether network congestion occurs according to the single-hop time delay threshold and the single-hop time delay;
the first control module is used for determining a target source node corresponding to data flow in the link when network congestion occurs, and controlling the generation rate of the target source node;
the first control module includes:
a second construction submodule for constructing a utility function of the network;
the first determining submodule is used for determining a constraint condition of the utility function;
the second determining submodule is used for determining a target solution of the utility function maximization according to the constraint condition;
a third determining submodule, configured to obtain a target generation rate of the target source node according to the target solution;
and the rate control submodule is used for controlling the generation rate of the target source node by adopting the target generation rate.
8. An electronic device, comprising a processor, a memory and a computer program stored on the memory and being executable on the processor, the computer program, when executed by the processor, implementing the steps of the network congestion control method according to any of claims 1 to 6.
9. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the network congestion control method according to any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011273453.3A CN112291747B (en) | 2020-11-13 | 2020-11-13 | Network congestion control method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011273453.3A CN112291747B (en) | 2020-11-13 | 2020-11-13 | Network congestion control method and device, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112291747A CN112291747A (en) | 2021-01-29 |
| CN112291747B true CN112291747B (en) | 2021-12-03 |
Family
ID=74398592
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011273453.3A Active CN112291747B (en) | 2020-11-13 | 2020-11-13 | Network congestion control method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112291747B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112995057B (en) * | 2021-05-20 | 2021-10-22 | 布比（北京）网络技术有限公司 | Maximum transmission rate determining method, maximum transmission rate determining device, electronic equipment and storage medium |
| CN114071568A (en) * | 2021-10-25 | 2022-02-18 | 中国电子科技集团公司第二十研究所 | Self-adaptive data transmission rate adjusting method in unmanned aerial vehicle self-organizing network |
| CN115987879B (en) * | 2022-12-22 | 2023-12-01 | 众芯汉创（北京）科技有限公司 | Low-delay image transmission system and method based on software defined network |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110139319A (en) * | 2019-05-25 | 2019-08-16 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | High dynamic time-delay network propagation delay time minimizes method for routing |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8942215B2 (en) * | 2010-07-15 | 2015-01-27 | Dejero Labs Inc. | System and method for transmission of data from a wireless mobile device over a multipath wireless router |
| CN103476086B (en) * | 2013-09-18 | 2016-07-06 | 南京理工大学 | Dynamic multi-path AODV method for routing based on the prediction of node congestion degree |
| US20150131446A1 (en) * | 2013-11-11 | 2015-05-14 | Broadcom Corporation | Enabling virtual queues with qos and pfc support and strict priority scheduling |
| CN105554838B (en) * | 2015-12-21 | 2018-09-28 | 上海赛勋信息科技有限公司 | Multichannel multi-hop vehicular ad hoc network frequency coordination distribution method |
| CN106789718B (en) * | 2016-12-05 | 2020-10-16 | 阿里巴巴（中国）有限公司 | Data transmission congestion control method, equipment, server and programmable equipment |
| CN106789719B (en) * | 2016-12-15 | 2019-06-04 | 中国科学院沈阳自动化研究所 | A kind of jamming control method and device towards wireless industrial Mesh network |
| CN108882299B (en) * | 2018-07-06 | 2021-11-30 | 杭州电子科技大学 | Distributed congestion control, routing and power distribution method for wireless multi-hop network |
-
2020
- 2020-11-13 CN CN202011273453.3A patent/CN112291747B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110139319A (en) * | 2019-05-25 | 2019-08-16 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | High dynamic time-delay network propagation delay time minimizes method for routing |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112291747A (en) | 2021-01-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112291747B (en) | Network congestion control method and device, electronic equipment and storage medium | |
| Mei et al. | A latency and reliability guaranteed resource allocation scheme for LTE V2V communication systems | |
| CN109068391B (en) | Internet of vehicles communication optimization algorithm based on edge calculation and Actor-Critic algorithm | |
| CN111031513B (en) | Multi-unmanned-aerial-vehicle-assisted Internet-of-things communication method and system | |
| Cordeschi et al. | Reliable adaptive resource management for cognitive cloud vehicular networks | |
| Neely | Universal scheduling for networks with arbitrary traffic, channels, and mobility | |
| EP3222092B1 (en) | Method for managing communication between a plurality of moving objects | |
| CN104661260A (en) | Wireless Mesh intelligent power grid routing mechanism with QoS perceiving and loading balancing | |
| CN111768654B (en) | Multi-unmanned aerial vehicle cooperative relay assisted vehicle-mounted ad hoc network data transmission method | |
| Zhou et al. | A scalable delay based analytical framework for CSMA/CA wireless mesh networks | |
| Egea-Lopez et al. | Fair congestion control in vehicular networks with beaconing rate adaptation at multiple transmit powers | |
| CN105848241A (en) | Clustering method and system of mobile ad hoc network | |
| US9787370B2 (en) | Dynamic clustering for radio coordination in a virtual network | |
| Chen et al. | The upper bounds of cellular vehicle-to-vehicle communication latency for platoon-based autonomous driving | |
| CN114024639B (en) | Distributed channel allocation method in wireless multi-hop network | |
| Chen et al. | Delay-optimal cooperation transmission in remote sensing satellite networks | |
| US20170127450A1 (en) | Data transmission control method and device | |
| More et al. | Optimization driven Multipath Routing for the video transmission in the VANET | |
| CN111132298B (en) | Power distribution method and device | |
| CN115037638B (en) | Unmanned aerial vehicle network data acquisition and transmission control method with low energy consumption and high timeliness | |
| Yang et al. | Delay performance of priority-queue equipped UAV-based mobile relay networks: Exploring the impact of trajectories | |
| CN101699909B (en) | Dynamic adjustment method for wireless Ad Hoc network resource | |
| Cordeschi et al. | Fairness-constrained optimized time-window controllers for secondary-users with primary-user reliability guarantees | |
| CN114157660A (en) | Data transmission method, device, equipment and storage medium | |
| Vázquez-Rodas et al. | Dynamic buffer sizing for wireless devices via maximum entropy |
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 |