CN114500388B - Method, device and storage medium for balancing routing load of distribution circuit - Google Patents
Method, device and storage medium for balancing routing load of distribution circuit Download PDFInfo
- Publication number
- CN114500388B CN114500388B CN202210331978.0A CN202210331978A CN114500388B CN 114500388 B CN114500388 B CN 114500388B CN 202210331978 A CN202210331978 A CN 202210331978A CN 114500388 B CN114500388 B CN 114500388B
- Authority
- CN
- China
- Prior art keywords
- node
- candidate
- flow
- nodes
- link
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the invention provides a power distribution and utilization circuit routing method, a power distribution and utilization circuit routing device and a storage medium based on load balancing, and belongs to the technical field of intelligent power distribution and utilization communication. The matched circuit routing method based on load balancing comprises the following steps: determining a candidate node set of the initial node; acquiring a pre-flow candidate node set from a candidate node set of an initial node according to a path cost value minimum principle; and sequencing the candidate nodes in the pre-streaming candidate node set and forwarding the data packets in sequence. The method and the device comprehensively consider the real-time performance, the priority and the network bandwidth conditions of the terminal access service, select a proper routing path, distribute the flow according to the actual use condition of the network link, realize load balance, reduce time delay and packet loss rate, improve the utilization rate of the communication link and realize priority arrangement of various access services.
Description
Technical Field
The invention relates to the technical field of intelligent power distribution and utilization communication, in particular to a power distribution and utilization circuit routing method, a power distribution and utilization circuit routing device and a storage medium based on load balancing.
Background
The power grid equipment acquires power grid state basic information through the multiple types of sensors and the acquisition terminal, and a data link is constructed by utilizing information communication technologies such as the Internet of things, most of traditional routing algorithms are simple to implement, but have poor adaptability to structural characteristics and data flow characteristics of a power communication network, and reasonable distribution of network resources cannot be achieved in the practical application process. Under the condition of light load, the traditional routing algorithm can guarantee the communication efficiency and the communication quality of the network, but with the continuous increase of network load and sudden service demand, the defects of the traditional routing algorithm are also exposed undoubtedly. The electric power communication service has obvious convergence characteristics and local association characteristics, so that the utilization efficiency of the links under a heavy load condition is obviously differentiated, a few links bear most of service flow in the network, and the phenomenon of packet loss caused by overload is easy to occur, so that the links become bottleneck links in the network, and the transmission performance of the whole network is restricted; and a large number of other links are in a relatively idle state, so that the utilization rate of the links is low, and the waste of network resources is caused.
Disclosure of Invention
In order to overcome the problems of the traditional power distribution route, the invention provides a method for balancing the load of a distribution circuit route, which comprehensively considers the real-time performance, the priority and the network bandwidth conditions of terminal access services, selects a proper route path, distributes the flow on the path according to the actual use condition of a network link, realizes load balancing, reduces time delay and packet loss rate, improves the utilization rate of the communication link and realizes priority arrangement of various access services.
In order to achieve the above object, an embodiment of the present invention provides a method for balancing loads by using a circuit, including: determining a candidate node set of the initial node; acquiring a pre-flow candidate node set from the candidate node set of the initial node according to a path cost value minimum principle; and sequencing the candidate nodes in the pre-streaming candidate node set and forwarding the data packets in sequence.
Optionally, the obtaining a pre-flow candidate node set according to the path cost value minimum principle includes: and adjusting the flow pre-distributed by the candidate node through an adjusting factor.
Optionally, the flow pre-allocated by the candidate node is adjusted by an adjustment factor, which is expressed by the following formula:
F pre(k)=F out(i)﹒pik+F adj(k)
wherein the nodeiAs the initial node, the candidate nodes are combined into
(ii) a Candidate nodekBelonging to the set of candidate nodes, the candidate nodekIs a pre-allocated flow ofF pre(k) (ii) a Egress nodeiAt a flow rate ofF out(i)、pikIs a candidate nodekProbability of being selected, adjustment factor isF adj(k)。
Optionally, the adjustment factor is a variable, and is determined according to one or more of signal-to-noise ratio requirement, bandwidth, delay, or packet size in the traffic requirement.
Optionally, obtaining a pre-flow candidate node set according to a path cost value minimum principle includes: calculating the utilization rate of any link from the initial node to the destination node according to the traffic; selecting links for which the utilization is below a first threshold.
Optionally, calculating the utilization of any link from the initial node to the destination node according to the traffic, including: obtaining the flow of any link e according to the bandwidth matrix of the network link of the distribution circuit, the weight setting of the link, the distribution proportion of the nodes and the service data volumeh etThen the utilization z of any link e e Comprises the following steps:
z e =h et /C e
wherein the content of the first and second substances,h etthe flow of any link e;C e representing the capacity of said any link e.
Optionally, the obtaining a set of pre-flow candidate nodes further includes: calculating the configuration priority of each node in the candidate node set; deleting nodes in the candidate node set with configuration priority higher than a second threshold; and acquiring the pre-flow candidate node set according to nodes in the candidate node set included in the link with the utilization rate lower than a first threshold value.
Optionally, sorting the candidate nodes in the pre-flow candidate node set includes: sequencing the links with the utilization rate lower than a first threshold value from low to high according to cost values; and sorting the candidate nodes in the link corresponding to the pre-flow candidate node set from low to high according to the cost values.
In another aspect, the present invention provides a device for load balancing with a circuit, comprising: the candidate node confirmation module is used for determining a candidate node set of the initial node; an obtaining module, configured to obtain a pre-flow candidate node set from the candidate node set of the initial node according to a path cost value minimum principle; the execution module is used for sequencing the candidate nodes in the pre-flow candidate node set and sequentially forwarding data packets; the acquisition module comprises an adjusting module which adjusts the flow pre-distributed by the candidate nodes through adjusting factors.
Optionally, the obtaining module further includes: the first calculation module is used for calculating the utilization rate of any link from the initial node to the destination node according to the traffic; a selection module for selecting links for which the utilization is below a first threshold; the second calculation module is used for calculating the configuration priority of each node in the candidate node set; a deletion module for deleting nodes in the candidate node set having a configuration priority higher than a second threshold; and the matching module is used for acquiring the pre-flow candidate node set according to nodes in the candidate node set included in the link with the utilization rate lower than the first threshold value.
Optionally, the execution module is configured to: sequencing the links with the utilization rate lower than a first threshold value from low to high according to cost values; and sorting the candidate nodes in the link corresponding to the pre-flow candidate node set from low to high according to the cost values.
In another aspect, the present invention provides a machine-readable storage medium having stored thereon instructions for causing a machine to perform any of the methods for load balancing for circuit complexes described herein.
In another aspect, the present invention provides a processor for executing a program, wherein the program is executed to perform: method for balancing loads with circuits according to any of the above aspects of the present invention
Through the technical scheme, compared with the prior art, the method for balancing the matched circuit by the load has the following advantages:
1. based on a flow pre-allocation mechanism and according to the link utilization rate, screening and deleting the candidate nodes with the highest configuration priority, all the candidate forwarding nodes receiving the data packet have an opportunity to participate in the forwarding of the data packet and are not limited to one routing path, so that the load imbalance caused by the fact that the flow only passes through one routing path is avoided;
2. according to the method and the device, the candidate node flow is pre-distributed according to the actual use condition of the network link, the load balance is realized, the time delay and the packet loss rate are reduced, the utilization rate of the communication link is improved, and the priority arrangement of various access services is realized.
Additional features and advantages of embodiments of the present invention will be described in the detailed description which follows.
Drawings
The accompanying drawings, which are included to provide a further understanding of the embodiments of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the embodiments of the invention without limiting the embodiments of the invention. In the drawings:
FIG. 1 is a topology diagram of a circuit configuration by communication network nodes according to an embodiment;
FIG. 2 is a flow diagram of a method for load balancing of circuit complexes;
fig. 3 is a block diagram of an apparatus for load balancing with circuit arrangements according to an embodiment.
Detailed Description
The following describes in detail embodiments of the present invention with reference to the drawings. It should be understood that the detailed description and specific examples, while indicating embodiments of the invention, are given by way of illustration and explanation only, not limitation.
A local communication QoS routing model based on a multidimensional constraint mechanism. Firstly, establishing a routing mechanism of a local communication network for power distribution and utilization aims to ensure that the cost of the communication network is the lowest as possible under the condition of meeting the requirements of QoS (quality of service) of different services of power distribution and utilization. Any network topology can be abstracted as a weighted directed graph
Where V is the set of network nodes and E is the set of links. Any one link
From cost parameter cost(i,j)And bandwidth B, time delay D and other QoS performance indexes; similarly, any one of the network nodes
Also by the cost parameter cost(n)And QoS performance indexes such as packet loss rate L and time delay D. Is provided withP(s,d)Representing the set of all links and network nodes from the source node s to the destination node d, the constraints on the routing of the communication network are as follows:
(1) (2) in the formula (3),B mina minimum bandwidth representing the quality of service requirement of the user,D maxrepresents the maximum latency of the local communication network,L maxrepresents the maximum packet loss rate allowed by the QoS requirement of the user, and the objective function cost［P(s,d) Is defined as:
the optimization problem of solving and obtaining a link satisfying all the above constraint conditions and minimizing the link cost is called a multi-constraint optimal path problem.
The method comprises the steps that firstly, based on flow pre-distribution routing measurement, local cost from a source node to a forwarding node and remote cost from the forwarding node to a destination node are obtained; secondly, deleting the candidate nodes with high priority from the candidate node set, and readjusting the flow distribution result to screen out a pre-flow candidate node set; meanwhile, calculating end-to-end path cost values from each candidate node to a destination node, determining a set with cost less than a threshold value as an optimal candidate node set, and combining the deleted candidate nodes to obtain a pre-flow candidate node set; after the pre-flow candidate node set is determined, the candidate nodes in the pre-flow candidate node set are sequenced according to the end-to-end path cost values, and the candidate nodes forward data packets in sequence, so that the load balance and the transmission reliability of a routing protocol are realized.
Figure 1 is a topology diagram of a circuit-equipped network node according to an embodiment.
Referring to fig. 1, an initial node s (source), which may also be understood as any one of a node i, a destination node d (destination), or any one of a node j on a link, or t in the embodiment, and a child node 1, 2, 3, 4, 5, 6, 7 for the circuit configuration are represented by a communication network topology
Wherein nodes 1, 2, 3 are candidates of the initial node s, the network topology includes: 4 paths s-1-4-t, s-1-5-t, s-2-5-t and s-3-6-7-t, then the link between two nodes includes: s-1, s-2, s-3, 1-4, 1-5, 2-5, 3-6, 6-7, 4-t, 5-t, and 7-t.
Method embodiment
FIG. 2 is a flow diagram of a method for load balancing with circuits.
Referring to fig. 1, at S101, a candidate node set of an initial node is determined.
According to the embodiment, since the initial node s has a plurality of adjacent nodes 1, 2 and 3, the candidate set of the initial node s can be regarded as a set consisting of nodes which can be covered by the node s
In addition, the actual link of the power communication network is complex and unstable, and the path cost value to the destination node calculated according to the initial candidate set is not necessarily minimum, so how to determine a suitable candidate set from the initial candidate set needs to be considered, that is, a pre-flow candidate node setAnd by eliminating the nodes with heavy load in the initial candidate set, the throughput rate of the network is increased, and the reliability and the stability of the network are improved.
In step S103, a pre-flow candidate node set is obtained from the candidate node set of the initial node according to the path cost value minimum principle.
According to the embodiment, the traffic of the initial node s includes the traffic flowing into the node s and the traffic generated by the node s itself according to the pre-allocation principle of the traffic. E.g., traffic flowing into node s isF in(s) the flow rate of the flow rate itself isF own(s), then the traffic on link e for all traffic with destination node t is summedh etComprises the following steps:
whereinj(e)Is a linkeThe terminal of (2) is connected to the network,i(e)is the starting point of link e. The traffic flowing out of the node is pre-allocated according to the link characteristics. The main purpose of the pre-allocation is to allocate traffic to candidate nodes in the pre-flow candidate node set after the pre-flow candidate node set is obtained, instead of allocating traffic to all candidate nodes of the initial node. For example, the initial set of candidate nodes for node i is
Introducing adjustment factors to account for different requirements of communication network trafficF adj(k) Appropriately adjusting the flow rate distributed by the candidate node, then the candidate node
Pre-allocated flowF pre(k) Can be expressed as follows:
F pre(k)=F out(i)﹒pik+ F adj(k) （6）
wherein, if the node i is an initial node, the candidate node set is
；
Candidate node k belongs to the set of candidate nodes, point k
The pre-allocated flow of the candidate node k isF pre(k) Its unit is a bit; the flow out of node i isF out(i)、pikThe probability of being selected for the candidate node k, the adjustment factor isF adj(k)。
According to an embodiment, the factor is adjustedF adj(k) Is a variable, determined in particular according to one or more of the signal-to-noise ratio requirements, bandwidth requirements, latency requirements or packet size of the power traffic.
According to an embodiment, the probability p that a candidate node k is selectedikDetermined according to the following formula:
wherein the content of the first and second substances,
is a set of candidate nodes that are,
which is the capacity of the link e, is,j(e) K, the link e with k as the end point, and the traffic of any candidate node k is counted.
Setting initial node
To arbitrary candidate nodes
Has a single hop cost of
，
As a set of candidate nodes, it is understood that
Then the path
The cost value of (a) can be expressed as follows:
according to the embodiment, the method for acquiring the pre-flow candidate node set from the candidate node set of the initial node according to the path cost value minimum principle comprises the following steps: calculating the utilization rate of any link from the initial node to the destination node according to the traffic; selecting links for which the utilization is below a first threshold.
According to embodiments, network topology for the present application
If the bandwidth matrix of the network link, the weight setting of the link, the configuration proportion of the nodes and the service data volume are known, the flow on any link e can be obtainedh etAlso understood as the amount of traffic assumed, the utilization z of any link e e Comprises the following steps:
z e =h et /C e （9）
a path consisting of links, e.g. s-1-4-t, has three links, the sum of the traffic of the path is
：
By comparing the utilization rates of the links, the possibility that a certain link becomes a bottleneck link can be quantitatively measured, z e The larger the link, the more load sharing is necessary. z is a radical of formula e =0 indicates that the link does not transmit any traffic and is in an idle state; z is a radical of e =1 indicates that the link bandwidth has been fully utilized, full load if traffic is shared over the linkh etHigher than link bandwidth capacityC e It is indicated that the link is overloaded, and there is a packet loss phenomenon, which cannot guarantee that the data information is completely transmitted to the destination node.
According to an embodiment, the link with the utilization rate lower than the first threshold is selected, for example, the first threshold is in a reasonable range and is set according to the service requirement, theoretically, 0-100%, and preferably, 50% -70%.
According to an embodiment, obtaining a set of pre-streaming candidate nodes further comprises: calculating the configuration priority of each node in the candidate node set; deleting nodes in the candidate node set with configuration priority higher than a second threshold; and acquiring the pre-flow candidate node set according to nodes in the candidate node set included in the link with the utilization rate lower than a first threshold value.
According to an embodiment, each node from which traffic flows (e.g., node 1 flows to nodes 4 and 5) determines whether to allocate traffic on the link by looking up a forwarding routing table that records the node to which the next traffic from the current node flows is destined. I.e. the traffic is adjusted based on the traffic flow node, defined as the node n belonging to the candidate node set,
wherein n is a service outflow node in the candidate node set, z e For the link utilization associated with n,k nis the degree of node n. z is a radical of e The larger the node degreek nThe higher the configuration priority of the candidate node is, the higher the candidate node is, which indicates that the candidate node is higher in the sequence and needs to be optimized; to this end, optionally, the candidate node with the highest configuration priority is deleted, preferably, the nodes in the candidate node set with the configuration priority higher than the second threshold are deleted, for example, the second threshold range may be set to be between 50% and 100%; and according to nodes in the candidate node set included in the link with the utilization rate lower than the first threshold value, and the part with intersection in the candidate nodes of the nodes, the node set is used as the acquired pre-streaming candidate node set, and then the flow is redistributed according to the flow pre-distribution process.
Preferably, after deleting the candidate node with the highest configuration priority, then reallocating the flow according to the flow pre-allocation process to obtain the updated link utilization rate and node degree, and deleting the updated candidate node with the highest configuration priority again; or more preferably, the number of times the update is deleted is set, and the above preferred embodiment is repeatedly performed each time, for example, 3 times. Finally, a stable candidate set may be screened from the candidate set of initial nodes as a pre-streaming candidate node set.
In S105, the candidate nodes in the pre-streaming candidate node set are sorted and the data packets are sequentially forwarded.
According to the embodiment, after the pre-flow candidate node set is confirmed, the links with the updated utilization rate lower than a first threshold value are sorted from low to high according to the cost values; and sorting the candidate nodes in the link corresponding to the pre-flow candidate node set from low to high according to the cost values. For example, several common ranking algorithms may be utilized: bubble sorting, selection sorting, insertion sorting, merging sorting and the like, and codes of the bubble sorting, the selection sorting, the insertion sorting, the merging sorting and the like are all realized by adopting Java.
Through the steps, the pre-flow candidate node set is obtained, the number of candidate nodes in the set is smaller than that of the candidate nodes in the initial candidate node set, the pre-distributed flow is optimally distributed to the candidate nodes in the pre-flow candidate node set, and load imbalance caused by the fact that the flow only passes through one routing path is avoided.
Device embodiment
Fig. 3 is a block diagram of an apparatus for load balancing with circuit arrangements according to an embodiment.
Referring to fig. 3, an apparatus 300 for balancing circuit loads includes: a candidate node confirmation module 301, an acquisition module 303 and an execution module 305.
According to an embodiment, the candidate node validation module 301 is configured to determine a set of candidate nodes for the initial node.
The obtaining module 303 is configured to obtain a pre-flow candidate node set from a candidate node set of an initial node in the candidate node confirmation module 301 according to a path cost value minimum principle.
The executing module 305 is configured to sort and sequentially forward the data packets according to the candidate nodes in the pre-flow candidate node set in the obtaining module 303, where the data packets are forwarded in sequence
The obtaining module 303 includes an adjusting module 3031, and the adjusting module 3031 adjusts the flow pre-allocated by the candidate node by using an adjusting factor.
According to an embodiment, the obtaining module 303 further comprises:
the first calculating module 3033 is configured to calculate the utilization rate of any link from the initial node to the destination node according to the traffic volume.
A selecting module 3035 is configured to select the link with the utilization rate lower than the first threshold.
The second calculating module 3037 is configured to calculate the configuration priority of each node in the candidate node set.
The deleting module 3039 is configured to delete nodes in the candidate node set having a configuration priority higher than a second threshold.
The matching module 30311 is configured to obtain the pre-flow candidate node set according to nodes in the candidate node set included in the link whose traversal utilization is lower than the first threshold.
According to an embodiment, the execution module 305 is configured to: sorting the links with the utilization rate lower than a first threshold value from low to high according to cost values; and sorting the candidate nodes in the link corresponding to the pre-flow candidate node set from low to high according to the cost values.
Compared with the prior art, the advantages of the above distribution circuit load balancing device are the same as those of the above distribution circuit load balancing method, and are not described herein again.
The device for load balancing of the distribution circuit comprises a processor and a memory, wherein the candidate node confirmation module 301, the acquisition module 303, the execution module 305 and the like are stored in the memory as program units, and the processor executes the program units stored in the memory to realize corresponding functions.
The processor comprises a kernel, and the kernel calls the corresponding program unit from the memory. One or more cores can be arranged, and the matched circuit is balanced by load by adjusting the parameters of the cores.
The memory may include volatile memory in a computer readable medium, Random Access Memory (RAM) and/or nonvolatile memory such as Read Only Memory (ROM) or flash memory (flash RAM), and the memory includes at least one memory chip.
An embodiment of the present invention provides a storage medium, on which a program is stored, where the program, when executed by a processor, implements the allocation circuit load balancing method.
The embodiment of the invention provides a processor, which is used for running a program, wherein the matched circuit load balancing method is executed when the program runs.
The present application also provides a computer program product for execution on the above-mentioned apparatus for load balancing of distribution circuits.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, 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, 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.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (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 apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, 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 apparatus 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 apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). The memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus 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 apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in the process, method, article, or apparatus that comprises the element.
The above are merely examples of the present application and are not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.
Claims (11)
1. A method for balancing loads in a circuit, comprising:
determining a candidate node set of the initial node;
acquiring a pre-flow candidate node set from the candidate node set of the initial node according to a path cost value minimum principle; and
sorting the candidate nodes in the pre-flow candidate node set and forwarding the data packets in sequence,
the obtaining of the pre-flow candidate node set according to the path cost value minimum principle includes:
and adjusting the flow pre-distributed by the candidate node of the initial node through an adjusting factor, wherein the flow pre-distributed by the candidate node of the initial node is expressed by the following formula:
F pre(k)=F out(i)﹒pik+F adj(k)
wherein the nodeiAs the initial node, the candidate nodes are combined into
；
Candidate nodekA set of candidate nodes belonging to the initial node, the candidate nodeskIs a pre-allocated flow ofF pre(k)；
Egress nodeiHas a flow rate ofF out(i) 、pikThe probability of being selected for the candidate node k, the adjustment factor isF adj(k)。
2. The method of claim 1, wherein the adjustment factor is a variable determined according to one or more of signal-to-noise ratio requirements, bandwidth, latency, or packet size among traffic requirements.
3. The method of claim 1, wherein obtaining the set of pre-flow candidate nodes according to the path cost value minimization principle comprises:
calculating the utilization rate of any link from the initial node to the destination node according to the traffic;
selecting links for which the utilization is below a first threshold.
4. The method of claim 3, wherein calculating the utilization of any link from the originating node to the destination node based on the traffic comprises:
obtaining the flow of any link e according to the bandwidth matrix of the network link of the distribution circuit, the weight setting of the link, the distribution proportion of the nodes and the service data volumeh etThen either link is connected toeUtilization ratio of z e Comprises the following steps:
z e =h et /C e
wherein the content of the first and second substances,h etthe flow of any link e;C e representing said any linkeThe capacity of (c).
5. The method of claim 3, wherein obtaining a set of pre-flow candidate nodes further comprises:
calculating the configuration priority of each node in the candidate node set of the initial node;
deleting nodes in the candidate node set of the initial node with the configuration priority higher than a second threshold value;
and acquiring the pre-flow candidate node set according to nodes in the candidate node set of the initial node included in the link with the utilization rate lower than a first threshold value.
6. The method of claim 3, wherein sorting the candidate nodes in the pre-streaming candidate node set comprises:
sequencing the links with the utilization rate lower than a first threshold value from low to high according to cost values;
and sorting the candidate nodes in the link corresponding to the pre-flow candidate node set from low to high according to the cost values.
7. An apparatus for load balancing in a circuit, comprising:
the candidate node confirmation module is used for determining a candidate node set of the initial node;
an obtaining module, configured to obtain a pre-flow candidate node set from the candidate node set of the initial node according to a path cost value minimum principle;
an execution module for sorting candidate nodes in the pre-flow candidate node set and forwarding data packets in sequence,
the acquisition module comprises an adjusting module, and the adjusting module adjusts the flow pre-distributed by the candidate node of the initial node through an adjusting factor, wherein the flow pre-distributed by the candidate node of the initial node is specifically shown in the following formula:
F pre(k)=F out(i)﹒pik+F adj(k)
wherein the nodeiAs the initial node, the candidate nodes are combined into
；
Candidate nodekA set of candidate nodes belonging to the initial node, the candidate nodeskIs a pre-allocated flow ofF pre(k)；
Egress nodeiHas a flow rate ofF out(i) 、pikThe probability of being selected for the candidate node k is adjusted byF adj(k)。
8. The apparatus of claim 7, wherein the obtaining module further comprises:
the first calculation module is used for calculating the utilization rate of any link from the initial node to the destination node according to the traffic;
a selection module for selecting links for which the utilization is below a first threshold;
the second calculation module is used for calculating the configuration priority of each node in the candidate node set of the initial node;
a deleting module, configured to delete nodes in the candidate node set of the initial node whose configuration priority is higher than a second threshold;
and the matching module is used for acquiring the pre-flow candidate node set according to nodes in the candidate node set of the initial node included in the link with the utilization rate lower than the first threshold value.
9. The apparatus of claim 8, wherein the execution module is configured to:
sorting the links with the utilization rate lower than a first threshold value from low to high according to cost values;
and sorting the candidate nodes in the link corresponding to the pre-flow candidate node set from low to high according to the cost values.
10. A machine-readable storage medium having instructions stored thereon for causing a machine to perform the method for load balancing of a distribution circuit according to any of claims 1-6.
11. A processor configured to execute a program, wherein the program is configured to perform: the method of employing circuit-by-circuit load balancing as recited in any one of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210331978.0A CN114500388B (en) | 2022-03-31 | 2022-03-31 | Method, device and storage medium for balancing routing load of distribution circuit |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210331978.0A CN114500388B (en) | 2022-03-31 | 2022-03-31 | Method, device and storage medium for balancing routing load of distribution circuit |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114500388A CN114500388A (en) | 2022-05-13 |
| CN114500388B true CN114500388B (en) | 2022-07-12 |
Family
ID=81487738
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210331978.0A Active CN114500388B (en) | 2022-03-31 | 2022-03-31 | Method, device and storage medium for balancing routing load of distribution circuit |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114500388B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117880206A (en) * | 2024-03-12 | 2024-04-12 | 深圳市艾奥科技有限公司 | Load balancing method and system for Internet of things management equipment |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110446122A (en) * | 2019-05-31 | 2019-11-12 | 广东电网有限责任公司 | A kind of cross-domain collaboration resource allocation methods of fiber radio integration network |
| CN113193996A (en) * | 2021-04-26 | 2021-07-30 | 国网四川省电力公司经济技术研究院 | Power optical transmission network optimization method, device, equipment and storage medium |
| CN114065457A (en) * | 2020-07-30 | 2022-02-18 | 国网河北省电力有限公司信息通信分公司 | Optimal safety link configuration method and system for power communication network |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105323166B (en) * | 2015-11-17 | 2018-05-29 | 东北大学 | A kind of method for routing preferential based on network energy efficiency towards cloud computing |
| US11356371B2 (en) * | 2020-09-18 | 2022-06-07 | T-Mobile Usa, Inc. | Routing agents with shared maximum rate limits |
-
2022
- 2022-03-31 CN CN202210331978.0A patent/CN114500388B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110446122A (en) * | 2019-05-31 | 2019-11-12 | 广东电网有限责任公司 | A kind of cross-domain collaboration resource allocation methods of fiber radio integration network |
| CN114065457A (en) * | 2020-07-30 | 2022-02-18 | 国网河北省电力有限公司信息通信分公司 | Optimal safety link configuration method and system for power communication network |
| CN113193996A (en) * | 2021-04-26 | 2021-07-30 | 国网四川省电力公司经济技术研究院 | Power optical transmission network optimization method, device, equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114500388A (en) | 2022-05-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112738820B (en) | Dynamic deployment method and device of service function chain and computer equipment | |
| CN112313910B (en) | Multi-path selection system and method for data center centric metropolitan area networks | |
| CN109194577B (en) | Traffic engineering method and device of segmented routing network based on partial deployment | |
| US8014290B2 (en) | Traffic flow management through a multipath network | |
| Liu et al. | Load-balancing routing algorithm based on segment routing for traffic return in LEO satellite networks | |
| US7898953B2 (en) | Deficit and group round robin scheduling for efficient network traffic management | |
| CN103685054B (en) | Multipath load balancing method based on service awareness | |
| EP1847080B1 (en) | Method and apparatus for distributed admission control | |
| US8862775B2 (en) | Network server and load balancing routing method for networks thereof | |
| CN106209669A (en) | Towards SDN data center network maximum of probability path stream scheduling method and device | |
| US10542081B2 (en) | Apparatus, design method, and recording medium | |
| CN101127689B (en) | Method for minimizing priority seizing cost | |
| CN112769696B (en) | Routing method, network controller, system and storage medium | |
| CN105472484B (en) | A kind of electric power backbone Optical Transmission Network OTN radio frequency channel proportional routing Wavelength allocation method | |
| CN114500388B (en) | Method, device and storage medium for balancing routing load of distribution circuit | |
| Sarasvathi et al. | QoS guaranteed intelligent routing using hybrid PSO-GA in wireless mesh networks | |
| Shirmarz et al. | A novel flow routing algorithm based on non-dominated ranking and crowd distance sorting to improve the performance in SDN | |
| Cheng et al. | Application-aware routing scheme for sdn-based cloud datacenters | |
| CN108174446B (en) | Network node link resource joint distribution method with minimized resource occupancy | |
| CN110139173A (en) | A kind of network dividing area method reducing optical transfer network end-to-end time delay | |
| CN112995032A (en) | Segment routing traffic engineering method and device based on limited widest path | |
| CN112187642A (en) | Weighted bandwidth allocation for adaptive routing | |
| López et al. | Priority flow admission and routing in sdn: Exact and heuristic approaches | |
| Sozu et al. | Multipath Routing Method for Large File Transfer with Time Constraint | |
| Liu et al. | Constrained multipath routing algorithm based on satellite network |
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 |