CN107465615B - Routing determination method based on layered multi-domain and controller - Google Patents
Routing determination method based on layered multi-domain and controller Download PDFInfo
- Publication number
- CN107465615B CN107465615B CN201710657780.0A CN201710657780A CN107465615B CN 107465615 B CN107465615 B CN 107465615B CN 201710657780 A CN201710657780 A CN 201710657780A CN 107465615 B CN107465615 B CN 107465615B
- Authority
- CN
- China
- Prior art keywords
- controller
- domain
- path
- node
- route
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 30
- 239000010410 layer Substances 0.000 claims description 114
- 230000011664 signaling Effects 0.000 claims description 27
- 239000011229 interlayer Substances 0.000 claims description 10
- 239000004576 sand Substances 0.000 claims description 3
- 238000005516 engineering process Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- VYMDGNCVAMGZFE-UHFFFAOYSA-N phenylbutazonum Chemical compound O=C1C(CCCC)C(=O)N(C=2C=CC=CC=2)N1C1=CC=CC=C1 VYMDGNCVAMGZFE-UHFFFAOYSA-N 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
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
- H04L45/04—Interdomain routing, e.g. hierarchical 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/302—Route determination based on requested QoS
- H04L45/306—Route determination based on the nature of the carried application
Abstract
The invention discloses a routing determination method based on layered multi-domain, comprising the following steps: acquiring source node information and sink node information in a service request; determining the type of the service request according to the source node information and the sink node information; and determining the optimal path of the route according to the type of the service request. The method provided by the invention utilizes the collaborative routing among the multiple controllers, can effectively improve the utilization rate of resources, reduces the cost of the controllers, and selects the path with the minimum cost as the optimal path.
Description
Technical Field
The invention relates to the technical field of information communication, in particular to a routing determination method and a controller based on layered multi-domain.
Background
A large-scale network is usually divided into multiple domains according to the differences of devices or different operators, and is cooperatively managed by multiple controllers. A hierarchical multi-domain based collaborative control technology has become a recognized large-scale network control technology solution in the industry and academia. The hierarchical multi-domain SDON architecture provides guarantee for normal operation of the network for continuous increase of network scale and data traffic.
Under the SDN network architecture, the existing kanduo architecture is a high-level application control framework based on the SDN network control platform proposed and designed in 2007 by soheil hassas yewaneh and the like, and is a novel distributed control plane, which is composed of two layers of controllers, a lower layer is a local controller for executing local application, and an upper layer is a logic centralized root controller for running non-local application programs. The structure changes the traditional single control plane structure, and a control plane structure with multiple control units is formed by distributed interconnection of a plurality of controller units. However, the distributed control plane of the two-layer controller cannot be used in a large-scale network architecture and provides efficient real-time management services to numerous network devices, so the hierarchical multi-domain cooperative control technology has become a recognized solution for large-scale network control technology in the industry and academia.
The prior art does not consider the situation that the controller manages both part of the sub-domain controller and part of the network elements directly, and the routing problem in this situation is not solved effectively.
Disclosure of Invention
Therefore, the technical problem to be solved by the present invention is to overcome the defect in the prior art that it is not possible to manage both part of the sub-domain controller and part of the network elements directly, thereby providing a hierarchical multi-domain based route determining method and controller.
The invention provides a routing determination method based on layered multi-domain, which is characterized by comprising the following steps:
acquiring source node information and sink node information in a service request;
determining the type of the service request according to the source node information and the sink node information;
and determining the optimal route of the route according to the type of the service request.
Further, the types of the request include a same-domain service request and a cross-domain service request.
When the service request is a service request in the same domain, the step of determining the optimal route of the route according to the type of the service request comprises the following steps:
determining a controller that manages the source node and sink node;
the controller calculates at least one candidate path according to the path building requirement, the constraint condition and the current network topology information, and determines a path with the minimum cost as an optimal path from the at least one candidate path.
Further, when both the source node and the sink node are directly managed by the sub-domain controller, controlling the controller to calculate at least one candidate path according to the routing requirement, the constraint condition and the current network topology information, and determining a path with the minimum cost as an optimal path from the at least one candidate path, including:
determining domains where the source node and the sink node are located by an upper layer controller;
the upper layer controller sends a route establishment signaling to a sub-domain controller of a domain where the source node and the sink node are located;
after receiving the route establishing signaling, a sub-domain controller of a domain in which the source node and the sink node are located calculates at least one candidate route according to the route establishing requirement, constraint conditions and current network topology information of an upper layer controller;
the sub-domain controller calculates the cost of the at least one candidate path, determines the path with the minimum cost as an optimal path, and returns the optimal path to the global controller of the top layer from the upper layer controller layer by layer;
and the global controller replies the optimal path to the entrance controller.
Further, when the source node and the sink node are directly managed by an inter-layer controller, the controller calculates at least one candidate path according to a routing requirement, a constraint condition, and current network topology information, and determines a path having a minimum cost as an optimal path from the at least one candidate path, including:
the controller of the layer where the source node and the sink node are located calculates at least one candidate path according to the route establishment requirement, the constraint condition and the current network topology information;
the controllers of the layers where the source node and the sink node are located calculate the cost of the at least one candidate path, determine the path with the minimum cost as an optimal path, and recurse to the global controller at the top layer by layer upwards;
and the global controller replies the optimal path to the entrance controller.
Further, when the service request is a cross-domain service request, the step of determining the optimal path of the route according to the type of the service request includes:
determining a controller that manages the source node and sink node;
and determining the border gateway nodes of the domains where the source node and the sink node are located, wherein the controller calculates at least one candidate path according to the border gateway nodes, the route establishment requirement, the constraint condition and the current network topology information, and determines the path with the minimum cost as the optimal path from the at least one candidate path.
Further, when the source node and the sink node are both directly managed by the sub-domain controller, the controller calculates at least one candidate path according to the routing requirement, the constraint condition and the current network topology information, and determines a path with the minimum cost as an optimal path from the at least one candidate path, including:
selecting a border gateway node GWs and a GWD of a domain in which the source node and the sink node are located by an upper layer controller respectively;
the upper layer controller determines GWs a domain sequence between the Gwd border gateway node;
selecting the border gateway nodes between traversed adjacent domains as peer nodes of the computation path;
a sub-domain controller of a domain where the source node is located sends a routing calculation request to the upper controller;
the upper layer controller calculates at least one candidate path based on the current abstract network topology according to the domain sequence and the selected peer-to-peer node, and sends a route establishment signaling to the traversed sub-domain controller;
after receiving the route establishing signaling, the traversed sub-domain controller respectively performs route establishment in the domain according to the route establishing requirement, the constraint condition and the current network topology information of the upper layer controller;
the sub-domain controllers respectively calculate the cost of the established path and return the cost to the global controller of the upper layer controller from layer to layer recursion to the top layer;
the global controller calculates the cost of the at least one candidate path based on the path cost information replied by the traversed sub-domain controller, and determines the path with the minimum cost as the optimal path;
and the global controller replies the optimal path to the entrance controller.
Further, when both the source node and the sink node are directly managed by an inter-layer controller, the step of controlling the controller to calculate at least one candidate path according to the routing requirement, the constraint condition and the current network topology information, and determining a path with the minimum cost as an optimal path from the at least one candidate path includes:
selecting a border gateway node GWs and a GWD of a domain in which the source node and the sink node are located by an upper layer controller respectively;
the upper layer controller determines GWs a domain sequence between the Gwd border gateway node;
selecting the border gateway nodes between traversed adjacent domains as peer nodes of the computation path;
the upper controller calculates at least one candidate path based on the current part of abstract network topology and the part of actual network topology according to the domain sequence and the selected peer node, and sends a routing signaling to the traversed sub-domain controller;
after receiving the route establishing signaling, the traversed sub-domain controller respectively performs route establishment in the domain according to the route establishing requirement, constraint conditions and current network topology information of the upper layer controller;
the sub-domain controllers respectively calculate the cost of the established path and return the cost to the global controller of the upper layer controller from layer to layer recursion to the top layer;
the global controller calculates the cost of the at least one candidate path based on the path cost information replied by the traversed sub-domain controller and the cost information of the network element directly managed by the upper controller traversed during path calculation, and determines the path with the minimum cost as the optimal path;
and the global controller replies the optimal path to the entrance controller.
Further, when one of the source node and the sink node is directly managed by the sub-domain controller and the other is directly managed by the upper layer controller, the step of controlling the controller to calculate at least one candidate path according to the routing requirement, the constraint condition and the current network topology information, and determine a path with the minimum cost as an optimal path from the at least one candidate path includes:
selecting a border gateway node GWs and a GWD of a domain in which the source node and the sink node are located by an upper layer controller respectively;
the upper layer controller determines GWs a domain sequence between the Gwd border gateway node;
selecting the border gateway nodes between traversed adjacent domains as peer nodes of the computation path;
a sub-domain controller of a domain where the source node is located sends a routing calculation request to the upper controller;
the upper controller calculates at least one candidate path based on the current part of abstract network topology and the part of actual network topology according to the domain sequence and the selected peer node, and sends a routing signaling to the traversed sub-domain controller;
after receiving the route establishing signaling, the traversed sub-domain controller respectively performs route establishment in the domain according to the route establishing requirement, the constraint condition and the current network topology information of the upper layer controller;
the sub-domain controllers respectively calculate the cost of the established path and return the cost to the global controller of the upper layer controller from layer to layer recursion to the top layer;
the global controller calculates the cost of the at least one candidate path based on the path cost information replied by the traversed sub-domain controller and the cost information of the network element directly managed by the upper controller traversed during path calculation, and determines the path with the minimum cost as the optimal path;
and the global controller replies the optimal path to the entrance controller.
Further, the optimal path of the cross-domain request is represented as:
op(ns，nd)＝op(ns，nbs)+op(nbs，nbd)+op(nbd,nd)，
wherein op (n)s，nd) Representing a source node nsAnd a sink node ndOptimal path between op (n)s，nbs) Representing a source node nsBorder gateway node n between adjacent domainsbsOptimal path between op (n)bs，nbd) Representing border gateway nodes n between adjacent domainsbsBorder gateway node n between adjacent domainsbdOptimal path between op (n)bd,nd) Representing border gateway nodes n between adjacent domainsbdAnd a sink node ndThe optimal path therebetween.
Accordingly, the present invention also provides a controller, comprising: the at least one processor and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to cause the at least one processor to perform the hierarchical multi-domain based route determination method.
The technical scheme of the invention has the following advantages: by acquiring the source node information and the destination node information in the service request, determining the type of the service request according to the source node information and the destination node information, and determining the optimal route of the route according to the type of the service request, the method considers the collaborative routing among the layered controllers, can effectively improve the utilization rate of resources, and reduce the cost of the controllers.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and other drawings can be obtained by those skilled in the art without creative efforts.
Fig. 1 is a composition diagram of a routing system based on a hierarchical multi-domain SDON architecture in an embodiment of the present invention;
fig. 2 is a flowchart of a specific example of a hierarchical multi-domain based route determination method according to an embodiment of the present invention;
FIG. 3 is a flowchart of a method for determining an optimal path according to an embodiment of the present invention;
FIG. 4 is a flowchart of another method for determining an optimal path according to an embodiment of the present invention;
FIG. 5 is a flowchart illustrating a third specific method for determining an optimal path according to an embodiment of the present invention;
fig. 6 is a flowchart of a fourth specific method for determining an optimal path according to an embodiment of the present invention;
fig. 7 is a flowchart of a fifth specific method for determining an optimal path according to an embodiment of the present invention;
fig. 8 is a schematic block diagram of a specific example of a controller according to an embodiment of the present invention.
Detailed Description
The technical solutions of the present invention will be described clearly and completely with reference to the accompanying drawings, and it should be understood that the described embodiments are some, but not all embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
In the description of the present invention, it is to be noted that, unless otherwise explicitly specified or limited, the terms "connected" and "connected" are to be interpreted broadly, e.g., as being fixed or detachable or integrally connected; can be mechanically or electrically connected; the two elements may be directly connected or indirectly connected through an intermediate medium, or may be communicated with each other inside the two elements, or may be wirelessly connected or wired connected. The specific meanings of the above terms in the present invention can be understood in specific cases to those skilled in the art.
In addition, the technical features involved in the different embodiments of the present invention described below may be combined with each other as long as they do not conflict with each other.
Fig. 1 shows a routing system based on a hierarchical multi-domain SDON architecture, where a top layer is a global controller, a network view of global abstraction is grasped, a lower control includes N layers of sub-domain controllers, the N layers of sub-domain controllers respectively manage respective domain topologies, the sub-domain controllers only grasp topology information of a local domain, and information interaction with other sub-domain controllers is realized by interacting with the global controller, or information interaction with other sub-domain controllers is realized by an interface. The network element nodes therein may be managed by the sub-domain controller, or may be directly managed by the upper layer manager thereof. The present embodiment provides a routing determination method based on hierarchical multiple domains, which is cooperatively executed by the above controllers, as shown in fig. 2, and includes the following steps:
s1: acquiring source node information and sink node information in a service request;
when the service comes to carry out routing calculation, the global controller firstly obtains the information of the source node s and the destination node d.
S2: determining the type of the service request according to the source node information and the sink node information;
the controller in the multi-domain SDON network manages part of sub-domain controllers and part of network elements directly, determines whether the nodes s and d belong to the same controller to be managed directly according to the information of the source node s and the sink node d, and judges whether the service belongs to the same-domain service or the cross-domain service, wherein the same-domain service is divided into two cases according to whether the nodes s and d are managed directly by an interlayer controller, ① s and d are managed directly by the sub-domain controllers, ② s and d are managed directly by the same-domain controller and an Nth (N is more than or equal to 2) layer controller, the cross-domain service is divided into three cases according to whether the nodes s and d are managed directly by the interlayer controller, ① s and d are spanned and are managed directly by the sub-domain controllers, ② s and d are spanned and are managed directly by the interlayer controllers, ③ s and d are spanned, s (or d) are managed directly by the sub-domain controllers, and d (or s) are managed directly by the.
S3: and determining the optimal path of the route according to the type of the service request.
And determining whether the source and destination nodes are directly managed by an upper controller or a sub-domain controller according to the information of the source and destination nodes, and finally determining k candidate paths, wherein the global controller selects the path with the minimum cost as the optimal path by calculating the cost of the k candidate paths.
According to the routing determination method based on the hierarchical multi-domain provided by the embodiment of the invention, the source node information and the destination node information in the service request are obtained, the type of the service request is determined according to the source node information and the destination node information, and the optimal route of the routing is determined according to the type of the service request.
In the first case, that is, when the service request is a service request in the same domain, the step S3 specifically includes:
s31, determining a controller for managing the source node and the sink node;
and S32, the controller calculates at least one candidate path according to the path building requirement, the constraint condition and the current network topology information, and determines the path with the minimum cost as the optimal path from the at least one candidate path.
Further, when the source node and the sink node in the request for the same-domain service are both directly managed by the sub-domain controller, as shown in fig. 3, the step S32 specifically includes:
s321a, determining the domains of the source node and the sink node by the upper controller;
s321b, the upper controller sends the route-establishing signaling to the sub-domain controller of the domain where the source node and the sink node are located;
s321c, after receiving the route establishing signaling, the sub-domain controller of the domain where the source node and the host node are located calculates at least one candidate route according to the route establishing requirement, the constraint condition and the current network topology information of the upper layer controller;
s321d, the sub-domain controller calculates the cost of at least one candidate path, determines the path with the minimum cost as the optimal path, and returns the optimal path to the upper layer controller to recur to the global controller at the top layer;
the global controller replies 321e to the ingress controller with the optimal path.
In this embodiment, the upper layer controller is a manager on a domain where the source node and the sink node are located, for example, the domain where the source node and the sink node are located is an N-1 layer controller, and then the upper layer controller is an nth layer controller, i.e., the nth layer controller issues a route establishment signaling to an N-1 layer controller of a sub-domain controller where the s node and the d node are located, and after receiving the route establishment signaling, the N-1 layer controller calculates k candidate paths by using a controller route calculation module according to a route establishment requirement, a constraint condition and current network topology information of the upper layer controller; and the sub-domain controller calculates the cost of the k candidate paths while establishing the path, and finally determines the path with the minimum cost as the optimal path after comparison. And the entrance controller comprises a controller in the domain where the s is located, the controller directly manages the s node, and after the optimal path is determined, the global controller replies the optimal path to the entrance controller.
When the source node and the sink node in the request of the same domain are directly managed by the inter-layer controller, as shown in fig. 4, the step S32 specifically includes:
s322a, the controller of the layer where the source node and the host node are located calculates at least one candidate path according to the path building requirement, the constraint condition and the current network topology information;
s322b, calculating the cost of at least one candidate path by the controllers of the layer where the source node and the sink node are located, determining the path with the minimum cost as the optimal path, and recursing to the global controller at the top layer from the upper layer to the lower layer;
s322, the global controller replies the optimal path to the ingress controller 322 c.
In the embodiment, the s node and the d node are in the same domain and are directly managed by the Nth (N is larger than or equal to 2) layer controller, the Nth (N is larger than or equal to 2) layer controller directly executes the controller route calculation module according to the route construction requirement, the constraint condition and the current network topology information, calculates k candidate routes, calculates the cost of the k candidate routes while constructing the route, and finally determines the route with the minimum cost as the optimal route.
In the second case, that is, when the service request is a cross-domain service request, the step S3 specifically includes:
s31', determining a controller for managing the source node and the sink node;
and S32', determining the border gateway nodes of the domain where the source node and the sink node are located, calculating at least one candidate path by the controller according to the border gateway nodes, the route establishment requirement, the constraint condition and the current network topology information, and determining the path with the minimum cost from the at least one candidate path as the optimal path.
Further, in the cross-domain request, when both the source node and the sink node are directly managed by the sub-domain controller, as shown in fig. 5, the step S32' specifically includes:
s32' 1a, selecting a boundary gateway node GWs and a Gwd of a domain where a source node and a sink node are located by an upper layer controller respectively;
s32' 1b, determining a domain sequence between GWs and the Gwd border gateway node by an upper layer controller;
s32' 1c, selecting the border gateway node between traversed adjacent domains as the peer node of the computation path;
s32' 1d, the sub-domain controller of the domain where the source node is located sends a route calculation request to an upper layer controller;
s32' 1e, the upper controller calculates at least one candidate path based on the current abstract network topology according to the domain sequence and the selected peer node, and sends a route establishing signaling to the traversed sub-domain controller;
s32' 1f, after the traversed sub-domain controller receives the route establishing signaling, respectively performing intra-domain route establishment according to the route establishing requirement, constraint condition and current network topology information of the upper layer controller;
s32' 1g, the sub-domain controllers respectively calculate the cost of the established path and return the cost to the upper layer controller and the global controller which recurs to the top layer by layer;
s32' 1h, the global controller calculates the cost of at least one candidate path based on the path cost information replied by the traversed sub-domain controller, and determines the path with the minimum cost as the optimal path;
s32' 1i the global controller replies to the ingress controller with the optimal path.
In this embodiment, the s-node and d-node upper controllers randomly calculate k candidate paths based on the current abstract network topology according to the domain sequence and the selected peer node, calculate the cost of the k candidate paths according to the path cost information replied by the sub-domain controller, and select the path with the minimum cost as the optimal path. When the cross-domain request is used for finding the optimal path, the peer nodes are utilized to improve the probability that the selected path is the optimal path, and the peer nodes are called as the peer nodes, namely the border gateway nodes of the adjacent domains. Global optimal results can be achieved as long as a suitable peer can be found.
In the cross-domain request, when both the source node and the sink node are directly managed by the inter-layer controller, as shown in fig. 6, the step S32' specifically includes:
s32' 2a, selecting a boundary gateway node GWs and a Gwd of a domain where a source node and a sink node are located by an upper layer controller respectively;
s32' 2b, the upper layer controller determines a domain sequence between GWs and the Gwd border gateway node;
s32' 2c, selecting the border gateway node between traversed adjacent domains as the peer node of the computation path;
s32' 2d, the upper controller calculates at least one candidate path based on the current part of abstract network topology and the part of actual network topology according to the domain sequence and the selected peer node, and sends a route establishing signaling to the traversed sub-domain controller;
s32' 2e, after the traversed subzone controller receives the route establishing signaling, respectively performing intra-zone route establishment according to the route establishing requirement, constraint condition and current network topology information of the upper layer controller;
s32' 2f, the sub-domain controllers respectively calculate the cost of the established path and return the cost to the upper layer controller and the global controller which recurs to the top layer by layer;
s32' 2g, the global controller calculates the cost of at least one candidate path based on the path cost information replied by the traversed sub-domain controller and the cost information of the network element directly managed by the upper controller traversed during path calculation, and determines the path with the minimum cost as the optimal path;
s32' 2h, the global controller replies the optimal path to the ingress controller.
In this embodiment, since the source node and the sink node are directly managed by the managers in different layers, the manager in the upper layer common to the source node and the sink node randomly calculates k candidate paths based on a part of the abstract network topology inside the current domain and a part of the actual network topology between network elements, and issues a route establishment signaling to the traversed sub-domain controller, where the path cost information returned by the traversed sub-domain controller and the cost information of the network elements directly managed by the upper layer controller during route calculation calculate the cost of the k candidate paths, and select the path with the smallest cost as the optimal path.
In the cross-domain request, when one of the source node and the sink node is directly managed by the sub-domain controller, and the other is directly managed by the upper controller, as shown in fig. 7, the step S32' specifically includes:
s32' 3a, selecting a border gateway node GWs and a Gwd of a domain where the source node and the sink node are respectively positioned by an upper layer controller;
s32' 3b, the upper layer controller determines a domain sequence between GWs and the Gwd border gateway node;
s32' 3c, selecting the border gateway node between traversed adjacent domains as the peer node of the computation path;
s32' 3d, the sub-domain controller of the domain where the source node is located sends a route calculation request to the upper controller;
s32' 3e, the upper controller calculates at least one candidate path based on the current part of abstract network topology and the part of actual network topology according to the domain sequence and the selected peer node, and sends a route establishing signaling to the traversed sub-domain controller;
s32' 3f, after the traversed subzone controller receives the route establishing signaling, respectively performing intra-zone route establishment according to the route establishing requirement, constraint condition and current network topology information of the upper layer controller;
s32' 3g, the sub-domain controllers respectively calculate the cost of the established path and return the cost to the upper layer controller and the global controller which recurs to the top layer by layer;
s32' 3h, the global controller calculates the cost of at least one candidate path based on the path cost information replied by the traversed sub-domain controller and the cost information of the network element directly managed by the upper controller traversed during path calculation, and determines the path with the minimum cost as the optimal path;
s32' 3i the global controller replies to the ingress controller with the optimal path.
In this embodiment, an s node (or d) is directly managed by a sub-domain controller, when the d node (or s) is directly managed by an interlayer controller, the sub-domain controller of the domain where the s node is located sends the d node (or s) to an upper controller, the common upper controller randomly calculates k candidate paths based on the current part of abstract network topology and the part of actual network topology, calculates the cost of the k candidate paths based on the path cost information replied by the traversed sub-domain controller and the cost information of the network element directly managed by the upper controller traversed during routing calculation, and finally selects the path with the minimum cost as the optimal path.
As a preferred implementation, the optimal path of the cross-domain request in this embodiment can be expressed as:
op(ns，nd)＝op(ns，nbs)+op(nbs，nbd)+op(nbd,nd)，
wherein op (n)s，nd) Representing a source node nsAnd a sink node ndOptimal path between op (n)s，nbs) Representing a source node nsBorder gateway node n between adjacent domainsbsOptimal path between op (n)bs，nbd) Representing border gateway nodes n between adjacent domainsbsBorder gateway node n between adjacent domainsbdOptimal path between op (n)bd,nd) Representing border gateway nodes n between adjacent domainsbdAnd a sink node ndThe optimal path therebetween.
If the ingress domain contains m border gateway nodes and the egress domain contains n border gateway nodes, then there are at most m x n peer nodes. When calculating the route, the probability that each pair of peer nodes can realize the global optimal path is 1/m n, if k pairs of peer nodes are selected, k candidate paths are established, then the optimal path is selected according to the cost function of each path, and the global optimal probability is improved to 1- (1-1/m n)kTherefore, as k increases, the probability that the result is the global optimum is higher, and the specific calculation in the domain is based on the controller calculation module.
Accordingly, the present embodiment further includes a controller, as shown in fig. 8, including: at least one processor 210 and a memory 220 communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to cause the at least one processor to perform a hierarchical multi-domain based route determination method. The system may further comprise: an input unit 230.
The processor 210, the memory 220, and the input unit 230 may be connected by a bus 200 or in other ways, and fig. 3 illustrates an example of a connection by the bus 200.
The memory 220, which is a non-transitory computer readable storage medium, may be used to store non-transitory software programs, non-transitory computer executable programs, and modules, such as program instructions/modules corresponding to the method for determining the shortest path between the electrical devices in the embodiment.
The processor 210 executes various functional applications of the server and data processing, i.e., the method in the present embodiment, by executing non-transitory software programs, instructions, and modules stored in the memory 220.
The input unit 230 may receive input numeric or character information and generate key signal inputs related to user settings and function control of the processing device operated by the list items.
The one or more modules are stored in the memory 220 and, when executed by the one or more processors 210, perform the method shown in fig. 2.
The product can execute the method provided by the embodiment of the invention, and has corresponding functional modules and beneficial effects of the execution method. For details of the technique not described in detail in the embodiment, reference may be made to the related description in the embodiment shown in fig. 2.
It should be understood that the above examples are only for clarity of illustration and are not intended to limit the embodiments. Other variations and modifications will be apparent to persons skilled in the art in light of the above description. And are neither required nor exhaustive of all embodiments. And obvious variations or modifications therefrom are within the scope of the invention.
Claims (6)
1. A method for determining a route based on a layered multi-domain is characterized by comprising the following steps:
acquiring source node information and sink node information in a service request;
determining the type of the service request according to the source node information and the sink node information, wherein the type of the request comprises a same-domain service request and a cross-domain service request;
determining an optimal route of a route according to the type of the service request;
when the service request is a service request in the same domain, the step of determining the optimal route of the route according to the type of the service request comprises the following steps:
determining a controller that manages the source node and sink node;
the controller calculates at least one candidate path according to the path building requirement, the constraint condition and the current network topology information, and determines a path with the minimum cost as an optimal path from the at least one candidate path; when the source node and the sink node are directly managed by an interlayer controller, the controlling the controller calculates at least one candidate path according to a routing requirement, a constraint condition and current network topology information, and determines a path with a minimum cost as an optimal path from the at least one candidate path, including:
the controller of the layer where the source node and the sink node are located calculates at least one candidate path according to the route establishment requirement, the constraint condition and the current network topology information;
the controllers of the layers where the source node and the sink node are located calculate the cost of the at least one candidate path, determine the path with the minimum cost as an optimal path, and recurse to the global controller at the top layer by layer upwards;
the global controller replies the optimal path to an entrance controller;
when the service request is a cross-domain service request and when the service request is a cross-domain service request, the step of determining the optimal route of the route according to the type of the service request includes:
determining a controller that manages the source node and sink node;
determining border gateway nodes of domains where the source node and the sink node are located, calculating at least one candidate path by the controller according to the border gateway nodes, a route building requirement, a constraint condition and current network topology information, and determining a path with minimum cost from the at least one candidate path as an optimal path; when the source node and the sink node are both directly managed by an interlayer controller, the step of controlling the controller to calculate at least one candidate path according to the path building requirement, the constraint condition and the current network topology information, and determining a path with the minimum cost as an optimal path from the at least one candidate path includes:
selecting a border gateway node GWs and a GWD of a domain in which the source node and the sink node are located by an upper layer controller respectively;
the upper layer controller determines GWs a domain sequence between the Gwd border gateway node;
selecting the border gateway nodes between traversed adjacent domains as peer nodes of the computation path;
the upper controller calculates at least one candidate path based on the current part of abstract network topology and the part of actual network topology according to the domain sequence and the selected peer node, and sends a routing signaling to the traversed sub-domain controller;
after receiving the route establishing signaling, the traversed sub-domain controller respectively performs route establishment in the domain according to the route establishing requirement, constraint conditions and current network topology information of the upper layer controller;
the sub-domain controllers respectively calculate the cost of the established path and return the cost to the upper-layer controller, and the cost is recurred to the global controller at the top layer;
the global controller calculates the cost of the at least one candidate path based on the path cost information replied by the traversed sub-domain controller and the cost information of the network element directly managed by the upper controller traversed during path calculation, and determines the path with the minimum cost as the optimal path;
and the global controller replies the optimal path to the entrance controller.
2. The method for determining the hierarchical multi-domain based route according to claim 1, wherein when the service request is a same-domain service request, and when the source node and the sink node are both directly managed by a sub-domain controller, controlling the controller to calculate at least one candidate path according to a routing requirement, a constraint condition and current network topology information, and determining a path with a minimum cost as an optimal path from the at least one candidate path comprises:
determining domains where the source node and the sink node are located by an upper layer controller;
the upper layer controller sends a route establishment signaling to a sub-domain controller of a domain where the source node and the sink node are located;
after receiving the route establishing signaling, a sub-domain controller of a domain in which the source node and the sink node are located calculates at least one candidate route according to the route establishing requirement, constraint conditions and current network topology information of an upper layer controller;
the sub-domain controller calculates the cost of the at least one candidate path, determines the path with the minimum cost as an optimal path, and returns the optimal path to the global controller of the top layer from the upper layer controller layer by layer;
and the global controller replies the optimal path to the entrance controller.
3. The method for determining a hierarchical multi-domain based route according to claim 1, wherein when the service request is a cross-domain service request, and when the source node and the sink node are both directly managed by a sub-domain controller, the step of controlling the controller to calculate at least one candidate path according to a routing requirement, a constraint condition, and current network topology information, and determine a path with a minimum cost as an optimal path from the at least one candidate path comprises:
selecting a border gateway node GWs and a GWD of a domain in which the source node and the sink node are located by an upper layer controller respectively;
the upper layer controller determines GWs a domain sequence between the Gwd border gateway node;
selecting the border gateway nodes between traversed adjacent domains as peer nodes of the computation path;
a sub-domain controller of a domain where the source node is located sends a routing calculation request to the upper controller;
the upper layer controller calculates at least one candidate path based on the current abstract network topology according to the domain sequence and the selected peer-to-peer node, and sends a route establishment signaling to the traversed sub-domain controller;
after receiving the route establishing signaling, the traversed sub-domain controller respectively performs route establishment in the domain according to the route establishing requirement, the constraint condition and the current network topology information of the upper layer controller;
the sub-domain controllers respectively calculate the cost of the established path and return the cost to the global controller of the upper layer controller from layer to layer recursion to the top layer;
the global controller calculates the cost of the at least one candidate path based on the path cost information replied by the traversed sub-domain controller, and determines the path with the minimum cost as the optimal path;
and the global controller replies the optimal path to the entrance controller.
4. The hierarchical multi-domain based route determination method according to claim 1, wherein when the service request is a cross-domain service request, when one of the source node and the sink node is directly managed by a sub-domain controller and the other is directly managed by an upper controller, the step of controlling the controller to calculate at least one candidate path according to a routing requirement, a constraint condition and current network topology information, and determine a path having a minimum cost as an optimal path from the at least one candidate path comprises:
selecting a border gateway node GWs and a GWD of a domain in which the source node and the sink node are located by an upper layer controller respectively;
the upper layer controller determines GWs a domain sequence between the Gwd border gateway node;
selecting the border gateway nodes between traversed adjacent domains as peer nodes of the computation path;
a sub-domain controller of a domain where the source node is located sends a routing calculation request to the upper controller;
the upper controller calculates at least one candidate path based on the current part of abstract network topology and the part of actual network topology according to the domain sequence and the selected peer node, and sends a routing signaling to the traversed sub-domain controller;
after receiving the route establishing signaling, the traversed sub-domain controller respectively performs route establishment in the domain according to the route establishing requirement, the constraint condition and the current network topology information of the upper layer controller;
the sub-domain controllers respectively calculate the cost of the established path and return the cost to the global controller of the upper layer controller from layer to layer recursion to the top layer;
the global controller calculates the cost of the at least one candidate path based on the path cost information replied by the traversed sub-domain controller and the cost information of the network element directly managed by the upper controller traversed during path calculation, and determines the path with the minimum cost as the optimal path;
and the global controller replies the optimal path to the entrance controller.
5. The hierarchical multi-domain based route determination method according to any of claims 3-4, wherein the optimal path is represented as:
op(ns，nd)＝op(ns，nbs)+op(nbs，nbd)+op(nbd,nd)，
wherein op (n)s，nd) Representing a source node nsAnd a sink node ndOptimal path between op (n)s，nbs) Representing a source node nsBorder gateway node n between adjacent domainsbsOptimal path between op (n)bs，nbd) Representing border gateway nodes n between adjacent domainsbsWith neighboring domainsInter border gateway node nbdOptimal path between op (n)bd,nd) Representing border gateway nodes n between adjacent domainsbdAnd a sink node ndThe optimal path therebetween.
6. A controller, comprising: the at least one processor and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to cause the at least one processor to perform the method for hierarchical multi-domain based routing determination of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710657780.0A CN107465615B (en) | 2017-08-03 | 2017-08-03 | Routing determination method based on layered multi-domain and controller |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710657780.0A CN107465615B (en) | 2017-08-03 | 2017-08-03 | Routing determination method based on layered multi-domain and controller |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107465615A CN107465615A (en) | 2017-12-12 |
| CN107465615B true CN107465615B (en) | 2020-05-05 |
Family
ID=60548277
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710657780.0A Active CN107465615B (en) | 2017-08-03 | 2017-08-03 | Routing determination method based on layered multi-domain and controller |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107465615B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111030928A (en) * | 2018-10-10 | 2020-04-17 | ***通信有限公司研究院 | Routing information determination method, node, system and storage medium |
| CN111083177B (en) * | 2018-10-19 | 2022-10-11 | 中国电子科技集团公司第十五研究所 | Cross-domain collaborative interaction method based on collaborative gateway |
| CN110336753B (en) * | 2019-06-19 | 2021-10-22 | 腾讯科技（深圳）有限公司 | Cross-network-area service calling method, device, equipment and storage medium |
| CN111163005B (en) * | 2019-12-16 | 2021-06-15 | 联想(北京)有限公司 | Information processing method, device, terminal and storage medium |
| CN111211890A (en) * | 2019-12-31 | 2020-05-29 | 江苏省未来网络创新研究院 | SDN-based network security defense system and working method thereof |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101699803A (en) * | 2009-11-02 | 2010-04-28 | 北京科技大学 | Inter-domain routing method based on distribution type multi-layer multi-domain optical network |
| CN104009871A (en) * | 2014-06-06 | 2014-08-27 | 中国科学院声学研究所 | SDN controller implementation method and SDN controller |
| EP2784993A1 (en) * | 2013-03-29 | 2014-10-01 | Alcatel Lucent | Method and device for setting up paths between network elements belonging to different network domains of a software-defined network |
| CN104702512A (en) * | 2013-12-06 | 2015-06-10 | 智梵网络科技有限公司 | Hierarchical control in software-defined network (sdn) |
| CN104780056A (en) * | 2014-01-13 | 2015-07-15 | 中国联合网络通信集团有限公司 | Network management method and equipment |
| CN105282025A (en) * | 2014-07-11 | 2016-01-27 | 中兴通讯股份有限公司 | Method of determining end-to-end routing and apparatus thereof |
| CN105577540A (en) * | 2015-12-08 | 2016-05-11 | 中国联合网络通信集团有限公司 | Service link establishment method, device and system |
| CN105656771A (en) * | 2014-11-12 | 2016-06-08 | ***通信集团公司 | Service path determining method, device and system |
| CN106302153A (en) * | 2015-05-11 | 2017-01-04 | 中兴通讯股份有限公司 | Multiple domain controller, single domain controller, software definition optical network system and method |
| CN106375214A (en) * | 2016-11-10 | 2017-02-01 | 北京邮电大学 | SDN-based tiered routing path determination method and device |
| CN106817306A (en) * | 2015-11-27 | 2017-06-09 | ***通信集团设计院有限公司 | A kind of method and device for determining target route |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10404571B2 (en) * | 2015-12-29 | 2019-09-03 | Futurewei Technologies, Inc. | Communication among network controllers |
-
2017
- 2017-08-03 CN CN201710657780.0A patent/CN107465615B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101699803A (en) * | 2009-11-02 | 2010-04-28 | 北京科技大学 | Inter-domain routing method based on distribution type multi-layer multi-domain optical network |
| EP2784993A1 (en) * | 2013-03-29 | 2014-10-01 | Alcatel Lucent | Method and device for setting up paths between network elements belonging to different network domains of a software-defined network |
| CN104702512A (en) * | 2013-12-06 | 2015-06-10 | 智梵网络科技有限公司 | Hierarchical control in software-defined network (sdn) |
| CN104780056A (en) * | 2014-01-13 | 2015-07-15 | 中国联合网络通信集团有限公司 | Network management method and equipment |
| CN104009871A (en) * | 2014-06-06 | 2014-08-27 | 中国科学院声学研究所 | SDN controller implementation method and SDN controller |
| CN105282025A (en) * | 2014-07-11 | 2016-01-27 | 中兴通讯股份有限公司 | Method of determining end-to-end routing and apparatus thereof |
| CN105656771A (en) * | 2014-11-12 | 2016-06-08 | ***通信集团公司 | Service path determining method, device and system |
| CN106302153A (en) * | 2015-05-11 | 2017-01-04 | 中兴通讯股份有限公司 | Multiple domain controller, single domain controller, software definition optical network system and method |
| CN106817306A (en) * | 2015-11-27 | 2017-06-09 | ***通信集团设计院有限公司 | A kind of method and device for determining target route |
| CN105577540A (en) * | 2015-12-08 | 2016-05-11 | 中国联合网络通信集团有限公司 | Service link establishment method, device and system |
| CN106375214A (en) * | 2016-11-10 | 2017-02-01 | 北京邮电大学 | SDN-based tiered routing path determination method and device |
Non-Patent Citations (1)
| Title |
|---|
| 《基于SDN的空间信息网络多路径承载策略》;田睿，郁小松等;《无线电工程》;20161230;第46卷(第12期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107465615A (en) | 2017-12-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107465615B (en) | Routing determination method based on layered multi-domain and controller | |
| EP2989749B1 (en) | Network resource monitoring | |
| CN103051565B (en) | A kind of architecture system and implementation method of grade software defined network controller | |
| CN104702512B (en) | The multi-level control system and computer implemented method of network management are provided for software defined network | |
| CN109067579B (en) | 5G network slice topology design and reliable mapping method for failure of bottom node | |
| CN103477612B (en) | Expanded to connect the cloud service control of network level and management framework | |
| CN103098420B (en) | Traffic engineered as the automation of the 802.1AQ breaking the feedback in mechanism to draw based on use link utilization | |
| CN104301256A (en) | Method for dynamically reserving bandwidths in SDN and controller | |
| Sun et al. | Towards provisioning hybrid virtual networks in federated cloud data centers | |
| CN105229968A (en) | For the method and system that the bandwidth aware service of service chaining is arranged | |
| CN104753713A (en) | SDN (Self-Defending Network) service deployment method and SDN controller | |
| CN108809794B (en) | SDN-based transport network virtual network creating method and device and transport network system | |
| CN103888360A (en) | Method for integrating covering method to obtain service node in SDN based on greedy algorithm | |
| US10237202B2 (en) | Network control device, network control method, and recording medium for program | |
| CN104144143B (en) | Method and control device that network is set up | |
| CN109286528A (en) | A kind of SDN network multi-controller dispositions method based on time delay | |
| CN101471879A (en) | Path control system and method for layering ordered address grouping network | |
| CN115714741A (en) | Routing decision method and system based on collaborative multi-agent reinforcement learning | |
| CN105430538B (en) | A kind of inter-domain routing method based on optical-fiber network subtopology figure | |
| US20160241469A1 (en) | Multi-layer network control method and device | |
| CN115277578B (en) | Service arrangement method, device and storage medium | |
| CN114205243B (en) | Logic topology hierarchical layout method for comprehensive hierarchical partition | |
| CN106716935B (en) | cross-layer service configuration method and controller | |
| CN104301220A (en) | Path computation elements, path computation client-terminal and load sharing method and system | |
| CN113660675A (en) | Automatic opening method and device for 5G special line bearing network segment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Address after: 102209 18 Riverside Avenue, Changping District science and Technology City, Beijing Applicant after: Global energy Internet Institute, Inc. Applicant after: Beijing University of Posts and Telecommunications Applicant after: State Grid Zhejiang Electric Power Company Applicant after: State Grid Corporation of China Address before: 102209 18 Riverside Avenue, Changping District science and Technology City, Beijing Applicant before: Global energy Internet Institute, Inc. Applicant before: Beijing University of Posts and Telecommunications Applicant before: State Grid Zhejiang Electric Power Company Applicant before: State Grid Corporation of China |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |