WO2019011338A1 - Procédé de détermination du plus court chemin et dispositif de commande - Google Patents

Procédé de détermination du plus court chemin et dispositif de commande Download PDF

Info

Publication number
WO2019011338A1
WO2019011338A1 PCT/CN2018/095702 CN2018095702W WO2019011338A1 WO 2019011338 A1 WO2019011338 A1 WO 2019011338A1 CN 2018095702 W CN2018095702 W CN 2018095702W WO 2019011338 A1 WO2019011338 A1 WO 2019011338A1
Authority
WO
WIPO (PCT)
Prior art keywords
path
network topology
attribute
edge
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.)
Ceased
Application number
PCT/CN2018/095702
Other languages
English (en)
Chinese (zh)
Inventor
黄荣锋
盛镇醴
李翰林
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Publication of WO2019011338A1 publication Critical patent/WO2019011338A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

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

Definitions

  • the present application relates to the field of communications technologies, and in particular, to a shortest path determining method and a controller.
  • SDN Software Defined Networking
  • the path set of each node in the network may be determined first, and the path set of each node includes The path from the source node to the node is determined based on the path set of each node, and the service path from the source node to the sink node is determined, and then the service data between the source node and the sink node is forwarded according to the service path.
  • the source node refers to a node that serves as a source to send service data
  • the sink node refers to a node that acts as a sink to receive service data.
  • the factors generally considered are relatively simple. For example, only factors such as cost or delay are considered to obtain a quality of service (Quality of Service, QoS) path, so that the calculated shortest path may not be the optimal path.
  • QoS Quality of Service
  • the advantage of the determined shortest path is not High, can not meet the actual application, so how to obtain a better shortest path is an urgent problem to be solved.
  • the present application provides a shortest path determination method and controller for solving the problem of how to determine a shortest path between a source node and a sink node.
  • An embodiment of the present application provides a shortest path determining method, where the method includes:
  • the multiplier corresponding to the shortest path determined by the Lagrangian relaxation algorithm is a fixed value, which is pulling In the last iteration of the Grande relaxation algorithm, the multiplier corresponding to the shortest path is determined.
  • the K paths are K paths whose weights in the path from the source node to the sink node in the network topology are small to large, and K is a positive integer greater than 1; the weight of the path The sum of the weights of all the edges in the path.
  • the threshold is a user equipment that requests the SDN controller to determine the shortest path from the source node to the sink node, and is set according to its actual network requirement.
  • the preset threshold may also be a default value, or the SDN controller may be based on the actual situation of the network. Settings.
  • the first attribute is an attribute of a link corresponding to the edge in the network topology
  • the second attribute is another attribute of the link corresponding to the edge in the network topology different from the first attribute.
  • the sum of the first attribute of the path is the sum of the first attributes of all edges in the path
  • the sum of the second attributes of the path is the sum of the second attributes of all sides in the path.
  • the weight of each edge in the network topology according to the multiplier, and according to each The weight of the edge determines the path with the least weight of the K paths. Finally, the first shortest path is determined from the K paths.
  • the determined first path is based on the constraint that the first attribute of the path is less than or equal to the preset threshold, and the minimum constraint condition of the second attribute of the path is considered, so The first path is better than the path determined only according to the constraint of the first attribute of the path and less than or equal to the preset threshold, that is, the determined second attribute of the first path is determined by the LARAC algorithm.
  • the sum of the second attributes of the shortest path is smaller, thereby achieving a better shortest path.
  • the method before determining the weight of each edge in the network topology according to the multiplier, the method further includes:
  • the node density of the network topology is greater than or equal to a preset node density, and the average difference coefficient of the shortest path determined based on the LALAC algorithm is less than or equal to a preset difference coefficient.
  • the shortest path determined by the LALAC algorithm is not an optimal path, so that the first shortest path can be determined according to the multiplier corresponding to the shortest path determined by the LALAC algorithm, thereby improving the accuracy of determining the shortest path between the source node and the sink node. Sex.
  • determining the shortest path determined based on the LALAC algorithm as a source node in the network topology The shortest path to the sink node.
  • the average difference coefficient of the shortest path determined based on the LALAC algorithm satisfies the following formula:
  • av(D) is the node density of the network topology
  • E is the number of edges included in the network topology
  • V is the number of nodes included in the network topology.
  • the preset node density is specifically determined, which is not limited by the embodiment of the present application.
  • the preset node density may be used to determine whether there are multiple heavy edges between nodes in the network topology, thereby determining the minimum determined based on the LARAC algorithm. Whether the path is optimal.
  • the average difference coefficient of the second path satisfies the following formula:
  • av(CV) is the average difference coefficient of the shortest path determined by the LALAC algorithm
  • the CV i is a difference coefficient of the weight of the heavy edge between the adjacent two nodes corresponding to the i-th edge of the shortest path determined by the LALAC algorithm
  • S i is the shortest path determined by the LARAC algorithm
  • n is a positive integer greater than or equal to 1
  • n is the based on the LARAC
  • the shortest path determined by the algorithm includes the number of edges.
  • the preset difference coefficient is specifically determined.
  • the embodiment of the present application is not limited to this.
  • the preset node density and the preset difference coefficient may be used to determine whether there are multiple heavy edges between nodes in the network topology, thereby determining the basis. Whether the shortest path determined by the LALAC algorithm is optimal.
  • determining a weight of each edge in the network topology based on the multiplier includes:
  • the sum of the product of the first attribute of the edge and the multiplier and the second attribute of the edge is determined as the weight of the edge.
  • the method further includes:
  • the first attribute is any one of a cost, a delay, a delay jitter, and a packet loss rate
  • the second attribute is any one of a cost, a delay, a delay jitter, and a packet loss rate.
  • the cost is a fee or distance or energy consumption.
  • the cost refers to the overhead required when the data packet arrives from the sending node in the network topology to the receiving node in the network topology.
  • it may refer to the cost or energy consumption of the data packet from the sending node in the network topology to the receiving node in the network topology, and may also indicate that the data packet arrives at the receiving node in the network topology from the sending node in the network topology. The distance of the link that passes through.
  • Delay is the time it takes for a packet to travel through a channel and then reach a receiving node in the network topology after it is sent from the transmitting node in the network topology.
  • Delay jitter refers to the change in delay and can reflect the degree of change in delay.
  • the packet loss rate refers to the ratio of the number of lost data packets to the total number of transmitted data packets in the data packets sent from the sending node in the network topology to the receiving node in the network topology.
  • An embodiment of the present application provides a controller, including:
  • a receiving module configured to receive source node information and sink node information; the source node information indicates a source node, and the sink node information indicates a sink node;
  • a storage module configured to use the storage network topology information, where the network topology information includes a network topology and a first attribute and a second attribute of each edge in the network topology, where the first attribute is the network topology An attribute of the link corresponding to the middle side, where the second attribute is another attribute of the link corresponding to the edge in the network topology that is different from the first attribute;
  • a processing module configured to determine a multiplier corresponding to a shortest path determined by a Lagrangian relaxed LALAC algorithm from a source node to a sink node in a network topology; determining, according to the multiplier, a weight of each edge in the network topology And determining K paths according to the weight of each edge, where the K paths are K paths whose weights in the path from the source node to the sink node in the network topology are small to large, K is a positive integer greater than 1; a weight of the path is a sum of weights of all edges in the path; a sum of first attributes of the paths in the K paths is less than or equal to a preset threshold, and a second attribute of the path And the smallest path is determined as a first path, the first path being a shortest path from the source node to the sink node in the network topology, wherein a sum of the first attributes of the path is a first attribute of all edges in the path And the sum of the second attribute of the path and the sum
  • the processing module is further configured to:
  • the node density of the network topology is greater than or equal to a preset node density, and the average difference coefficient of the shortest path determined based on the LALAC algorithm is less than or equal to a preset difference coefficient.
  • the node density of the network topology satisfies the following formula:
  • av(D) is the node density of the network topology
  • E is the number of edges included in the network topology
  • V is the number of nodes included in the network topology.
  • the average difference coefficient of the second path satisfies the following formula:
  • av(CV) is the average difference coefficient of the second path
  • CV i is a difference coefficient of the weight of the heavy edge between the adjacent two nodes corresponding to the i-th edge of the second path
  • S i is the weight between the adjacent two nodes corresponding to the i-th edge in the second path
  • n is a positive integer greater than or equal to 1
  • n is the number of edges included in the second path.
  • the processing module is specifically configured to:
  • the sum of the product of the first attribute of the edge and the multiplier and the second attribute of the edge is determined as the weight of the edge.
  • the processing module is further configured to:
  • the storage module is further configured to store a routing table
  • the processing module is further configured to instruct the storage module to update the routing table, where the routing table is used to route a message between the source node and the sink node.
  • the first attribute is any one of a cost, a delay, a delay jitter, and a packet loss rate
  • the second attribute is any one of a cost, a delay, a delay jitter, and a packet loss rate.
  • the present application also provides a computer readable storage medium storing computer software instructions for use in any of the designed functions of any of the shortest path determination methods described above, when the instructions are run on a computer Computer software instructions for performing any of the functions of any of the shortest path determination methods described above.
  • the embodiment of the present application also provides a computer program product comprising instructions which, when run on a computer, cause the computer to perform the shortest path determination method described in the above aspects.
  • FIG. 1 is a schematic diagram of a scenario applicable to an embodiment of the present application
  • FIG. 2 is a schematic flowchart of a method for determining a shortest path according to an embodiment of the present application
  • FIG. 3 is a schematic diagram of path calculation according to an embodiment of the present application.
  • FIG. 4 is a schematic diagram of a network topology structure according to an embodiment of the present application.
  • FIG. 5 is a schematic flowchart of a method for determining a shortest path according to an embodiment of the present application
  • FIG. 6 is a schematic structural diagram of a controller according to an embodiment of the present application.
  • FIG. 7 is a schematic structural diagram of a controller according to an embodiment of the present application.
  • GSM Global System of Mobile communication
  • CDMA Code Division Multiple Access
  • Wideband Code Division Multiple Access Wideband Code Division Multiple Access
  • Code Division Multiple Access WCDMA
  • GPRS General Packet Radio Service
  • LTE Long Term Evolution
  • LTE-A Advanced Long Term Evolution
  • UMTS Universal Mobile Telecommunication System
  • eLTE evolved Long Term Evolution
  • 5G New Radio
  • the execution subject of the shortest path determining method provided by the embodiment of the present application may be a device such as an SDN controller.
  • FIG. 1 it is a schematic diagram of a scenario applicable to an embodiment of the present application.
  • the SDN controller collects network topology information of the underlying network topology in real time through the southbound interface.
  • the network topology information includes but is not limited to the number of nodes included in the network, the number of edges, the cost and delay of each edge, and the nodes adjacent to each node. And other information.
  • the northbound interface of the SDN controller receives the downlink service request sent by the user equipment or the like, the SDN controller calculates the shortest path that satisfies the constraint condition for the source node and the sink node of the service.
  • the SDN controller generates a forwarding routing table according to the shortest path and sends it to the underlying transponder through the southbound interface.
  • the underlying device can send the service packet from the source node to the sink node.
  • the execution subject may be a device such as an SDN controller.
  • SDN controller is described as an execution subject in the following description.
  • the method includes:
  • Step 201 Determine a multiplier corresponding to the shortest path determined by the Lagrangian relaxation algorithm from the source node to the sink node in the network topology;
  • Step 202 Determine weights of each edge in the network topology according to the multiplier, and determine K paths according to weights of each edge.
  • the K paths are K paths whose weights in the path from the source node to the sink node in the network topology are small to large, and K is a positive integer greater than 1; the weight of the path The sum of the weights of all the edges in the path.
  • Step 203 Determine a path in which the sum of the first attributes of the paths in the K paths is less than or equal to a preset threshold, and the path of the second attribute of the path is the smallest path, where the first path is the network.
  • the first attribute is an attribute of a link corresponding to the edge in the network topology
  • the second attribute is another attribute of the link corresponding to the edge in the network topology different from the first attribute.
  • the sum of the first attribute of the path is the sum of the first attributes of all edges in the path
  • the sum of the second attributes of the path is the sum of the second attributes of all sides in the path.
  • the SDN controller can obtain network topology information of the underlying network topology from the southbound interface, thereby determining the entire network topology.
  • the network topology information includes information such as the connection relationship between each node in the network topology.
  • the southbound interface is an interface that provides access and management to other vendors or operators, that is, a downward interface.
  • the SDN controller may determine the source node according to the source node information in the service request message, determine the sink node and other information according to the information of the sink node, and the service request message may further include a constraint condition.
  • the SDN controller can determine the shortest path that satisfies the constraint based on the constraints.
  • the SDN controller determines, according to a Lagrangian Relaxation Based Aggregated Cost (LARAC) algorithm, that the shortest path from the source node to the sink node is a path that satisfies the constraint condition, and the constraint condition may be the first path.
  • LARAC Lagrangian Relaxation Based Aggregated Cost
  • the process of determining the shortest path based on the Lagrangian relaxation algorithm may be as follows:
  • Step 1 Using the Dijkstra algorithm to calculate the second attribute and the minimum path P1 of the path in the path from the source node to the sink node in the network topology, if the sum d(P1) of the first attribute of the path P1 is less than or equal to a preset threshold, Then it is determined that the path P1 is the shortest path determined based on the LALAC algorithm, and the result is output and the entire algorithm is ended, otherwise it is transferred to Step 2.
  • the first attribute may be any one of a cost, a delay, a delay jitter, and a packet loss rate
  • the second attribute may be any one of a cost, a delay, a delay jitter, and a packet loss rate.
  • the first attribute can be a time delay and the second attribute can be a cost.
  • the cost refers to the overhead required when the data packet arrives from the sending node in the network topology to the receiving node in the network topology.
  • it may refer to the cost or energy consumption of the data packet from the sending node in the network topology to the receiving node in the network topology, and may also indicate that the data packet arrives at the receiving node in the network topology from the sending node in the network topology. The distance of the link that passes through.
  • Delay is the time it takes for a packet to travel through a channel and then reach a receiving node in the network topology after it is sent from the transmitting node in the network topology.
  • the delay can also be referred to as delay or delay (transmission) time and the like.
  • Delay jitter refers to the change in delay and can reflect the degree of change in delay.
  • the packet loss rate refers to the ratio of the number of lost data packets to the total number of transmitted data packets in the data packets sent from the sending node in the network topology to the receiving node in the network topology.
  • Step 2 Calculate the first attribute and the minimum path P2 of the path in the path from the source node to the sink node in the network topology by using the Dijkstra algorithm, and determine if the sum d(P2) of the first attribute of the path P2 is greater than a preset threshold. There is no shortest path that meets the first attribute that satisfies the path and is less than or equal to the preset threshold, otherwise it goes to Step 3.
  • Step 3 Calculate the multiplier according to the path P1 and the path P2, and update the weight of each edge in the entire network topology by using the formula (1) according to the calculated multiplier.
  • c ⁇ i is the weight of the ith side
  • c i is the first attribute of the ith side
  • d i is the second attribute of the ith side
  • ⁇ is the multiplier
  • c(P2) is the sum of the second attribute of the path P2
  • c(P1) is the sum of the second attribute of the path P1.
  • Step 4 Calculate the path P3 of the minimum weight of the source node s to the sink node t using the Dijkstra algorithm.
  • Step 5 If the weight d ⁇ (P3) of the path P3 is equal to the weight d ⁇ (P2) of the path P2, determine that the path P2 is the shortest path from the source node to the sink node, output the result and end the entire algorithm, otherwise use the path P3 Replace path P2 and go to Step 3.
  • the shortest path determined by the LALAC algorithm may not be the shortest path from the source node to the sink node.
  • the embodiment of the present application will be based on LALAC.
  • the shortest path determined by the algorithm is optimized to obtain a substantial shortest path from the source node to the sink node. The process of optimization is described later and will not be described here.
  • the multiplier is an iterative value in the iterative process of the algorithm, which is a variable, but after determining the shortest path based on the LALAC algorithm, the multiplier corresponding to the shortest path determined by the LALAC algorithm is a The fixed value is the multiplier corresponding to the shortest path during the last iteration of the LARAC algorithm.
  • the two constraint parameters (the first attribute and the second attribute) in the network topology are aggregated into a constraint parameter by using the multiplier ⁇ : weight, so that the Dijkstra algorithm can be used to solve the network topology in which multiple constraint parameters exist.
  • the shortest path problem In the above method, only one constraint parameter is considered, that is, the sum of the first attributes of the path is less than or equal to a preset threshold, so the calculated shortest path may not be optimal.
  • the SDN controller determines the shortest path based on the LALAC algorithm, it may be determined whether the preset condition is met: determining whether the node density of the network topology is greater than or equal to a preset node density, and determining that the LALAC is based on Whether the average difference coefficient of the shortest path determined by the algorithm is less than or equal to the preset difference coefficient.
  • the shortest path determined based on the LALAC algorithm can be directly determined as the shortest path from the source node to the sink node in the network topology.
  • the SDN controller may perform the following steps to determine whether the preset condition is met:
  • Step 301 The SDN controller determines a node density of the network topology.
  • the SDN controller can determine the node density of the network topology according to the following formula:
  • av(D) is the node density of the network topology
  • E is the number of edges included in the network topology
  • V is the number of nodes included in the network topology.
  • Step 302 The SDN controller determines whether the node density is greater than or equal to the preset node density, and if so, then proceeds to step 303, otherwise proceeds to step 306;
  • the value of the preset node density is not limited, and the specific value may be close to whether there are multiple critical values of the heavy edge between the nodes in the network topology, so that the preset node density may be used to determine Whether there are multiple heavy edges between nodes in the network topology. Specifically, if the node density of the network topology is less than the preset node density, it may be determined that there are no multiple heavy edges between the nodes in the network topology, so that the shortest path determined by the LALAC algorithm may be determined to be the optimal path.
  • the node density of the network topology is greater than or equal to the preset node density, it may be determined that there may be multiple heavy edges between the nodes in the network topology (whether or not there are certain heavy edges that may be determined by the average difference coefficient of the combined paths), It can be determined that the shortest path determined based on the LALAC algorithm is not necessarily optimal, and the shortest path determined based on the LALAC algorithm may need to be optimized.
  • Step 303 The SDN controller determines an average difference coefficient of the shortest path determined by the LALAC algorithm.
  • the SDN controller may determine an average difference coefficient of the shortest path determined by the LALAC algorithm according to the following formula:
  • av(CV) is the average difference coefficient of the shortest path determined by the LALAC algorithm
  • the CV i is a difference coefficient of the weight of the heavy edge between the adjacent two nodes corresponding to the i-th edge of the shortest path determined by the LALAC algorithm
  • S i is the i-th edge corresponding to the shortest path determined by the LALAC algorithm
  • n is a positive integer greater than or equal to 1
  • n is the shortest determined by the LALAC algorithm The number of edges included in the path.
  • each edge corresponds to two adjacent nodes, but there may be multiple edges between the adjacent two nodes. These edges may be called heavy edges, and each heavy edge corresponds to a first attribute and a second edge. Attributes.
  • the method for determining the weight of each heavy edge between adjacent nodes corresponding to the i-th edge of the shortest path determined by the LALAC algorithm and the method for determining the weight of each edge in the network topology Similarly, specifically, for any one of the adjacent two nodes corresponding to the i-th edge of the shortest path determined by the LALAC algorithm, the product of the first attribute of the heavy side and the multiplier may be The sum of the second attributes of the heavy edges is determined as the weight of the heavy edge.
  • the standard deviation of the weights of the heavy edges and the average weights of the heavy edges between the adjacent two nodes corresponding to the i-th edge can be determined, thereby determining the difference of the weights of the heavy edges between the adjacent two nodes corresponding to the i-th edge. coefficient.
  • the adjacent two nodes corresponding to the i-th edge of the shortest path determined by the LALAC algorithm include four heavy edges, and the corresponding first attribute and second attribute are: (2, 2), (1 , 6), (2, 1), (5, 1).
  • the first parameter in parentheses is the first attribute
  • the second parameter is the second attribute.
  • the multiplier is 3, the weight of each heavy side is: 8, 9, 7, 16 respectively.
  • the standard deviation of the weights of the heavy edges and the average weights of the heavy edge weights between the adjacent two nodes corresponding to the i-th edge are: 3.53, 10, and finally the adjacent two nodes corresponding to the i-th edge can be determined.
  • the coefficient of variation between the weights of the heavy edges is 0.353.
  • Step 304 The SDN controller determines whether the average difference coefficient of the shortest path determined by the LALAC algorithm is less than or equal to the preset difference coefficient, and if yes, proceeds to step 305, otherwise proceeds to step 306;
  • the average difference coefficient is the average difference between the weight of each heavy edge and the average of the weight of the heavy edge.
  • the larger the mean difference coefficient the greater the difference between the weight of each heavy edge and the average of the heavy edge weights; the smaller the average difference coefficient, the difference between the weight of each heavy edge and the average of the heavy edge weights. The difference is less.
  • the average difference coefficient exceeds the preset difference coefficient, it can be considered that the degree of difference between each heavy side is very large, and each heavy side can be regarded as an independent side, so there are multiple heavy-edge network topologies between nodes, essentially It can be thought of as a network topology where there are no multiple heavy edges between nodes.
  • the specific value of the preset difference coefficient may be close to a critical value of a network topology in which a plurality of heavy edges exist substantially as a network topology in which no multiple heavy edges exist.
  • the preset difference coefficient is specifically determined, which is not limited by the embodiment of the present application.
  • the preset difference coefficient can determine whether there are substantially multiple heavy edges between nodes in the network topology by combining the preset node density and the preset difference coefficient. Specifically, when the node density of the network topology is greater than or equal to the preset node density, if the average difference coefficient of the path is less than or equal to the preset difference coefficient, it may be determined that there are substantially multiple heavy edges between the nodes in the network topology. Therefore, it can be determined that the shortest path determined based on the LALAC algorithm is not necessarily optimal, and the shortest path determined based on the LALAC algorithm needs to be optimized.
  • the network topology When the node density of the network topology is greater than or equal to the preset node density, if the average difference coefficient of the path is greater than the preset difference coefficient, the network topology can be regarded as a network topology without multiple heavy edges, so the LARAC algorithm can be determined.
  • the shortest path determined is the optimal path.
  • Step 305 According to the judgment result of step 304, it is determined that there are multiple heavy edges between the nodes in the current network topology, so the shortest path determined by the LALAC algorithm determined by the LALAC algorithm is not optimal, and needs to be determined based on the LALAC algorithm. The shortest path is optimized.
  • Step 306 Generate a routing table from the source node to the sink node according to the shortest path determined based on the LALAC algorithm.
  • the nodes in the current network topology may be determined. There is no multiple heavy edges, so the shortest path determined based on the LALAC algorithm is the optimal path, so that the routing table from the source node to the sink node can be directly generated according to the shortest path determined by the LALAC algorithm, thereby improving the determination of the source node to The efficiency of the shortest path between sink nodes.
  • the preset condition when it is determined that the preset condition is not met, it may be determined that there are multiple heavy edges between the two nodes in the current network topology, so the goodness of the shortest path determined by the LALAC algorithm is not high, and the actual application cannot be satisfied. Need to be optimized.
  • step 202 for any one of the network topologies, the sum of the product of the first attribute of the edge and the multiplier and the second attribute of the edge may be determined as the weight of the edge, that is, in the network topology.
  • the weight of the i-th edge satisfies the formula (1).
  • FIG. 4 it is a schematic diagram of a network topology provided by an embodiment of the present application.
  • the network topology includes nodes A, B, C, D, E, and F; the first attribute and the second attribute corresponding to the edge included in the network topology are: (2, 2), (1, 6), ( 3, 3), (1, 2), (2, 1), (1, 1), (5, 1), (4, 3).
  • the first parameter in parentheses is the first attribute, and the second parameter is the second attribute. If the multiplier is 3, the weights of each side are: 8, 9, 12, 5, 7, 4, 16, and 15, respectively.
  • the SDN controller may determine the K paths according to the shortest path algorithm, and the shortest path algorithm may be a Dijkstra algorithm, a Yen algorithm, an Eppstein algorithm, etc., which is not limited by the embodiment of the present application.
  • the SDN controller may determine that the sum of the first attributes of the paths in the K paths is less than or equal to a preset threshold, and the path with the smallest sum of the second attributes of the paths is determined as the first path, thereby
  • the first path acts as the shortest path from the source node to the sink node in the network topology. That is, unlike the shortest path determined by the LARAC algorithm in the prior art as the shortest path from the source node to the sink node, in the embodiment of the present invention, the first path that satisfies the condition is used as the shortest path from the source node to the sink node, SDN.
  • the controller may generate a routing table from the source node to the sink node according to the first path, where the routing table is used to route a message between the source node and the sink node.
  • the preset threshold is a user equipment that requests the SDN controller to determine the shortest path from the source node to the sink node, and is set according to its actual network requirement.
  • the first attribute is a delay
  • the user equipment A needs a shortest path with a low delay.
  • the user equipment A can set the preset threshold to a smaller value, for example, set to 1, and the user equipment A can
  • the preset threshold is set to notify the SDN controller, and the SDN controller can thus determine the shortest path for the user equipment A that the delay is less than or equal to 1.
  • the preset threshold can also be a default value, or the SDN controller can be set according to the actual situation of the network.
  • the value of the preset threshold may further restrict the K paths, and whether the sum of the first attributes of the path is less than or equal to a preset threshold, and the K paths are filtered, thereby further according to the sum of the second attributes of the path. Determine the first path.
  • the larger the preset threshold is the larger the sum of the first attributes of the paths selected from the K paths is, so that the sum of the first attributes of the determined first path is larger; otherwise, the smaller the preset threshold is.
  • the smaller the sum of the first attributes of the paths filtered from the K paths the smaller the sum of the first attributes of the determined first paths.
  • the preset threshold may be determined according to actual conditions, and details are not described herein again.
  • the weight of each edge in the network topology according to the multiplier, and according to the weight of each edge Determine the path with the least weight of the K paths. Finally, the first path is determined from the K paths.
  • the determined first path is based on the constraint that the first attribute of the path is less than or equal to the preset threshold, and the minimum constraint of the second attribute of the path is considered, Determining the first path is better than the path determined according to the constraint of the first attribute of the path and less than or equal to the preset threshold, that is, the determined sum of the second attributes of the first path is determined according to the LARAC algorithm.
  • the sum of the second attributes of the shortest path is smaller, thereby achieving a better shortest path.
  • FIG. 5 it is a schematic flowchart of a method for determining a shortest path according to an embodiment of the present application.
  • the first attribute is a delay and the second attribute is a cost.
  • Step 501 The SDN controller acquires information such as a source node, a sink node, and a delay constraint.
  • the delay constraint condition is that the sum of the delays of the path from the source node to the sink node in the network topology is less than or equal to a preset threshold.
  • Step 502 The SDN controller determines, according to the LALAC algorithm, a path that satisfies the delay constraint condition from all paths of the source node to the sink node in the network topology, that is, the shortest path determined based on the LALAC algorithm, and determines the shortest path determined by the LALAC algorithm. The corresponding multiplier.
  • Step 503 The SDN controller determines a node density of the network topology and an average difference coefficient of the second path.
  • Step 504 The SDN controller determines whether the node density is greater than or equal to a preset node density, and whether the average difference coefficient of the second path is less than or equal to a preset difference coefficient. If yes, go to step 505, otherwise, The shortest path determined based on the LALAC algorithm is determined to be the shortest path from the source node to the sink node in the network topology, and proceeds to step 508.
  • Step 505 The SDN controller determines a weight of each edge in the network topology according to the multiplier, and determines K paths according to the weight of each edge.
  • Step 506 The SDN controller determines a first path by using a sum of delays of the paths in the K paths that are less than or equal to a preset threshold, and a minimum of the cost of the path, and determines the first path as the The shortest path from the source node to the sink node in the network topology.
  • Step 507 The SDN controller generates a routing table from the source node to the sink node according to the first path.
  • Step 508 The SDN controller generates a routing table from the source node to the sink node according to the shortest path determined based on the LALAC algorithm.
  • the embodiment of the present application further provides a controller.
  • the embodiment of the present application provides a schematic structural diagram of a controller.
  • the controller can execute the flow shown in FIG. 2.
  • the controller 600 includes a receiving module 601, a processing module 602, and a storage module 603.
  • the receiving module 601 is configured to receive source node information and sink node information; the source node information indicates a source node, and the sink node information indicates a sink node;
  • the storage module 603 is configured to use the storage network topology information, where the network topology information includes a network topology and a first attribute and a second attribute of each edge in the network topology, where the first attribute is the network An attribute of the link corresponding to the edge in the topology, where the second attribute is another attribute of the link corresponding to the edge in the network topology that is different from the first attribute;
  • the processing module 602 is configured to determine a multiplier corresponding to the shortest path determined by the Lagrangian relaxed LALAC algorithm from the source node to the sink node in the network topology; and determine, according to the multiplier, each side of the network topology Weighting, and determining K paths according to the weight of each edge, the K paths being K paths with small to large weights of paths in the path from the source node to the sink node in the network topology, K a positive integer greater than 1; the weight of the path is the sum of the weights of all edges in the path; the sum of the first attributes of the paths in the K paths is less than or equal to a preset threshold, and the second attribute of the path And a minimum path determined as a first path, the first path being a shortest path from the source node to the sink node in the network topology, wherein a sum of the first attributes of the path is the first of all sides in the path The sum of the attributes, the sum of the second attributes of the path, and the sum of the second attributes of
  • the receiving module 601, the processing module 602, and the storage module 603 can also perform other content.
  • the receiving module 601, the processing module 602, and the storage module 603 can also perform other content.
  • details refer to the descriptions in steps 201 to 203, and details are not described herein.
  • the embodiment of the present application further provides a controller.
  • the embodiment of the present application provides a schematic structural diagram of a controller.
  • the controller can execute the flow shown in FIG. 2.
  • the controller 700 includes a processor 701, a memory 702, and an input/output interface 703.
  • the processor 701 can be a general-purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or the like. Programming logic devices, discrete gates or transistor logic devices, discrete hardware components.
  • DSP digital signal processor
  • ASIC application specific integrated circuit
  • FPGA field-programmable gate array
  • Memory 702 can include read only memory and random access memory and can provide instructions and data to processor 701. A portion of the memory 702 may also include a Non-Volatile Random Access Memory (NVRAM).
  • NVRAM Non-Volatile Random Access Memory
  • bus system 704 which may include, in addition to the data bus, a power bus, a control bus, a status signal bus, and the like. However, for clarity of description, various buses are labeled as bus system 704 in the figure.
  • An input/output interface 703, configured to receive source node information and sink node information; the source node information indicates a source node, and the sink node information indicates a sink node;
  • a memory 702 configured to: store the network topology information, where the network topology information includes a network topology and a first attribute and a second attribute of each edge in the network topology, where the first attribute is the network topology An attribute of the link corresponding to the middle side, where the second attribute is another attribute of the link corresponding to the edge in the network topology that is different from the first attribute;
  • the processor 701 is configured to determine a multiplier corresponding to the shortest path determined by the Lagrangian relaxed LALAC algorithm from the source node to the sink node in the network topology, and determine, according to the multiplier, each side of the network topology Weighting, and determining K paths according to the weight of each edge, the K paths being K paths with small to large weights of paths in the path from the source node to the sink node in the network topology, K a positive integer greater than 1; the weight of the path is the sum of the weights of all edges in the path; the sum of the first attributes of the paths in the K paths is less than or equal to a preset threshold, and the second attribute of the path And a minimum path determined as a first path, the first path being a shortest path from the source node to the sink node in the network topology, wherein a sum of the first attributes of the path is the first of all sides in the path The sum of the attributes, the sum of the second attributes of the path, and the sum of the second attributes of all
  • the processor 701 is further configured to:
  • the node density of the network topology is greater than or equal to a preset node density, and the average difference coefficient of the shortest path determined based on the LALAC algorithm is less than or equal to a preset difference coefficient.
  • the node density of the network topology satisfies the following formula:
  • av(D) is the node density of the network topology
  • E is the number of edges included in the network topology
  • V is the number of nodes included in the network topology.
  • the average difference coefficient of the second path satisfies the following formula:
  • av(CV) is the average difference coefficient of the second path
  • CV i is a difference coefficient of the weight of the heavy edge between the adjacent two nodes corresponding to the i-th edge of the second path
  • S i is the weight between the adjacent two nodes corresponding to the i-th edge in the second path
  • n is a positive integer greater than or equal to 1
  • n is the number of edges included in the second path.
  • the processor 701 is specifically configured to:
  • the sum of the product of the first attribute of the edge and the multiplier and the second attribute of the edge is determined as the weight of the edge.
  • the processor 701 is further configured to:
  • the memory 702 is further configured to store a routing table
  • the processor 701 is further configured to instruct the memory 702 to update the routing table, where the routing table is used to route a message between the source node and the sink node.
  • the first attribute is any one of a cost, a delay, a delay jitter, and a packet loss rate
  • the second attribute is any one of a cost, a delay, a delay jitter, and a packet loss rate.
  • the embodiment of the present application further provides a computer readable storage medium for storing computer software instructions required to execute the foregoing processor, which includes a program for executing the above-mentioned processor.
  • embodiments of the present application can be provided as a method, system, or computer program product.
  • the present application can take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment in combination of software and hardware.
  • the application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, optical storage, etc.) including computer usable program code.
  • the computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device.
  • the apparatus implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.
  • These computer program instructions can also be loaded onto a computer or other programmable data processing device such that a series of operational steps are performed on a computer or other programmable device to produce computer-implemented processing for execution on a computer or other programmable device.
  • the instructions provide steps for implementing the functions specified in one or more of the flow or in a block or blocks of a flow diagram.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Environmental & Geological Engineering (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

La présente invention concerne un procédé de détermination d'un plus court chemin et un dispositif de commande, le procédé consistant à : déterminer un multiplicateur correspondant à un chemin le plus court qui est déterminé sur la base d'un algorithme d'agrégation de coût basé sur la relaxation de Lagrange (LARAC) d'un nœud source vers un nœud récepteur à l'intérieur d'une topologie de réseau ; déterminer le poids de chaque côté dans la topologie de réseau selon le multiplicateur, et en fonction du poids de chaque côté, déterminer K chemins, les K chemins étant K chemins qui sont en séquence de la plus petite pondération de chemin à la plus grande pondération de chemin parmi les chemins allant du nœud source au nœud récepteur dans la topologie de réseau, et K étant un nombre entier positif supérieur à 1, le poids d'un chemin étant la somme des poids de tous les côtés dans le chemin ; la somme des premiers attributs des chemins parmi les K chemins étant amenée à être inférieure ou égale à un seuil prédéfini, un chemin ayant la plus petite somme de seconds attributs de chemin étant déterminé en tant que premier chemin, et le premier chemin servant de chemin le plus court du nœud source au nœud récepteur dans la topologie de réseau.
PCT/CN2018/095702 2017-07-13 2018-07-13 Procédé de détermination du plus court chemin et dispositif de commande Ceased WO2019011338A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710571119.8 2017-07-13
CN201710571119.8A CN109257287B (zh) 2017-07-13 2017-07-13 一种最短路径确定方法及控制器

Publications (1)

Publication Number Publication Date
WO2019011338A1 true WO2019011338A1 (fr) 2019-01-17

Family

ID=65001535

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/095702 Ceased WO2019011338A1 (fr) 2017-07-13 2018-07-13 Procédé de détermination du plus court chemin et dispositif de commande

Country Status (2)

Country Link
CN (1) CN109257287B (fr)
WO (1) WO2019011338A1 (fr)

Cited By (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111917645A (zh) * 2020-08-20 2020-11-10 深圳多拉多通信技术有限公司 基于sdn的机动网络的路径优化方法及系统
CN112231142A (zh) * 2020-09-22 2021-01-15 南方电网调峰调频发电有限公司信息通信分公司 系统备份恢复方法、装置、计算机设备和存储介质
CN112769696A (zh) * 2019-11-06 2021-05-07 中兴通讯股份有限公司 路由选择方法、网络控制器、系统和存储介质
CN113347083A (zh) * 2021-05-31 2021-09-03 北京字跳网络技术有限公司 网络路径确定及切换方法、装置、设备、介质及程序产品
CN113923099A (zh) * 2021-09-03 2022-01-11 华为技术有限公司 一种通信网络故障的根因定位方法及相关设备
CN113965973A (zh) * 2021-10-21 2022-01-21 中国电力科学研究院有限公司 异构网络无线通信技术选择方法、系统、设备及存储介质
CN113965474A (zh) * 2020-06-29 2022-01-21 中兴通讯股份有限公司 网络质量评估的方法、电子设备及存储介质
CN114640622A (zh) * 2022-03-22 2022-06-17 中国电信股份有限公司 数据传输路径的确定方法、装置及软件定义网络控制器
CN115766882A (zh) * 2022-10-19 2023-03-07 北京奇艺世纪科技有限公司 分布式回源数据的方法、装置、存储介质以及电子设备
CN115827185A (zh) * 2022-10-31 2023-03-21 中电信数智科技有限公司 6g空中基站结合北斗空中避障的方法、存储介质及设备
CN115842579A (zh) * 2021-09-18 2023-03-24 大唐移动通信设备有限公司 一种多任务路径确定方法、装置及网络设备
CN115865783A (zh) * 2022-11-22 2023-03-28 中国联合网络通信集团有限公司 目标节点的确定方法、装置及计算机可读存储介质
CN116016199A (zh) * 2023-02-21 2023-04-25 山东海量信息技术研究院 一种信息控制方法、系统、电子设备及可读存储介质
CN116886591A (zh) * 2023-09-06 2023-10-13 芯来智融半导体科技(上海)有限公司 片上网络的拓扑结构及路由方法
CN118233358A (zh) * 2022-12-13 2024-06-21 锐捷网络股份有限公司 一种确定路径的方法、装置及电子设备
CN118741637A (zh) * 2024-09-03 2024-10-01 上海景瑞阳实业有限公司 网络通信的路径筛选方法、装置、介质及终端
CN119402416A (zh) * 2024-10-22 2025-02-07 新华三技术有限公司 通信方法及装置

Families Citing this family (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110390421B (zh) * 2019-06-12 2022-05-10 北京交通大学 基于时空网络的拥堵地铁线路客流协调控制方法
CN111245720B (zh) * 2020-01-03 2021-10-26 烽火通信科技股份有限公司 一种路径计算方法及系统
CN112261690B (zh) * 2020-10-10 2022-04-01 北京航空航天大学 卫星网络约束多路径路由设定方法、电子设备及存储介质
CN112966122B (zh) * 2021-03-03 2024-05-10 平安科技（深圳）有限公司 语料意图识别方法、装置、存储介质及计算机设备
CN113098766A (zh) * 2021-04-07 2021-07-09 北京字跳网络技术有限公司 一种通信方法及装置
CN115529246A (zh) * 2021-06-25 2022-12-27 华为技术有限公司 拓扑结构的确定方法、装置、设备及系统
US12206571B2 (en) * 2023-04-12 2025-01-21 Eci Telecom Ltd. Spectral defragmentation in communication networks
CN116989812B (zh) * 2023-07-31 2026-01-23 上海有个机器人有限公司 路径规划方法、装置、计算机设备和存储介质
CN119494059B (zh) * 2025-01-17 2025-05-13 湖南省交通科学研究院有限公司 旅游公路的分级方法、装置、电子设备、存储介质及计算机程序产品
CN121026159A (zh) * 2025-10-31 2025-11-28 北自所(北京)科技发展股份有限公司 一种天轨系统的动态路径规划方法、系统

Citations (3)

* Cited by examiner, † Cited by third party
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
CN101753425A (zh) * 2008-12-01 2010-06-23 北京航空航天大学 在多约束下求取网络中多条最短简单路径的启发式方法
CN104168191A (zh) * 2014-08-31 2014-11-26 西安电子科技大学 大规模软件定义网络中满足多约束参数的路由方法

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10009287B2 (en) * 2013-12-26 2018-06-26 Huawei Technologies Co., Ltd. Hierarchical software-defined network traffic engineering controller
CN105897575A (zh) * 2016-06-03 2016-08-24 中国电子科技集团公司第三十研究所 一种sdn下基于多约束路径计算策略的路径计算方法

Patent Citations (3)

* Cited by examiner, † Cited by third party
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
CN101753425A (zh) * 2008-12-01 2010-06-23 北京航空航天大学 在多约束下求取网络中多条最短简单路径的启发式方法
CN104168191A (zh) * 2014-08-31 2014-11-26 西安电子科技大学 大规模软件定义网络中满足多约束参数的路由方法

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
EGILMEZ, H.E. ET AL.: "A Distributed QoS Routing Architecture for Scalable Video Streaming over Multi-Domain Openflow Networks", 2012 19TH IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, 15 March 2017 (2017-03-15), XP055567403 *
GONG, WENJUAN: "A Service- Oriented Load Balancing Mechanism for Software-Defined Networking", CHINA MASTER'S THESES FULL-TEXT DATABASE, 15 March 2017 (2017-03-15), pages 45 - 50, XP010852183 *

Cited By (25)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112769696A (zh) * 2019-11-06 2021-05-07 中兴通讯股份有限公司 路由选择方法、网络控制器、系统和存储介质
CN112769696B (zh) * 2019-11-06 2023-09-26 中兴通讯股份有限公司 路由选择方法、网络控制器、系统和存储介质
CN113965474A (zh) * 2020-06-29 2022-01-21 中兴通讯股份有限公司 网络质量评估的方法、电子设备及存储介质
CN111917645A (zh) * 2020-08-20 2020-11-10 深圳多拉多通信技术有限公司 基于sdn的机动网络的路径优化方法及系统
CN112231142A (zh) * 2020-09-22 2021-01-15 南方电网调峰调频发电有限公司信息通信分公司 系统备份恢复方法、装置、计算机设备和存储介质
CN112231142B (zh) * 2020-09-22 2024-04-05 南方电网调峰调频发电有限公司信息通信分公司 系统备份恢复方法、装置、计算机设备和存储介质
CN113347083A (zh) * 2021-05-31 2021-09-03 北京字跳网络技术有限公司 网络路径确定及切换方法、装置、设备、介质及程序产品
CN113347083B (zh) * 2021-05-31 2022-09-23 北京字跳网络技术有限公司 网络路径确定及切换方法、装置、设备、介质及程序产品
CN113923099A (zh) * 2021-09-03 2022-01-11 华为技术有限公司 一种通信网络故障的根因定位方法及相关设备
CN113923099B (zh) * 2021-09-03 2022-12-27 华为技术有限公司 一种通信网络故障的根因定位方法及相关设备
CN115842579A (zh) * 2021-09-18 2023-03-24 大唐移动通信设备有限公司 一种多任务路径确定方法、装置及网络设备
CN113965973A (zh) * 2021-10-21 2022-01-21 中国电力科学研究院有限公司 异构网络无线通信技术选择方法、系统、设备及存储介质
CN114640622A (zh) * 2022-03-22 2022-06-17 中国电信股份有限公司 数据传输路径的确定方法、装置及软件定义网络控制器
CN115766882A (zh) * 2022-10-19 2023-03-07 北京奇艺世纪科技有限公司 分布式回源数据的方法、装置、存储介质以及电子设备
CN115827185A (zh) * 2022-10-31 2023-03-21 中电信数智科技有限公司 6g空中基站结合北斗空中避障的方法、存储介质及设备
CN115827185B (zh) * 2022-10-31 2023-12-01 中电信数智科技有限公司 6g空中基站结合北斗空中避障的方法、存储介质及设备
CN115865783A (zh) * 2022-11-22 2023-03-28 中国联合网络通信集团有限公司 目标节点的确定方法、装置及计算机可读存储介质
CN115865783B (zh) * 2022-11-22 2024-04-09 中国联合网络通信集团有限公司 目标节点的确定方法、装置及计算机可读存储介质
CN118233358A (zh) * 2022-12-13 2024-06-21 锐捷网络股份有限公司 一种确定路径的方法、装置及电子设备
CN116016199A (zh) * 2023-02-21 2023-04-25 山东海量信息技术研究院 一种信息控制方法、系统、电子设备及可读存储介质
CN116016199B (zh) * 2023-02-21 2023-06-09 山东海量信息技术研究院 一种信息控制方法、系统、电子设备及可读存储介质
CN116886591B (zh) * 2023-09-06 2023-12-15 芯来智融半导体科技(上海)有限公司 计算机网络系统及路由方法
CN116886591A (zh) * 2023-09-06 2023-10-13 芯来智融半导体科技(上海)有限公司 片上网络的拓扑结构及路由方法
CN118741637A (zh) * 2024-09-03 2024-10-01 上海景瑞阳实业有限公司 网络通信的路径筛选方法、装置、介质及终端
CN119402416A (zh) * 2024-10-22 2025-02-07 新华三技术有限公司 通信方法及装置

Also Published As

Publication number Publication date
CN109257287A (zh) 2019-01-22
CN109257287B (zh) 2020-08-25

Similar Documents

Publication Publication Date Title
WO2019011338A1 (fr) Procédé de détermination du plus court chemin et dispositif de commande
CN107094115B (zh) 一种基于sdn的蚁群优化负载均衡路由算法
WO2020119648A1 (fr) Algorithme de déchargement de tâche informatique basé sur une optimisation des coûts
CN110958133B (zh) 网络切片映射方法、设备、服务器和存储介质
CN107666412A (zh) 服务功能链的虚拟网络功能部署方法
Lin et al. Three-tier capacity and traffic allocation for core, edges, and devices for mobile edge computing
JP5943431B2 (ja) ネットワーク、データ転送ノード、通信方法およびプログラム
US10764161B2 (en) Method for traffic engineering in communications network and controller
CN109617810B (zh) 数据传输方法及装置
CN103825823A (zh) 基于不同优先级的软件定义网络中数据转发方法
CN108476175B (zh) 使用对偶变量的传送sdn流量工程方法与系统
CN104937901A (zh) 用于面向内容的网络中提供路由和存储的流量工程的方法
US20200287820A1 (en) Method, apparatus and system for controlling routing information advertising
CN104270313B (zh) 一种网络链路利用率调节方法
CN105553855B (zh) 动态调整底层网络生成树拓扑结构的方法及系统
CN103685011A (zh) 一种确定节能路由的方法和装置
Huang et al. Admission control with flow aggregation for QoS provisioning in software-defined network
CN108347377B (zh) 数据转发方法及装置
CN106105282B (zh) 利用链路缓冲区状态进行流量工程的系统和方法
CN108366015B (zh) 用于软件定义网络的路由计算方法
US9722913B2 (en) System and method for delay management for traffic engineering
CN112448890B (zh) 一种路径确定方法、设备和存储介质
Sumathi et al. A survey on congestion control in wireless sensor networks
CN118828275B (zh) 一种数据传输方法、装置、设备、存储介质及产品
CN104753751A (zh) 一种动态确定虚拟网络的方法及系统

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18831309

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 18831309

Country of ref document: EP

Kind code of ref document: A1