WO2021008533A1 - 确定路径的方法和相关设备 - Google Patents
确定路径的方法和相关设备 Download PDFInfo
- Publication number
- WO2021008533A1 WO2021008533A1 PCT/CN2020/101947 CN2020101947W WO2021008533A1 WO 2021008533 A1 WO2021008533 A1 WO 2021008533A1 CN 2020101947 W CN2020101947 W CN 2020101947W WO 2021008533 A1 WO2021008533 A1 WO 2021008533A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- type
- node
- path
- nodes
- target
- Prior art date
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/02—Topology update or discovery
-
- 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
- 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
-
- 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/10—Active monitoring, e.g. heartbeat, ping or trace-route
-
- 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/121—Shortest path evaluation by minimising delays
-
- 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
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/34—Source routing
-
- 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/64—Routing or path finding of packets in data switching networks using an overlay routing layer
-
- 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/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
- H04L41/5003—Managing SLA; Interaction between SLA and QoS
- H04L41/5019—Ensuring fulfilment of SLA
Definitions
- This application relates to the field of communication technology, and more specifically, to a method for determining a path and related equipment.
- SR Segment Routing
- 5G Fifth Generation
- SR-MPLS Multi-Protocol Label Switching
- IPv6 Internet Protocol Version 6 (Internet Protocol Version).
- the present application provides a method and related equipment for determining a path, which can use the existing network topology to establish a new network topology, so as to reduce the difficulty of path calculation, thereby reducing the burden of managing equipment.
- an embodiment of the present application provides a method for determining a path, including: determining N 1 nodes of the first type from N nodes included in a first network topology, where the N nodes include the N 1 first nodes Class nodes and N 2 second-class nodes, the first-class nodes support Internet Protocol version 6 routing SRv6, N 1 is a positive integer greater than or equal to 2, and N 2 is a positive integer greater than or equal to 1.
- the second network topology includes the N 1 nodes of the first type but not the N 2 nodes of the second type
- the target topology includes M objects of the first type Path
- the i-th first-type target path among the M first-type target paths corresponds to the K i paths in the first network topology
- the source node and destination node of the K i paths correspond to the i- th path the same source node and destination node of the first category of the target path
- each path in the paths of the K i of the second type comprises at least one node
- M is a positive integer equal to or greater than 1
- i 1, ..., or M
- K i is a positive integer greater than or equal to 2
- determine the transmission cost of the M first-type target paths, and the transmission cost of the i-th first-type target path is the minimum transmission cost of the K i paths; Perform path calculation on the transmission overhead of the M first-type target paths and the second network topology.
- the above technical solution can use the existing network topology to establish a new network topology.
- the new network topology only includes some nodes in the original network topology, and these nodes all support SRv6. This can reduce the difficulty of path calculation, thereby reducing the burden of managing equipment.
- the first type of node is a node that supports SRv6 among the N nodes
- the second type of node is a node that does not support SRv6 among the N nodes
- the first type of node is a key node among the N nodes
- the second type of node is a non-key node among the N nodes.
- the above technical solution can remove nodes and/or non-critical nodes that do not support SRv6 in the original network topology to obtain a new network topology, and all nodes in the network topology support SRv6. In this way, even if there are nodes in the network that do not support SRv6, packets can be forwarded according to the path determined by the management device. Or, by ignoring non-critical nodes when calculating the path, the difficulty of path calculation can be reduced, thereby reducing the burden on the management device.
- the method further includes: acquiring the transmission overhead between two adjacent nodes in the first network topology; and determining M target paths of the first type the transmission overhead, comprising: the transmission overhead between two adjacent nodes of the K i of paths each path, to determine the K i overhead transmission paths for each path; paths determining the K i
- the minimum value of the transmission cost in is the transmission cost of the i-th target path of the first type.
- the determining the transmission cost of the M first-type target paths includes: measuring the transmission cost of the i-th first-type target path to obtain The transmission overhead of the i-th target path of the first type.
- the transmission overhead of the i-th target path of the first type can be directly obtained through measurement.
- the nodes in the path forward the measurement message according to the shortest path. Therefore, the resulting transmission overhead is the minimum transmission overhead. Therefore, by using the above technical solution, the minimum transmission overhead can be directly obtained, thereby reducing the workload of the management device.
- the measurement of the transmission cost of the i-th target path of the first type to obtain the transmission cost of the i-th target path of the first type includes : Send measurement information to the source node and/or destination node of the i-th target path of the first type; receive measurement feedback information from the source node and/or destination node of the i-th target path of the first type, the measurement The feedback information includes the transmission overhead of the i-th target path of the first type.
- the second network topology further includes P second type target paths, and each of the P second type target paths It is composed of two first-type nodes among the N 1 first-type nodes, and the first network topology includes the P second-type target paths.
- the transmission overhead includes transmission cost and/or transmission delay.
- an embodiment of the present application provides a management device, which includes a unit for implementing any possible implementation manner in the method design of the first aspect.
- the management device may be a computer device or a component (such as a chip, a circuit, etc.) used in a computer device.
- an embodiment of the present application provides a management device, including a transceiver and a processor.
- the management device further includes a memory.
- the processor is used to control the transceiver to send and receive signals
- the memory is used to store a computer program
- the processor is used to call and run the computer program from the memory, so that the management device executes any one of the above-mentioned method designs of the first aspect The method in the implementation mode.
- an embodiment of the present application provides an electronic device, which may be a management device used to implement the above-mentioned method design in the first aspect, or a chip provided in the management device.
- the electronic device includes a processor, which is coupled to a memory, and can be used to execute instructions and/or program codes in the memory to implement the method in any one of the possible implementation manners in the method design of the first aspect described above.
- the electronic device further includes a memory.
- the electronic device further includes a communication interface, and the processor is coupled with the communication interface.
- the communication interface may be a transceiver, or an input/output interface.
- the communication interface may be an input/output interface.
- the transceiver may be a transceiver circuit.
- the input/output interface may be an input/output circuit.
- embodiments of the present application provide a computer program product, the computer program product comprising: computer program code, when the computer program code runs on a computer, the computer executes any of the method designs of the first aspect above One possible implementation method.
- an embodiment of the present application provides a computer-readable medium, the computer-readable medium stores program code, and when the computer program code runs on a computer, the computer executes the method design of the first aspect above Any one of the possible implementation methods.
- Figure 1 is a schematic diagram of the network structure.
- Fig. 2 is a schematic flowchart of a method for determining a path according to an embodiment of the present application.
- FIG. 3 is a schematic diagram of the target topology structure corresponding to the network 100 determined by the management device.
- Fig. 4 is a schematic flowchart of a method for determining a path according to an embodiment of the present application.
- Fig. 5 is a schematic structural block diagram of a management device according to an embodiment of the present application.
- Fig. 6 is a schematic structural block diagram of a management device according to an embodiment of the present application.
- the subscript sometimes as W 1 may form a clerical error at non-target as W1, while not emphasize the difference, to express their meaning is the same.
- references described in this specification to "one embodiment” or “some embodiments”, etc. mean that one or more embodiments of the present application include a specific feature, structure, or characteristic described in combination with the embodiment. Therefore, the phrases “in one embodiment”, “in some embodiments”, “in some other embodiments”, “in some other embodiments”, etc. appearing in different places in this specification are not necessarily All refer to the same embodiment, but mean “one or more but not all embodiments” unless it is specifically emphasized otherwise.
- the terms “including”, “including”, “having” and their variations all mean “including but not limited to” unless otherwise specifically emphasized.
- At least one refers to one or more, and “multiple” refers to two or more.
- “And/or” describes the association relationship of the associated objects, indicating that there can be three relationships, for example, A and/or B, which can mean: A alone exists, A and B exist at the same time, and B exists alone, where A, B can be singular or plural.
- the character “/” generally indicates that the associated objects are in an "or” relationship.
- "The following at least one item (a)” or similar expressions refers to any combination of these items, including any combination of a single item (a) or plural items (a).
- at least one item (a) of a, b, or c can represent: a, b, c, ab, ac, bc, or abc, where a, b, and c can be single or multiple .
- FIG. 1 is a schematic diagram of the network structure.
- the network 100 shown in FIG. 1 includes 8 nodes, which are node 101, node 102, node 103, node 104, node 105, node 106, node 107, and node 108, respectively.
- the network 100 may be a complete network or a part of a complete network.
- the nodes in the network 100 as shown in FIG. 1 may also be referred to as network nodes.
- the node can be a workstation, server, terminal device, network device, etc. Each device can have its own different IPv6 address.
- two adjacent nodes in the network 100 may be connected through a wired medium or a wireless medium.
- the two adjacent nodes may not include intermediate devices, or may include one or more intermediate devices that do not perform Layer 3 forwarding of packets (that is, forwarding based on Internet Protocol (IP) addresses) (for example, some Switches, optical equipment, etc.).
- IP Internet Protocol
- the nodes in the network 100 can be divided into a first type of node and a second type of node.
- both the first type node and the second type node support SRv6.
- the first type of nodes are key nodes in the network 100
- the second type of nodes are non-key nodes in the network 100.
- the key node may be a boundary node of two networks.
- the network may include an access layer, an aggregation layer, a core layer, and so on. Key nodes can be boundary nodes of these layers.
- the key node may be an edge egress node of the network.
- the non-critical nodes may be other nodes besides the critical nodes.
- the first type of node is a node that supports SRv6
- the second type of node is a node that does not support SRv6.
- the first type of node may be a node that supports SRv6 and the first type of node is a key node in the network 100;
- the second type of node may be a node that does not support SRv6, or the second type of node may be a node that supports SRv6 and
- the second type of node network 100 is a non-critical node.
- the first type of nodes are nodes that support SRv6, and the second type of nodes are nodes that do not support SRv6.
- Figure 2 will describe the technical solution of the present application in detail in combination with the network structure shown in Figure 1.
- node 102 and node 106 are nodes that do not support SRv6
- node 101, node 103, node 104, node 105, node 107, and node 108 are nodes that support SRv6.
- FIG. 2 is only for helping those skilled in the art to better understand the technical solution of the present application, and is not limited to the limited embodiments of the technical solution of the present application.
- Fig. 2 is a schematic flowchart of a method for determining a path according to an embodiment of the present application.
- the method shown in Figure 2 can be executed by a management device in the network.
- the management device can be a general-purpose computer device, such as a notebook computer, a personal computer, etc., or it can be a dedicated network management device.
- the management device determines the topology of the network 100.
- the management device may establish Border Gateway Protocol-link state (Border Gateway Protocol-link state, BGP-LS) or Interior Gateway Protocol (Interior Gateway Protocol, IGP) neighbors with nodes in the network 100.
- BGP-LS Border Gateway Protocol-link state
- IGP Interior Gateway Protocol
- the nodes in the network 100 use BGP-LS or IGP to obtain the topology of the network 100, and send the obtained topology of the network 100 to the management device.
- the management device determines a first type of node from the nodes included in the network 100.
- the nodes in the network 100 can be divided into a first type of node and a second type of node.
- the first type of nodes are nodes that support SRv6, and the second type of nodes are nodes that do not support SRv6.
- the network 100 includes 6 first-type nodes (ie, node 101, node 103, node 104, node 105, node 107, and node 108) and 2 second-type nodes (ie, node 102 and node 106).
- the management device may determine the type of each node in the network 100 by itself. For example, the management device may obtain SRv6 indication information, where the SRv6 indication information is used to indicate whether each node in the network 100 supports SRv6. In this case, the management device may determine the first type of nodes included in the network 100 according to the SRv6 indication information.
- the management device may obtain the SRv6 indication information in the process of determining the topology of the network 100.
- the management device may obtain the topology information reported by each node in the network 100, and the topology information includes the SRv6 indication information.
- the management device may send SRv6 query information to each node in the network 100.
- a node in the network 100 After receiving the SRv6 query information, a node in the network 100 sends SRv6 query feedback information to the management device.
- the SRv6 query feedback information is used to indicate whether the node supports SRv6.
- the management device may determine the type of each node in the network 100 according to the manual annotation of the administrator. For example, the administrator of the management device can view the maintenance log of the network 100 or manually query the attribute information of each node in the network 100, determine whether each node in the network 100 supports SRv6, and save the determination result in the management device . In this case, the management device can determine the first type of node in the network 100 according to the stored determination result.
- the management device determines a target topology structure corresponding to the network 100.
- FIG. 3 is a schematic diagram of the target topology structure corresponding to the network 100 determined by the management device.
- the target topology 300 shown in FIG. 3 includes the first type of nodes in the network 100, but does not include the second type of network nodes in the network 100.
- the target topology 300 shown in FIG. 3 includes node 101, node 103, node 104, node 105, node 107, and node 108, but does not include node 102 and node 106.
- the management device can determine that the connection relationship between the two nodes in the network 100 is the same as the connection relationship in the target topology. For example, the connection relationship between node 101 and node 105, the connection relationship between node 103 and node 104, the connection relationship between node 104 and node 108, the connection relationship between node 103 and node 107, and the connection relationship between node 101 and node 105 in the target topology
- the structure 300 is the same as in the network 100.
- the path between two nodes with the same connection relationship in the network 100 and the connection relationship in the target topology can be referred to as the second type of target path.
- the path between node 101 and node 105, the path between node 103 and node 104, the path between node 104 and node 108, and the path between node 103 and node 107 are the second type of target path.
- the management device can determine that the two first-type nodes have a directly connected path in the target topology.
- the management device may also determine one or more paths in the network 100 corresponding to the path.
- the path between two nodes whose connection relationship in the network 100 is different from the connection relationship in the target topology may be referred to as a first-type target path.
- the path between node 101 and node 103, the path between node 101 and node 107, the path between node 105 and node 103, and node 105 and node 107 The path between is the first type of target path.
- the first type of target path between nodes 101 and 103 in the target topology 300 is referred to as the first type of target path 1
- the path between two adjacent nodes in the network 100 is referred to as Link
- the link between node 101 and node 102 is called link 12
- the path between node 102 and node 103 is called link 23, and so on.
- the node 101 can communicate with the node 103 through multiple paths.
- path 1 may include link 12 and link 23 paths;
- path 2 may include link 12, link 26, link 67, and link 73;
- path 3 may include link 15, link 56, and link 62 And link 23;
- path 4 may include link 15, link 56, link 67, and link 73. It can be seen that each path from path 1 to path 4 includes at least one second type node.
- Possible path 1, path 2, path 3, and path 4 can be referred to as paths corresponding to the first type of target path 1.
- the first-type target path 1 has four corresponding paths in the network 100, which are path 1, path 2, path 3, and path 4, respectively.
- the first-type target path between the node 101 and the node 107 also has multiple corresponding paths in the network 100, and the first-type target path between the node 105 and the node 107 is in the network 100.
- the target topology that can be determined by the management device includes four first-type target paths and five second-type target paths.
- the management device may determine the transmission cost of each first-type target path among the four first-type target paths.
- the transmission overhead is transmission delay. In other embodiments, the transmission overhead is the transmission cost. The transmission cost can also be called the cost of the link. In other embodiments, the transmission overhead may include transmission cost and transmission delay. In other embodiments, the transmission overhead may be a value determined according to the transmission cost and the transmission delay. For example, the transmission overhead can be determined according to Formula 1:
- Con represents the transmission cost
- C represents the transmission cost
- D represents the transmission delay
- ⁇ represents the weight coefficient corresponding to the transmission overhead
- ⁇ represents the weight coefficient corresponding to the transmission delay
- ⁇ and ⁇ are numbers greater than zero.
- the management device determines the transmission cost of the target path of the first type.
- the management device may obtain the transmission costs of two adjacent nodes of each of the four paths (that is, path 1 to path 4) corresponding to the first-type target path 1.
- the topology information acquired by the management device may include the transmission overhead of two adjacent nodes of the network 100.
- the management device can obtain the transmission cost between node 101 and node 102 (that is, the transmission cost of link 12), and the management device can also obtain the transmission cost between node 102 and node 103 (that is, the link Transmission overhead of route 23).
- the management device can determine that the transmission cost of path 1 (hereinafter referred to as transmission cost 1) is the sum of the transmission cost of link 12 and the transmission cost of link 23.
- the management device can determine the transmission overhead of path 2 (hereinafter referred to as transmission overhead 2), the transmission overhead of path 3 (hereinafter referred to as transmission overhead 3) and the transmission overhead of path 4 (hereinafter referred to as transmission overhead 4). After determining the transmission cost 1 to the transmission cost 4, the management device may determine that the transmission cost of the first type target path 1 is the minimum value of the transmission cost 1 to the transmission cost 4.
- the minimum value of the multiple transmission overheads may be the value of the transmission overhead with the smallest transmission delay among the multiple transmission overheads.
- the minimum value of the multiple transmission overheads may be the value of the transmission overhead with the smallest transmission cost among the multiple transmission overheads.
- the minimum value of the multiple transmission delays is the minimum value of the multiple transmission overheads; In the same situation, the minimum value of the transmission cost is the minimum value of the multiple transmission costs.
- the management device may measure the transmission cost of the first type target path 1 to obtain the transmission cost of the first type target path 1.
- the management device may send measurement information to the target node, where the measurement information is used to instruct the target node to perform delay measurement, where the target node may be node 101 and/or node 103.
- the target node can perform delay measurement.
- the target node can use the Network Quality Analyzer (NQA) technology, the Two-way Active Measurement Protocol (TWAMP), or the Internet Packet Detector (Packet Internet Groper, PING) technology to analyze the nodes 101
- NQA Network Quality Analyzer
- TWAMP Two-way Active Measurement Protocol
- PING Internet Packet Detector
- the target node can obtain the transmission delay of the first-type target path 1.
- the target node may send measurement feedback information to the management device, where the measurement feedback information includes the transmission overhead of the first-type target path 1.
- the target node may directly send the measured transmission delay as the transmission overhead to the management device.
- the target node may determine the transmission cost according to the transmission delay, and send the transmission delay and the transmission cost as the transmission overhead to the management device. For example, the target node may determine the transmission overhead corresponding to the measured transmission delay according to the preset correspondence between the transmission cost and the transmission delay. For another example, the target node may determine the transmission overhead corresponding to the measured transmission delay according to a preset formula.
- the target node may determine the transmission cost according to the transmission delay, and send the transmission cost as the transmission overhead to the management device.
- the management device can directly obtain the transmission overhead of the first-type target path 1.
- the transmission cost of the first type target path 1 is the minimum value of the transmission cost from node 101 to node 103.
- the management device can determine the transmission cost of the first type target path between node 101 and node 107 of the target topology 300, and the transmission cost of the first type target path between node 105 and node 107, node 105 and node 107 The transmission overhead of the first type target path between nodes 103.
- the method for determining the transmission cost of each of the five second-type target paths is the same as or similar to the method for determining the transmission cost of the first-type target path.
- the topology information acquired by the management device may include the transmission overhead of two adjacent nodes of the network 100. In this way, the management device can directly determine the transmission overhead of each target path of the second type.
- the management device may also determine the transmission cost of each of the five second-type target paths in the five second-type target paths by means of measurement.
- the specific measurement method is the same as the measurement method for measuring the transmission overhead of the first-type target path, and for the sake of brevity, it will not be repeated here.
- the management device may perform path calculation according to the target topology structure of the transmission costs of the four first-type target paths.
- the management device can determine whether the path reaches node 108 through node 103 or node 107 according to the four first-type target paths.
- the transmission overhead is the transmission delay. Assuming that the transmission delay from node 101 to node 103 is 2ms, the transmission cost from node 101 to node 107 is 3ms, the transmission cost from node 103 to node 104 is 2ms, the transmission cost from node 104 to node 108 is 1ms, and the transmission cost from node 107 to node The transmission overhead of 108 is 8ms.
- the management device can determine that the path from node 101 to node 108 passes through node 103 and node 104.
- Fig. 4 is a schematic flowchart of a method for determining a path according to an embodiment of the present application.
- the method shown in FIG. 4 may be implemented by a management device or a component (such as a chip, a circuit, etc.) in the management device.
- N 1 is a positive integer greater than or equal to 2
- N 2 is a positive integer greater than or equal to 1.
- the first network topology may be the network topology of the network 100 shown in FIG. 1.
- the node 101, the node 103, the node 104, the node 105, the node 107, and the node 108 in the network 100 may be the first type of nodes, and the node 102 and the node 106 may be the second type of nodes.
- the second network topology may be the target topology structure 300 as shown in FIG. 3.
- the target topology 300 includes node 101, node 103, node 104, node 105, node 107, and node 108.
- the first type of node is a node that supports SRv6 among the N nodes
- the second type of node is a node that does not support SRv6 among the N nodes; or, the first type of node is one of the N nodes
- the second type of node is a non-critical node among the N nodes.
- the method further includes: obtaining the transmission cost between two adjacent nodes in the first network topology; the determining the transmission cost of the M first-type target paths includes: according to the K i paths transmission overhead between two adjacent nodes of each path, determines a transmission overhead of the K i in the path of each path; determining a transmission minimum cost paths in the K i for the i-th first type The transmission overhead of the destination path.
- the determining the transmission cost of the M first-type target paths includes: measuring the transmission cost of the i-th first-type target path to obtain the transmission cost of the i-th first-type target path.
- the measurement of the transmission cost of the i-th type-I target path to obtain the transmission cost of the i-th type-I target path includes: to the source node of the i-th type-I target path And/or the destination node sends measurement information; receives measurement feedback information from the source node and/or destination node of the i-th first-type target path, the measurement feedback information includes the transmission of the i-th first-type target path Overhead.
- the second network topology further includes P second-type target paths, and each second-type target path in the P second-type target paths is determined by two of the N 1 first-type nodes It is composed of a type of node, and the first network topology includes the P target paths of the second type.
- the transmission overhead includes transmission cost and/or transmission delay.
- Fig. 5 is a schematic structural block diagram of a management device according to an embodiment of the present application.
- the management device 500 shown in FIG. 5 includes a topology management unit 501, a data collection unit 502, and a path calculation unit 503.
- the topology management unit 501 is configured to determine N 1 nodes of the first type from the N nodes included in the first network topology, where the N nodes include the N 1 nodes of the first type and N 2 nodes of the second type,
- the first type of node supports Internet Protocol version 6 routing SRv6, where N 1 is a positive integer greater than or equal to 2, and N 2 is a positive integer greater than or equal to 1.
- the topology management unit 501 is further configured to determine a second network topology corresponding to the first network topology.
- the second network topology includes the N 1 first-type nodes but does not include the N 2 second-type nodes.
- Data acquisition unit 502 the transmission overhead for determining the M first type of the target path, the transmission overhead i-th path for the first type of target minimum cost K i-th transmission paths.
- the path calculation unit 503 is configured to perform path calculation according to the transmission costs of the M first-type target paths and the second network topology.
- the first type of node is a node that supports SRv6 among the N nodes
- the second type of node is a node that does not support SRv6 among the N nodes; or, the first type of node is one of the N nodes
- the second type of node is a non-critical node among the N nodes.
- Data acquisition unit 502 is configured in accordance with the transmission overhead between two adjacent nodes of the K i of paths each path, to determine the K i overhead transmission paths for each path; determining the K i
- the minimum transmission cost in each path is the transmission cost of the i-th first-type target path.
- the data collection unit 502 is specifically configured to measure the transmission cost of the i-th target path of the first type to obtain the transmission cost of the i-th target path of the first type.
- the data collection unit 502 is specifically configured to send measurement information to the source node and/or destination node of the i-th target path of the first type; receive the source node and/or destination node from the i-th target path of the first type /Or measurement feedback information of the destination node, where the measurement feedback information includes the transmission overhead of the i-th target path of the first type.
- the second network topology further includes P second-type target paths, and each second-type target path in the P second-type target paths is determined by two of the N 1 first-type nodes It is composed of a type of node, and the first network topology includes the P target paths of the second type.
- the transmission overhead includes transmission cost and/or transmission delay.
- topology management unit 501 The specific functions of the topology management unit 501, the data collection unit 502, and the path calculation unit 503 can be referred to the method shown in FIG. 2, which will not be described here for brevity.
- the topology management unit 501, the data collection unit 502, and the path calculation unit 503 may be implemented by a processor.
- Fig. 6 is a schematic structural block diagram of a management device according to an embodiment of the present application.
- the management device 600 includes a bus 601, a processor 602, a communication interface 603, and a memory 604.
- the processor 602, the memory 604, and the communication interface 603 communicate through a bus 601.
- the processor 602 may be a field programmable gate array (FPGA), an application specific integrated circuit (ASIC), a system on chip (SoC), or a central
- the processor central processor unit, CPU
- CPU central processor unit, CPU
- NP network processor
- DSP digital signal processor
- MCU microcontroller
- the memory 604 stores executable codes included in the pathological image processing system, and the processor 602 reads the executable codes in the memory 604 to execute the method shown in FIG. 2 or FIG. 4.
- the memory 604 may also include an operating system and other software modules required for running processes.
- the operating system can be LINUX TM , UNIX TM , WINDOWS TM etc.
- An embodiment of the present application also provides a chip system, which is characterized by comprising: a logic circuit for coupling with an input/output interface, and transmitting data through the input/output interface, so as to perform as shown in FIG. 2 or 4 described method.
- the steps of the above method can be completed by hardware integrated logic circuits in the processor or instructions in the form of software.
- the steps of the method disclosed in the embodiments of the present application may be directly embodied as being executed and completed by a hardware processor, or executed and completed by a combination of hardware and software modules in the processor.
- the software module can be located in a mature storage medium in the field such as random access memory, flash memory, read-only memory, programmable read-only memory, or electrically erasable programmable memory, registers.
- the storage medium is located in the memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware. In order to avoid repetition, it will not be described in detail here.
- the processor in the embodiment of the present application may be an integrated circuit chip with signal processing capability.
- the steps of the foregoing method embodiments can be completed by hardware integrated logic circuits in the processor or instructions in the form of software.
- the general-purpose processor may be a microprocessor or the processor may also be any conventional processor or the like.
- the steps of the method disclosed in the embodiments of the present application may be directly embodied as being executed and completed by a hardware decoding processor, or executed and completed by a combination of hardware and software modules in the decoding processor.
- the software module can be located in a mature storage medium in the field such as random access memory, flash memory, read-only memory, programmable read-only memory, or electrically erasable programmable memory, registers.
- the storage medium is located in the memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware.
- the memory in the embodiment of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memory.
- the non-volatile memory can be read-only memory (ROM), programmable read-only memory (programmable ROM, PROM), erasable programmable read-only memory (erasable PROM, EPROM), and electronic Erase programmable read-only memory (electrically EPROM, EEPROM) or flash memory.
- the volatile memory may be random access memory (RAM), which is used as an external cache.
- RAM random access memory
- static random access memory static random access memory
- dynamic RAM dynamic random access memory
- DRAM dynamic random access memory
- SDRAM synchronous dynamic random access memory
- double data rate synchronous dynamic random access memory double data rate SDRAM, DDR SDRAM
- enhanced synchronous dynamic random access memory enhanced SDRAM, ESDRAM
- serial link DRAM SLDRAM
- direct rambus RAM direct rambus RAM
- the present application also provides a computer program product.
- the computer program product includes: computer program code, which when the computer program code runs on a computer, causes the computer to execute the steps shown in FIG. 2 or FIG. 4 The method of any one of the embodiments is shown.
- the present application also provides a computer-readable medium that stores program code, and when the program code runs on a computer, the computer executes the steps shown in FIG. 2 or FIG. 4 The method of any one of the embodiments is shown.
- the present application further provides a system, which includes the aforementioned management device, and the system further includes a plurality of nodes, and the plurality of nodes includes at least two nodes supporting SRv6.
- the disclosed system, device, and method may be implemented in other ways.
- the device embodiments described above are only illustrative.
- the division of the units is only a logical function division, and there may be other divisions in actual implementation, for example, multiple units or components can be combined or It can be integrated into another system, or some features can be ignored or not implemented.
- the displayed or discussed mutual coupling or direct coupling or communication connection may be indirect coupling or communication connection through some interfaces, devices or units, and may be in electrical, mechanical or other forms.
- the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the objectives of the solutions of the embodiments.
- each unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units may be integrated into one unit.
- the function is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer readable storage medium.
- the technical solution of this application essentially or the part that contributes to the existing technology or the part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including Several instructions are used to make a computer device (which may be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the method described in each embodiment of the present application.
- the aforementioned storage media include: U disk, mobile hard disk, read-only memory (Read-Only Memory, ROM), random access memory (Random Access Memory, RAM), magnetic disk or optical disk and other media that can store program code .
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Environmental & Geological Engineering (AREA)
- Health & Medical Sciences (AREA)
- Cardiology (AREA)
- General Health & Medical Sciences (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
本申请提供一种确定路径的方法和相关设备,该方法包括:从第一网络拓扑包括的N个节点中确定N 1个第一类节点,其中该N个节点包括该N 1个第一类节点和N 2个第二类节点,该第一类节点支持SRv6;确定与该第一网络拓扑对应的第二网络拓扑,该第二网络拓扑包括该N 1个第一类节点,但不包括该N 2个第二类节点,该目标拓扑结构包括M个第一类目标路径;确定该M个第一类目标路径的传输开销,该第i个第一类目标路径的传输开销为该K i个路径的传输开销最小值;根据该M个第一类目标路径的传输开销和该第二网络拓扑,进行路径计算。上述技术方案可以利用现有的网络拓扑结构建立一张新的网络拓扑,以降低路径计算的难度,从而降低管理设备的负担。
Description
本申请要求于2019年7月18日提交中国专利局、申请号为CN 201910649763.1、发明名称为“段路由算路”的中国专利申请和与2019年12月9日提交中国专利局、申请号为CN 201911252648.7、发明名称为“确定路径的方法和相关设备”中国专利申请的优先权,其全部内容通过引用结合在本申请中。
本申请涉及通信技术领域,更具体地,涉及确定路径的方法和相关设备。
近年来,段路由(Segment Routing,SR)技术在第五代(5
th Generation,5G)系统、物联网、多云等中得到了广泛的应用。SR技术可以分为两类,一种是基于多协议标签交换(Multi-Protocol Label Switching,MPLS)的SR技术,可以称为SR-MPLS;另一种是基于互联网协议第六版(Internet Protocol Version,IPv6)的SR技术,可以称为SRv6。
目前,如果需要利用SRv6技术,就需要全网设备均支持SRv6,这样控制器才能获取全网拓扑,计算满足服务等级协议(Service Level Agreement,SLA)的路径。但是,升级全网设备对运行商的难度太大。一方面因为网络中的设备数量非常多,升级全网设备会花费较多的时间。另一方面因为有些设备需要进行硬件升级才能支持SRv6,这就提高了升级的成本。
发明内容
本申请提供一种确定路径的方法和相关设备,可以利用现有的网络拓扑结构建立一张新的网络拓扑,以降低路径计算的难度,从而降低管理设备的负担。
第一方面,本申请实施例提供一种确定路径的方法,包括:从第一网络拓扑包括的N个节点中确定N
1个第一类节点,其中该N个节点包括该N
1个第一类节点和N
2个第二类节点,该第一类节点支持互联网协议第六版段路由SRv6,N
1为大于或等于2的正整数,N
2为大于或等于1的正整数;确定与该第一网络拓扑对应的第二网络拓扑,该第二网络拓扑包括该N
1个第一类节点,但不包括该N
2个第二类节点,该目标拓扑结构包括M个第一类目标路径,该M个第一类目标路径中的第i个第一类目标路径与该第一网络拓扑中的K
i个路径对应,该K
i个路径的源节点和目的节点与该第i个第一类目标路径的源节点和目的节点相同,该K
i个路径中的每个路径包括至少一个该第二类节点,M为大于或等于1的正整数,i=1,…,或M,K
i为大于或等于2的正整数;确定该M个第一类目标路径的传输开销,该第i个第一类目标路径的传输开销为该K
i个路径的传输开销最小值;根据该 M个第一类目标路径的传输开销和该第二网络拓扑,进行路径计算。
上述技术方案可以利用现有的网络拓扑结构建立一张新的网络拓扑。该新的网络拓扑中只包括原网络拓扑中的部分节点,且这些节点均支持SRv6。这样可以降低路径计算的难度,从而降低管理设备的负担。
结合第一方面,在第一方面的一种可能的实现方式中,该第一类节点为该N个节点中支持SRv6的节点,该第二类节点为该N个节点中不支持SRv6的节点;或者,该第一类节点为该N个节点中的关键节点,该第二类节点为该N个节点中的非关键节点。
上述技术方案可以将原网络拓扑中不支持SRv6的节点和/或非关键节点去除,得到一张新的网络拓扑,该网络拓扑中的所有节点都支持SRv6。这样即使网络中的存在不支持SRv6的节点,也可以根据管理设备确定的路径转发报文。或者,通过计算路径时忽略了非关键节点,可以降低路径计算的难度,从而降低管理设备的负担。
结合第一方面,在第一方面的一种可能的实现方式中,该方法还包括:获取该第一网络拓扑中两个相邻节点之间的传输开销;该确定M个第一类目标路径的传输开销,包括:根据该K
i个路径中的每个路径的两个相邻节点之间的传输开销,确定该K
i个路径中的每个路径的传输开销;确定该K
i个路径中的传输开销最小值为该第i个第一类目标路径的传输开销。
结合第一方面,在第一方面的一种可能的实现方式中,该确定M个第一类目标路径的传输开销,包括:对该第i个第一类目标路径的进行传输开销测量,得到该第i个第一类目标路径的传输开销。
利用上述技术方案可以直接通过测量的方式获取该第i个第一类目标路径的传输开销。换句话说,在利用通过测量的方式测量传输开销的情况下,路径中的节点是按照最短路径转发测量报文的。因此,得到的传输开销就是最小传输开销。因此,利用上述技术方案可以直接获得传输开销的最小值,从而可以减少管理设备的工作负担。
结合第一方面,在第一方面的一种可能的实现方式中,该对该第i个第一类目标路径的进行传输开销测量,得到该第i个第一类目标路径的传输开销,包括:向该第i个第一类目标路径的源节点和/或目的节点发送测量信息;接收来自于该第i个第一类目标路径的源节点和/或目的节点的测量反馈信息,该测量反馈信息包括该第i个第一类目标路径的传输开销。
结合第一方面,在第一方面的一种可能的实现方式中,该第二网络拓扑还包括P个第二类目标路径,该P个第二类目标路径中的每个第二类目标路径由该N
1个第一类节点中的两个第一类节点组成,该第一网络拓扑中包括该P个第二类目标路径。
结合第一方面,在第一方面的一种可能的实现方式中,该传输开销包括传输成本和/或传输时延。
第二方面,本申请实施例提供一种管理设备,该管理设备包括用于实现上述第一方面的方法设计中任意一种可能的实现方式的单元。该管理设备可以为计算机设备或者用于计算机设备的部件(例如芯片、电路等)。
第三方面,本申请实施例提供一种管理设备,包括收发器和处理器。可选地,该管理设备还包括存储器。该处理器用于控制收发器收发信号,该存储器用于存储计算机程序,该处理器用于从存储器中调用并运行该计算机程序,使得该管理设备执行上述第一方面的方法设计中任意一种可能的实现方式中的方法。
第四方面,本申请实施例提供一种电子装置,该电子装置可以为用于实现上述第一方面方法设计中的管理设备,或者为设置在管理设备中的芯片。该电子装置包括:处理器,与存储器耦合,可用于执行存储器中的指令和/或程序代码,以实现上述第一方面的方法设计中任意一种可能的实现方式中的方法。可选地,该电子装置还包括存储器。可选地,该电子装置还包括通信接口,处理器与通信接口耦合。
当该电子装置为管理设备时,该通信接口可以是收发器,或,输入/输出接口。
当该电子装置为配置于管理设备中的芯片时,该通信接口可以是输入/输出接口。
可选地,该收发器可以为收发电路。可选地,该输入/输出接口可以为输入/输出电路。
第五方面,本申请实施例提供一种计算机程序产品,所述计算机程序产品包括:计算机程序代码,当所述计算机程序代码在计算机上运行时,使得计算机执行上述第一方面的方法设计中任意一种可能的实现方式中的方法。
第六方面,本申请实施例提供一种计算机可读介质,所述计算机可读介质存储有程序代码,当所述计算机程序代码在计算机上运行时,使得计算机执行上述第一方面的方法设计中任意一种可能的实现方式中的方法。
图1是网络结构的示意图。
图2是根据本申请实施例提供的一种确定路径的方法的示意性流程图。
图3是该管理设备确定的与网络100对应的目标拓扑结构的示意图。
图4是根据本申请实施例提供的一种确定路径的方法示意性流程图。
图5是根据本申请实施例提供的一种管理设备的示意性结构框图。
图6是根据本申请实施例提供的一种管理设备的示意性结构框图。
下面将结合附图,对本申请中的技术方案进行描述。
本申请将围绕可包括多个设备、组件、模块等的系统来呈现各个方面、实施例或特征。 应当理解和明白的是,各个系统可以包括另外的设备、组件、模块等,并且/或者可以并不包括结合附图讨论的所有设备、组件、模块等。此外,还可以使用这些方案的组合。
另外,在本申请实施例中,“示例的”、“例如”等词用于表示作例子、例证或说明。本申请中被描述为“示例”的任何实施例或设计方案不应被解释为比其它实施例或设计方案更优选或更具优势。确切而言,使用示例的一词旨在以具体方式呈现概念。
在本申请实施例中,如果一个技术手段、操作或者限定没有被强调为是必须的,那么则表示这个技术手段、操作或者限定是可选的。
本申请实施例中,信息(information),信号(signal),消息(message),信道(channel)有时可以混用,应当指出的是,在不强调其区别时,其所要表达的含义是一致的。“相应的(corresponding,relevant)”和“对应的(corresponding)”有时可以混用,应当指出的是,在不强调其区别时,其所要表达的含义是一致的。
本申请实施例中,有时候下标如W
1可能会笔误为非下标的形式如W1,在不强调其区别时,其所要表达的含义是一致的。
本申请实施例描述的网络架构以及业务场景是为了更加清楚的说明本申请实施例的技术方案,并不构成对于本申请实施例提供的技术方案的限定,本领域普通技术人员可知,随着网络架构的演变和新业务场景的出现,本申请实施例提供的技术方案对于类似的技术问题,同样适用。
在本说明书中描述的参考“一个实施例”或“一些实施例”等意味着在本申请的一个或多个实施例中包括结合该实施例描述的特定特征、结构或特点。由此,在本说明书中的不同之处出现的语句“在一个实施例中”、“在一些实施例中”、“在其他一些实施例中”、“在另外一些实施例中”等不是必然都参考相同的实施例,而是意味着“一个或多个但不是所有的实施例”,除非是以其他方式另外特别强调。术语“包括”、“包含”、“具有”及它们的变形都意味着“包括但不限于”,除非是以其他方式另外特别强调。
本申请中,“至少一个”是指一个或者多个,“多个”是指两个或两个以上。“和/或”,描述关联对象的关联关系,表示可以存在三种关系,例如,A和/或B,可以表示:单独存在A,同时存在A和B,单独存在B的情况,其中A,B可以是单数或者复数。字符“/”一般表示前后关联对象是一种“或”的关系。“以下至少一项(个)”或其类似表达,是指的这些项中的任意组合,包括单项(个)或复数项(个)的任意组合。例如,a,b,或c中的至少一项(个),可以表示:a,b,c,a-b,a-c,b-c,或a-b-c,其中a,b,c可以是单个,也可以是多个。
图1是网络结构的示意图。如图1所示的网络100中包括8个节点,分别为节点101,节点102,节点103,节点104,节点105,节点106,节点107和节点108。网络100可以是一个完整的网络,也可以是一个完整网络的一部分。
如图1所示的网络100中的节点(即节点101至节点108)也可以称为网络节点。该节点可以是工作站、服务器、终端设备、网络设备等设备,各个设备可以拥有各自不同的IPv6地址。如图1所示的网络100中的两个相邻节点(例如节点101和节点102,节点102和节点103,节点101和节点105等)可以通过有线介质或无线介质进行连接。该两个相邻节点之间可以不包括中间设备,也可以包括一个或多个不对报文进行三层转发(即基于互联网协议(Internet Protocol,IP)地址的转发)的中间设备(例如某些交换机、光设备等)。
网络100中的节点可以分为第一类节点和第二类节点。
可选的,在一些实施例中,第一类节点和第二类节点都支持SRv6。第一类节点是网络100中的关键节点,第二类节点是网络100中的非关键节点。在一些实施例中,关键节点可以是两个网络的边界节点。例如,网络可以包括接入层、汇聚层、核心层等。关键节点可以是这些层的边界节点。可选的,在另一些实施例中,关键节点可以是网络的边缘出口节点。相应的,非关键节点可以是除关键节点以外的其他节点。
在另一些实施例中,第一类节点是支持SRv6的节点,第二类节点是不支持SRv6的节点。
此外,第一类节点可以是支持SRv6的节点且第一类节点是网络100中的关键节点;第二类节点可以是不支持SRv6的节点,或者,第二类节点可以是支持SRv6的节点且第二类节点网络100中的非关键节点。
为了便于描述,以下实施例中假设第一类节点为支持SRv6的节点,第二类节点为不支持SRv6的节点。
图2将结合图1所示的网络结构,对本申请的技术方案进行详细描述。为了便于描述,在图2所示的实施例中,假设节点102和节点106是不支持SRv6的节点;节点101,节点103,节点104,节点105,节点107和节点108是支持SRv6的节点。可以理解的是,图2所示的具体实施例仅是为了帮助本领域技术人员更好地理解本申请的技术方案,而并非是对本申请技术方案的局限于有限的实施例中。
图2是根据本申请实施例提供的一种确定路径的方法的示意性流程图。如图2所示的方法可以由网络中的管理设备执行。该管理设备可以是通用计算机设备,例如笔记本电脑、个人电脑等,也可以是也可以是一个专用的网络管理设备。
201,管理设备确定网络100的拓扑结构。
本申请实施例对该管理设备如何获取网络100的拓扑结构的具体实现方式并不进行限定。例如,该管理设备可以与网络100中的节点建立边界网关协议-链路状态(Border Gateway Protocol-link state,BGP-LS)或者内部网关协议(Interior Gateway Protocol,IGP)邻居。网络100中节点利用BGP-LS或IGP获取网络100的拓扑结构,并将获取到的网络 100的拓扑结构发送至管理设备。
202,该管理设备从网络100包括节点中,确定第一类节点。
根据节点是否支持SRv6,网络100中的节点可以分为第一类节点和第二类节点。第一类节点为支持SRv6的节点,第二类节点为不支持SRv6的节点。
如上假设,网络100中共包括6个第一类节点(即节点101,节点103,节点104,节点105,节点107和节点108)和2个第二类节点(即节点102和节点106)。
任何在本网络环境中可用的确定网络100中的节点的类型的方法均可以应用于本实施例中
例如,在一些实施例中,该管理设备可以自行确定网络100中的每个节点的类型。例如,该管理设备可以获取SRv6指示信息,该SRv6指示信息用于指示网络100中的每个节点是否支持SRv6。在此情况下,该管理设备可以根据该SRv6指示信息确定网络100包括的第一类节点。
可选的,在一些实施例中,该管理设备可以在确定网络100的拓扑结构的过程中获取到该SRv6指示信息。例如,该管理设备在确定网络100的拓扑结构的过程中可以获取网络100中的每个节点上报的拓扑信息,该拓扑信息中包括该SRv6指示信息。
可选的,在另一些实施例中,该管理设备可以向网络100中的每个节点发送SRv6查询信息。网络100中的节点在接收到该SRv6查询信息后,会向该管理设备发送SRv6查询反馈信息,该SRv6查询反馈信息用于指示该节点是否支持SRv6。
又如,在另一些实施例中,该管理设备可以根据管理员的人工标注,确定网络100中的每个节点的类型。例如,管理设备的管理员可以查看网络100的维护日志或者手工查询网络100中的每个节点的属性信息,确定网络100中的每个节点是否支持SRv6,并将确定结果保存在该管理设备中。在此情况下,该管理设备可以根据保存的确定结果,确定出网络100中的第一类节点。
203,该管理设备确定与网络100对应的目标拓扑结构。
图3是该管理设备确定的与网络100对应的目标拓扑结构的示意图。如图3所示的目标拓扑结构300包括网络100中的第一类节点,而不包括网络100中的第二类网络节点。如图3所示的目标拓扑结构300中包括节点101、节点103、节点104、节点105、节点107和节点108,不包括节点102和节点106。
如果网络100中的两个相邻节点均为第一类节点,那么该管理设备可以确定这两个节点在网络100中的连接关系和目标拓扑结构中的连接关系是相同的。例如,节点101和节点105的连接关系,节点103和节点104的连接关系,节点104和节点108的连接关系,节点103和节点107的连接关系,以及节点101和节点105的连接关系在目标拓扑结构300中与在网络100中相同。为了便于描述,可以将这种在网络100中的连接关系和在目标拓 扑结构中的连接关系相同的两个节点之间的路径称为第二类目标路径。换句话说,在图3所示目标拓扑结构中,节点101和节点105之间的路径,节点103和节点104之间的路径,节点104和节点108之间的路径,节点103和节点107之间的路径,以及节点101和节点105之间的路径均为该第二类目标路径。
如果网络100中的两个第一类节点之间包括一个或多个第二类节点,那么该管理设备可以确定这两个第一类节点在目标拓扑结构中具有直接连接的路径。此外,该管理设备还可以确定网络100中与该路径对应一个或多个路径。为了便于描述,可以将这种在网络100中的连接关系和在目标拓扑结构中的连接关系不相同的两个节点之间的路径称为第一类目标路径。换句话说,在图3所示目标拓扑结构300中,节点101和节点103之间的路径,节点101和节点107之间的路径,节点105和节点103之间的路径,节点105和节点107之间的路径为该第一类目标路径。
下面以节点101和节点103为例对第一类目标路径进行介绍。为了便于描述,以下将在目标拓扑结构300中节点101和节点103之间的第一类目标路径称为第一类目标路径1,将网络100中两个具有相邻节点之间的路径称为链路,节点101和节点102之间的链路称为链路12,将节点102和节点103之间的路径称为链路23,以此类推。
在网络100中,节点101可以通过多条路径与节点103进行通信。例如,路径1可以包括链路12和链路23路径;路径2可以包括链路12,链路26,链路67和链路73;路径3可以包括链路15,链路56,链路62和链路23;路径4可以包括链路15,链路56,链路67和链路73。可以看出,路径1至路径4中的每个路径中都包括至少一个第二类节点。
可以路径1、路径2、路径3和路径4可以称为与第一类目标路径1对应的路径。换句话说,在目标拓扑结构300中,第一类目标路径1在网络100中有四个对应的路径,分别为路径1、路径2、路径3和路径4。类似的,在目标拓扑结构300中,节点101和节点107之间的第一类目标路径在网络100中也有多条对应的路径,节点105和节点107之间的第一类目标路径在网络100中也有多条对应的路径,节点105和节点103之间的第一类目标路径在网络100中也有多条对应的路径。
综上所述,该管理设备可以确定的目标拓扑结构中共包括四个第一类目标路径和五个第二类目标路径。
204,该管理设备可以确定该四个第一类目标路径中的每个第一类目标路径的传输开销。
在一些实施例中,传输开销为传输时延。在另一些实施例中,传输开销为传输成本。传输成本也可以称为链路的代价。在另一些实施例中,传输开销可以包括传输成本和传输时延。在另一些实施例中,传输开销可以是根据传输成本和传输时延确定的一个值。例如,传输开销可以根据公式1确定:
Con=α×C+β×D,(公式1)
其中Con表示传输开销,C表示传输成本,D表示传输时延,α表示与传输开销对应的权重系数,β表示与传输时延对应的权重系数,其中α和β为大于0的数。
还以第一类目标路径1为例,对该管理设备确定该第一类目标路径的传输开销的具体实现方式进行描述。
可选的,在一些实施例中,该管理设备可以获取与第一类目标路径1对应的四条路径(即路径1至路径4)中的每条路径的两个相邻节点的传输开销。例如,该管理设备获取到的拓扑信息中可以包括网络100的两个相邻节点的传输开销。以路径1为例,该管理设备可以获取节点101和节点102之间的传输开销(即链路12的传输开销),该管理设备还可以获取节点102和节点103之间的传输开销(即链路23的传输开销)。这样,该管理设备可以确定路径1的传输开销(以下简称传输开销1)为链路12的传输开销和链路23的传输开销的和。类似的,该管理设备可以确定路径2的传输开销(以下简称传输开销2),路径3的传输开销(以下简称传输开销3)和路径4的传输开销(以下简称传输开销4)。在确定了传输开销1至传输开销4后,该管理设备可以确定第一类目标路径1的传输开销为该传输开销1至该传输开销4中的最小值。
在一些实施例中,若传输开销包括传输成本和传输时延,则多个传输开销的最小值可以是多个传输开销中具有最小传输时延的传输开销的值。
在另一些实施例中,若传输开销包括传输成本和传输时延,则该多个传输开销的最小值可以是多个传输开销中具有最小传输成本的传输开销的值。
在一些实施例中,若传输开销包括传输成本和传输时延,则在传输时延不同的情况下,多个传输时延中的最小值为该多个传输开销的最小值;在传输时延相同的情况下,传输成本的最小值为该多个传输开销的最小值。
可选的,在另一些实施例中,该管理设备可以对第一类目标路径1的传输开销进行测量,得到该第一类目标路径1的传输开销。
例如,该管理设备可以向目标节点发送测量信息,该测量信息用于指示目标节点进行时延测量,其中该目标节点可以是节点101和/或节点103。该目标节点在接收到该测量信息后,可以进行时延测量。例如,该目标节点可以利用网络质量分析(Network Quality Analyzer,NQA)技术、双向测量协议(Two-way Active Measurement Protocol,TWAMP)或者因特网包探测器(Packet Internet Groper,PING)等技术对节点101到节点103之间的路径进行时延测量。该目标节点可以得到该第一类目标路径1的传输时延。该目标节点可以向该管理设备发送测量反馈信息,该测量反馈信息包括该第一类目标路径1的传输开销。
在一些实施例中,该目标节点可以直接将测量到的传输时延作为传输开销发送给该管理设备。
在另一些实施例中,该目标节点可以根据传输时延确定传输成本,并将传输时延和传输成本作为传输开销发送给该管理设备。例如,该目标节点可以根据预设的传输成本和传输时延的对应关系,确定与测量到的传输时延对应的传输开销。又如,该目标节点可以根据预设公式确定与测量到的传输时延对应的传输开销。
在另一些实施例中,该目标节点可以根据传输时延确定传输成本,并将传输成本作为传输开销发送给该管理设备。
在此情况下,该管理设备可以直接获得第一类目标路径1的传输开销。第一类目标路径1的传输开销就是节点101到节点103的传输开销的最小值。
类似的,该管理设备可以确定目标拓扑结构300的节点101和节点107之间的第一类目标路径的传输开销,节点105和节点107之间的第一类目标路径的传输开销,节点105和节点103之间的第一类目标路径的传输开销。
该五个第二类目标路径中的每个第二类目标路径的传输开销的确定方式与确定第一类目标路径的传输开销的确定方式相同或类似。例如,该管理设备获取到的拓扑信息中可以包括网络100的两个相邻节点的传输开销。这样,该管理设备就可以直接确定每个第二类目标路径的传输开销。又如,该管理设备也可以采用测量的方式确定该五个第二类目标路径中的每个第二类目标路径的传输开销。具体测量方式与测量第一类目标路径的传输开销的测量方式相同,为了简洁,在此就不再赘述。
205,该管理设备可以根据四个第一类目标路径的传输开销该目标拓扑结构,进行路径计算。
例如,若管理设备希望确定从节点101到节点108的路径的情况下,该管理设备可以根据该四个第一类目标路径,确定该路径是通过节点103还是节点107到达节点108。为了便于描述,假设传输开销为传输时延。假设节点101到节点103的传输时延为2ms,节点101到节点107的传输开销为3ms,节点103到节点104的传输开销为2ms,节点104到节点108的传输开销为1ms,节点107到节点108的传输开销为8ms。若节点101至节点108的路径经过节点103和节点104,则总传输开销为5ms;若节点101至节点108的路径经过节点107,则总传输开销为11ms。在此情况下,该管理设备可以确定节点101至节点108的路径经过节点103和节点104。
图4是根据本申请实施例提供的一种确定路径的方法示意性流程图。图4所示的方法可以由管理设备或者管理设备内的部件(例如芯片、或电路等实现)。
401,从第一网络拓扑包括的N个节点中确定N
1个第一类节点,其中该N个节点包括该N
1个第一类节点和N
2个第二类节点,该第一类节点支持SRv6,N
1为大于或等于2的正整数,N
2为大于或等于1的正整数。
402,确定与该第一网络拓扑对应的第二网络拓扑,该第二网络拓扑包括该N
1个第一 类节点,但不包括该N
2个第二类节点,该目标拓扑结构包括M个第一类目标路径,该M个第一类目标路径中的第i个第一类目标路径与该第一网络拓扑中的K
i个路径对应,该K
i个路径的源节点和目的节点与该第i个第一类目标路径的源节点和目的节点相同,该K
i个路径中的每个路径包括至少一个该第二类节点,M为大于或等于1的正整数,i=1,…,或M,K
i为大于或等于2的正整数。
例如,该第一网络拓扑可以是如图1所示的网络100的网络拓扑结构。网络100中的节点101、节点103、节点104、节点105、节点107和节点108可以是第一类节点,节点102和节点106可以是第二类节点。该第二网络拓扑可以是如图3所示的目标拓扑结构300。目标拓扑结构300中包括节点101、节点103、节点104、节点105、节点107和节点108。
403,确定该M个第一类目标路径的传输开销,该第i个第一类目标路径的传输开销为该K
i个路径的传输开销最小值。
404,根据该M个第一类目标路径的传输开销和该第二网络拓扑,进行路径计算。
可选的,该第一类节点为该N个节点中支持SRv6的节点,该第二类节点为该N个节点中不支持SRv6的节点;或者,该第一类节点为该N个节点中的关键节点,该第二类节点为该N个节点中的非关键节点。
可选的,该方法还包括:获取该第一网络拓扑中两个相邻节点之间的传输开销;该确定M个第一类目标路径的传输开销,包括:根据该K
i个路径中的每个路径的两个相邻节点之间的传输开销,确定该K
i个路径中的每个路径的传输开销;确定该K
i个路径中的传输开销最小值为该第i个第一类目标路径的传输开销。
可选的,该确定M个第一类目标路径的传输开销,包括:对该第i个第一类目标路径的进行传输开销测量,得到该第i个第一类目标路径的传输开销。
可选的,该对该第i个第一类目标路径的进行传输开销测量,得到该第i个第一类目标路径的传输开销,包括:向该第i个第一类目标路径的源节点和/或目的节点发送测量信息;接收来自于该第i个第一类目标路径的源节点和/或目的节点的测量反馈信息,该测量反馈信息包括该第i个第一类目标路径的传输开销。
可选的,该第二网络拓扑还包括P个第二类目标路径,该P个第二类目标路径中的每个第二类目标路径由该N
1个第一类节点中的两个第一类节点组成,该第一网络拓扑中包括该P个第二类目标路径。
可选的,该传输开销包括传输成本和/或传输时延。
图4所示方法的各个步骤的具体实现方式可以参考图2所示的实施例,为了简洁,在此就不再描述。
图5是根据本申请实施例提供的一种管理设备的示意性结构框图。如图5所示的管理设备500包括拓扑管理单元501、数据采集单元502和路径计算单元503。
拓扑管理单元501,用于从第一网络拓扑包括的N个节点中确定N
1个第一类节点,其中该N个节点包括该N
1个第一类节点和N
2个第二类节点,该第一类节点支持互联网协议第六版段路由SRv6,N
1为大于或等于2的正整数,N
2为大于或等于1的正整数。
拓扑管理单元501,还用于确定与该第一网络拓扑对应的第二网络拓扑,该第二网络拓扑包括该N
1个第一类节点,但不包括该N
2个第二类节点,该目标拓扑结构包括M个第一类目标路径,该M个第一类目标路径中的第i个第一类目标路径与该第一网络拓扑中的K
i个路径对应,该K
i个路径的源节点和目的节点与该第i个第一类目标路径的源节点和目的节点相同,该K
i个路径中的每个路径包括至少一个该第二类节点,M为大于或等于1的正整数,i=1,…,或M,K
i为大于或等于2的正整数。
数据采集单元502,用于确定该M个第一类目标路径的传输开销,该第i个第一类目标路径的传输开销为该K
i个路径的传输开销最小值。
路径计算单元503,用于根据该M个第一类目标路径的传输开销和该第二网络拓扑,进行路径计算。
可选的,该第一类节点为该N个节点中支持SRv6的节点,该第二类节点为该N个节点中不支持SRv6的节点;或者,该第一类节点为该N个节点中的关键节点,该第二类节点为该N个节点中的非关键节点。
可选的,获取该第一网络拓扑中两个相邻节点之间的传输开销。数据采集单元502,具体用于根据该K
i个路径中的每个路径的两个相邻节点之间的传输开销,确定该K
i个路径中的每个路径的传输开销;确定该K
i个路径中的传输开销最小值为该第i个第一类目标路径的传输开销。
可选的,数据采集单元502,具体用于对该第i个第一类目标路径的进行传输开销测量,得到该第i个第一类目标路径的传输开销。
可选的,数据采集单元502,具体用于向该第i个第一类目标路径的源节点和/或目的节点发送测量信息;接收来自于该第i个第一类目标路径的源节点和/或目的节点的测量反馈信息,该测量反馈信息包括该第i个第一类目标路径的传输开销。
可选的,该第二网络拓扑还包括P个第二类目标路径,该P个第二类目标路径中的每个第二类目标路径由该N
1个第一类节点中的两个第一类节点组成,该第一网络拓扑中包括该P个第二类目标路径。
可选的,该传输开销包括传输成本和/或传输时延。
拓扑管理单元501、数据采集单元502和路径计算单元503的具体功能可以参见图2所示的方法,为了简洁,在此就不再描述。
拓扑管理单元501、数据采集单元502和路径计算单元503可以由处理器实现。
图6是根据本申请实施例提供的一种管理设备的示意性结构框图。管理设备600包括 总线601、处理器602、通信接口603和存储器604。处理器602、存储器604和通信接口603之间通过总线601通信。其中,处理器602可以是编程门阵列(field programmable gate array,FPGA),可以是专用集成芯片(application specific integrated circuit,ASIC),还可以是系统芯片(system on chip,SoC),还可以是中央处理器(central processor unit,CPU),还可以是网络处理器(network processor,NP),还可以是数字信号处理电路(digital signal processor,DSP),还可以是微控制器(micro controller unit,MCU),还可以是可编程控制器(programmable logic device,PLD)、其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件,或其他集成芯片。存储器604中存储有病理图像处理系统所包括的可执行代码,处理器602读取存储器604中的该可执行代码以执行如图2或图4所示的方法。存储器604中还可以包括操作系统等其他运行进程所需的软件模块。操作系统可以为LINUX
TM,UNIX
TM,WINDOWS
TM等。
本申请实施例还提供一种芯片系统,其特征在于,包括:逻辑电路,所述逻辑电路用于与输入/输出接口耦合,通过所述输入/输出接口传输数据,以执行如图2或图4所述的方法。
在实现过程中,上述方法的各步骤可以通过处理器中的硬件的集成逻辑电路或者软件形式的指令完成。结合本申请实施例所公开的方法的步骤可以直接体现为硬件处理器执行完成,或者用处理器中的硬件及软件模块组合执行完成。软件模块可以位于随机存储器,闪存、只读存储器,可编程只读存储器或者电可擦写可编程存储器、寄存器等本领域成熟的存储介质中。该存储介质位于存储器,处理器读取存储器中的信息,结合其硬件完成上述方法的步骤。为避免重复,这里不再详细描述。
应注意,本申请实施例中的处理器可以是一种集成电路芯片,具有信号的处理能力。在实现过程中,上述方法实施例的各步骤可以通过处理器中的硬件的集成逻辑电路或者软件形式的指令完成。通用处理器可以是微处理器或者该处理器也可以是任何常规的处理器等。结合本申请实施例所公开的方法的步骤可以直接体现为硬件译码处理器执行完成,或者用译码处理器中的硬件及软件模块组合执行完成。软件模块可以位于随机存储器,闪存、只读存储器,可编程只读存储器或者电可擦写可编程存储器、寄存器等本领域成熟的存储介质中。该存储介质位于存储器,处理器读取存储器中的信息,结合其硬件完成上述方法的步骤。
可以理解,本申请实施例中的存储器可以是易失性存储器或非易失性存储器,或可包括易失性和非易失性存储器两者。其中,非易失性存储器可以是只读存储器(read-only memory,ROM)、可编程只读存储器(programmable ROM,PROM)、可擦除可编程只读存储器(erasable PROM,EPROM)、电可擦除可编程只读存储器(electrically EPROM,EEPROM)或闪存。易失性存储器可以是随机存取存储器(random access memory,RAM), 其用作外部高速缓存。通过示例性但不是限制性说明,许多形式的RAM可用,例如静态随机存取存储器(static RAM,SRAM)、动态随机存取存储器(dynamic RAM,DRAM)、同步动态随机存取存储器(synchronous DRAM,SDRAM)、双倍数据速率同步动态随机存取存储器(double data rate SDRAM,DDR SDRAM)、增强型同步动态随机存取存储器(enhanced SDRAM,ESDRAM)、同步连接动态随机存取存储器(synchlink DRAM,SLDRAM)和直接内存总线随机存取存储器(direct rambus RAM,DR RAM)。应注意,本文描述的系统和方法的存储器旨在包括但不限于这些和任意其它适合类型的存储器。
根据本申请实施例提供的方法,本申请还提供一种计算机程序产品,该计算机程序产品包括:计算机程序代码,当该计算机程序代码在计算机上运行时,使得该计算机执行图2或图4所示实施例中任意一个实施例的方法。
根据本申请实施例提供的方法,本申请还提供一种计算机可读介质,该计算机可读介质存储有程序代码,当该程序代码在计算机上运行时,使得该计算机执行图2或图4所示实施例中任意一个实施例的方法。
根据本申请实施例提供的方法,本申请还提供一种系统,其包括前述的管理设备,该系统还包括多个节点,该多个节点中包括至少两个支持SRv6的节点。
本领域普通技术人员可以意识到,结合本文中所公开的实施例描述的各示例的单元及算法步骤,能够以电子硬件、或者计算机软件和电子硬件的结合来实现。这些功能究竟以硬件还是软件方式来执行,取决于技术方案的特定应用和设计约束条件。专业技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能,但是这种实现不应认为超出本申请的范围。
所属领域的技术人员可以清楚地了解到,为描述的方便和简洁,上述描述的系统、装置和单元的具体工作过程,可以参考前述方法实施例中的对应过程,在此不再赘述。
在本申请所提供的几个实施例中,应该理解到,所揭露的系统、装置和方法,可以通过其它的方式实现。例如,以上所描述的装置实施例仅仅是示意性的,例如,所述单元的划分,仅仅为一种逻辑功能划分,实际实现时可以有另外的划分方式,例如多个单元或组件可以结合或者可以集成到另一个系统,或一些特征可以忽略,或不执行。另一点,所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口,装置或单元的间接耦合或通信连接,可以是电性,机械或其它的形式。
所述作为分离部件说明的单元可以是或者也可以不是物理上分开的,作为单元显示的部件可以是或者也可以不是物理单元,即可以位于一个地方,或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部单元来实现本实施例方案的目的。
另外,在本申请各个实施例中的各功能单元可以集成在一个处理单元中,也可以是各个单元单独物理存在,也可以两个或两个以上单元集成在一个单元中。
所述功能如果以软件功能单元的形式实现并作为独立的产品销售或使用时,可以存储在一个计算机可读取存储介质中。基于这样的理解,本申请的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的部分可以以软件产品的形式体现出来,该计算机软件产品存储在一个存储介质中,包括若干指令用以使得一台计算机设备(可以是个人计算机,服务器,或者网络设备等)执行本申请各个实施例所述方法的全部或部分步骤。而前述的存储介质包括:U盘、移动硬盘、只读存储器(Read-Only Memory,ROM)、随机存取存储器(Random Access Memory,RAM)、磁碟或者光盘等各种可以存储程序代码的介质。
以上所述,仅为本申请的具体实施方式,但本申请的保护范围并不局限于此,任何熟悉本技术领域的技术人员在本申请揭露的技术范围内,可轻易想到变化或替换,都应涵盖在本申请的保护范围之内。
Claims (17)
- 一种确定路径的方法,其特征在于,包括:从第一网络拓扑包括的N个节点中确定N 1个第一类节点,其中所述N个节点包括所述N 1个第一类节点和N 2个第二类节点,所述第一类节点支持互联网协议第六版段路由SRv6,N 1为大于或等于2的正整数,N 2为大于或等于1的正整数;确定与所述第一网络拓扑对应的第二网络拓扑,所述第二网络拓扑包括所述N 1个第一类节点,但不包括所述N 2个第二类节点,所述目标拓扑结构包括M个第一类目标路径,所述M个第一类目标路径中的第i个第一类目标路径与所述第一网络拓扑中的K i个路径对应,所述K i个路径的源节点和目的节点与所述第i个第一类目标路径的源节点和目的节点相同,所述K i个路径中的每个路径包括至少一个所述第二类节点,M为大于或等于1的正整数,i=1,…,或M,K i为大于或等于2的正整数;确定所述M个第一类目标路径的传输开销,所述第i个第一类目标路径的传输开销为所述K i个路径的传输开销最小值;根据所述M个第一类目标路径的传输开销和所述第二网络拓扑,进行路径计算。
- 如权利要求1所述的方法,其特征在于,所述第一类节点为所述N个节点中支持SRv6的节点,所述第二类节点为所述N个节点中不支持SRv6的节点;或者,所述第一类节点为所述N个节点中支持SRv6的关键节点,所述第二类节点为所述N个节点中的支持SRv6的非关键节点或者不支持SRv6的节点。
- 如权利要求1或2所述的方法,其特征在于,所述方法还包括:获取所述第一网络拓扑中两个相邻节点之间的传输开销;所述确定M个第一类目标路径的传输开销,包括:根据所述K i个路径中的每个路径的两个相邻节点之间的传输开销,确定所述K i个路径中的每个路径的传输开销;确定所述K i个路径中的传输开销最小值为所述第i个第一类目标路径的传输开销。
- 如权利要求1或2所述的方法,其特征在于,所述确定M个第一类目标路径的传输开销,包括:对所述第i个第一类目标路径的进行传输开销测量,得到所述第i个第一类目标路径的传输开销。
- 如权利要求4所述的方法,其特征在于,所述对所述第i个第一类目标路径的进行传输开销测量,得到所述第i个第一类目标路径的传输开销,包括:向所述第i个第一类目标路径的源节点和/或目的节点发送测量信息;接收来自于所述第i个第一类目标路径的源节点和/或目的节点的测量反馈信息,所述测量反馈信息包括所述第i个第一类目标路径的传输开销。
- 如权利要求1至5中任一项所述的方法,其特征在于,所述第二网络拓扑还包括P个第二类目标路径,所述P个第二类目标路径中的每个第二类目标路径由所述N 1个第一类节点中的两个第一类节点组成,所述第一网络拓扑中包括所述P个第二类目标路径。
- 如权利要求1至6中任一项所述的方法,其特征在于,所述传输开销包括传输成本和/或传输时延。
- 一种管理设备,其特征在于,包括:拓扑管理单元,用于从第一网络拓扑包括的N个节点中确定N 1个第一类节点,其中所述N个节点包括所述N 1个第一类节点和N 2个第二类节点,所述第一类节点支持互联网协议第六版段路由SRv6,N 1为大于或等于2的正整数,N 2为大于或等于1的正整数;所述拓扑管理单元,还用于确定与所述第一网络拓扑对应的第二网络拓扑,所述第二网络拓扑包括所述N 1个第一类节点,但不包括所述N 2个第二类节点,所述目标拓扑结构包括M个第一类目标路径,所述M个第一类目标路径中的第i个第一类目标路径与所述第一网络拓扑中的K i个路径对应,所述K i个路径的源节点和目的节点与所述第i个第一类目标路径的源节点和目的节点相同,所述K i个路径中的每个路径包括至少一个所述第二类节点,M为大于或等于1的正整数,i=1,…,或M,K i为大于或等于2的正整数;数据采集单元,用于确定所述M个第一类目标路径的传输开销,所述第i个第一类目标路径的传输开销为所述K i个路径的传输开销最小值;路径计算单元,用于根据所述M个第一类目标路径的传输开销和所述第二网络拓扑,进行路径计算。
- 如权利要求8所述的设备,其特征在于,所述第一类节点为所述N个节点中支持SRv6的节点,所述第二类节点为所述N个节点中不支持SRv6的节点;或者,所述第一类节点为所述N个节点中支持SRv6的关键节点,所述第二类节点为所述N个节点中的支持SRv6的非关键节点或者不支持SRv6的节点。
- 如权利要求8或9所述的设备,其特征在于,所述数据采集单元,还用于获取所述第一网络拓扑中两个相邻节点之间的传输开销;所述数据采集单元,具体用于根据所述K i个路径中的每个路径的两个相邻节点之间的传输开销,确定所述K i个路径中的每个路径的传输开销;确定所述K i个路径中的传输开销最小值为所述第i个第一类目标路径的传输开销。
- 如权利要求8或9所述的设备,其特征在于,所述数据采集单元,具体用于对所述第i个第一类目标路径的进行传输开销测量,得到所述第i个第一类目标路径的传输开销。
- 如权利要求11所述的设备,其特征在于,所述数据采集单元,具体用于向所述第i个第一类目标路径的源节点和/或目的节点发送测量信息;接收来自于所述第i个第一类目标路径的源节点和/或目的节点的测量反馈信息,所述测量反馈信息包括所述第i个第一类目标路径的传输开销。
- 如权利要求8至12中任一项所述的设备,其特征在于,所述第二网络拓扑还包括P个第二类目标路径,所述P个第二类目标路径中的每个第二类目标路径由所述N 1个第一类节点中的两个第一类节点组成,所述第一网络拓扑中包括所述P个第二类目标路径。
- 如权利要求8至13中任一项所述的设备,其特征在于,所述传输开销包括传输成本和/或传输时延。
- 一种计算机设备,其特征在于,包括:处理器,所述处理器用于与存储器耦合,读取并执行所述存储器中的指令和/或程序代码,以执行如权利要求1-7中任一项所述的方法。
- 一种芯片系统,其特征在于,包括:逻辑电路,所述逻辑电路用于与输入/输出接口耦合,通过所述输入/输出接口传输数据,以执行如权利要求1-7中任一项所述的方法。
- 一种计算机可读介质,其特征在于,所述计算机可读介质存储有程序代码,当所述计算机程序代码在计算机上运行时,使得计算机执行如权利要求1-7中任一项所述的方法。
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP20840937.5A EP3975490A4 (en) | 2019-07-18 | 2020-07-14 | METHOD OF WAY DETERMINATION AND RELATED DEVICE |
US17/573,934 US20220141121A1 (en) | 2019-07-18 | 2022-01-12 | Path determining method and related device |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910649763 | 2019-07-18 | ||
CN201910649763.1 | 2019-07-18 | ||
CN201911252648.7A CN112242950B (zh) | 2019-07-18 | 2019-12-09 | 确定路径的方法和相关设备 |
CN201911252648.7 | 2019-12-09 |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US17/573,934 Continuation US20220141121A1 (en) | 2019-07-18 | 2022-01-12 | Path determining method and related device |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2021008533A1 true WO2021008533A1 (zh) | 2021-01-21 |
Family
ID=74168369
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2020/101947 WO2021008533A1 (zh) | 2019-07-18 | 2020-07-14 | 确定路径的方法和相关设备 |
Country Status (4)
Country | Link |
---|---|
US (1) | US20220141121A1 (zh) |
EP (1) | EP3975490A4 (zh) |
CN (1) | CN112242950B (zh) |
WO (1) | WO2021008533A1 (zh) |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113328893A (zh) * | 2021-06-10 | 2021-08-31 | 北京知道创宇信息技术股份有限公司 | 网络拓扑测绘完备性评估方法、系统、电子设备及计算机可读存储介质 |
CN114024876A (zh) * | 2021-10-15 | 2022-02-08 | 中国联合网络通信集团有限公司 | 一种网络拨测方法、装置、设备及存储介质 |
CN114205290A (zh) * | 2021-12-10 | 2022-03-18 | 中国电子科技集团公司第十五研究所 | 一种用于行为体传播的数据处理方法及装置 |
CN117792981A (zh) * | 2024-02-28 | 2024-03-29 | 山东云海国创云计算装备产业创新中心有限公司 | 路由方法、装置、路由设备、路由管理设备和路由网络 |
Families Citing this family (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP3949291B1 (fr) * | 2020-05-25 | 2023-07-05 | Airbus Defence and Space SAS | Routage de paquets au sein d'un réseau de communication présentant une topologie variable et prédictible |
CN112995032B (zh) * | 2021-05-20 | 2021-08-24 | 中国人民解放军国防科技大学 | 一种基于受限最宽路径的段路由流量工程方法及装置 |
CN115550185A (zh) * | 2021-06-29 | 2022-12-30 | 华为技术有限公司 | 网络拓扑生成方法和相关装置 |
CN113507413B (zh) * | 2021-07-22 | 2022-07-29 | 中国联合网络通信集团有限公司 | 一种路由优化方法、装置及计算设备 |
CN114650254B (zh) * | 2021-12-10 | 2023-10-20 | 中国联合网络通信集团有限公司 | 一种确定业务路径的方法、装置以及计算机可读存储介质 |
CN117319217A (zh) * | 2022-06-22 | 2023-12-29 | 华为技术有限公司 | 复用目的节点标识的方法、装置以及第一设备 |
CN115865783B (zh) * | 2022-11-22 | 2024-04-09 | 中国联合网络通信集团有限公司 | 目标节点的确定方法、装置及计算机可读存储介质 |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104735745A (zh) * | 2015-04-02 | 2015-06-24 | 吉林大学 | 一种异构自组织网络中虚拟骨干网的建立方法及装置 |
CN108574594A (zh) * | 2017-03-14 | 2018-09-25 | 华为技术有限公司 | 一种网络业务传输的方法及系统 |
US10230605B1 (en) * | 2018-09-04 | 2019-03-12 | Cisco Technology, Inc. | Scalable distributed end-to-end performance delay measurement for segment routing policies |
CN109922004A (zh) * | 2019-04-24 | 2019-06-21 | 清华大学 | 基于部分部署分段路由的IPv6网络的流量工程方法及装置 |
Family Cites Families (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8578054B2 (en) * | 2008-03-07 | 2013-11-05 | Cisco Technology, Inc. | Computing disjoint paths for reactive routing mesh networks |
EP2698953A4 (en) * | 2011-04-13 | 2014-12-10 | Nec Corp | NETWORK DATA TRANSMISSION NODES, COMMUNICATION METHOD AND PROGRAM |
CN108702328B (zh) * | 2016-02-15 | 2021-04-09 | 瑞典爱立信有限公司 | 用于穿越分段路由和mpls网络的业务的灵活路径拼接和选择的is-is扩展 |
CN107181520A (zh) * | 2017-04-21 | 2017-09-19 | 中国科学院光电研究院 | 一种网络拓扑结构的组网方法及装置 |
US10904152B2 (en) * | 2018-12-17 | 2021-01-26 | Cisco Technology, Inc. | Hardware-friendly mechanisms for in-band OAM processing |
CN109768883A (zh) * | 2018-12-21 | 2019-05-17 | 华为技术服务有限公司 | 一种网络拓扑路径的确定方法、装置和终端设备 |
US10892967B2 (en) * | 2018-12-21 | 2021-01-12 | Cisco Technology, Inc. | End-to-end path delay measurements in a network |
-
2019
- 2019-12-09 CN CN201911252648.7A patent/CN112242950B/zh active Active
-
2020
- 2020-07-14 WO PCT/CN2020/101947 patent/WO2021008533A1/zh unknown
- 2020-07-14 EP EP20840937.5A patent/EP3975490A4/en active Pending
-
2022
- 2022-01-12 US US17/573,934 patent/US20220141121A1/en active Pending
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104735745A (zh) * | 2015-04-02 | 2015-06-24 | 吉林大学 | 一种异构自组织网络中虚拟骨干网的建立方法及装置 |
CN108574594A (zh) * | 2017-03-14 | 2018-09-25 | 华为技术有限公司 | 一种网络业务传输的方法及系统 |
US10230605B1 (en) * | 2018-09-04 | 2019-03-12 | Cisco Technology, Inc. | Scalable distributed end-to-end performance delay measurement for segment routing policies |
CN109922004A (zh) * | 2019-04-24 | 2019-06-21 | 清华大学 | 基于部分部署分段路由的IPv6网络的流量工程方法及装置 |
Non-Patent Citations (3)
Title |
---|
ANONYMOUS: "3rd Generation Partnership Prodect; Technical Specification Group Core Network and Terminals; Study on User Plane Protocol in 5GC.(Release 16)", 3GPP STANDARD; TECHNICAL REPORT; 3GPP TR 29.892, vol. CT WG4, no. V1.2.0, 2 September 2019 (2019-09-02), pages 1 - 49, XP051784469 * |
See also references of EP3975490A4 |
VENTRE, PIER LUIGI ET AL.: "SDN Architecture and Southbound APIs for IPv6 Segment Routing Enabled Wide Area Networks", IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 31 December 2018 (2018-12-31), XP081065473, DOI: 20200915150611A * |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113328893A (zh) * | 2021-06-10 | 2021-08-31 | 北京知道创宇信息技术股份有限公司 | 网络拓扑测绘完备性评估方法、系统、电子设备及计算机可读存储介质 |
CN114024876A (zh) * | 2021-10-15 | 2022-02-08 | 中国联合网络通信集团有限公司 | 一种网络拨测方法、装置、设备及存储介质 |
CN114024876B (zh) * | 2021-10-15 | 2023-06-16 | 中国联合网络通信集团有限公司 | 一种网络拨测方法、装置、设备及存储介质 |
CN114205290A (zh) * | 2021-12-10 | 2022-03-18 | 中国电子科技集团公司第十五研究所 | 一种用于行为体传播的数据处理方法及装置 |
CN117792981A (zh) * | 2024-02-28 | 2024-03-29 | 山东云海国创云计算装备产业创新中心有限公司 | 路由方法、装置、路由设备、路由管理设备和路由网络 |
CN117792981B (zh) * | 2024-02-28 | 2024-06-07 | 山东云海国创云计算装备产业创新中心有限公司 | 路由方法、装置、路由设备、路由管理设备和路由网络 |
Also Published As
Publication number | Publication date |
---|---|
CN112242950B (zh) | 2022-05-17 |
EP3975490A1 (en) | 2022-03-30 |
CN112242950A (zh) | 2021-01-19 |
EP3975490A4 (en) | 2022-08-03 |
US20220141121A1 (en) | 2022-05-05 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2021008533A1 (zh) | 确定路径的方法和相关设备 | |
US11570285B2 (en) | Packet processing method, network node, and system | |
US9940153B2 (en) | Method for generating configuration information, and network control unit | |
EP2882150B1 (en) | Physical path determination for virtual network packet flows | |
US9641420B1 (en) | Methods and apparatus for assessing the quality of a data path including both layer-2 and layer-3 devices | |
US10257086B2 (en) | Source imposition of network routes in computing networks | |
WO2020073908A1 (zh) | 一种发送路由信息的方法和装置 | |
CN111614505B (zh) | 报文处理的方法和网关设备 | |
Amamou et al. | A trill-based multi-tenant data center network | |
US10547500B1 (en) | Determining sources of network packet loss | |
WO2023093513A1 (zh) | 路径感知方法、装置及系统 | |
US11563662B2 (en) | Network latency estimation in distributed computing systems | |
US11362928B2 (en) | Method, electronic device and computer program product for generating network topology | |
US20100177772A1 (en) | Method and system for deriving tunnel path information in mpls networks | |
CN116530067A (zh) | 使用内部网关协议(interior gateway protocol,IGP)的边缘计算数据和服务发现 | |
US11431599B2 (en) | Network latency estimation in distributed computing systems | |
WO2023193498A1 (zh) | 网络的可靠性评估方法、装置、计算设备以及存储介质 | |
CN116584077A (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: 20840937 Country of ref document: EP Kind code of ref document: A1 |
|
ENP | Entry into the national phase |
Ref document number: 2020840937 Country of ref document: EP Effective date: 20211222 |
|
NENP | Non-entry into the national phase |
Ref country code: DE |