Software-defined network, nodes and path calculation method and device
A software-defined network and path calculation technology, applied in the field of communication, can solve the problem of paths that do not meet the actual traffic forwarding requirements, and achieve the effect of simple configuration
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
no. 1 example
[0028] figure 2 It is a flow chart of the path calculation method provided in the first embodiment of the present invention, consisting of figure 2 It can be seen that, in this embodiment, the path calculation method provided by the present invention includes:
[0029] S101: Determine the candidate node of the next hop node according to the topology network;
[0030] S102: Obtain constraint parameters of each candidate node;
[0031] S103: Select the target node of the next hop node from the candidate nodes according to the constraint conditions and the constraint parameters of each candidate node.
[0032] In some embodiments, when there are multiple target nodes, the path calculation method in the above embodiments further includes:
[0033] Obtain the communication cost value of each target node;
[0034] The target nodes are sorted according to the communication cost value.
[0035] In some embodiments, before determining the candidate node, the path calculation met...
no. 2 example
[0043] image 3 It is a schematic structural diagram of the path calculation device provided in the second embodiment of the present invention, which is represented by image 3 It can be seen that, in this embodiment, the path calculation device provided by the present invention includes: a candidate node module 31 and a target node module 32, wherein,
[0044] The candidate node module 31 is used to determine the candidate nodes of the next hop node according to the topological network, and obtain the constraint parameters of each candidate node;
[0045] The target node module 32 is used to select the target node of the next hop node from the candidate nodes according to the constraint parameters of the current node, the constraint parameters and constraints of each candidate node, and write the reachable path set table.
[0046] In some embodiments, the target node module 32 in the above embodiment is also used to sort the target nodes according to the communication cost v...
no. 3 example
[0056] The present invention will be further explained in combination with specific application scenarios.
[0057] This embodiment takes the network hierarchy required by the existing operator network as a constraint parameter as an example, and provides a shortest path algorithm with hierarchy constraints. This method is simple to configure, can well meet various path calculation requirements, and is compatible with existing operators. network.
[0058] In this embodiment, the network forwarding device management module on the SDN controller is used to increase the device level information. When calculating the next hop in the path calculation module, the shortest next hop that meets the conditions is selected according to the device level information. In this way, the SDN controller mainly include:
[0059] Network forwarding device management module: When adding a device, add the network layer where the device is located (access device<aggregation device<core device). In ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com