CN109257287A - A kind of shortest path determines method and controller - Google Patents
A kind of shortest path determines method and controller Download PDFInfo
- Publication number
- CN109257287A CN109257287A CN201710571119.8A CN201710571119A CN109257287A CN 109257287 A CN109257287 A CN 109257287A CN 201710571119 A CN201710571119 A CN 201710571119A CN 109257287 A CN109257287 A CN 109257287A
- Authority
- CN
- China
- Prior art keywords
- path
- attribute
- network topology
- weight
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/14—Routing performance; Theoretical aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
- H04L41/122—Discovery or management of network topologies of virtualised topologies, e.g. software-defined networks [SDN] or network function virtualisation [NFV]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/40—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks using virtualisation of network functions or resources, e.g. SDN or NFV entities
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0823—Errors, e.g. transmission errors
- H04L43/0829—Packet loss
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0852—Delays
- H04L43/087—Jitter
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/20—Arrangements for monitoring or testing data switching networks the monitoring system or the monitored elements being virtualised, abstracted or software-defined entities, e.g. SDN or NFV
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/123—Evaluation of link metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/124—Shortest path evaluation using a combination of metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/16—Threshold monitoring
Abstract
This application discloses a kind of shortest paths to determine method and controller, and wherein method comprises determining that the corresponding multiplier of shortest path determined based on Lagrange relaxation LARAC algorithm in network topology from source node to destination node；The weight of each edge in the network topology is determined according to the multiplier, and K paths are determined according to the weight of each edge, the K paths are the K paths in the network topology from the weight in source node path into the path of destination node from small to large, and K is the positive integer greater than 1；The weight in path is the sum of the weight on all sides in the path；By in the K paths first attribute in path and be less than or equal to preset threshold, and second attribute in path and the smallest path be determined as first path, and using the first path as in the network topology from source node to the shortest path of destination node.
Description
Technical field
This application involves fields of communication technology more particularly to a kind of shortest path to determine method and controller.
Background technique
With the development of communication technology, software defined network (Software Defined Networking, SDN) conduct
A kind of new network framework, is more and more paid attention to.The core concept of SDN is by network-based control plane and Forwarding plane
It is separated, the forwarding that the SDN controller in plane can be uniformly controlled data in a certain network on Forwarding plane is controlled, with reality
The flexible allotment of existing network flow.Wherein, SDN controller is in controlling a certain network when the forwarding of data, for some business
Source node and destination node where network, can first determine the set of paths of each node in the network, the path of each node
Set includes active node to the path of the node, then the set of paths based on each node, determines source node to destination node
Service path, and then according to the forwarding of business datum between service path progress source node and destination node.Wherein, source node is
Refer to and serve as the node that information source sends business datum, destination node, which refers to, serves as the node that the stay of two nights receives business datum.
For SDN controller when carrying out the router-level topology between source node and destination node, the factor generally considered is more single,
Such as only consider the factors such as cost (cost) or time delay (delay), it obtains one and meets service quality (Quality of
Service, QoS) path, may not be optimal path so as to cause calculated shortest path, for example, in a network
Two nodes between there are under the scene on multiple heavy sides, the goodness for the shortest path determined is not high, is not able to satisfy reality
Using, therefore preferably shortest path how is obtained, it is a urgent problem to be solved.
Summary of the invention
The application provides a kind of shortest path and determines method and controller, how to determine source node and destination node to solve
Between preferably shortest path the problem of.
The embodiment of the present application provides a kind of shortest path and determines method, this method comprises:
Determine the shortest path pair determined based on Lagrangian Relaxation Algorithm in network topology from source node to destination node
The multiplier answered；The corresponding multiplier of shortest path determined based on Lagrangian Relaxation Algorithm is a fixed value, is bright in glug
In the last one iterative process of day relaxed algorithm, multiplier corresponding when shortest path is determined.
The weight of each edge in the network topology is determined according to the multiplier, and K is determined according to the weight of each edge
Paths.Wherein, the K paths are in the network topology from the source node to path in the path of the destination node
The K paths of weight from small to large, K are the positive integer greater than 1；The weight in the path is the weight on all sides in the path
With.
By in the K paths first attribute in path and be less than or equal to preset threshold, and second attribute in path
And the smallest path be determined as first path, the first path be in the network topology from source node to destination node most
Short path.If threshold value is the user equipment for requesting SDN controller to determine the shortest path from source node to destination node, according to itself
Actual network demand setting, certain preset threshold may be the reality of a default value or SDN controller according to network
Situation setting.
Wherein, first attribute is an attribute of link corresponding to side in the network topology, and the second attribute is
Another attribute different from the first attribute of link corresponding to side in the network topology；The sum of first attribute in path is
The sum of first attribute on all sides in the path, the sum of second attribute in path are second attribute on all sides in the path
With.
According to method provided by the embodiments of the present application, the shortest path pair determined based on Lagrangian Relaxation Algorithm is being determined
After the multiplier answered, the weight of each edge in the network topology is determined according to the multiplier, and according to the weight of each edge
Determine the smallest path of the weight of K paths.Finally the first shortest path is determined from the K paths.The application is implemented
Example, the first path determined be the first attribute for meeting path sum less than or equal to preset threshold constraint condition base
On plinth, it is contemplated that second attribute in path and the smallest constraint condition, thus determine that first path better than only according to road
The sum of first attribute of diameter less than or equal to the path that the constraint condition of preset threshold is determined, that is, the first path determined
It is second attribute and the shortest path than being determined based on LARAC algorithm the second attribute and smaller, to realize acquisition
Preferably shortest path.
In some embodiments, it before the weight that each edge in the network topology is determined according to the multiplier, also wraps
It includes:
Determination meets following preset condition:
The node density of the network topology is greater than or equal to default node density, and described based on the LARAC algorithm
The mean difference coefficient of determining shortest path is less than or equal to default coefficient of variation.
It by the above method, determines that the node density is greater than or equal to default node density, and determines described based on institute
When stating the mean difference coefficient for the shortest path that LARAC algorithm determines less than or equal to default coefficient of variation, it can determine current
The shortest path determined based on the LARAC algorithm obtained is not optimal path, so as to according to based on the LARAC
The corresponding multiplier of shortest path that algorithm determines determines the first shortest path, to improve determining source node between destination node
The accuracy of shortest path.
In some embodiments, however, it is determined that the shortest path determined based on the LARAC algorithm is unsatisfactory for described pre-
If condition, then by it is described based on the LARAC algorithm determine shortest path be determined as in the network topology from source node to
The shortest path of destination node.
In some embodiments, the mean difference coefficient of the shortest path determined based on the LARAC algorithm is met
Following formula:
Av (D)=| E | × 2/ | V |
Wherein, av (D) is the node density of the network topology, and E is number of edges included by the network topology, and V is institute
State number of nodes included by network topology.
How default node density specifically determines that the embodiment of the present application does not limit this, and default node density can be used
Judge between the node in network topology with the presence or absence of multiple heavy sides, so that it is determined that determined most based on the LARAC algorithm
Whether short path is optimal.
In some embodiments, the mean difference coefficient in second path meets following formula:
Wherein, av (CV) is the mean difference coefficient of the shortest path determined based on the LARAC algorithm,CViFor it is described based on the LARAC algorithm determine shortest path the corresponding adjacent two nodes in i-th side it
Between weight side right weight coefficient of variation, SiFor the corresponding phase in i-th side in the shortest path determined based on the LARAC algorithm
The standard deviation of weight side right weight between adjacent two nodes,For i-th side of the shortest path determined based on the LARAC algorithm
The average value of weight side right weight between corresponding adjacent two nodes, n are the positive integer more than or equal to 1, and n is described based on described
The number of edges that the shortest path that LARAC algorithm determines includes.
How default coefficient of variation specifically determines that the embodiment of the present application does not limit this, can be by combining default section
Dot density and default coefficient of variation judge with the presence or absence of multiple heavy sides between the node in network topology, so that it is determined that being based on
Whether the shortest path that the LARAC algorithm determines is optimal.
In some embodiments, the weight of each edge in the network topology is determined according to the multiplier, comprising:
For any a line in the network topology, by the product of first attribute on the side and the multiplier with
This while the sum of second attribute be determined as this while weight.
In some embodiments, using the first path as most short from source node to destination node in the network topology
After path, further includes:
The routing table from source node to destination node is generated according to the first path.
In some embodiments, first attribute is any one in cost, time delay, delay variation and packet loss；
Second attribute is any one in cost, time delay, delay variation and packet loss.
In some embodiments, the cost is expense or distance or energy consumption.
In the embodiment of the present application, cost refers to that data packet reaches connecing in network topology from the sending node in network topology
Receive expense required when node.For example, it may be referring to that data packet reaches in network topology from the sending node in network topology
Required expense or energy consumption when receiving node can also indicate that and refer to that data packet reaches network from the sending node in network topology
The distance of the link passed through when receiving node in topology.
Time delay refers to that data packet after the sending node transmission in network topology, by transmission, reaches network and opens up
The time it takes when receiving node in flutterring.Delay variation refers to the variation of time delay, can reflect the variation degree of time delay.It loses
Packet rate refers in the data packet for the receiving node being sent in network topology from the sending node in network topology, the data of loss
The quantity of packet accounts for the ratio of the total quantity of transmitted data packet.
The embodiment of the present application provides a kind of controller, comprising:
Receiving module, for receiving source node identification and destination node information；The source node identification indicates source node,
The destination node information indicates destination node；
Memory module, is used for the storage network topological information, the network topological information include network topology structure with
And in the network topology structure each edge the first attribute and the second attribute, first attribute be the network topology in side
One attribute of corresponding link, the second attribute are the different from the first attribute of link corresponding to side in the network topology
Another attribute；
Processing module, for determining calculating based on Lagrange relaxation LARAC from source node to destination node in network topology
The corresponding multiplier of shortest path that method determines；The weight of each edge in the network topology, and root are determined according to the multiplier
Determine that K paths, the K paths are in the network topology from the source node to the destination node according to the weight of each edge
Path in path weight K paths from small to large, K is the positive integer greater than 1；The weight in the path is in the path
The sum of the weight on all sides；By in the K paths first attribute in path and be less than or equal to preset threshold, and path
Second attribute and the smallest path is determined as first path, and the first path is in the network topology from source node to place
The shortest path of node, wherein the sum of first attribute in path for first attribute on all sides in the path sum, the of path
The sum of two attributes for second attribute on all sides in the path sum.
In some embodiments, the processing module is also used to:
Determination meets following preset condition:
The node density of the network topology is greater than or equal to default node density, and described based on the LARAC algorithm
The mean difference coefficient of determining shortest path is less than or equal to default coefficient of variation.
In some embodiments, the node density of the network topology meets following formula:
Av (D)=| E | × 2/ | V |
Wherein, av (D) is the node density of the network topology, and E is number of edges included by the network topology, V
For number of nodes included by the network topology.
In some embodiments, the mean difference coefficient in second path meets following formula:
Wherein, av (CV) is the mean difference coefficient in second path,CViFor second path
The coefficient of variation of weight side right weight, S between the corresponding adjacent two nodes in i-th sideiIt is corresponding for i-th side in second path
The standard deviation of weight side right weight between adjacent two nodes,Between the corresponding adjacent two nodes in i-th side in second path
The average value of weight side right weight, n are the positive integer more than or equal to 1, and n is the number of edges that second path includes.
In some embodiments, the processing module is specifically used for:
For any a line in the network topology, by the product of first attribute on the side and the multiplier with
This while the sum of second attribute be determined as this while weight.
In some embodiments, the processing module is also used to:
The routing table from source node to destination node is generated according to the first path.
In some embodiments, the memory module is also used to store routing table；
The processing module is also used to indicate that the memory module updates the routing table, and the routing table is for routing institute
State the message between source node and the destination node.
In some embodiments, first attribute is any one in cost, time delay, delay variation and packet loss；
Second attribute is any one in cost, time delay, delay variation and packet loss.
Present invention also provides a kind of computer readable storage medium, the computer-readable recording medium storage has above-mentioned
Any shortest path determines computer software instructions used in the function of any one design of method, when described instruction is calculating
When running on machine, determine that computer used in any one function of designing of method is soft for executing any of the above-described shortest path
Part instruction.
The embodiment of the present application also provides a kind of computer program products comprising instruction, when it runs on computers
When, so that computer executes shortest path described in above-mentioned various aspects and determines method.
Detailed description of the invention
Fig. 1 is a kind of schematic diagram of a scenario suitable for the embodiment of the present application；
Fig. 2 is that a kind of shortest path provided by the embodiments of the present application determines method flow schematic diagram；
Fig. 3 is a kind of path computing schematic diagram provided by the embodiments of the present application；
Fig. 4 is a kind of network topology structure schematic diagram provided by the embodiments of the present application；
Fig. 5 is that a kind of shortest path provided by the embodiments of the present application determines method flow schematic diagram；
Fig. 6 is a kind of controller architecture schematic diagram provided by the embodiments of the present application；
Fig. 7 is a kind of controller architecture schematic diagram provided by the embodiments of the present application.
Specific embodiment
The application is described in further detail below in conjunction with attached drawing.
The embodiment of the present application can be applied to various mobile communication system, such as: global system for mobile telecommunications (Global
System of Mobile communication, GSM) system, CDMA (Code Division Multiple
Access, CDMA) system, wideband code division multiple access (Wideband Code Division Multiple Access, WCDMA) system
System, General Packet Radio Service (General Packet Radio Service, GPRS), long term evolution (Long Term
Evolution, LTE) it is system, advanced long term evolution (Advanced long term evolution, LTE-A) system, logical
With mobile communication system (Universal Mobile Telecommunication System, UMTS), the long term evolution of evolution
(evolved Long Term Evolution, eLTE) system, 5G system (such as new wireless (New Radio, NR) system) etc.
Other mobile communication system.
It executes shortest path provided by the embodiments of the present application and determines that the executing subject of method can set for SDN controller etc.
It is standby.As shown in Figure 1, for a kind of schematic diagram of a scenario suitable for the embodiment of the present application.SDN controller is received in real time by southbound interface
Collect bottom-layer network topology network topological information, network topological information include but is not limited to the number of nodes for including in network, number of edges,
The information such as the adjacent node of the cost and time delay of each edge, each node.When the northbound interface of SDN controller is received by user
When the decentralization service request that the equipment such as equipment are sent, SDN controller meets constraint condition for the source node of business, destination node calculating
Shortest path.SDN controller generates converting route according to shortest path, and the forwarding of bottom is handed down to by southbound interface
Device.Underlying device can send destination node from source node for business packet.
In conjunction with foregoing description, as shown in Fig. 2, being that a kind of shortest path provided by the embodiments of the present application determines that method flow shows
It is intended to.In Fig. 2, executing subject can be the equipment such as SDN controller, for convenience of description, be described below in SDN controller be to hold
Row main body is described.
Referring to fig. 2, this method comprises:
Step 201: determining determining most based on Lagrangian Relaxation Algorithm from source node to destination node in network topology
The corresponding multiplier of short path；
Step 202: the weight of each edge in the network topology is determined according to the multiplier, and according to the power of each edge
K paths are determined again.
Wherein, the K paths are in the network topology from the source node to path in the path of the destination node
Weight K paths from small to large, K is the positive integer greater than 1；The weight in the path is the weight on all sides in the path
Sum.
Step 203: by the K paths first attribute in path and be less than or equal to preset threshold, and path
Second attribute and the smallest path is determined as first path, and the first path is in the network topology from source node to place
The shortest path of node.
Wherein, first attribute is an attribute of link corresponding to side in the network topology, and the second attribute is
Another attribute different from the first attribute of link corresponding to side in the network topology；The sum of first attribute in path is
The sum of first attribute on all sides in the path, the sum of second attribute in path are second attribute on all sides in the path
With.
Before step 201, SDN controller can obtain the network topological information of bottom-layer network topology from southbound interface, from
And determine whole network topology.Network topological information includes the information such as the connection relationship in network topology between each node.Its
In, southbound interface is to be supplied to the interface that other producers or operator are accessed and managed, i.e., downward interface.
SDN controller, can be according in business request information after the business request information for receiving user equipment transmission
Source node identification determine source node, the information such as destination node determined according to destination node information, while may be used also in business request information
To include constraint condition, SDN controller can be based on the determining shortest path for meeting the constraint condition of constraint condition.
In step 201, SDN controller is based on Lagrange relaxation (Lagrange Relaxation based
Aggregated Cost, LARAC) algorithm determines that shortest path from source node to destination node is the path for meeting constraint condition,
The constraint condition can for path the first attribute and be less than or equal to preset threshold.In the embodiment of the present application, base is determined
Determine that the process of shortest path can be such that in Lagrangian Relaxation Algorithm
Step 1: using dijkstra's algorithm calculate network topology in source node into the path of destination node path second
Attribute and the smallest path P 1, if the first attribute of path P 1 is less than or equal to preset threshold with d (P1), it is determined that road
Diameter P1 is the shortest path determined based on LARAC algorithm, exports result and terminates entire algorithm, otherwise goes to Step 2.
Wherein, first attribute can be any one in cost, time delay, delay variation and packet loss, described the
Two attributes can be any one in cost, time delay, delay variation and packet loss.For example, when the first attribute can be
Prolong, the second attribute can be cost.
In the embodiment of the present application, cost refers to that data packet reaches connecing in network topology from the sending node in network topology
Receive expense required when node.For example, it may be referring to that data packet reaches in network topology from the sending node in network topology
Required expense or energy consumption when receiving node can also indicate that and refer to that data packet reaches network from the sending node in network topology
The distance of the link passed through when receiving node in topology.
Time delay refers to that data packet after the sending node transmission in network topology, by transmission, reaches network and opens up
The time it takes when receiving node in flutterring.Time delay is referred to as being delayed or being delayed (transmission) time etc..Delay variation is
The variation for referring to time delay, can reflect the variation degree of time delay.
Packet loss refers in the data packet for the receiving node being sent in network topology from the sending node in network topology,
The quantity of the data packet of loss accounts for the ratio of the total quantity of transmitted data packet.
Step 2: using dijkstra's algorithm calculate network topology in source node into the path of destination node path first
Attribute and the smallest path P 2, if the first attribute of path P 2 is greater than preset threshold with d (P2), it is determined that do not meet
Shortest path of the sum less than or equal to preset threshold for meeting first attribute in path, otherwise goes to Step 3.
Step 3: multiplier is calculated according to path P 1 and path P 2, and is updated according to calculated multiplier using formula (1)
The weight of each edge in whole network topology.
Wherein formula (1) are as follows:
cλi=ci+λ×di······(1)
In formula (1), cλiFor the weight on i-th side, ciFor first attribute on i-th side, diSecond for i-th side belongs to
Property, λ is multiplier.
Wherein, calculated multiplier λ meets formula (2):
In formula (2), c (P2) is the sum of the second attribute of path P 2, and c (P1) is the sum of the second attribute of path P 1.
Step 4: the path P 3 of the minimal weight of source node s to destination node t is calculated using dijkstra's algorithm.
Step 5: if the weight d of path P 3λ(P3) it is equal to the weight d of path P 2λ(P2), it is determined that path P 2 is from source
Node exports result and terminates entire algorithm, otherwise use 3 replacement path P2 of path P, and go to the shortest path of destination node
Step 3。
It should be noted that the shortest path determined based on LARAC algorithm may not be from source node to destination node
The shortest path of essence, the embodiment of the present application, can be to bases in order to determine the substantive shortest path from source node to destination node
It is optimized in the shortest path that LARAC algorithm determines, so that the shortest path of the essence from source node to destination node is obtained, it is excellent
The process of change is described below, and details are not described herein.
In conjunction with the process of front, in the embodiment of the present application, multiplier is iterative value during algorithm iteration, is a change
Amount, but after determining shortest path based on LARAC algorithm, the corresponding multiplier of shortest path determined based on LARAC algorithm is
One fixed value is to determine multiplier corresponding when shortest path in the last one iterative process of LARAC algorithm.
It is by multiplier λ that two constrained parameters (the first attribute and the second attribute) in network topology are poly- in the above method
Constrained parameters: weight are combined into, so as to realize that there are the networks of multiple constrained parameters using dijkstra's algorithm solution
The problem of shortest path of topology.However in the above method, it only considered a constrained parameters, i.e. first attribute in path
Be less than or equal to preset threshold, so calculated shortest path may not be optimal.
In some embodiments, SDN controller is based on after LARAC algorithm determines shortest path, it can be determined that whether
Meet preset condition: judging whether the node density of the network topology is greater than or equal to default node density, and judges institute
Whether the mean difference coefficient for stating the shortest path determined based on LARAC algorithm is less than or equal to default coefficient of variation.
If it is determined that the node density of the network topology is greater than or equal to default node density, and it is based on described in determination
The mean difference coefficient for the shortest path that LARAC algorithm determines is less than or equal to default coefficient of variation, then continues to execute step 201
Otherwise the shortest path determined based on LARAC algorithm can be directly determined as in the network topology from source by the step of below
Node to destination node shortest path.
Specifically, SDN controller can execute following steps, determine whether to meet preset condition:
Step 301:SDN controller determines the node density of the network topology；
SDN controller can determine the node density of the network topology according to the following formula:
Av (D)=| E | × 2/ | V | (3)
Wherein, av (D) is the node density of the network topology, and E is number of edges included by the network topology, and V is institute
State number of nodes included by network topology.
Step 302:SDN controller judges whether the node density is greater than or equal to default node density, if so, turning
To step 303, step 306 is otherwise gone to；
In the embodiment of the present application, the value of default node density is not limited, and specific value can be close to opens up in network
It whether there is the critical value on multiple heavy sides between the node flutterred, node density default in this way can be used to judge in network topology
Node between whether there is multiple heavy sides.It, can be with specifically, if the node density of network topology is less than default node density
Determine that there is no multiple heavy sides between the node in network topology, thus may determine that the shortest path determined based on LARAC algorithm
Diameter is optimal path.
If the node density of network topology is greater than or equal to default node density, the node in network topology can be determined
Between there may be it is multiple it is heavy while (when specifically whether certainly existing multiple heavy can in conjunction with path mean difference coefficient determine),
Thus may determine that the shortest path determined based on LARAC algorithm is not necessarily optimal, it may be necessary to be determined to based on LARAC algorithm
Shortest path optimize.
Step 303:SDN controller determines the mean difference coefficient of the shortest path determined based on LARAC algorithm；
SDN controller can determine the mean difference of the shortest path determined based on LARAC algorithm according to the following formula
Different coefficient:
Wherein, av (CV) is the mean difference coefficient of the shortest path determined based on LARAC algorithm,
CViThe difference of weight side right weight between the corresponding adjacent two nodes in i-th side of the shortest path determined based on LARAC algorithm
Different coefficient, SiThe weight side right between the corresponding adjacent two nodes in i-th side in the shortest path determined based on LARAC algorithm
The standard deviation of weight,The weight between the corresponding adjacent two nodes in i-th side of the shortest path determined based on LARAC algorithm
The average value of side right weight, n are the positive integer more than or equal to 1, and n is that the shortest path determined based on LARAC algorithm includes
Number of edges.
It should be noted that each edge corresponds to adjacent two nodes, but there may be a plurality of between the adjacent two nodes
Side, these are when being properly termed as weight, every corresponding first attribute in weight side and second attribute.In the embodiment of the present application,
Weight when every weight of i-th of shortest path determined based on LARAC algorithm between corresponding adjacent two nodes is really
It is identical with the determination method of the weight of each edge in network topology to determine method, specifically, determining for based on LARAC algorithm
I-th of shortest path any one weight between corresponding adjacent two nodes while, can be by first attribute on the heavy side
With the product of the multiplier and this it is heavy while the sum of the second attribute be determined as this it is heavy while weight.It can finally determine i-th
The average value of the standard deviation of weight side right weight and weight side right weight between the corresponding adjacent two nodes in side, so that it is determined that i-th side pair out
The coefficient of variation of weight side right weight between the adjacent two nodes answered.
For example, include between the corresponding adjacent two nodes in i-th side of the shortest path determined based on LARAC algorithm
4 weight sides, corresponding first attribute and the second attribute are respectively as follows: (2,2), (1,6), (2,1), (5,1).In its bracket
One parameter is the first attribute, and second parameter is the second attribute.If multiplier is 3, the weight on every weight side respectively is:
8,9,7,16.The average value branch of the standard deviation of weight side right weight and weight side right weight between the corresponding adjacent two nodes in i-th side
Are as follows: 3.53,10, it may finally determine that the coefficient of variation of weight side right weight between the corresponding adjacent two nodes in i-th side is
0.353。
Step 304:SDN controller judges that the mean difference coefficient of the shortest path determined based on LARAC algorithm is
It is no otherwise to go to step 306 if so, going to step 305 less than or equal to default coefficient of variation；
Mean difference coefficient is the mean difference reacted between the weight on every weight side and the average value of weight side right weight.It is average
Coefficient of variation is bigger, shows that the difference degree between the weight on every weight side and the average value of weight side right weight is bigger；Mean difference
Coefficient is smaller, shows that the difference degree between the weight on every weight side and the average value of weight side right weight is smaller.
When mean difference coefficient is more than default coefficient of variation, it is believed that the difference degree on every weight side is very big, often
Item weight while can regard as one it is independent while, therefore can substantially be considered as between node there are the network topology on multiple heavy sides
The network topology on multiple heavy sides is not present between node.The default specific value of coefficient of variation can be close to multiple heavy in will be present
While network topology be substantially considered as there is no it is multiple heavy while network topology critical value.
In the embodiment of the present application, how default coefficient of variation specifically determines that the embodiment of the present application does not limit this.It is default
Coefficient of variation can be between the node in network topology by judging in conjunction with default node density and default coefficient of variation
It is no that there is essentially multiple heavy sides.Specifically, when the node density of network topology is greater than or equal to default node density, if road
The mean difference coefficient of diameter is less than or equal to default coefficient of variation, then can determine and substantially deposit between the node in network topology
On multiple heavy sides, thus may determine that the shortest path determined based on LARAC algorithm is not necessarily optimal, need to based on LARAC
The shortest path that algorithm determines optimizes.
When the node density of network topology is greater than or equal to default node density, if the mean difference coefficient in path is greater than
Network topology, then can be considered as that there is no the network topologies on multiple heavy sides by default coefficient of variation, thus may determine that being based on
The shortest path that LARAC algorithm determines is optimal path.
Step 305: according to the judging result of step 304, determining that there are multiple between the node in current network topology
Weight side, thus by the shortest path based on the determination of LARAC algorithm that LARAC algorithm is determined be not it is optimal, need to being based on
The shortest path that LARAC algorithm determines optimizes.
Step 306: the routing table from source node to destination node is generated according to the shortest path determined based on LARAC algorithm.
By the above process, determining that the node density is less than or equal to default node density and described based on LARAC
When the mean difference coefficient for the shortest path that algorithm determines is greater than default coefficient of variation, it can determine in current network topology
Multiple heavy sides are not present between node, therefore the shortest path determined based on LARAC algorithm is optimal path, so as to straight
The routing table according to the shortest path generation determined based on LARAC algorithm from source node to destination node is connect, to improve determination
Source node to shortest path between destination node efficiency.Correspondingly, can be determined current when determination is unsatisfactory for preset condition
There are multiple heavy sides between two nodes in network topology, therefore simultaneously based on the goodness of the determining shortest path of LARAC algorithm
It is not high, it is not able to satisfy practical application, needs to optimize.
In step 202, for any a line in the network topology, first attribute on the side can be multiplied with described
The product of son and this while the sum of the second attribute be determined as this while weight, i.e. the weight on i-th in network topology side meets
Formula (1).
For example, as shown in figure 4, being a kind of network topology schematic diagram provided by the embodiments of the present application.In Fig. 4, network
Topology includes node A, B, C, D, E, F；Corresponding first attribute in the side that network topology includes and the second attribute be respectively as follows: (2,2),
(1,6),(3,3),(1,2),(2,1),(1,1),(5,1),(4,3).First parameter in its bracket is the first attribute, the
Two parameters are the second attribute.If multiplier is 3, the weight of each edge respectively is: 8,9,12,5,7,4,16,15.
Then, SDN controller can determine that K paths, shortest path first can be according to shortest path first
Dijkstra's algorithm, Yen algorithm, Eppstein algorithm etc., the embodiment of the present application does not limit this.
In step 203, SDN controller can by the K paths first attribute in path and be less than or equal to pre-
If threshold value, and second attribute in path and the smallest path be determined as first path, thus using the first path as institute
It states in network topology from source node to the shortest path of destination node.That is, being different from the prior art determining LARAC algorithm most
Shortest path of the short path as source node to destination node, use in the embodiment of the present invention meet the first path of the condition as
For source node to the shortest path of destination node, SDN controller can be according to first path generation from source node to destination node
Routing table, the routing table are used to route the message between the source node and the destination node.
Wherein, preset threshold is the user equipment for requesting SDN controller to determine the shortest path from source node to destination node,
It is arranged according to itself actual network demand.For example, the first attribute is time delay, user equipment A needs a time delay lower
Shortest path, user equipment A can set preset threshold to a lesser value, such as be set as 1, at this time user equipment A
The preset threshold of setting can be notified into SDN controller, SDN controller is so as to determining a time delay for user equipment A
Shortest path less than or equal to 1.Certain preset threshold may be the reality of a default value or SDN controller according to network
The setting of border situation.
The value of preset threshold can do further limitation to K paths, realize that the sum of the first attribute of passage path is
It is no to be less than or equal to preset threshold, K paths are screened, thus further according to second attribute in path and determine the
One path.Preset threshold is bigger, first attribute in the path filtered out from K paths and bigger, so that it is determined that go out
It is first attribute of first path and bigger；Conversely, preset threshold is smaller, the first of the path filtered out from K paths
Attribute and just it is smaller, so that it is determined that go out first path the first attribute and just it is smaller.
It should be noted that preset threshold can be no longer superfluous herein determines according to actual conditions in the embodiment of the present application
It states.
According to method provided by the embodiments of the present application, in determining network topology from source node to the multiplier of destination node it
Afterwards, the weight of each edge in the network topology is determined according to the multiplier, and K paths are determined according to the weight of each edge
The smallest path of weight.Finally first path is determined from the K paths.In the embodiment of the present application, determine
One path is on the basis of meeting constraint condition of the sum of the first attribute in path less than or equal to preset threshold, it is contemplated that road
Second attribute of diameter and the smallest constraint condition, thus determine that first path better than only according to first attribute in path
With the path determined of constraint condition for being less than or equal to preset threshold, that is, the second attribute of the first path determined and ratio
It is second attribute of the shortest path determined based on LARAC algorithm and smaller, to realize acquisition preferably shortest path.
The process of front is described below by a specific embodiment.
As shown in figure 5, being that a kind of shortest path provided by the embodiments of the present application determines method flow schematic diagram.
In process shown in fig. 5, the first attribute is time delay, and the second attribute is cost.
Step 501:SDN controller gets the information such as source node, destination node, delay constraint condition.Wherein, delay constraint
Condition are as follows: in network topology source node to the path of destination node time delay and be less than or equal to preset threshold.
All paths of the step 502:SDN controller according to LARAC algorithm from network topology from source node to destination node
Middle determination meets the path of delay constraint condition, i.e., the shortest path determined based on LARAC algorithm, and determines and calculated based on LARAC
Multiplier corresponding to the shortest path that method determines.
The specific iterative process of LARAC algorithm can refer to the description of front, and details are not described herein.
Step 503:SDN controller determines the node density of the network topology and the mean difference system in second path
Number.
Step 504:SDN controller judges whether the node density is greater than or equal to default node density and described
Whether the mean difference coefficient in two paths is less than or equal to default coefficient of variation, if so, going to step 505, otherwise, will be based on
The shortest path that LARAC algorithm determines is determined as in the network topology from source node to the shortest path of destination node, and goes to
Step 508.
Step 505:SDN controller determines the weight of each edge in the network topology according to the multiplier, and according to
The weight of each edge determines K paths.
Step 506:SDN controller by the K paths time delay in path and be less than or equal to preset threshold, and road
The cost of diameter and the smallest path determines first path, and the first path is determined as in the network topology saving from source
It puts to the shortest path of destination node.
Step 507:SDN controller generates the routing table from source node to destination node according to the first path.
Step 508:SDN controller is generated according to the shortest path determined based on LARAC algorithm from source node to destination node
Routing table.
Based on the same technical idea, the embodiment of the present application also provides a kind of controller.
As shown in fig. 6, the embodiment of the present application provides a kind of controller architecture schematic diagram.The controller can execute Fig. 2 institute
The process shown.
Referring to Fig. 6, which includes: receiving module 601, processing module 602, memory module 603.
Receiving module 601, for receiving source node identification and destination node information；The source node identification indicates that source is saved
Point, the destination node information indicate destination node；
Memory module 603 is used for the storage network topological information, and the network topological information includes network topology structure
And in the network topology structure each edge the first attribute and the second attribute, first attribute be the network topology in
One attribute of link corresponding to side, the second attribute be in the network topology link corresponding to side with the first attribute not
Same another attribute；
Processing module 602, for determine in network topology from source node to destination node based on Lagrange relaxation LARAC
The corresponding multiplier of shortest path that algorithm determines；The weight of each edge in the network topology is determined according to the multiplier, and
Determine that K paths, the K paths are in the network topology from the source node to the Su Jie according to the weight of each edge
The K paths of the weight in path from small to large in the path of point, K are the positive integer greater than 1；The weight in the path is the path
In all sides weight sum；By in the K paths first attribute in path and be less than or equal to preset threshold, and path
The second attribute and the smallest path be determined as first path, the first path be in the network topology from source node to
The shortest path of destination node, wherein the sum of first attribute in path for first attribute on all sides in the path sum, path
The sum of second attribute for second attribute on all sides in the path sum.
It should be understood that the division of the above modules is only a kind of division of logic function, it in actual implementation can be whole
Or be partially integrated on a physical entity, it can also be physically separate.
Other content can also be performed in above-mentioned receiving module 601, processing module 602 and memory module 603, specifically can be with
With reference to the description in step 201 to step 203, details are not described herein.
Based on the same technical idea, the embodiment of the present application also provides a kind of controller.
As shown in fig. 7, the embodiment of the present application provides a kind of controller architecture schematic diagram.The controller can execute Fig. 2 institute
The process shown.
Referring to Fig. 7, which includes: processor 701, memory 702, input/output interface 703.
Processor 701 can be general processor, digital signal processor (Digital Signal Processor,
DSP), specific integrated circuit (Application Specific Integrated Circuit, ASIC), ready-made programmable gate
Array (Field-Programmable Gate Array, FPGA) either other programmable logic device, discrete gate or crystalline substance
Body pipe logical device, discrete hardware components.
Memory 702 may include read-only memory and random access memory, and instruction sum number can be provided to processor 701
According to.The a part of of memory 702 can also include nonvolatile RAM (Non-Volatile Random
Access Memory, NVRAM).
The various components of controller 700 are coupled by bus system 704, and it includes number that wherein bus system 704, which is removed,
It can also include power bus, control bus and status signal bus in addition etc. except bus.But for the sake of clear explanation,
Various buses are all designated as bus system 704 in figure.
Input/output interface 703, for receiving source node identification and destination node information；The source node identification instruction
Source node out, the destination node information indicate destination node；
Memory 702, is used for the storage network topological information, the network topological information include network topology structure with
And in the network topology structure each edge the first attribute and the second attribute, first attribute be the network topology in side
One attribute of corresponding link, the second attribute are the different from the first attribute of link corresponding to side in the network topology
Another attribute；
Processor 701, for determining calculating based on Lagrange relaxation LARAC from source node to destination node in network topology
The corresponding multiplier of shortest path that method determines；The weight of each edge in the network topology, and root are determined according to the multiplier
Determine that K paths, the K paths are in the network topology from the source node to the destination node according to the weight of each edge
Path in path weight K paths from small to large, K is the positive integer greater than 1；The weight in the path is in the path
The sum of the weight on all sides；By in the K paths first attribute in path and be less than or equal to preset threshold, and path
Second attribute and the smallest path is determined as first path, and the first path is in the network topology from source node to place
The shortest path of node, wherein the sum of first attribute in path for first attribute on all sides in the path sum, the of path
The sum of two attributes for second attribute on all sides in the path sum.
In some embodiments, the processor 701 is also used to:
Determination meets following preset condition:
The node density of the network topology is greater than or equal to default node density, and described based on the LARAC algorithm
The mean difference coefficient of determining shortest path is less than or equal to default coefficient of variation.
In some embodiments, the node density of the network topology meets following formula:
Av (D)=| E | × 2/ | V |
Wherein, av (D) is the node density of the network topology, and E is number of edges included by the network topology, V
For number of nodes included by the network topology.
In some embodiments, the mean difference coefficient in second path meets following formula:
Wherein, av (CV) is the mean difference coefficient in second path,CViFor second path
The coefficient of variation of weight side right weight, S between the corresponding adjacent two nodes in i-th sideiIt is corresponding for i-th side in second path
The standard deviation of weight side right weight between adjacent two nodes,Between the corresponding adjacent two nodes in i-th side in second path
The average value of weight side right weight, n are the positive integer more than or equal to 1, and n is the number of edges that second path includes.
In some embodiments, the processor 701 is specifically used for:
For any a line in the network topology, by the product of first attribute on the side and the multiplier with
This while the sum of second attribute be determined as this while weight.
In some embodiments, the processor 701 is also used to:
The routing table from source node to destination node is generated according to the first path.
In some embodiments, the memory 702 is also used to store routing table；
The processor 701 is also used to indicate that the memory 702 updates the routing table, and the routing table is for routing
Message between the source node and the destination node.
In some embodiments, first attribute is any one in cost, time delay, delay variation and packet loss；
Second attribute is any one in cost, time delay, delay variation and packet loss.
The embodiment of the present application also provides a kind of computer readable storage mediums, execute above-mentioned processor institute for being stored as
The computer software instructions that need to be executed, it includes the programs for execution needed for executing above-mentioned processor.
It should be understood by those skilled in the art that, embodiments herein can provide as method, system or computer program
Product.Therefore, complete hardware embodiment, complete software embodiment or reality combining software and hardware aspects can be used in the application
Apply the form of example.Moreover, it wherein includes the computer of computer usable program code that the application, which can be used in one or more,
The shape for the computer program product implemented in usable storage medium (including but not limited to magnetic disk storage, optical memory etc.)
Formula.
The application be referring to according to the present processes, equipment (system) and computer program product flow chart and/or
Block diagram describes.It should be understood that each process that can be realized by computer program instructions in flowchart and/or the block diagram and/or
The combination of process and/or box in box and flowchart and/or the block diagram.It can provide these computer program instructions to arrive
General purpose computer, special purpose computer, Embedded Processor or other programmable data processing devices processor to generate one
Machine, so that being generated by the instruction that computer or the processor of other programmable data processing devices execute for realizing flowing
The device for the function of being specified in journey figure one process or multiple processes and/or block diagrams one box or multiple boxes.
These computer program instructions, which may also be stored in, is able to guide computer or other programmable data processing devices with spy
Determine in the computer-readable memory that mode works, so that it includes referring to that instruction stored in the computer readable memory, which generates,
Enable the manufacture of device, the command device realize in one box of one or more flows of the flowchart and/or block diagram or
The function of being specified in multiple boxes.
These computer program instructions also can be loaded onto a computer or other programmable data processing device, so that counting
Series of operation steps are executed on calculation machine or other programmable devices to generate computer implemented processing, thus in computer or
The instruction executed on other programmable devices is provided for realizing in one or more flows of the flowchart and/or block diagram one
The step of function of being specified in a box or multiple boxes.
The above is only the section Example of the application, the application protection scope is without being limited thereto.
Claims (17)
1. a kind of shortest path determines method, which is characterized in that the described method includes:
Determine the shortest path pair determined based on Lagrange relaxation LARAC algorithm in network topology from source node to destination node
The multiplier answered；
The weight of each edge in the network topology is determined according to the multiplier, and K road is determined according to the weight of each edge
Diameter, the K paths are weight in the network topology from the source node to path in the path of the destination node from small
To big K paths, K is the positive integer greater than 1；The weight in the path is the sum of the weight on all sides in the path；
By in the K paths first attribute in path and be less than or equal to preset threshold, and the sum of second attribute in path
The smallest path is determined as first path, and the first path is in the network topology from the source node to the destination node
Shortest path, wherein first attribute is an attribute of link corresponding to side in the network topology, described second
Attribute is another attribute different from the first attribute of link corresponding to side in the network topology；First attribute in path
Sum be the sum of first attribute on all sides in the path, the sum of second attribute in path belongs to for second of all sides in the path
The sum of property.
2. the method according to claim 1, wherein determining every in the network topology according to the multiplier
Before the weight on side, further includes:
Determination meets following preset condition:
The node density of the network topology is greater than or equal to default node density, and described determining based on the LARAC algorithm
The mean difference coefficient of shortest path be less than or equal to default coefficient of variation.
3. according to the method described in claim 2, it is characterized in that, the node density of the network topology meets following public affairs
Formula:
Av (D)=| E | × 2/ | V |
Wherein, av (D) is the node density of the network topology, and E is number of edges included by the network topology, and V is institute
State number of nodes included by network topology.
4. according to the method in claim 2 or 3, which is characterized in that the shortest path determined based on the LARAC algorithm
The mean difference coefficient of diameter meets following formula:
Wherein, av (CV) is the mean difference coefficient of the shortest path determined based on the LARAC algorithm,
CViThe weight side right weight between the corresponding adjacent two nodes in i-th side of the shortest path determined based on the LARAC algorithm
Coefficient of variation, SiFor it is described based on the LARAC algorithm determine shortest path in the corresponding adjacent two nodes in i-th side it
Between weight side right weight standard deviation,I-th side for the shortest path determined based on the LARAC algorithm is corresponding adjacent
The average value of weight side right weight between two nodes, n are the positive integer more than or equal to 1, and n is described true based on the LARAC algorithm
The number of edges that fixed shortest path includes.
5. method according to any one of claims 1 to 4, which is characterized in that determine the network topology according to the multiplier
In each edge weight, comprising:
For any a line in the network topology, by this while first attribute and the multiplier product and this while
The sum of second attribute be determined as the weight on the side.
6. method according to any one of claims 1 to 5, which is characterized in that further include:
It is generated according to the first path from the source node to the routing table of the destination node.
7. method according to any one of claims 1 to 6, which is characterized in that first attribute is cost, time delay, time delay
Shake and any one in packet loss；
Second attribute be cost, time delay, delay variation and packet loss in any one and it is different from first attribute.
8. a kind of controller characterized by comprising
Receiving module, for receiving source node identification and destination node information；The source node identification indicates source node, described
Destination node information indicates destination node；
Memory module is used for the storage network topological information, and the network topological information includes network topology structure and institute
The first attribute and the second attribute of each edge in network topology structure are stated, first attribute is right for side in the network topology
One attribute of the link answered, second attribute are the different from the first attribute of link corresponding to side in the network topology
Another attribute；
Processing module, it is true based on Lagrange relaxation LARAC algorithm from source node to destination node in network topology for determining
The corresponding multiplier of fixed shortest path；The weight of each edge in the network topology is determined according to the multiplier, and according to every
The weight on side determines that K paths, the K paths are in the network topology from the source node to the road of the destination node
The K paths of the weight in path from small to large in diameter, K are the positive integer greater than 1；The weight in the path is to own in the path
The sum of the weight on side；By in the K paths first attribute in path and be less than or equal to preset threshold, and the second of path
Attribute and the smallest path is determined as first path, and the first path is in the network topology from source node to destination node
Shortest path, wherein the sum of first attribute in path for first attribute on all sides in the path sum, path second belong to
The sum of property for second attribute on all sides in the path sum.
9. controller according to claim 8, which is characterized in that the processing module is also used to:
Determination meets following preset condition:
The node density of the network topology is greater than or equal to default node density, and described determining based on the LARAC algorithm
The mean difference coefficient of shortest path be less than or equal to default coefficient of variation.
10. controller according to claim 9, which is characterized in that the node density of the network topology meet with
Lower formula:
Av (D)=| E | × 2/ | V |
Wherein, av (D) is the node density of the network topology, and E is number of edges included by the network topology, and V is institute
State number of nodes included by network topology.
11. controller according to claim 9, which is characterized in that the mean difference coefficient in second path meet with
Lower formula:
Wherein, av (CV) is the mean difference coefficient in second path,CViIt is i-th of second path
The coefficient of variation of weight side right weight, S between the corresponding adjacent two nodes in sideiIt is corresponding adjacent for i-th side in second path
The standard deviation of weight side right weight between two nodes,For i-th of second path between corresponding adjacent two nodes when weight
The average value of weight, n are the positive integer more than or equal to 1, and n is the number of edges that second path includes.
12. according to any controller of claim 8 to 11, which is characterized in that the processing module is specifically used for:
For any a line in the network topology, by this while first attribute and the multiplier product and this while
The sum of second attribute be determined as the weight on the side.
13. according to any controller of claim 8 to 12, which is characterized in that the processing module is also used to:
The routing table from source node to destination node is generated according to the first path.
14. controller according to claim 13, which is characterized in that the memory module is also used to store routing table；
The processing module is also used to indicate that the memory module updates the routing table, and the routing table is for routing the source
Message between node and the destination node.
15. according to any controller of claim 8 to 14, which is characterized in that first attribute be cost, time delay,
Any one in delay variation and packet loss；
Second attribute is any one in cost, time delay, delay variation and packet loss.
16. a kind of computer readable storage medium, including computer-readable instruction, when computer is read and executes the computer
When readable instruction, so that computer executes the method as described in claim 1-7 any one.
17. a kind of computer program product, including computer-readable instruction, when computer is read and is executed described computer-readable
Instruction, so that computer executes the method as described in claim 1-7 any one.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710571119.8A CN109257287B (en) | 2017-07-13 | 2017-07-13 | Shortest path determining method and controller |
| PCT/CN2018/095702 WO2019011338A1 (en) | 2017-07-13 | 2018-07-13 | Method for determining shortest path and controller |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710571119.8A CN109257287B (en) | 2017-07-13 | 2017-07-13 | Shortest path determining method and controller |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109257287A true CN109257287A (en) | 2019-01-22 |
| CN109257287B CN109257287B (en) | 2020-08-25 |
Family
ID=65001535
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710571119.8A Active CN109257287B (en) | 2017-07-13 | 2017-07-13 | Shortest path determining method and controller |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN109257287B (en) |
| WO (1) | WO2019011338A1 (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110390421A (en) * | 2019-06-12 | 2019-10-29 | 北京交通大学 | Congestion subway line passenger flow control method for coordinating based on time-space network |
| CN112261690A (en) * | 2020-10-10 | 2021-01-22 | 北京航空航天大学 | Satellite network constrained multipath routing setting method, electronic device and storage medium |
| CN112966122A (en) * | 2021-03-03 | 2021-06-15 | 平安科技（深圳）有限公司 | Corpus intention identification method and device, storage medium and computer equipment |
| WO2021136542A1 (en) * | 2020-01-03 | 2021-07-08 | 烽火通信科技股份有限公司 | Path calculation method and system |
| CN113098766A (en) * | 2021-04-07 | 2021-07-09 | 北京字跳网络技术有限公司 | Communication method and device |
| CN114640622A (en) * | 2022-03-22 | 2022-06-17 | 中国电信股份有限公司 | Method and device for determining data transmission path and software defined network controller |
| WO2022268101A1 (en) * | 2021-06-25 | 2022-12-29 | 华为技术有限公司 | Topological structure determination method, apparatus, device, and system |
| CN115865783A (en) * | 2022-11-22 | 2023-03-28 | 中国联合网络通信集团有限公司 | Method and device for determining target node and computer readable storage medium |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112769696B (en) * | 2019-11-06 | 2023-09-26 | 中兴通讯股份有限公司 | Routing method, network controller, system and storage medium |
| CN111917645A (en) * | 2020-08-20 | 2020-11-10 | 深圳多拉多通信技术有限公司 | SDN-based path optimization method and system for mobile network |
| CN112231142B (en) * | 2020-09-22 | 2024-04-05 | 南方电网调峰调频发电有限公司信息通信分公司 | System backup recovery method, device, computer equipment and storage medium |
| CN113347083B (en) * | 2021-05-31 | 2022-09-23 | 北京字跳网络技术有限公司 | Network path determination and switching method, device, equipment, medium and program product |
| CN113923099B (en) * | 2021-09-03 | 2022-12-27 | 华为技术有限公司 | Root cause positioning method for communication network fault and related equipment |
| CN113965973A (en) * | 2021-10-21 | 2022-01-21 | 中国电力科学研究院有限公司 | Heterogeneous network wireless communication technology selection method, system, device and storage medium |
| CN115827185B (en) * | 2022-10-31 | 2023-12-01 | ***数智科技有限公司 | Method, storage medium and equipment for combining 6G air base station with Beidou air obstacle avoidance |
| CN116016199B (en) * | 2023-02-21 | 2023-06-09 | 山东海量信息技术研究院 | Information control method, system, electronic equipment and readable storage medium |
| CN116886591B (en) * | 2023-09-06 | 2023-12-15 | 芯来智融半导体科技(上海)有限公司 | Computer network system and routing method |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104168191A (en) * | 2014-08-31 | 2014-11-26 | 西安电子科技大学 | Routing method for meeting multiple constrained parameter conditions in large-scale software-defined network |
| US20150188837A1 (en) * | 2013-12-26 | 2015-07-02 | Futurewei Technologies, Inc. | Hierarchical Software-Defined Network Traffic Engineering Controller |
| CN105897575A (en) * | 2016-06-03 | 2016-08-24 | 中国电子科技集团公司第三十研究所 | Path computing method based on multi-constrained path computing strategy under SDN |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7020086B2 (en) * | 2000-07-03 | 2006-03-28 | Telefonaktiebolaget Lm Ericsson (Publ) | Lagrange quality of service routing |
| CN101753425B (en) * | 2008-12-01 | 2011-11-09 | 北京航空航天大学 | Heuristic method for working out a plurality of shortest simple routes in network under multiple constraints |
-
2017
- 2017-07-13 CN CN201710571119.8A patent/CN109257287B/en active Active
-
2018
- 2018-07-13 WO PCT/CN2018/095702 patent/WO2019011338A1/en active Application Filing
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150188837A1 (en) * | 2013-12-26 | 2015-07-02 | Futurewei Technologies, Inc. | Hierarchical Software-Defined Network Traffic Engineering Controller |
| CN104168191A (en) * | 2014-08-31 | 2014-11-26 | 西安电子科技大学 | Routing method for meeting multiple constrained parameter conditions in large-scale software-defined network |
| CN105897575A (en) * | 2016-06-03 | 2016-08-24 | 中国电子科技集团公司第三十研究所 | Path computing method based on multi-constrained path computing strategy under SDN |
Non-Patent Citations (1)
| Title |
|---|
| 龚文娟: "软件定义网络中面向服务的负载均衡机制", 《中国优秀硕士学位论文全文数据库信息科技辑（月刊 ）2017 年 第 03 期》 * |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110390421A (en) * | 2019-06-12 | 2019-10-29 | 北京交通大学 | Congestion subway line passenger flow control method for coordinating based on time-space network |
| CN110390421B (en) * | 2019-06-12 | 2022-05-10 | 北京交通大学 | Space-time network-based method for coordinating and controlling passenger flow of congested subway line |
| WO2021136542A1 (en) * | 2020-01-03 | 2021-07-08 | 烽火通信科技股份有限公司 | Path calculation method and system |
| CN112261690A (en) * | 2020-10-10 | 2021-01-22 | 北京航空航天大学 | Satellite network constrained multipath routing setting method, electronic device and storage medium |
| CN112966122A (en) * | 2021-03-03 | 2021-06-15 | 平安科技（深圳）有限公司 | Corpus intention identification method and device, storage medium and computer equipment |
| CN113098766A (en) * | 2021-04-07 | 2021-07-09 | 北京字跳网络技术有限公司 | Communication method and device |
| WO2022268101A1 (en) * | 2021-06-25 | 2022-12-29 | 华为技术有限公司 | Topological structure determination method, apparatus, device, and system |
| CN114640622A (en) * | 2022-03-22 | 2022-06-17 | 中国电信股份有限公司 | Method and device for determining data transmission path and software defined network controller |
| CN114640622B (en) * | 2022-03-22 | 2023-07-18 | 中国电信股份有限公司 | Method and device for determining data transmission path and software-defined network controller |
| CN115865783A (en) * | 2022-11-22 | 2023-03-28 | 中国联合网络通信集团有限公司 | Method and device for determining target node and computer readable storage medium |
| CN115865783B (en) * | 2022-11-22 | 2024-04-09 | 中国联合网络通信集团有限公司 | Method and device for determining target node and computer readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2019011338A1 (en) | 2019-01-17 |
| CN109257287B (en) | 2020-08-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109257287A (en) | A kind of shortest path determines method and controller | |
| US10657106B2 (en) | Method, computing device, and distributed file system for placement of file blocks within a distributed file system | |
| EP3090517B1 (en) | Inter-domain sdn traffic engineering | |
| CN107094115B (en) | Ant colony optimization load balancing routing algorithm based on SDN | |
| WO2020119648A1 (en) | Computing task unloading algorithm based on cost optimization | |
| US10009254B2 (en) | Calculation of a lowest cost path | |
| CN108475207A (en) | The joint auto zoom of cloud application | |
| Kim et al. | Ant colony based self-adaptive energy saving routing for energy efficient Internet | |
| US10250484B2 (en) | Network service computation system | |
| CN112350949B (en) | Rerouting congestion control method and system based on flow scheduling in software defined network | |
| CN101841487A (en) | Configuration method for aggregating link service flow and packet switching device | |
| WO2019210946A1 (en) | Management device for slice management in a network, method and computer program for managing network slices | |
| CN103746852A (en) | Service routing configuration method and network management equipment | |
| Lin et al. | Scheduling for time-constrained big-file transfer over multiple paths in cloud computing | |
| EP3565194A1 (en) | Method and device for forwarding data | |
| CN106105282B (en) | The system and method for carrying out traffic engineering using link buffer zone state | |
| Hu et al. | Software-defined congestion control algorithm for IP networks | |
| Yu et al. | Deterministic service function chaining over beyond 5g edge fabric | |
| Yu et al. | Robust resource provisioning in time-varying edge networks | |
| CN107295038A (en) | A kind of method and device for setting up interface group | |
| CN105610712B (en) | The method for reducing whole network data stream forward delay based on software defined network framework | |
| Eramo et al. | Joint use of adaptive link rate and virtual router migration techniques to reduce the power consumption in telecommunication networks | |
| CN107070792A (en) | A kind of route selection method based on SDN | |
| CN117880178A (en) | Multi-transmission path determining method, device, equipment and medium | |
| CN102142972B (en) | Networking method and networking device of IP (internet protocol) 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 |