WO2019218649A1 - Method and device for acquiring route of software-defined network and storage medium - Google Patents

Method and device for acquiring route of software-defined network and storage medium Download PDF

Info

Publication number
WO2019218649A1
WO2019218649A1 PCT/CN2018/119604 CN2018119604W WO2019218649A1 WO 2019218649 A1 WO2019218649 A1 WO 2019218649A1 CN 2018119604 W CN2018119604 W CN 2018119604W WO 2019218649 A1 WO2019218649 A1 WO 2019218649A1
Authority
WO
WIPO (PCT)
Prior art keywords
sdn
node
route
sub
domain
Prior art date
Application number
PCT/CN2018/119604
Other languages
French (fr)
Chinese (zh)
Inventor
杨军
何桓
Original Assignee
南京中兴新软件有限责任公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 南京中兴新软件有限责任公司 filed Critical 南京中兴新软件有限责任公司
Publication of WO2019218649A1 publication Critical patent/WO2019218649A1/en

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • H04L45/04Interdomain routing, e.g. hierarchical routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/12Shortest path evaluation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/12Shortest path evaluation
    • H04L45/123Evaluation of link metrics
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/64Routing or path finding of packets in data switching networks using an overlay routing layer

Definitions

  • the present invention relates to the field of communications technologies, and in particular, to a route acquisition method, apparatus, and storage medium for a Software Defined Network (SDN).
  • SDN Software Defined Network
  • SDN can realize more open, flexible, and intelligent network resource management, scheduling, and maintenance, which also brings new challenges.
  • 5G, 5th-Generation the network scale will increase dramatically.
  • the SDN architecture with hierarchical and domain division can realize the deployment and expansion of large-scale SDN networks.
  • single-domain routing technology is no longer suitable for computing cross-domain end-to-end routing.
  • For SDN cross-domain routing computing solutions there is no accurate acquisition in related technologies.
  • the shortest path routing scheme for SDN is shortest path routing scheme for SDN.
  • the embodiments of the present invention provide a method, a device, and a storage medium for acquiring an SDN, which at least solve the problems in the prior art, and can accurately obtain the shortest path route of the SDN.
  • An embodiment of the present invention provides a method for obtaining a route of an SDN, where the SDN includes at least two sub-domains, and the method includes:
  • the node status includes at least: a node mileage, and a previous hop node of the node;
  • the shortest path route of each of the extracted sub-domains is connected to obtain a first shortest path route of the SDN.
  • the SDN includes at least two network levels; and correspondingly, the initializing the SDN includes:
  • the link weights of the links in the available network topology are determined according to the route acquisition request, the obtained boundary nodes of each sub-domain in the SDN are stored, and the node states of the sub-domain nodes are initialized.
  • the acquiring the available network topologies of the sub-domains of each network level in the SDN, and the boundary nodes of each sub-domain in the SDN include:
  • the updating the node status of each sub-domain in the SDN includes:
  • the updating the node status of the node of the sub-domain network where the routing start point of the SDN is located includes:
  • the node state of the node of the other sub-domain of the SDN is iteratively updated based on the node status of the boundary node of the sub-domain where the routing start point of the SDN is updated, including:
  • the node state of the nodes of the other sub-domains of the SDN is iteratively updated.
  • the shortest path route extraction is performed on each of the subdomains, including:
  • the node status of the node of the sub-domain where the routing end point of the SDN is located starting from the routing end point of the SDN, obtaining the shortest path routing of the sub-domain where the routing end point of the SDN is located;
  • the iteratively obtaining the shortest path route of the other sub-domains of the SDN according to the obtained shortest path route including:
  • the route origin of the last shortest path route obtained by the iteration is the route start point of the SDN.
  • the method further includes:
  • the acquiring the second shortest path route of the SDN different from the first shortest path route includes:
  • the updating the link weight of the link in each subdomain according to the preset weight policy includes:
  • w'(u,v) is the link weight between the updated node u and node v
  • w(u,v) is the original link weight between node u and node v
  • d(A,v) ) is the mileage of the node v from the routing start point A of the SDN
  • d(A, u) is the mileage of the node u from the routing start point A of the SDN.
  • the method further includes:
  • the method further includes:
  • the determined overlapping links are deleted to obtain a shortest separated path pair consisting of one working path and one shortest path as a protection path.
  • the route acquisition request of the SDN carries at least one of the following information:
  • a route identifier ID corresponding to the route acquisition request a sender ID corresponding to the route acquisition request, a receiver ID corresponding to the route acquisition request, a service level corresponding to the route acquisition request, and a route acquisition request.
  • the service type, the request type corresponding to the route acquisition request, and the request parameter corresponding to the route acquisition request are the same.
  • the embodiment of the invention further provides a route acquisition device for an SDN, the device comprising:
  • An initialization module configured to initialize the SDN in response to the received route acquisition request of the SDN
  • An update module configured to update a node status of each sub-domain in the SDN; the node status includes at least: a node mileage, and a previous hop node of the node;
  • the extracting module is configured to perform shortest path routing extraction for each of the subdomains based on the updated node status of each subdomain, and connect the extracted shortest path routes of each of the subdomains to obtain the SDN number A shortest path route.
  • the SDN includes at least two network levels; correspondingly,
  • the initialization module is further configured to acquire an available network topology of each sub-domain of each network level in the SDN, and a boundary node of each sub-domain in the SDN, and initialize a node status of each sub-domain;
  • the initialization module is further configured to: extract the routing policy and the boundary node of the SDN from the received route obtaining request;
  • the available network topologies of the sub-domains of each network level in the SDN, and the boundary nodes of each sub-domain in the SDN are sequentially acquired according to the order of the network level from high to low.
  • the updating module is further configured to update a node state of a node of the subdomain where the routing start point of the SDN is located, based on a routing start point of the SDN;
  • the update module is further configured to use a routing start point of the SDN as a routing start point of the sub-domain in which the SDN is located, and determine a node mileage of the node in the sub-domain where the routing start point of the SDN is located from the starting point of the routing, and The previous hop node of the node of the sub-domain network where the routing start point of the SDN is located.
  • the update module is further configured to acquire an inter-domain link relationship of each sub-domain in the SDN.
  • the node state of the nodes of the other sub-domains of the SDN is iteratively updated.
  • the extracting module is further configured to extract a routing end point of the SDN from the received route obtaining request;
  • the node status of the node of the sub-domain where the routing end point of the SDN is located starting from the routing end point of the SDN, obtaining the shortest path routing of the sub-domain where the routing end point of the SDN is located;
  • the extracting module is further configured to determine, according to the obtained shortest path route, a route backtracking node of the subdomain connected to the subdomain where the routing end point of the SDN is located;
  • the route origin of the last shortest path route obtained by the iteration is the route start point of the SDN.
  • the initialization module is further configured to determine a service type corresponding to the route of the SDN according to the route acquisition request of the SDN;
  • the update module is further configured to update a node state of a node of each subdomain in the SDN based on the updated link weight of the link in each subdomain;
  • the extracting module is further configured to obtain a second shortest path route of the SDN different from the first shortest path route, based on the node status of the node of each subdomain in the updated SDN.
  • the initialization module is further configured to update link weights of links in each subdomain according to the following formula:
  • w'(u,v) is the link weight between the updated node u and node v
  • w(u,v) is the original link weight between node u and node v
  • d(A,v) ) is the mileage of the node v from the routing start point A of the SDN
  • d(A, u) is the mileage of the node u from the routing start point A of the SDN.
  • the initialization module is further configured to set a forward link weight of the first shortest path route to be not less than a weight threshold, and set a reverse link weight of the first shortest path route to be zero.
  • the extracting module is further configured to determine a link that overlaps between the first shortest path route of the SDN and the second shortest path route;
  • the determined overlapping links are deleted to obtain a shortest separated path pair consisting of one working path and one shortest path as a protection path.
  • the route acquisition request of the SDN carries at least one of the following information:
  • a route identifier ID corresponding to the route acquisition request a sender ID corresponding to the route acquisition request, a receiver ID corresponding to the route acquisition request, a service level corresponding to the route acquisition request, and a route acquisition request.
  • the service type, the request type corresponding to the route acquisition request, and the request parameter corresponding to the route acquisition request are the same.
  • the embodiment of the invention further provides a route acquisition device for an SDN, the device comprising:
  • a memory configured to store an executable program
  • the processor configured to execute the executable program stored in the memory, implements the route acquisition method of the SDN described above.
  • the embodiment of the present invention further provides a storage medium, where an executable program is stored, and when the executable program is executed by the processor, the route obtaining method of the SDN is implemented.
  • the node status of each sub-domain in the SDN is updated, and then the sub-domains of each sub-domain are updated according to the updated node status of each sub-domain.
  • the shortest path is extracted, and the shortest path route of each subdomain extracted by the connection is obtained to obtain the shortest path route of the SDN. In this way, the shortest path routing of the SDN can be accurately obtained, the computational complexity is reduced, and the computational efficiency of the shortest path of the SDN is improved.
  • FIG. 1 is a schematic diagram of an optional hierarchical controller architecture of an SDN according to an embodiment of the present invention
  • FIG. 2 is a schematic diagram of a network architecture of an optional SDN according to an embodiment of the present invention.
  • FIG. 3 is a schematic flowchart of a method for obtaining an SDN route according to an embodiment of the present disclosure
  • 4A is a schematic diagram of a format of an optional request packet according to an embodiment of the present invention.
  • 4B is a schematic diagram of a format of an optional response packet according to an embodiment of the present invention.
  • FIG. 5 is a schematic diagram of an SDN after initialization according to an embodiment of the present invention.
  • 6A is a schematic diagram of updating a node state of a sub-domain 1 according to an embodiment of the present invention
  • 6B is a schematic diagram of updating node states of sub-domain 3 and sub-domain 2 according to an embodiment of the present invention
  • 6C is a schematic diagram of updating node states of sub-domain 3 and sub-domain 4 according to an embodiment of the present invention.
  • 6D is a schematic diagram of updating a node state of a sub-domain 2 according to an embodiment of the present invention.
  • 6E is a schematic diagram of updating a node state of a sub-domain 4 according to an embodiment of the present invention.
  • FIG. 7 is a schematic diagram of a first shortest path routing of an SDN according to an embodiment of the present invention.
  • FIG. 8 is a schematic diagram of a sub-domain topology after re-adjusting link weights according to an embodiment of the present invention.
  • FIG. 9 is a schematic diagram of a second shortest path routing of an SDN according to an embodiment of the present invention.
  • FIG. 10 is a schematic diagram of merging a first shortest path route and a second shortest path route according to an embodiment of the present invention.
  • FIG. 11 is a schematic diagram of a shortest path routing pair corresponding to a route protection policy obtained according to an embodiment of the present disclosure
  • FIG. 12 is a schematic diagram of an SDN cross-domain routing scenario in which a multi-vendor device is connected according to an embodiment of the present invention
  • FIG. 13 is a schematic diagram of dividing a 5G metropolitan area network into 9 virtual sub-domains according to an area according to an embodiment of the present disclosure
  • FIG. 14 is a schematic structural diagram of a device for acquiring an SDN route according to an embodiment of the present disclosure
  • FIG. 15 is a schematic diagram of an optional hardware structure of an SDN route obtaining apparatus according to an embodiment of the present invention.
  • first ⁇ second ⁇ third according to the embodiment of the present invention is only a similar object, and does not represent a specific ordering for an object. It can be understood that “first ⁇ second ⁇ The three” may be interchanged in a specific order or order. It is to be understood that the "first ⁇ second ⁇ third” distinguished objects may be interchanged as appropriate to enable the embodiments of the invention described herein to be carried out in a sequence other than those illustrated or described herein.
  • the term "comprises”, “comprises” or any other variations thereof is intended to cover a non-exclusive inclusion, such that a method or apparatus comprising a series of elements includes not only the elements that are specifically recited but also Other elements not explicitly listed, or elements that are inherent to the implementation of the method or device.
  • an element defined by the phrase “comprising a " does not exclude the presence of additional related elements in the method or device including the element (eg, a step in the method or a module in the device)
  • the module here can be part of a circuit, part of a processor, part of a program or software, etc.).
  • the route obtaining method of the SDN provided by the embodiment of the present invention includes a series of steps, but the method for obtaining the route of the SDN provided by the embodiment of the present invention is not limited to the steps described, and similarly, the SDN provided by the embodiment of the present invention
  • the route acquisition device includes a series of modules, but the route acquisition device of the SDN provided by the embodiment of the present invention is not limited to including the explicitly described module, and may further include a unit that needs to be set to acquire relevant information or process based on the information.
  • the routing calculation of the SDN can be implemented by the following two distributed cross-domain routing calculation methods:
  • the PD route calculation method For each domain (PD, Per-Domain) method, the PD route calculation method needs to obtain the sub-domain or the cross-domain port that the cross-domain path passes in advance, and then start from the sub-domain where the source end (route start point) is located. The path from the source to the egress of the sub-domain is complete, and the label switching path (LSP) is established through the RSVP-TE protocol. After the next sub-domain receives the road-building signaling, the same operation is performed to complete the path calculation in the domain. , thereby completing the route calculation and completing the end-to-end path.
  • the routing calculation using the implementation method is inefficient, and can only cope with a cross-domain network with a simple structure. For a complex cross-domain network with a sub-domain network distribution, the determined route cannot be guaranteed to be the global shortest path, and it is usually difficult to calculate and separate. Protection path.
  • the Backward-Recursive PCE-Based Computation (BRPC) method uses the BRPC method to first determine the sub-domain through which the cross-domain path passes, forming a Path Computation Element (PCE) chain, and then The end node (route end point) starts to calculate the shortest path to all the outbound ports of the domain to form a virtual shortest path tree (VSPT), and transmits the VSPT to the previous PCE in the PCE chain, and the PCE will The VSPT is merged with its topology to obtain a new VSPT and forwarded until the source node is located.
  • the source PCE determines the shortest path from the VSPT obtained by the local domain as the route calculation result.
  • the application of the route calculation method can ensure the shortest path only when the sub-domains are serially arranged. When the sub-domain is distributed, the calculation result is affected by the selected PCE chain, and the obtained path is not necessarily the shortest.
  • the PD method and the BRPC method are optimized and extended to obtain a topology abstract method for calculating cross-domain routing.
  • a PCE chain is determined, and then each sub-domain will be between the intra-domain boundary nodes.
  • the path is returned to the upper controller in the form of an abstract topology, and the upper controller selects a shortest path from it.
  • applying this method also fails to reliably obtain the global shortest path, and the amount of calculation is very large.
  • the calculation of the cross-domain path may be implemented by using the hierarchical PCE.
  • the calculation manner is similar to the above-mentioned topology abstraction method. It is necessary to exhaust all the sub-domain intra-domain paths according to the inter-domain link, and the calculation amount is large, and only applicable. In a small cross-domain network.
  • the foregoing methods for implementing the route calculation of the SDN cannot implement the same sub-domain update multiple times, and the obtained cross-domain path cannot pass through the same sub-domain multiple times.
  • a special case the network topology of the SDN as shown in FIG. 5
  • the cross-domain shortest path from the A node to the Z node it is impossible to obtain the global shortest path no matter how the selected sub-domain sequence is selected.
  • the embodiment of the present invention provides a method for obtaining an SDN route, and the method for obtaining the route of the SDN can be implemented by a controller in the SDN.
  • the SDN controller in the implementation of the present invention is first described.
  • FIG. 1 is a schematic diagram of an optional SDN hierarchical controller architecture according to an embodiment of the present invention.
  • Each hierarchical controller may be deployed in a network management room in a different area or a different machine deployed in the same network management room according to the geographic location of the sub-domain. On the shelf.
  • the hierarchical controller architecture of the embodiment of the present invention corresponds to a layered architecture of SDN, and adopts a multi-controller manner to improve the processing capability of the overall controller.
  • an overall network can also be manually divided.
  • a layered architecture is formed, such as dividing a 5G metropolitan area network into multiple sub-domains of a hierarchical structure.
  • the SDN includes four sub-domains: a sub-domain 11, a sub-domain 12, a sub-domain 13, and a sub-domain 14.
  • the sub-domain 11 is controlled by the controller 1
  • the sub-domain 12 is controlled by the controller 2.
  • the sub-domain 13 is controlled by the controller 3
  • the sub-domain 14 is controlled by the controller 4, and the controller 1 to the controller 4 respectively grasp the intra-domain information of the corresponding sub-domain, and the connection between the sub-domains (ie, the inter-domain link) ) is not perceived.
  • the sub-domain 11 and the sub-domain 12 constitute a higher-level sub-domain 21, and the sub-domain 13 and the sub-domain 14 constitute a higher-level sub-domain 22, and the sub-domain 21 is controlled by the controller 5, and the sub-domain 22 is controlled.
  • the controller 6 controls, and the controller 5 of the layer can only know the inter-domain connection between the sub-domain 11 and the sub-domain 12 (ie, the inter-domain link), and the intra-domain information of the sub-domain 11 and the sub-domain 12 (eg, It is not known in the intra-domain topology that the controller 6 can only know the inter-domain connection between the sub-domain 13 and the sub-domain 14, and the intra-domain information of the sub-domain 13 and the sub-domain 14 is not known.
  • the sub-domain 21 and the sub-domain 22 constitute a top-level network of the SDN
  • the controller 7 is a top-level controller of the SDN, which can only know the inter-domain connection between the sub-domain 21 and the sub-domain 22, and the sub-domain 21 and the sub-domain 21
  • the intra-domain information of the domain 22 and the intra-domain information of the sub-domain 11 to the sub-domain 14 are not known.
  • the top controller 7 is connected to the service manager to receive the route acquisition task delivered by the service manager through the route acquisition request.
  • the controller shown in Figure 1 is divided into three levels, namely top controller 7, intermediate layer controller 5 and controller 6, and bottom controllers 1 to 4; in practical applications, SDN points
  • the layer controller architecture is not limited to this, and may be, for example, divided into four levels or two levels.
  • the available network topology of the upper subdomain is composed of the interdomain links of the lower subdomain, and the boundary nodes of the lower subdomain constitute the nodes of the available topology of the sublayer of the layer.
  • FIG. 2 is a schematic diagram of a network architecture of an optional SDN according to an embodiment of the present invention.
  • the SDN cross-domain network shown in FIG. 2 can be regarded as a network architecture view obtained from a perspective of a top controller, and in FIG. 2, the control is performed.
  • the hierarchical structure of the device is two layers, which are top controller 0, subdomain controller 01, subdomain controller 02, subdomain controller 03, and subdomain controller 04; wherein subdomain controllers 01 to 04 respectively use In sub-domain 1 to sub-domain 4, controller 0 can only acquire (perceive) the inter-domain link relationship of each sub-domain.
  • FIG. 3 is a schematic flowchart of a method for obtaining a route of an SDN according to an embodiment of the present invention.
  • a method for obtaining a route of an SDN according to an embodiment of the present invention involves steps 101 and 104, which are respectively described next.
  • Step 101 Receive a route acquisition request of the SDN, and initialize the SDN.
  • the service manager generates a route calculation task according to actual service requirements, and delivers a corresponding route acquisition request to the top controller of the SDN.
  • the route acquisition request of the SDN carries at least one of the following: a route identifier ID corresponding to the route acquisition request, a sender ID corresponding to the route acquisition request, a receiver ID corresponding to the route acquisition request, and a route acquisition request.
  • the request sent by the service manager and the controller adopts a request message in a unified format, as shown in FIG. 4A, which is a schematic diagram of a format of the request packet, including: a route ID and a sender ID. , receiver ID, service level, service type, request type, request parameters.
  • the route ID is set to identify the route calculation task corresponding to the request, which facilitates the batch delivery and processing of the route acquisition request.
  • the sender ID set to identify the sender of the request.
  • Receiver ID set to identify the recipient of the request.
  • the service level is set to identify the priority of the route calculation task corresponding to the request; for example, the priority of the fast reroute task should be higher than the priority of the route calculation task when the normal service is opened, and the controller preferentially processes the service level with priority Routing request.
  • the service type set to identify whether the request requires a protection path to be calculated.
  • the request type identifies the operation phase of the controller corresponding to the request, and the acquisition process of the first shortest path and the second shortest path can be decomposed into three stages: route initialization, route update, and route extraction.
  • the request parameters including the data carried in the request, are determined by the type of request.
  • the request parameters of the initialization phase in the first shortest path acquisition process include route start and end point information, routing policy, boundary node information, etc.; the request parameters of the route update phase include the start node information of the subdomain; and the route extraction phase The request parameters include backtracking node information of the subdomain, and the like.
  • the request parameters of the initialization phase in the second shortest path acquisition process include route start and end point information and first shortest path information, etc.; the request parameters of the route update node and the route extraction phase are the same as those in the first shortest path acquisition process.
  • the routing policy includes but is not limited to the following three types: 1), the minimum hopping strategy, that is, the routing end point is reached after the least routing node; 2) the bandwidth balancing strategy, that is, preferentially taking the link with sufficient available bandwidth; 3), the minimum time
  • the delay policy is the link with the smallest delay.
  • the initialization of the SDN can be implemented as follows:
  • the boundary node described herein refers to a node that has a link connection with an adjacent sub-domain.
  • the available network topologies of the sub-domains of each network level in the SDN and the boundary nodes of each sub-domain in the SDN can be obtained as follows:
  • the boundary node of the sub-domain of the current layer is extracted and saved (the top-level sub-domain does not need to obtain the boundary node); the routing policy in the route acquisition request is sequentially in accordance with the order of the network hierarchy from high to low. Obtain the available network topology of the sub-domains at each network level in the SDN, and the boundary nodes of the sub-domains of the lower layer.
  • the available network topologies of the sub-domains of each network level in the SDN and the boundary nodes of each sub-domain in the SDN are sequentially obtained according to the order of the network hierarchy from high to low.
  • the top controller After receiving the route acquisition request sent by the service manager, the top controller performs the first operation, and then generates the first request of the layer according to the unified request packet format in the embodiment of the present invention, and sends the first request to the next layer.
  • the controller of the sub-domain; the controller of the next-level controller receives the first request sent by the top-level controller, completes the first operation, delivers the first request of the regenerative cost layer, and so on, and delivers the corresponding layer by layer.
  • a request is made up to the lowest level controller, thereby completing the initialization of each level subfield from top to bottom.
  • the top-level controller receives the route acquisition request
  • the first request sent by the layer is named as the first request, but the first request only represents the operation phase corresponding to the controller (initialization request) Phase), corresponding to different levels of controllers, the sender ID in the first request and the content of the request parameters are different.
  • the first operation includes: extracting and storing the boundary node information of the sub-domain from the received first request (the top-level sub-domain does not have the operation), and acquiring the available network topology and the lower sub-domain according to the request parameter in the routing request.
  • the boundary node determines the link weight of each link in the available network topology of the layer, and initializes the node state of the node of the current sub-domain.
  • the request parameters in the first request include route start and end point information, routing policy, boundary node information, and the like.
  • the storage method of the boundary node of the domain may be one of the following methods: 1) local storage; 2) distributed cache.
  • each level of the SDN needs to perform initialization confirmation to its own upper layer controller, that is, send a first response corresponding to the first request, in an embodiment, the sent The response is a response packet in a unified format.
  • the format of the response packet provided by the embodiment of the present invention includes: a route ID, a sender ID, a receiver ID, a service class, a service type, and a response type. , response parameters.
  • the meanings of the route ID, the sender ID, the receiver ID, the service class, and the service type in the response message are the same as those in the request message.
  • the response type identifies the operational phase of the controller corresponding to the response.
  • the response parameter including the data information carried in the response, is determined by the response type.
  • the SDN cross-domain network shown in FIG. 2 is used as an example.
  • the controller 0 After receiving the route acquisition request sent by the service manager, the controller 0 obtains the available network topology of the layer and the sub-domain 1 to sub-domain 4 according to the routing request parameter.
  • the boundary node initializes the link weight and node state of each link in the available network layer of the layer (controller 0 does not need to obtain the boundary node of the sublayer of the layer).
  • the controller 0 generates the first request of the local layer to be sent to the sub-domain controllers 01 to 04 corresponding to the sub-domain 1 to the sub-domain 4 according to the unified request packet format in the embodiment of the present invention.
  • the sub-domain controllers 01 to 04 respectively perform the above-described first operations, complete the initialization of the domain, and return a first response carrying the initialization completion information to the controller 0.
  • the response parameters of the first response here include confirmation information indicating that the initialization is completed, and the like.
  • Step 102 Update the node status of each sub-domain in the SDN.
  • the node status includes at least: a node mileage, and a previous hop node of the node.
  • the node status of each sub-domain in the SDN is updated based on the received second request sent by the upper-layer controller.
  • the node mileage refers to the distance from the current node to the routing start node in the current route calculation phase, which is determined by the weight of each link. In practical applications, the mileage between adjacent nodes is equivalent to the link weight.
  • the node status of each sub-domain in the SDN may be updated by: updating the node status of the sub-domain where the routing start point of the SDN is located based on the routing start information in the second request; The node status of the node of the sub-domain where the routing start point of the SDN is located, and iteratively updates the node status of the node of the other sub-domain of the SDN.
  • the node status of the sub-domain network where the routing start point of the SDN is located may be updated by: determining, according to the routing start node information in the received second request, the shortest path algorithm to determine the SDN
  • the node of the subdomain where the route origination is located is the distance from the node of the route start point, and the last hop node of the node of the subdomain network where the route origination of the SDN is located.
  • the node status of the nodes of the other sub-domains of the SDN may be iteratively updated by: acquiring an inter-domain link relationship of each sub-domain in the SDN; determining, based on the inter-domain link relationship, a routing start point of the sub-domain connected to the sub-domain of the routing start point of the SDN; and based on the determined node status of the starting point of the routing, the shortest path algorithm may be used to update the sub-domain connected to the sub-domain where the routing start point of the SDN is located Node state; and so on, iteratively updates the node state of other subdomains of the SDN.
  • the node status of the same sub-domain can be updated multiple times to obtain the shortest mileage of each node in the current sub-domain.
  • the iterative calculation is terminated, and the remaining un-updated sub-domains do not need to continue the route calculation.
  • the top-level controller queries the next layer of the SDN route start point (which can be obtained from the route acquisition request sent by the service manager).
  • the second request of the routing start point information carrying the SDN is sent to the next layer controller by using the unified request packet format in the embodiment of the present invention; the next layer controller queries the next route starting point of the SDN.
  • the sub-domain of the layer continues to deliver the second request until the lowest-level controller corresponding to the lowest-level sub-domain where the SDN routing start point is located; the lowest-level controller uses the routing start point of the SDN as the routing starting point of the local domain, and updates the node of the local domain.
  • the node state is saved and includes the mileage of the local node (distance from the starting point of the route), the previous hop node of the node, etc., and then the node state of the updated boundary node of the subdomain passes the second response (using the above unified).
  • the format of the response message is returned to the controller of the upper layer, and the upper layer controller updates the node status of the layer according to the second response returned by the lower subdomain and the available topology of the layer. Save, and then determined to be updated starting node and lower sub-domains according to the update result, and then generates a sub-field to be sent at a second update corresponding to the request.
  • the routing update phase is completed when the top-level controller receives a second response from all of the lower-level controllers and the state of the boundary node in the second response is not updated.
  • the request type corresponding to the foregoing second request identifies that the operation phase of the controller corresponding to the request is a route update phase.
  • the update criterion of the layer node is less than the mileage saved after the last update, and the upper controller finds that the mileage of the new route start point is greater than the mileage of the updated SDN route end point, and discards.
  • the starting point of the route stops sending the second request to the corresponding sub-domain.
  • Step 103 Perform shortest path route extraction for each of the subdomains based on the updated node status of each subdomain.
  • the shortest path route extraction for each of the subdomains may be implemented as follows:
  • the shortest path route of the subdomain in which the routing destination is located iteratively obtains the shortest path route of the other subdomains of the SDN according to the obtained shortest path route.
  • the shortest path routing of other subdomains of the SDN may be iteratively obtained by:
  • the state of the node in the subdomain where the route backtracking node is located obtains the shortest path route to the subdomain where the route backtracking node is located; and so on, iteratively obtains the shortest path route of other subdomains of the SDN;
  • the starting point of the route of the last shortest path route is the routing start point of the SDN.
  • the top controller queries the next subdomain where the routing destination is located, and sends the first subdomain to the corresponding controller of the subdomain. Three requests, then the controller queries the next subdomain where the routing endpoint is located, continues to send the controller down to the lowest subdomain where the routing endpoint is located, and traces back from the routing endpoint to get the shortest route to the routing endpoint in the subdomain.
  • Path routing and then returning a third response carrying the shortest path route to the upper layer controller, and the upper layer controller determines the subdomain of the routing end point with the SDN according to the network topology of the domain and the route starting point of the obtained shortest path route
  • a route backtracking node of the connected sub-domain and based on the route back-tracking node, the third request is sent to the controller of the corresponding sub-domain to obtain the shortest path route of the sub-domain.
  • the shortest path extraction and connection of each layer subdomain can be completed layer by layer, when the top controller receives all the lower subdomains.
  • the complete cross-domain first shortest path is obtained.
  • the top-level controller returns the first shortest path to the service manager, so that the service manager completes the corresponding business operations and resource configuration accordingly.
  • the acquisition of the first shortest path mainly includes three phases: a route initialization phase, a route update phase, and a route extraction phase.
  • the controllers of each level of the SDN cooperate to complete the initialization of the SDN by adopting the first request and the first response in a unified format, and then, the controllers of each level of the SDN cooperate to adopt the second request in a unified format. And the second response mode completes the node state update of the sub-domain node.
  • the controllers of each level of the SDN cooperate to complete the extraction of the first shortest path across the domain by adopting the third request and the third response in a unified format.
  • Step 104 Connect the extracted shortest path routes of each of the subdomains to obtain a first shortest path route of the SDN.
  • the route protection policy needs to be determined according to the service type when the service is opened, so as to implement fast protection switching.
  • two paths need to be calculated simultaneously in the route calculation.
  • the two paths need to be separated from each other, and there can be neither a public link nor a public node (except for the routing start point and routing end point of the SDN).
  • the controller obtains the request according to the route of the SDN, and obtains the service type corresponding to the route of the SDN, and determines that the route protection policy exists according to the service level, and after obtaining the first shortest path route, the controller still needs to acquire and The first shortest path routes the second shortest path route of the different SDNs (the start and end points of the first shortest path and the second shortest path may be the same, or only the start point or the end point may be the same, and there may be no public nodes), and the second The method for obtaining the shortest path route is similar to the method for obtaining the first shortest path route. The difference is that the link weight of the link in each subdomain needs to be updated according to the preset weight policy before the second shortest path is obtained. For example: Update the link weights of the links in each subdomain according to the following formula:
  • w'(u,v) is the link weight between the updated node u and node v
  • w(u,v) is the original link weight between node u and node v
  • d(A,v) ) is the mileage of the node v from the routing start point A of the SDN
  • d(A, u) is the mileage of the node u from the routing start point A of the SDN.
  • the forward link that the first shortest path route passes is not available, and the reverse link weight of the first shortest path route is set to zero;
  • the forward link that the first shortest path route passes may be unavailable in the following manner: the link weight of the first shortest path route is not less than the weight threshold, and the weight threshold is used to indicate that when the link weight is less than the threshold It is an available link, and vice versa.
  • the steps 102 to 104 are repeatedly performed to obtain the second shortest path route of the SDN.
  • determining whether there is an overlapping link in the network topology formed by the first shortest path route and the second shortest path route if there is an overlapping link, deleting the The overlapping links are described, thereby obtaining a cross-domain shortest separated path pair consisting of one working path and one protection path.
  • the hierarchical controller architecture is easy to handle the domain and extension of the network, and it is easy to deal with cross-domain routing calculation of large-scale networks.
  • a unified format request and response message can be used to process routing calculation requests for a large number of services concurrently, and multi-vendor device interconnection can be implemented to complete cross-domain routing calculation.
  • Routing data can be distributed storage, which enhances the stability and reliability of route calculation.
  • the route obtaining method of the SDN according to the embodiment of the present invention is further Be explained.
  • the method for obtaining the route of the SDN provided by the embodiment of the present invention includes:
  • Step 201 The controller 0 receives a route acquisition request sent by the resource manager.
  • the controller 0 is a top-level controller of the SDN, and the route acquisition request adopts a request format as shown in FIG. 4A, and carries the following information: a route identifier ID, a sender ID, a receiver ID, a service level, a service type, and a request.
  • Type request parameters.
  • the request parameter includes the following information: a route start and end point information corresponding to the route acquisition request, a routing policy, and a lower layer sub-domain boundary node.
  • Step 202 The controller 0 performs a first operation based on the route acquisition request, and sends a first request to the controller 01 to the controller 04, respectively.
  • the first operation is performed to complete the initialization of the local domain, and the first operation performed includes: acquiring the available network topology of the layer according to the routing policy in the route acquisition request (that is, the links ⁇ D, F>, ⁇ E in FIG. 2) , K>, ⁇ G, J>, ⁇ I, L>, ⁇ H, N>, and ⁇ M, O>) and the boundary nodes of the lower subdomain (subdomain 1: D, E; subdomain 2: J, K, L, M; sub-domain 3: F, G, H, I; sub-domain 4: N, O), initialize the link weight and node status of each link in the available network topology of this layer.
  • the first request is generated by using the request format as shown in FIG. 4A, and is sent to the controller 01 to the controller 04 respectively.
  • the request parameters carried in the four first requests are different, corresponding to the first request of the controller 01.
  • the lower-layer sub-domain boundary node portion includes the boundary node of the sub-domain 1, and the lower-layer sub-domain boundary node portion in the first request corresponding to the controller 02 includes the boundary node of the sub-domain 2, and correspondingly, the corresponding controller 03,
  • the lower subdomain boundary node portion of the first request of 04 includes the boundary nodes of the subdomains 3, 4.
  • Step 203 The controller 01 to the controller 04 respectively complete the initialization of each corresponding sub-domain according to the first request.
  • controller 01 is taken as an example for description, and the boundary node information of the sub-domain is extracted and saved from the received first request, and the available network topology of the sub-domain 1 is obtained according to the routing policy in the first request, and the initialization sub-instance The link weight and node status of each link in the available network topology for Domain 1.
  • FIG. 5 is a schematic diagram showing topological weights and node states of sublayers in each layer after initialization is completed according to an embodiment of the present invention.
  • the number on the side of the link indicated by the solid line indicates the weight of the link.
  • the weight of the link ⁇ D, F> is 100.
  • Step 204 The controller 01 to the controller 04 return the first response to the controller 0.
  • the first response adopts a response message format as shown in FIG. 4B, and carries the confirmation information of the completion of the corresponding sub-domain initialization in the response parameter part.
  • Step 205 The controller 0 sends a second request to the controller 01 based on the routing start point of the SDN, so that the controller 01 performs the node status update.
  • controller 0 determines that the subdomain where the routing start node A is located is subdomain 1, and uses the A node as the routing start point of subdomain 1, generates a second request, and sends a second request to the corresponding control of subdomain 1.
  • the request parameter part of the second request includes the routing start point A of the sub-domain 1.
  • the second request sent to the controller 01 is used to request to update the node status of the sub-domain 1; the second request also adopts the message format as shown in FIG. 4A, that is, the request type part in the request,
  • the operation phase of the controller that identifies the request is the route update phase.
  • the controller 01 updates the node state of the sub-domain 1 using the shortest path algorithm.
  • the node status includes at least: a node mileage (a mileage from the node A) and a previous hop node of the node.
  • FIG. 6A is a schematic diagram of updating a node state of a boundary node of a sub-domain 1 according to an embodiment of the present invention.
  • the number on the side of the router icon indicates the mileage of the node to the starting node A after completing the status update. For example, the number above the boundary node D of the sub-domain 1 is 2, indicating that the current D-node to the A-node has a mileage of 2 Similarly, the number below the boundary node E is 2, indicating that its mileage to the A node is also 2.
  • the table on the side of the controller icon represents the update status of the boundary node of the corresponding sub-domain.
  • the table on the side of the controller 01 records the status of the boundary nodes D and E after the current status update of the node.
  • the state of each sub-domain node can be saved locally or distributed.
  • Step 206 The controller 01 sends a second response to the controller 0 to cause the controller 0 to update the node status table, as shown in FIG. 6A.
  • the second response adopts a response message format as shown in FIG. 4B, and the response parameter portion carries an update result of the node state of the boundary node of the sub-domain 1 by the controller 01.
  • Step 207 The controller 0 separately sends a second request to the controller 02 and the controller 03 according to the updated node state table, so that the controller 02 and the controller 03 perform node state update.
  • the controller 0 is obtained by the inter-domain link relationship between the sub-domain 1 and the sub-domain 2 and the sub-domain 3.
  • the node D is connected to the sub-domain 3 via the cross-domain link ⁇ D, F>
  • Node E reaches subdomain 2 via cross-domain link ⁇ E, K>, so it is determined that sub-domains 2, 3 are updated next, and the starting point of sub-domain 2 is node K (starting mileage is 3, last hop node)
  • the routing start point of subdomain 3 is node F (starting mileage is 102, and the last hop node is D);
  • the request parameter part of the second request sent to controller 02 includes the routing start point K of subdomain 2,
  • the request parameter portion of the second request sent to controller 03 includes the routing start of subdomain 3.
  • the controller 03 after receiving the second request, the controller 03 extracts the route start point F (the starting mileage is 102 and the last hop node is D) included in the request parameter part of the second request, based on the route starting point.
  • F updates the node status of nodes G, I, and H in the domain, and obtains the node mileage of node G as 103, the previous hop node is node F, the node I has a node mileage of 104, and the previous hop node is node G, node.
  • the node mileage of H is 103, and the last hop node is node F.
  • FIG. 6B is a schematic diagram of a node state after sub-domain 3 and sub-domain 2 are updated according to an embodiment of the present invention.
  • Step 208 The controller 02 and the controller 03 send a second response to the controller 0 to cause the controller 0 to update the node status table.
  • Step 209 The controller 0 sends a second request to the controller 03 and the controller 04 according to the updated node state table, so that the controller 03 and the controller 04 perform node state update.
  • the controller 0 updates the node state table based on the update result returned by the controller 02 and the controller 03, it is found that the mileage reached by the node J via the link ⁇ J, G> reaches 5, which is higher than the existing G.
  • the node mileage 103 is smaller, so it is determined that the node G needs to be renewed for the sub-domain 3 with the node G as the new routing starting point; the controller 0 determines the H through the inter-domain link relationship of the sub-domain 2, the sub-domain 3 and the sub-domain 4.
  • the M node reaches the subdomain 4 through the inter-domain links ⁇ H, N> and ⁇ M, O>, so that the routing start point of the sub-domain 4 is determined to be the node N (the starting mileage is 203, the last hop is H) and Node O (starting mileage is 104, last hop is M); generating a second request corresponding to controller 03 and controller 04.
  • FIG. 6C is a schematic diagram of a node state after sub-domain 3 and sub-domain 4 are updated according to an embodiment of the present invention.
  • Step 210 The controller 03 and the controller 04 send a second response to the controller 0 to cause the controller 0 to update the node status table.
  • Step 211 The controller 0 sends a second request to the controller 02 according to the updated node state table, so that the controller 02 performs node state update.
  • FIG. 6D is a schematic diagram of a node state after updating subdomain 2 according to an embodiment of the present invention.
  • Step 212 The controller 02 sends a second response to the controller 0 to cause the controller 0 to update the node status table.
  • Step 213 The controller 0 sends a second request to the controller 04 according to the updated node state table, so that the controller 04 performs node state update.
  • FIG. 6E is a schematic diagram of a node state after updating subdomain 4 according to an embodiment of the present invention.
  • Step 214 The controller 04 sends a second response to the controller 0 to cause the controller 0 to update the node status table.
  • the controller 0 finds that the return result includes the route end point Z, and the node state of the border node of the sub-domain 4 after the update cannot be further used to update the node state of the other sub-domains, so that the second request is no longer issued, and the route update phase ends. .
  • Step 215 The controller 0 obtains the first shortest path route of the SDN based on the updated node state table.
  • the controller 0 finds that the routing end point Z of the SDN is located in the sub-domain 4, and sends a third request to the controller 04.
  • the controller 04 starts backtracking from the Z node according to the node state table saved in the routing update phase, and obtains the sub-domain.
  • the shortest path route OQZ to node Z is returned to controller 0 through the third response; controller 0 determines that the path to node Z in the domain is MOQZ based on the result returned by controller 04 and the available network topology of the domain.
  • the route backtracking point is the node M
  • the controller 02 starts backtracking from the M node and obtains the shortest sub-domain 2
  • the path route is returned to the controller 0 through the third response, and the controller 0 connects the shortest path in the subdomain 2 with the MOQZ, and determines the subfield that needs to extract the shortest path next; and so on, to obtain the shortest path of each subdomain. Routing, and then splicing the extracted shortest path routes of each subdomain to obtain the first shortest path route of the SDN.
  • the shortest path route of the SDN is a link indicated by an arrow, that is, a path P1: A-C-E-K-J-G-F-H-I-L-M-O-Q-Z.
  • the sub-path information returned by each sub-domain to the upper-level controller may be encrypted.
  • Step 216 The controller 0 determines that there is a route protection policy corresponding to the first shortest path route, and obtains a second shortest path route different from the first shortest path route.
  • controller 0 updates the link weights of the links in each subdomain according to the following formula:
  • w'(u,v) is the link weight between the updated node u and node v
  • w(u,v) is the original link weight between node u and node v
  • d(A,v) ) is the mileage of the node v from the routing start point A of the SDN
  • d(A, u) is the mileage of the node u from the routing start point A of the SDN.
  • FIG. 8 is a schematic diagram of a sub-domain topology after re-adjusting link weights according to an embodiment of the present invention.
  • FIG. 9 is a schematic diagram of the second shortest path routing of the obtained SDN according to the embodiment of the present invention.
  • the shortest path route of the SDN is the link indicated by the arrow, that is, the path P2: A-B-D-F-G-J-K-M-L-I-H-N-P-Z.
  • Step 217 The controller 0 deletes the overlapping links in the first shortest path route and the second shortest path route, and obtains a cross-domain shortest path pair composed of one working path and one protection path that meets the service type requirement.
  • the controller 0 finds that the link P1 and the link P2 have overlapping links ⁇ F, G>, ⁇ J, K>, ⁇ H, I>, and ⁇ L, M.
  • FIG. 10 a schematic diagram of a first shortest path route and a second shortest path route is provided according to an embodiment of the present invention.
  • the overlapping link is deleted to obtain the shortest path pair of the SDN, that is, the shortest path route 1: ABDFHNPZ and Shortest path route 2: ACEKMOQZ.
  • FIG. 11 is a schematic diagram of a shortest path routing pair corresponding to a route protection policy obtained according to an embodiment of the present invention.
  • FIG. 12 is a schematic diagram of an SDN cross-domain routing scenario in which a multi-vendor device is connected according to an embodiment of the present invention.
  • the two upper sub-domains are respectively managed by the controllers of the device vendors A and B, and the sub-domains of the next level are divided in the two sub-domains.
  • the A and B device controllers need to support the route calculation interface of the embodiment of the present invention, and then the top controller can perform cross-domain route calculation across different device vendors controllers by using steps similar to those in the foregoing embodiments.
  • routing start point and the routing end point of the cross-domain routing request are in the sub-domains of the sub-domains 1 and 2, respectively.
  • Step 301 After receiving the route acquisition request sent by the service manager, the top controller initializes the available network topology of the layer, and then sends the first request to the device controllers of the lower layer A and B respectively.
  • Step 302 After receiving the first request, the A and B device controllers respectively complete the route calculation initialization task of each layer subdomain in the domain and return an acknowledgement response to the top controller.
  • Step 303 The top controller sends a second request to the device vendor controller, and the controller updates the node state layer by layer according to the A node information in the second request, and returns the update result of the boundary node to the top controller.
  • Step 304 The top controller determines, according to the second response returned by the A device vendor controller and its available network topology, the starting node for updating the subdomain of the B device vendor controller, and then sends a second request to the controller. .
  • Step 305 After receiving the second request sent by the top controller, the B device controller updates the node status of the subdomain under its jurisdiction layer by layer and returns the status information of the updated boundary node and the Z node to the top layer as the second response. Controller.
  • Step 306 After receiving the second response from the B-device vendor controller, the top-level controller confirms that the route calculation is complete, and then obtains the third-domain shortest path by sending a third request to the A and B device controllers, and returns the service to the service manager. The business manager completes related business operations accordingly.
  • Subdomain controller configuration including:
  • Step 401 Divide the 5G metropolitan area network into a certain number of virtual subdomains.
  • FIG. 13 is a schematic diagram of dividing a 5G metropolitan area network into nine virtual sub-domains according to an area according to an embodiment of the present invention.
  • Step 402 Assign a corresponding sub-domain controller according to the divided virtual sub-domain.
  • the subdomain controller here may be an entity controller or a process in the upper controller that implements the controller function.
  • Step 401 and step 402 can be completed in advance and dynamically adjusted according to changes in the network, and the sub-domain does not need to be re-divided for each route calculation.
  • the metropolitan area network After dividing the virtual subdomain and assigning the subdomain controller, the metropolitan area network has a layered architecture similar to the previous embodiment (FIG. 13), and the steps similar to the previous embodiment can be used to implement routing calculation across the artificial subdomain.
  • the shortest path route The shortest path route.
  • the key to improving the efficiency of routing calculation in this embodiment lies in manually dividing the subdomain and allocating the subdomain controller. Assume that the total number of original metropolitan area network nodes is n (n is very large). If the average is divided into m sub-domains, the computational complexity of the post-domain routing calculation becomes O(n 2 /m), so the sub-domains are divided. More, the higher the computational efficiency. However, after sub-domains are divided, the communication overhead between controllers or between processes is also brought. Therefore, the number of sub-domain partitions needs to be determined according to actual conditions to achieve effective improvement of computational efficiency.
  • FIG. 14 is a schematic structural diagram of a device for obtaining an SDN route according to an embodiment of the present invention. As shown in FIG. 14, the device for obtaining an SDN according to an embodiment of the present invention includes:
  • the initialization module 141 is configured to initialize the SDN in response to the received route acquisition request of the SDN;
  • the update module 142 is configured to update a node status of each sub-domain in the SDN; the node status includes at least: a node mileage and a previous hop node;
  • the extracting module 143 is configured to perform shortest path route extraction for each of the subdomains based on the updated node status of each subdomain, and connect the extracted shortest path routes of each of the subdomains to obtain the SDN The first shortest path route.
  • the SDN comprises at least two network levels; correspondingly,
  • the initialization module 141 is further configured to acquire an available network topology of each sub-domain of each network level in the SDN, and a boundary node of each sub-domain in the SDN, and initialize a node status of each sub-domain;
  • the initialization module 141 is further configured to: extract the routing policy and the boundary node of the SDN from the received route acquisition request;
  • the updating module 142 is further configured to update a node status of a node of the sub-domain where the routing start point of the SDN is located, based on a routing start point of the SDN;
  • the update module 142 is further configured to use the routing start point of the SDN as a routing start point of the sub-domain in which the SDN is located, and determine the node mileage of the node in the sub-domain where the routing start point of the SDN is located from the starting point of the routing. And a previous hop node of the node of the sub-domain network where the routing start point of the SDN is located.
  • the updating module 142 is further configured to acquire an inter-domain link relationship of each sub-domain in the SDN.
  • the node state of the nodes of the other sub-domains of the SDN is iteratively updated.
  • the extracting module 143 is further configured to extract a routing end point of the SDN from the received route obtaining request;
  • the node status of the node of the sub-domain where the routing end point of the SDN is located starting from the routing end point of the SDN, obtaining the shortest path routing of the sub-domain where the routing end point of the SDN is located;
  • the obtained shortest path route iteratively obtains the shortest path route of other subdomains of the SDN.
  • the extracting module 143 is further configured to determine, according to the obtained shortest path route, a route backtracking node of the subdomain connected to the subdomain where the routing end point of the SDN is located;
  • the route origin of the last shortest path route obtained by the iteration is the route start point of the SDN.
  • the extraction module 143 is further configured to connect the sub-domain shortest path extracted from the lower sub-domain to obtain a complete cross-domain shortest path from the route start point to the end point.
  • the initialization module 141 is further configured to determine a service level and a service type corresponding to the route of the SDN according to the route acquisition request of the SDN;
  • the service type is used to determine whether a route protection policy exists. If yes, the second shortest path route of the SDN different from the first shortest path route needs to be obtained.
  • the initialization module 141 is further configured to reset weights of links in each subdomain and reinitialize node states of each subdomain according to a preset weight policy and a first shortest path;
  • the update module 142 is further configured to update the node status of the node of each sub-domain in the SDN again, based on the updated link weight of the link in each sub-domain;
  • the extracting module is further configured to obtain a second shortest path route of the SDN different from the first shortest path route, based on the updated node status of each subdomain in the SDN.
  • the initialization module 141 is further configured to update link weights of links in each subdomain according to the following formula:
  • w'(u,v) is the link weight between the updated node u and node v
  • w(u,v) is the original link weight between node u and node v
  • d(A,v) ) is the mileage of the node v from the routing start point A of the SDN
  • d(A, u) is the mileage of the node u from the routing start point A of the SDN.
  • the initialization module 141 is further configured to set a forward link weight of the first shortest path route to be not less than a weight threshold, and set a reverse link weight of the first shortest path route to zero.
  • the extracting module 143 is further configured to determine a link that overlaps between a first shortest path route of the SDN and a network topology formed by the second shortest path route;
  • the determined overlapping links are deleted to obtain a cross-domain shortest separated path pair consisting of one working path and one protection path.
  • the route acquisition request of the SDN carries at least one of the following information:
  • a route identifier ID corresponding to the route acquisition request a sender ID corresponding to the route acquisition request, a receiver ID corresponding to the route acquisition request, a service level corresponding to the route acquisition request, and a route acquisition request.
  • the service type, the request type corresponding to the route acquisition request, and the request parameter corresponding to the route acquisition request are the same.
  • FIG. 15 is a schematic diagram of an optional hardware structure of an SDN route obtaining apparatus according to an embodiment of the present invention.
  • the SDN route obtaining apparatus provided by the embodiment of the present invention includes: a processor 61, a memory 62, and at least An external communication interface 63; a storage medium 621 is stored in the memory 62, and the processor 61, the memory 62, and the external communication interface 63 are all connected by a bus 64;
  • a memory 62 configured to store an executable program
  • the processor 61 is configured to implement the route acquisition method of the SDN when configured to execute an executable program stored in the memory.
  • the embodiment of the invention further provides a computer storage medium, which stores an executable program, and when the executable program is executed by the processor, implements the route acquisition method of the SDN.
  • the foregoing program may be stored in a computer readable storage medium, and the program is executed when executed.
  • the foregoing storage device includes the following steps: the foregoing storage medium includes: a mobile storage device, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk.
  • ROM read-only memory
  • RAM random access memory
  • magnetic disk or an optical disk.
  • optical disk A medium that can store program code.
  • the above-described integrated unit of the present invention may be stored in a computer readable storage medium if it is implemented in the form of a software function module and sold or used as a standalone product.
  • the technical solution of the embodiments of the present invention may be embodied in the form of a software product in essence or in the form of a software product stored in a storage medium, including a plurality of instructions.
  • a computer device (which may be a personal computer, server, or network device, etc.) is caused to perform all or part of the methods described in various embodiments of the present invention.
  • the foregoing storage medium includes various media that can store program codes, such as a mobile storage device, a ROM, a RAM, a magnetic disk, or an optical disk.

Abstract

Disclosed are a method and device for acquiring a route of a software-defined network (SDN) and a storage medium, in which the SDN is formed by at least two sub-domains. The method comprises: in response to a received request to acquire a route of an SDN, initializing the SDN; updating a node status of each sub-domain in the SDN, wherein the node status comprises at least: a node mileage of a node and a previous-hop node of the node; extracting, on the basis of the updated node status of each sub-domain, a shortest route in each sub-domain; and connecting the extracted shortest route of each sub-domain to acquire a first shortest route of the SDN. According to a service type, after the weight of an SDN link is reconfigured, a second shortest path can be acquired in the same manner, and a pair of shortest cross-domain separation paths can be acquired by deleting an overlapping link on the first shortest path and on the second shortest path.

Description

软件定义网络的路由获取方法、装置及存储介质Method, device and storage medium for route acquisition of software defined network 技术领域Technical field
本发明涉及通信技术领域,尤其涉及一种软件定义网络(SDN,Software Defined Network)的路由获取方法、装置及存储介质。The present invention relates to the field of communications technologies, and in particular, to a route acquisition method, apparatus, and storage medium for a Software Defined Network (SDN).
背景技术Background technique
SDN通过将转发平面和控制平面分离,将分散的子网***进行集中管理,可以实现更开放、更灵活、更智能的网络资源管理、调度和维护,由此也带来了新的挑战。进入第五代移动通信技术(5G,5th-Generation)时代,网络规模将急剧增大,采用分层分域的SDN体系架构可以实现大规模SDN网络的部署和扩展。在这种分层分域的SDN体系架构下,单域路由技术已不再适用于计算跨域的端到端路由,而对于SDN的跨域路由计算方案,相关技术中并不存在能够精确获得SDN的最短路径路由的方案。By separating the forwarding plane from the control plane and centrally managing the distributed subnet systems, SDN can realize more open, flexible, and intelligent network resource management, scheduling, and maintenance, which also brings new challenges. In the era of the fifth-generation mobile communication technology (5G, 5th-Generation), the network scale will increase dramatically. The SDN architecture with hierarchical and domain division can realize the deployment and expansion of large-scale SDN networks. In this hierarchical and SDN-based SDN architecture, single-domain routing technology is no longer suitable for computing cross-domain end-to-end routing. For SDN cross-domain routing computing solutions, there is no accurate acquisition in related technologies. The shortest path routing scheme for SDN.
发明内容Summary of the invention
有鉴于此,本发明实施例提供一种SDN的路由获取方法、装置及存储介质,至少解决了现有技术中存在的问题,能够准确的得到SDN的最短路径路由。In view of this, the embodiments of the present invention provide a method, a device, and a storage medium for acquiring an SDN, which at least solve the problems in the prior art, and can accurately obtain the shortest path route of the SDN.
本发明实施例的技术方案是这样实现的:The technical solution of the embodiment of the present invention is implemented as follows:
本发明实施例提供了一种SDN的路由获取方法,所述SDN包括至少两个子域,所述方法包括:An embodiment of the present invention provides a method for obtaining a route of an SDN, where the SDN includes at least two sub-domains, and the method includes:
响应于接收到的所述SDN的路由获取请求,初始化所述SDN;And initializing the SDN in response to the received route acquisition request of the SDN;
更新所述SDN中各子域的节点状态;所述节点状态至少包括:节点里程、节点的上一跳节点;Updating a node status of each sub-domain in the SDN; the node status includes at least: a node mileage, and a previous hop node of the node;
基于更新后的各子域的节点状态,对各所述子域分别进行最短路径路由提取;Performing shortest path route extraction for each of the subdomains based on the updated node status of each subdomain;
连接所提取的各所述子域的最短路径路由,得到所述SDN的第一最短路径路由。The shortest path route of each of the extracted sub-domains is connected to obtain a first shortest path route of the SDN.
上述实施例中,所述SDN包括至少两个网络层级;相应的,所述初始化所 述SDN,包括:In the foregoing embodiment, the SDN includes at least two network levels; and correspondingly, the initializing the SDN includes:
分别获取所述SDN中各网络层级的子域的可用网络拓扑,以及所述SDN中各子域的边界节点;Obtaining an available network topology of each sub-domain of each network level in the SDN, and a boundary node of each sub-domain in the SDN;
依据路由获取请求确定所获取的所述可用网络拓扑中各链路的链路权重,存储所获取的所述SDN中各子域的边界节点并初始化各子域节点的节点状态。The link weights of the links in the available network topology are determined according to the route acquisition request, the obtained boundary nodes of each sub-domain in the SDN are stored, and the node states of the sub-domain nodes are initialized.
上述实施例中,所述分别获取所述SDN中各网络层级的子域的可用网络拓扑,以及所述SDN中各子域的边界节点,包括:In the foregoing embodiment, the acquiring the available network topologies of the sub-domains of each network level in the SDN, and the boundary nodes of each sub-domain in the SDN, include:
从接收到的所述路由获取请求中,提取所述SDN的路由策略及边界节点;Extracting, from the received route obtaining request, a routing policy and a boundary node of the SDN;
基于所述SDN的路由策略,按照网络层级由高到低的顺序,依次获取所述SDN中各网络层级的子域的可用网络拓扑,以及所述SDN中各子域的边界节点。And obtaining, according to the routing policy of the SDN, the available network topologies of the sub-domains of each network level in the SDN, and the boundary nodes of each sub-domain in the SDN, in descending order of the network level.
上述实施例中,所述更新所述SDN中各子域的节点状态,包括:In the above embodiment, the updating the node status of each sub-domain in the SDN includes:
基于所述SDN的路由起点,更新所述SDN的路由起点所在子域的节点的节点状态;Updating a node status of a node of the sub-domain where the routing start point of the SDN is located, based on a routing start point of the SDN;
基于更新后的所述SDN的路由起点所在子域的边界节点的节点状态,迭代更新所述SDN的其它子域的节点的节点状态。Updating the node status of the nodes of the other sub-domains of the SDN based on the node status of the boundary node of the sub-domain where the routing start point of the SDN is updated.
上述实施例中,所述更新所述SDN的路由起点所在子域网络的节点的节点状态,包括:In the above embodiment, the updating the node status of the node of the sub-domain network where the routing start point of the SDN is located includes:
将所述SDN的路由起点作为其所在子域的路由起点,确定所述SDN的路由起点所在子域的节点距路由起点的节点里程,以及所述SDN的路由起点所在子域网络的节点的上一跳节点。Determining the route starting point of the SDN as the starting point of the routing of the sub-domain, determining the node mileage of the node in the sub-domain where the routing start point of the SDN is located from the starting point of the routing, and the node of the sub-domain network where the routing starting point of the SDN is located One hop node.
上述实施例中,所述基于更新后的所述SDN的路由起点所在子域的边界节点的节点状态,迭代更新所述SDN的其它子域的节点的节点状态,包括:In the above embodiment, the node state of the node of the other sub-domain of the SDN is iteratively updated based on the node status of the boundary node of the sub-domain where the routing start point of the SDN is updated, including:
获取所述SDN中各个子域的域间链路关系;Obtaining an inter-domain link relationship of each sub-domain in the SDN;
基于所述域间链路关系,确定与所述SDN的路由起点所在子域相连的子域的路由起点;Determining, according to the inter-domain link relationship, a route start point of the sub-domain connected to the sub-domain where the routing start point of the SDN is located;
基于所确定的所述路由起点的节点状态,更新与所述SDN的路由起点所在子域相连的子域的节点的节点状态;Updating a node status of a node of the sub-domain connected to the sub-domain where the routing start point of the SDN is located, based on the determined node status of the routing start point;
以此类推,迭代更新所述SDN的其它子域的节点的节点状态。By analogy, the node state of the nodes of the other sub-domains of the SDN is iteratively updated.
上述实施例中,所述对各所述子域分别进行最短路径路由提取,包括:In the above embodiment, the shortest path route extraction is performed on each of the subdomains, including:
从接收到的所述路由获取请求中,提取所述SDN的路由终点;Extracting, from the received route acquisition request, a route end point of the SDN;
根据所述SDN的路由终点所在子域的节点的节点状态,从所述SDN的路由终点开始回溯,得到所述SDN的路由终点所在子域的最短路径路由;According to the node status of the node of the sub-domain where the routing end point of the SDN is located, starting from the routing end point of the SDN, obtaining the shortest path routing of the sub-domain where the routing end point of the SDN is located;
根据所得到的所述最短路径路由,迭代获取所述SDN的其它子域的最短路径路由。Obtaining the shortest path route of the other sub-domains of the SDN according to the obtained shortest path route.
上述实施例中,所述根据所得到的所述最短路径路由,迭代获取所述SDN的其它子域的最短路径路由,包括:In the foregoing embodiment, the iteratively obtaining the shortest path route of the other sub-domains of the SDN according to the obtained shortest path route, including:
根据所得到的所述最短路径路由,确定与所述SDN的路由终点所在子域相连的子域的路由回溯节点;Determining, according to the obtained shortest path route, a route backtracking node of the subdomain connected to the subdomain where the routing end point of the SDN is located;
基于确定的所述路由回溯节点,以及所述路由回溯节点所在子域的节点状态,获取所述路由回溯节点所在子域的最短路径路由;Obtaining, according to the determined route backtracking node, the node state of the subdomain where the route backtracking node is located, obtaining the shortest path route of the subdomain where the route backtracking node is located;
以此类推,迭代得到所述SDN的其它子域的最短路径路由;By analogy, iteratively obtains the shortest path route of other subdomains of the SDN;
其中,迭代得到的最后一个最短路径路由的路由起点为所述SDN的路由起点。The route origin of the last shortest path route obtained by the iteration is the route start point of the SDN.
上述实施例中,所述方法还包括:In the above embodiment, the method further includes:
根据所述SDN的路由获取请求,确定所述SDN的路由对应的业务类型;Determining, according to the route obtaining request of the SDN, a service type corresponding to the route of the SDN;
根据所确定的所述业务类型,获取不同于所述第一最短路径路由的所述SDN的第二最短路径路由。And obtaining, according to the determined service type, a second shortest path route of the SDN different from the first shortest path route.
上述实施例中,所述获取不同于所述第一最短路径路由的所述SDN的第二最短路径路由,包括:In the above embodiment, the acquiring the second shortest path route of the SDN different from the first shortest path route includes:
根据预设的权重策略,更新各子域中链路的链路权重;Update link weights of links in each subdomain according to a preset weighting policy;
初始化所述SDN各子域的节点状态;Initializing the node status of each sub-domain of the SDN;
基于更新后的所述各子域中链路的链路权重,更新所述SDN中各子域的节点的节点状态;Updating a node status of a node of each sub-domain in the SDN based on the updated link weight of the link in each sub-domain;
基于更新后的所述SDN中各子域的节点的节点状态,得到不同于所述第一最短路径路由的所述SDN的第二最短路径路由。And obtaining, according to the updated node status of the node of each sub-domain in the SDN, a second shortest path route of the SDN different from the first shortest path route.
上述实施例中,所述根据预设的权重策略,更新各子域中链路的链路权重,包括:In the above embodiment, the updating the link weight of the link in each subdomain according to the preset weight policy includes:
根据以下公式更新各子域中链路的链路权重:Update the link weights of the links in each subdomain according to the following formula:
w'(u,v)=w(u,v)-d(A,v)+d(A,u);w'(u,v)=w(u,v)-d(A,v)+d(A,u);
其中,w'(u,v)为更新后的节点u和节点v之间的链路权重,w(u,v)为节点u和节点v之间的原始链路权重,d(A,v)为节点v距所述SDN的路由起点A的里 程,d(A,u)为节点u距所述SDN的路由起点A的里程。Where w'(u,v) is the link weight between the updated node u and node v, and w(u,v) is the original link weight between node u and node v, d(A,v) ) is the mileage of the node v from the routing start point A of the SDN, and d(A, u) is the mileage of the node u from the routing start point A of the SDN.
上述实施例中,所述方法还包括:In the above embodiment, the method further includes:
设置所述第一最短路径路由的正向链路权重不小于权重阈值,并设置所述第一最短路径路由的反向链路权重为零。And setting a forward link weight of the first shortest path route to be not less than a weight threshold, and setting a reverse link weight of the first shortest path route to be zero.
上述实施例中,所述方法还包括:In the above embodiment, the method further includes:
确定所述SDN的第一最短路径路由与所述第二最短路径路由所构成的网络拓扑中存在重叠的链路;Determining that there is an overlapping link in the network topology formed by the first shortest path route of the SDN and the second shortest path route;
删除所确定的所述重叠的链路,以得到由一条作为工作路径和一条作为保护路径的两条最短路径组成的最短分离路径对。The determined overlapping links are deleted to obtain a shortest separated path pair consisting of one working path and one shortest path as a protection path.
上述实施例中,所述SDN的路由获取请求携带以下信息至少之一:In the above embodiment, the route acquisition request of the SDN carries at least one of the following information:
所述路由获取请求对应的路由标识ID、所述路由获取请求对应的发送方ID、所述路由获取请求对应的接收方ID、所述路由获取请求对应的业务等级、所述路由获取请求对应的业务类型、所述路由获取请求对应的请求类型、所述路由获取请求对应的请求参数。a route identifier ID corresponding to the route acquisition request, a sender ID corresponding to the route acquisition request, a receiver ID corresponding to the route acquisition request, a service level corresponding to the route acquisition request, and a route acquisition request. The service type, the request type corresponding to the route acquisition request, and the request parameter corresponding to the route acquisition request.
本发明实施例还提供了一种SDN的路由获取装置,所述装置包括:The embodiment of the invention further provides a route acquisition device for an SDN, the device comprising:
初始化模块,设置为响应于接收到的所述SDN的路由获取请求,初始化所述SDN;An initialization module, configured to initialize the SDN in response to the received route acquisition request of the SDN;
更新模块,设置为更新所述SDN中各子域的节点状态;所述节点状态至少包括:节点里程、节点的上一跳节点;An update module, configured to update a node status of each sub-domain in the SDN; the node status includes at least: a node mileage, and a previous hop node of the node;
提取模块,设置为基于更新后的各子域的节点状态,对各所述子域分别进行最短路径路由提取,并连接所提取的各所述子域的最短路径路由,得到所述SDN的第一最短路径路由。The extracting module is configured to perform shortest path routing extraction for each of the subdomains based on the updated node status of each subdomain, and connect the extracted shortest path routes of each of the subdomains to obtain the SDN number A shortest path route.
上述实施例中,所述SDN包括至少两个网络层级;相应的,In the above embodiment, the SDN includes at least two network levels; correspondingly,
所述初始化模块,还设置为分别获取所述SDN中各网络层级的子域的可用网络拓扑,以及所述SDN中各子域的边界节点,并初始化各子域的节点状态;The initialization module is further configured to acquire an available network topology of each sub-domain of each network level in the SDN, and a boundary node of each sub-domain in the SDN, and initialize a node status of each sub-domain;
依据路由获取请求确定所获取的所述可用网络拓扑中各链路的链路权重,并存储所获取的所述SDN中各子域的边界节点。Determining, according to the route acquisition request, the link weight of each link in the obtained available network topology, and storing the obtained boundary node of each sub-domain in the SDN.
上述实施例中,所述初始化模块,还设置为从接收到的所述路由获取请求中,提取所述SDN的路由策略及边界节点;In the foregoing embodiment, the initialization module is further configured to: extract the routing policy and the boundary node of the SDN from the received route obtaining request;
基于所述SDN的路由策略,按照网络层级由高到低的顺序,依次获取所述SDN中各网络层级的子域的可用网络拓扑,以及所述SDN中各子域的边界节 点。Based on the routing policy of the SDN, the available network topologies of the sub-domains of each network level in the SDN, and the boundary nodes of each sub-domain in the SDN are sequentially acquired according to the order of the network level from high to low.
上述实施例中,所述更新模块,还设置为基于所述SDN的路由起点,更新所述SDN的路由起点所在子域的节点的节点状态;In the above embodiment, the updating module is further configured to update a node state of a node of the subdomain where the routing start point of the SDN is located, based on a routing start point of the SDN;
基于更新后的所述SDN的路由起点所在子域的边界节点的节点状态,迭代更新所述SDN的其它子域的节点的节点状态。Updating the node status of the nodes of the other sub-domains of the SDN based on the node status of the boundary node of the sub-domain where the routing start point of the SDN is updated.
上述实施例中,所述更新模块,还设置为将所述SDN的路由起点作为其所在子域的路由起点,确定所述SDN的路由起点所在子域的节点距路由起点的节点里程,以及所述SDN的路由起点所在子域网络的节点的上一跳节点。In the foregoing embodiment, the update module is further configured to use a routing start point of the SDN as a routing start point of the sub-domain in which the SDN is located, and determine a node mileage of the node in the sub-domain where the routing start point of the SDN is located from the starting point of the routing, and The previous hop node of the node of the sub-domain network where the routing start point of the SDN is located.
上述实施例中,所述更新模块,还设置为获取所述SDN中各个子域的域间链路关系;In the foregoing embodiment, the update module is further configured to acquire an inter-domain link relationship of each sub-domain in the SDN.
基于所述域间链路关系,确定与所述SDN的路由起点所在子域相连的子域的路由起点;Determining, according to the inter-domain link relationship, a route start point of the sub-domain connected to the sub-domain where the routing start point of the SDN is located;
基于所确定的所述路由起点的节点状态,更新与所述SDN的路由起点所在子域相连的子域的节点的节点状态;Updating a node status of a node of the sub-domain connected to the sub-domain where the routing start point of the SDN is located, based on the determined node status of the routing start point;
以此类推,迭代更新所述SDN的其它子域的节点的节点状态。By analogy, the node state of the nodes of the other sub-domains of the SDN is iteratively updated.
上述实施例中,所述提取模块,还设置为从接收到的所述路由获取请求中,提取所述SDN的路由终点;In the above embodiment, the extracting module is further configured to extract a routing end point of the SDN from the received route obtaining request;
根据所述SDN的路由终点所在子域的节点的节点状态,从所述SDN的路由终点开始回溯,得到所述SDN的路由终点所在子域的最短路径路由;According to the node status of the node of the sub-domain where the routing end point of the SDN is located, starting from the routing end point of the SDN, obtaining the shortest path routing of the sub-domain where the routing end point of the SDN is located;
根据所得到的所述最短路径路由,迭代获取所述SDN的其它子域的最短路径路由。Obtaining the shortest path route of the other sub-domains of the SDN according to the obtained shortest path route.
上述实施例中,所述提取模块,还设置为根据所得到的所述最短路径路由,确定与所述SDN的路由终点所在子域相连的子域的路由回溯节点;In the above embodiment, the extracting module is further configured to determine, according to the obtained shortest path route, a route backtracking node of the subdomain connected to the subdomain where the routing end point of the SDN is located;
基于确定的所述路由回溯节点,以及所述路由回溯节点所在子域的节点状态,获取所述路由回溯节点所在子域的最短路径路由;Obtaining, according to the determined route backtracking node, the node state of the subdomain where the route backtracking node is located, obtaining the shortest path route of the subdomain where the route backtracking node is located;
以此类推,迭代得到所述SDN的其它子域的最短路径路由;By analogy, iteratively obtains the shortest path route of other subdomains of the SDN;
其中,迭代得到的最后一个最短路径路由的路由起点为所述SDN的路由起点。The route origin of the last shortest path route obtained by the iteration is the route start point of the SDN.
上述实施例中,所述初始化模块,还设置为根据所述SDN的路由获取请求,确定所述SDN的路由对应的业务类型;In the above embodiment, the initialization module is further configured to determine a service type corresponding to the route of the SDN according to the route acquisition request of the SDN;
以及,根据预设的权重策略,更新各子域中链路的链路权重,并初始化所 述SDN各子域的节点的节点状态;And updating a link weight of the link in each subdomain according to a preset weight policy, and initializing a node state of the node of each subdomain of the SDN;
所述更新模块,还设置为基于更新后的所述各子域中链路的链路权重,更新所述SDN中各子域的节点的节点状态;The update module is further configured to update a node state of a node of each subdomain in the SDN based on the updated link weight of the link in each subdomain;
所述提取模块,还设置为基于更新后的所述SDN中各子域的节点的节点状态,得到不同于所述第一最短路径路由的所述SDN的第二最短路径路由。The extracting module is further configured to obtain a second shortest path route of the SDN different from the first shortest path route, based on the node status of the node of each subdomain in the updated SDN.
上述实施例中,所述初始化模块,还设置为根据以下公式更新各子域中链路的链路权重:In the foregoing embodiment, the initialization module is further configured to update link weights of links in each subdomain according to the following formula:
w'(u,v)=w(u,v)-d(A,v)+d(A,u);w'(u,v)=w(u,v)-d(A,v)+d(A,u);
其中,w'(u,v)为更新后的节点u和节点v之间的链路权重,w(u,v)为节点u和节点v之间的原始链路权重,d(A,v)为节点v距所述SDN的路由起点A的里程,d(A,u)为节点u距所述SDN的路由起点A的里程。Where w'(u,v) is the link weight between the updated node u and node v, and w(u,v) is the original link weight between node u and node v, d(A,v) ) is the mileage of the node v from the routing start point A of the SDN, and d(A, u) is the mileage of the node u from the routing start point A of the SDN.
上述实施例中,所述初始化模块,还设置为设置所述第一最短路径路由的正向链路权重不小于权重阈值,并设置所述第一最短路径路由的反向链路权重为零。In the foregoing embodiment, the initialization module is further configured to set a forward link weight of the first shortest path route to be not less than a weight threshold, and set a reverse link weight of the first shortest path route to be zero.
上述实施例中,所述提取模块,还设置为确定所述SDN的第一最短路径路由与所述第二最短路径路由所构成的网络拓扑中存在重叠的链路;In the above embodiment, the extracting module is further configured to determine a link that overlaps between the first shortest path route of the SDN and the second shortest path route;
删除所确定的所述重叠的链路,以得到由一条作为工作路径和一条作为保护路径的两条最短路径组成的最短分离路径对。The determined overlapping links are deleted to obtain a shortest separated path pair consisting of one working path and one shortest path as a protection path.
上述实施例中,所述SDN的路由获取请求携带以下信息至少之一:In the above embodiment, the route acquisition request of the SDN carries at least one of the following information:
所述路由获取请求对应的路由标识ID、所述路由获取请求对应的发送方ID、所述路由获取请求对应的接收方ID、所述路由获取请求对应的业务等级、所述路由获取请求对应的业务类型、所述路由获取请求对应的请求类型、所述路由获取请求对应的请求参数。a route identifier ID corresponding to the route acquisition request, a sender ID corresponding to the route acquisition request, a receiver ID corresponding to the route acquisition request, a service level corresponding to the route acquisition request, and a route acquisition request. The service type, the request type corresponding to the route acquisition request, and the request parameter corresponding to the route acquisition request.
本发明实施例还提供了一种SDN的路由获取装置,所述装置包括:The embodiment of the invention further provides a route acquisition device for an SDN, the device comprising:
存储器,配置为存储可执行程序;a memory configured to store an executable program;
处理器,配置为执行所述存储器中存储的可执行程序时,实现上述的SDN的路由获取方法。The processor, configured to execute the executable program stored in the memory, implements the route acquisition method of the SDN described above.
本发明实施例还提供了一种存储介质,存储有可执行程序,所述可执行程序被处理器执行时,实现上述的SDN的路由获取方法。The embodiment of the present invention further provides a storage medium, where an executable program is stored, and when the executable program is executed by the processor, the route obtaining method of the SDN is implemented.
应用本发明实施例提供的SDN的路由获取方法、装置及存储介质,对SDN初始化之后,更新SDN中各个子域的节点状态,然后基于更新后的各子域的节 点状态,对各个子域分别进行最短路由提取,通过连接提取的各子域的最短路径路由得到SDN的最短路径路由。如此,能够准确的得到SDN的最短路径路由,降低了计算复杂度,提高了SDN的跨域最短路由的计算效率。After the SDN is initialized, the node status of each sub-domain in the SDN is updated, and then the sub-domains of each sub-domain are updated according to the updated node status of each sub-domain. The shortest path is extracted, and the shortest path route of each subdomain extracted by the connection is obtained to obtain the shortest path route of the SDN. In this way, the shortest path routing of the SDN can be accurately obtained, the computational complexity is reduced, and the computational efficiency of the shortest path of the SDN is improved.
附图说明DRAWINGS
图1为本发明实施例提供的一个可选的SDN的分层控制器架构的示意图;1 is a schematic diagram of an optional hierarchical controller architecture of an SDN according to an embodiment of the present invention;
图2为本发明实施例提供的一个可选的SDN的网络架构示意图;2 is a schematic diagram of a network architecture of an optional SDN according to an embodiment of the present invention;
图3为本发明实施例提供的SDN的路由获取方法的流程示意图;FIG. 3 is a schematic flowchart of a method for obtaining an SDN route according to an embodiment of the present disclosure;
图4A为本发明实施例提供的一个可选的请求报文的格式示意图;4A is a schematic diagram of a format of an optional request packet according to an embodiment of the present invention;
图4B为本发明实施例提供的一个可选的应答报文的格式示意图;4B is a schematic diagram of a format of an optional response packet according to an embodiment of the present invention;
图5为本发明实施例提供的SDN初始化后的示意图;FIG. 5 is a schematic diagram of an SDN after initialization according to an embodiment of the present invention;
图6A为本发明实施例提供的更新子域1的节点状态的示意图;6A is a schematic diagram of updating a node state of a sub-domain 1 according to an embodiment of the present invention;
图6B为本发明实施例提供的更新子域3及子域2的节点状态的示意图;6B is a schematic diagram of updating node states of sub-domain 3 and sub-domain 2 according to an embodiment of the present invention;
图6C为本发明实施例提供的更新子域3及子域4的节点状态的示意图;6C is a schematic diagram of updating node states of sub-domain 3 and sub-domain 4 according to an embodiment of the present invention;
图6D为本发明实施例提供的更新子域2的节点状态的示意图;6D is a schematic diagram of updating a node state of a sub-domain 2 according to an embodiment of the present invention;
图6E为本发明实施例提供的更新子域4的节点状态的示意图;6E is a schematic diagram of updating a node state of a sub-domain 4 according to an embodiment of the present invention;
图7所示为本发明实施例提供的SDN的第一最短路径路由示意图;FIG. 7 is a schematic diagram of a first shortest path routing of an SDN according to an embodiment of the present invention;
图8所示为本发明实施例提供的重新调整链路权重后的子域拓扑示意图;FIG. 8 is a schematic diagram of a sub-domain topology after re-adjusting link weights according to an embodiment of the present invention;
图9所示为本发明实施例提供的SDN的第二最短路径路由示意图;FIG. 9 is a schematic diagram of a second shortest path routing of an SDN according to an embodiment of the present invention;
图10为本发明实施例提供的融合第一最短路径路由和第二最短路径路由的示意图;FIG. 10 is a schematic diagram of merging a first shortest path route and a second shortest path route according to an embodiment of the present invention;
图11为本发明实施例提供的得到的对应路由保护策略的最短路径路由对的示意图;FIG. 11 is a schematic diagram of a shortest path routing pair corresponding to a route protection policy obtained according to an embodiment of the present disclosure;
图12为本发明实施例提供的多厂家设备对接的SDN跨域路由场景示意图;FIG. 12 is a schematic diagram of an SDN cross-domain routing scenario in which a multi-vendor device is connected according to an embodiment of the present invention;
图13为本发明实施例提供的将5G城域网按照区域划分成9个虚拟子域的示意图;FIG. 13 is a schematic diagram of dividing a 5G metropolitan area network into 9 virtual sub-domains according to an area according to an embodiment of the present disclosure;
图14为本发明实施例提供的SDN的路由获取装置的组成结构示意图;FIG. 14 is a schematic structural diagram of a device for acquiring an SDN route according to an embodiment of the present disclosure;
图15为本发明实施例提供的SDN的路由获取装置的一个可选的硬件结构 示意图。FIG. 15 is a schematic diagram of an optional hardware structure of an SDN route obtaining apparatus according to an embodiment of the present invention.
具体实施方式Detailed ways
以下结合附图及实施例,对本发明进行进一步详细说明。应当理解,此处所提供的实施例仅仅用以解释本发明,并不用于限定本发明。另外,以下所提供的实施例是用于实施本发明的部分实施例,而非提供实施本发明的全部实施例,在不冲突的情况下,本发明实施例记载的技术方案可以任意组合的方式实施。The present invention will be further described in detail below with reference to the accompanying drawings and embodiments. It is to be understood that the examples are provided to illustrate the invention and not to limit the invention. In addition, the embodiments provided below are part of the embodiments for implementing the present invention, and do not provide all the embodiments for implementing the present invention. In the case of no conflict, the technical solutions described in the embodiments of the present invention may be combined in any combination. Implementation.
需要说明的是,本发明实施例所涉及的术语“第一\第二\第三”仅仅是区别类似的对象,不代表针对对象的特定排序,可以理解地,“第一\第二\第三”在允许的情况下可以互换特定的顺序或先后次序。应该理解“第一\第二\第三”区分的对象在适当情况下可以互换,以使这里描述的本发明的实施例能够以除了在这里图示或描述的那些以外的顺序实施。It should be noted that the term “first\second\third” according to the embodiment of the present invention is only a similar object, and does not represent a specific ordering for an object. It can be understood that “first\second\第The three" may be interchanged in a specific order or order. It is to be understood that the "first\second\third" distinguished objects may be interchanged as appropriate to enable the embodiments of the invention described herein to be carried out in a sequence other than those illustrated or described herein.
在本发明实施例中,术语“包括”、“包含”或者其任何其他变体意在涵盖非排他性的包含,从而使得包括一系列要素的方法或者装置不仅包括所明确记载的要素,而且还包括没有明确列出的其他要素,或者是还包括为实施方法或者装置所固有的要素。在没有更多限制的情况下,由语句“包括一个……”限定的要素,并不排除在包括该要素的方法或者装置中还存在另外的相关要素(例如方法中的步骤或者装置中的模块,这里的模块可以是部分电路、部分处理器、部分程序或软件等等)。In the embodiments of the present invention, the term "comprises", "comprises" or any other variations thereof is intended to cover a non-exclusive inclusion, such that a method or apparatus comprising a series of elements includes not only the elements that are specifically recited but also Other elements not explicitly listed, or elements that are inherent to the implementation of the method or device. In the absence of further limitation, an element defined by the phrase "comprising a ..." does not exclude the presence of additional related elements in the method or device including the element (eg, a step in the method or a module in the device) The module here can be part of a circuit, part of a processor, part of a program or software, etc.).
例如,本发明实施例提供的SDN的路由获取方法包含了一系列的步骤,但是本发明实施例提供的SDN的路由获取方法不限于所记载的步骤,同样地,本发明实施例提供的SDN的路由获取装置包括了一系列模块,但是本发明实施例提供的SDN的路由获取装置不限于包括所明确记载的模块,还可以包括为获取相关信息、或基于信息进行处理时所需要设置的单元。For example, the route obtaining method of the SDN provided by the embodiment of the present invention includes a series of steps, but the method for obtaining the route of the SDN provided by the embodiment of the present invention is not limited to the steps described, and similarly, the SDN provided by the embodiment of the present invention The route acquisition device includes a series of modules, but the route acquisition device of the SDN provided by the embodiment of the present invention is not limited to including the explicitly described module, and may further include a unit that needs to be set to acquire relevant information or process based on the information.
发明人在研究过程中发现,针对跨域SDN,在一实施例中,可以通过如下两种分布式跨域路由计算方法实现SDN的路由计算:During the research, the inventor found that for the inter-domain SDN, in one embodiment, the routing calculation of the SDN can be implemented by the following two distributed cross-domain routing calculation methods:
1),每域(PD,Per-Domain)方法,采用PD路由计算方法需要提前获取跨域路径经过的子域或者经过的跨域端口,然后从源端(路由起点)所在子域开始,计算出源端到子域出口节点的路径,再通过RSVP-TE协议完成标签交换 路径(LSP,Label Switching Path)的建立,下一子域收到建路信令后执行同样的操作完成域内路径计算,从而逐域完成路由计算并建立起端到端的路径。然而应用该实现方式的路由计算效率较低,且只能应对结构简单的跨域网络,对于子域网状分布的复杂跨域网络,无法保证确定的路由为全局最短路由,且通常难以计算分离的保护路径。1) For each domain (PD, Per-Domain) method, the PD route calculation method needs to obtain the sub-domain or the cross-domain port that the cross-domain path passes in advance, and then start from the sub-domain where the source end (route start point) is located. The path from the source to the egress of the sub-domain is complete, and the label switching path (LSP) is established through the RSVP-TE protocol. After the next sub-domain receives the road-building signaling, the same operation is performed to complete the path calculation in the domain. , thereby completing the route calculation and completing the end-to-end path. However, the routing calculation using the implementation method is inefficient, and can only cope with a cross-domain network with a simple structure. For a complex cross-domain network with a sub-domain network distribution, the determined route cannot be guaranteed to be the global shortest path, and it is usually difficult to calculate and separate. Protection path.
2),反向递归计算(BRPC,Backward-Recursive PCE-Based Computation)方法,采用BRPC方法,首先确定跨域路径经过的子域,形成路径计算单元(PCE,Path Computation Element)链,然后由宿端节点(路由终点)开始计算出到本域所有出端口的最短路径以组成虚拟最短路径树(VSPT,Virtual Shortest Path Tree),并将该VSPT传给PCE链中的前一PCE,该PCE将VSPT与其拓扑合并后得到新的VSPT并向前传递,直到源端节点所在PCE,源端PCE从本域获得的VSPT中确定最短的一条路径作为路由计算结果。然而,应用该路由计算方式只有在子域串行排列时能确保获得最短路径,当子域网状分布时,其计算结果受所选的PCE链影响,获得的路径未必是全局最短。2) The Backward-Recursive PCE-Based Computation (BRPC) method uses the BRPC method to first determine the sub-domain through which the cross-domain path passes, forming a Path Computation Element (PCE) chain, and then The end node (route end point) starts to calculate the shortest path to all the outbound ports of the domain to form a virtual shortest path tree (VSPT), and transmits the VSPT to the previous PCE in the PCE chain, and the PCE will The VSPT is merged with its topology to obtain a new VSPT and forwarded until the source node is located. The source PCE determines the shortest path from the VSPT obtained by the local domain as the route calculation result. However, the application of the route calculation method can ensure the shortest path only when the sub-domains are serially arranged. When the sub-domain is distributed, the calculation result is affected by the selected PCE chain, and the obtained path is not necessarily the shortest.
在一实施例中,对上述PD方法及BRPC方法进行优化和扩展,可得到计算跨域路由的拓扑抽象方法,采用该方法,首先确定一个PCE链,然后各子域将域内边界节点之间的通路以抽象拓扑的形式返回给上层控制器,上层控制器再从中选出一条最短路径。然而,应用该方法同样不能可靠地获得全局最短路径,且计算量非常大。In an embodiment, the PD method and the BRPC method are optimized and extended to obtain a topology abstract method for calculating cross-domain routing. First, a PCE chain is determined, and then each sub-domain will be between the intra-domain boundary nodes. The path is returned to the upper controller in the form of an abstract topology, and the upper controller selects a shortest path from it. However, applying this method also fails to reliably obtain the global shortest path, and the amount of calculation is very large.
在一实施例中,还可采用层级型PCE实现跨域路径的计算,该计算方式与上述拓扑抽象方式类似,需要根据域间链路穷举所有的子域域内通路,计算量大,只适用于小规模的跨域网络中。In an embodiment, the calculation of the cross-domain path may be implemented by using the hierarchical PCE. The calculation manner is similar to the above-mentioned topology abstraction method. It is necessary to exhaust all the sub-domain intra-domain paths according to the inter-domain link, and the calculation amount is large, and only applicable. In a small cross-domain network.
另,上述实现SDN的路由计算的各个方法均无法实现多次更新同一个子域,所得跨域路径也不能多次穿过同一子域,在特殊情况下(如图5所示的SDN的网络拓扑中由A节点到Z节点的跨域最短路径),无论如何选择经过的子域序列,都不可能获得全局最短路径。In addition, the foregoing methods for implementing the route calculation of the SDN cannot implement the same sub-domain update multiple times, and the obtained cross-domain path cannot pass through the same sub-domain multiple times. In a special case (the network topology of the SDN as shown in FIG. 5) In the cross-domain shortest path from the A node to the Z node, it is impossible to obtain the global shortest path no matter how the selected sub-domain sequence is selected.
本发明实施例提供了一种SDN的路由获取方法、该SDN的路由获取方法可由SDN中的控制器实施,接下来首先对本发明实施中的SDN控制器进行说明。The embodiment of the present invention provides a method for obtaining an SDN route, and the method for obtaining the route of the SDN can be implemented by a controller in the SDN. Next, the SDN controller in the implementation of the present invention is first described.
图1为本发明实施例提供的一个可选的SDN的分层控制器架构的示意图, 各层级控制器根据子域的地理位置可部署在不同区域的网管机房或部署在同一网管机房的不同机架上。参见图1,本发明实施例的分层控制器架构对应SDN的分层架构,采用多控制器的方式来提升整体控制器的处理能力,在实际应用中,亦可将一个整体的网络人为划分为多个子域,形成分层架构,如将一个5G城域网划分为层级结构的多个子域。在图1中,SDN包括如下四个子域:子域11、子域12、子域13、子域14;其中,子域11由控制器1进行控制,子域12由控制器2进行控制,子域13由控制器3进行控制,子域14由控制器4进行控制,控制器1至控制器4分别掌握其对应的子域的域内信息,对子域间的连接(即域间链路)并不感知。FIG. 1 is a schematic diagram of an optional SDN hierarchical controller architecture according to an embodiment of the present invention. Each hierarchical controller may be deployed in a network management room in a different area or a different machine deployed in the same network management room according to the geographic location of the sub-domain. On the shelf. Referring to FIG. 1 , the hierarchical controller architecture of the embodiment of the present invention corresponds to a layered architecture of SDN, and adopts a multi-controller manner to improve the processing capability of the overall controller. In actual applications, an overall network can also be manually divided. For multiple sub-domains, a layered architecture is formed, such as dividing a 5G metropolitan area network into multiple sub-domains of a hierarchical structure. In FIG. 1, the SDN includes four sub-domains: a sub-domain 11, a sub-domain 12, a sub-domain 13, and a sub-domain 14. wherein the sub-domain 11 is controlled by the controller 1, and the sub-domain 12 is controlled by the controller 2. The sub-domain 13 is controlled by the controller 3, and the sub-domain 14 is controlled by the controller 4, and the controller 1 to the controller 4 respectively grasp the intra-domain information of the corresponding sub-domain, and the connection between the sub-domains (ie, the inter-domain link) ) is not perceived.
子域11及子域12构成了更高层级的子域21,子域13及子域14构成了更高层级的子域22,而子域21由控制器5进行控制,子域22由控制器6进行控制,且该层的控制器5仅能获知子域11及子域12之间的域间连接(即域间链路),而对子域11及子域12的域内信息(如域内拓扑)并不能获知,控制器6仅能获知子域13及子域14之间的域间连接,而对子域13及子域14的域内信息并不能获知。The sub-domain 11 and the sub-domain 12 constitute a higher-level sub-domain 21, and the sub-domain 13 and the sub-domain 14 constitute a higher-level sub-domain 22, and the sub-domain 21 is controlled by the controller 5, and the sub-domain 22 is controlled. The controller 6 controls, and the controller 5 of the layer can only know the inter-domain connection between the sub-domain 11 and the sub-domain 12 (ie, the inter-domain link), and the intra-domain information of the sub-domain 11 and the sub-domain 12 (eg, It is not known in the intra-domain topology that the controller 6 can only know the inter-domain connection between the sub-domain 13 and the sub-domain 14, and the intra-domain information of the sub-domain 13 and the sub-domain 14 is not known.
子域21及子域22构成了SDN的顶层网络,控制器7为该SDN的顶层控制器,其仅能获知子域21及子域22之间的域间连接,而对子域21及子域22的域内信息及子域11至子域14的域内信息并不能获知。顶层控制器7连接业务管理器,以接收业务管理器通过路由获取请求下发的路由获取任务。The sub-domain 21 and the sub-domain 22 constitute a top-level network of the SDN, and the controller 7 is a top-level controller of the SDN, which can only know the inter-domain connection between the sub-domain 21 and the sub-domain 22, and the sub-domain 21 and the sub-domain 21 The intra-domain information of the domain 22 and the intra-domain information of the sub-domain 11 to the sub-domain 14 are not known. The top controller 7 is connected to the service manager to receive the route acquisition task delivered by the service manager through the route acquisition request.
综上可知,图1所示的控制器共分为三个层级,分别为顶层控制器7,中间层控制器5和控制器6,以及底层控制器1至4;在实际应用中,SDN分层控制器架构并不限于此,例如可分为四个层级或两个层级等。在此控制器架构中,上层子域的可用网络拓扑由下层子域的域间链路构成,下层子域的边界节点组成本层子域的可用拓扑的节点。In summary, the controller shown in Figure 1 is divided into three levels, namely top controller 7, intermediate layer controller 5 and controller 6, and bottom controllers 1 to 4; in practical applications, SDN points The layer controller architecture is not limited to this, and may be, for example, divided into four levels or two levels. In this controller architecture, the available network topology of the upper subdomain is composed of the interdomain links of the lower subdomain, and the boundary nodes of the lower subdomain constitute the nodes of the available topology of the sublayer of the layer.
基于上述对本发明实施例的SDN分层控制器架构的理解,接下来对本发明实施例的SDN的路由获取方法进行说明。图2为本发明实施例提供的一个可选的SDN的网络架构示意图,图2所示的SDN跨域网络可视为是从顶层控制器的视角得到的网络架构视图,在图2中,控制器的层级结构为两层,分别为顶层控制器0,子域控制器01、子域控制器02、子域控制器03、子域控制器04;其中,子域控制器01至04分别用于控制子域1至子域4,而控制器0仅能获 取(感知)各个子域的域间链路关系。图3为本发明实施例提供的SDN的路由获取方法的流程示意图,结合图2、图3,本发明实施例的SDN的路由获取方法涉及步骤101及步骤104,接下来分别进行说明。Based on the above understanding of the SDN layered controller architecture of the embodiment of the present invention, the method for obtaining the SDN route according to the embodiment of the present invention is described. 2 is a schematic diagram of a network architecture of an optional SDN according to an embodiment of the present invention. The SDN cross-domain network shown in FIG. 2 can be regarded as a network architecture view obtained from a perspective of a top controller, and in FIG. 2, the control is performed. The hierarchical structure of the device is two layers, which are top controller 0, subdomain controller 01, subdomain controller 02, subdomain controller 03, and subdomain controller 04; wherein subdomain controllers 01 to 04 respectively use In sub-domain 1 to sub-domain 4, controller 0 can only acquire (perceive) the inter-domain link relationship of each sub-domain. FIG. 3 is a schematic flowchart of a method for obtaining a route of an SDN according to an embodiment of the present invention. Referring to FIG. 2 and FIG. 3, a method for obtaining a route of an SDN according to an embodiment of the present invention involves steps 101 and 104, which are respectively described next.
步骤101:接收到所述SDN的路由获取请求,初始化所述SDN。Step 101: Receive a route acquisition request of the SDN, and initialize the SDN.
在实际实施时,根据实际业务需要,业务管理器生成路由计算任务,并下发相应的路由获取请求给SDN的顶层控制器。In actual implementation, the service manager generates a route calculation task according to actual service requirements, and delivers a corresponding route acquisition request to the top controller of the SDN.
在一实施例中,SDN的路由获取请求携带以下信息至少之一:路由获取请求对应的路由标识ID、路由获取请求对应的发送方ID、路由获取请求对应的接收方ID、路由获取请求对应的业务等级、路由获取请求对应的业务类型、路由获取请求对应的请求类型、路由获取请求对应的请求参数。In an embodiment, the route acquisition request of the SDN carries at least one of the following: a route identifier ID corresponding to the route acquisition request, a sender ID corresponding to the route acquisition request, a receiver ID corresponding to the route acquisition request, and a route acquisition request. The service level, the service type corresponding to the route acquisition request, the request type corresponding to the route acquisition request, and the request parameter corresponding to the route acquisition request.
在一实施例中,业务管理器及控制器发送的请求采用统一格式的请求报文,如图4A所示为本发明实施例提供的请求报文的格式示意图,包括:路由ID、发送方ID、接收方ID、业务等级、业务类型、请求类型、请求参数。In an embodiment, the request sent by the service manager and the controller adopts a request message in a unified format, as shown in FIG. 4A, which is a schematic diagram of a format of the request packet, including: a route ID and a sender ID. , receiver ID, service level, service type, request type, request parameters.
其中,路由ID,设置为标识该请求所对应的路由计算任务,便于路由获取请求的批量下发和处理。The route ID is set to identify the route calculation task corresponding to the request, which facilitates the batch delivery and processing of the route acquisition request.
发送方ID,设置为标识该请求的发送方。The sender ID, set to identify the sender of the request.
接收方ID,设置为标识该请求的接收方。Receiver ID, set to identify the recipient of the request.
业务等级,设置为标识该请求所对应的路由计算任务的优先级;例如快速重路由任务的优先级应高于普通业务开通时路由计算任务的优先级,控制器据此优先处理业务等级高的路由请求。The service level is set to identify the priority of the route calculation task corresponding to the request; for example, the priority of the fast reroute task should be higher than the priority of the route calculation task when the normal service is opened, and the controller preferentially processes the service level with priority Routing request.
业务类型,设置为标识该请求是否需要计算保护路径。The service type, set to identify whether the request requires a protection path to be calculated.
请求类型,标识该请求所对应的控制器的操作阶段,第一最短路径和第二最短路径的获取过程均可以分解为路由初始化、路由更新和路由提取三个阶段。The request type identifies the operation phase of the controller corresponding to the request, and the acquisition process of the first shortest path and the second shortest path can be decomposed into three stages: route initialization, route update, and route extraction.
请求参数,包括该请求中携带的数据,由请求类型确定。The request parameters, including the data carried in the request, are determined by the type of request.
其中,第一最短路径获取过程中的初始化阶段的请求参数包括路由起点和终点信息、路由策略、边界节点信息等;路由更新阶段的请求参数包括子域的起始节点信息等;路由提取阶段的请求参数包括子域的回溯节点信息等。The request parameters of the initialization phase in the first shortest path acquisition process include route start and end point information, routing policy, boundary node information, etc.; the request parameters of the route update phase include the start node information of the subdomain; and the route extraction phase The request parameters include backtracking node information of the subdomain, and the like.
第二最短路径获取过程中的初始化阶段的请求参数包括路由起点和终点信息和第一最短路径信息等;路由更新节点和路由提取阶段的请求参数与第一最短路径获取过程中的相同。The request parameters of the initialization phase in the second shortest path acquisition process include route start and end point information and first shortest path information, etc.; the request parameters of the route update node and the route extraction phase are the same as those in the first shortest path acquisition process.
其中,路由策略包括但不限于以下三种:1),最小跳策略,即经过最少的 路由节点到达路由终点;2)带宽均衡策略,即优先走可用带宽充裕的链路;3),最小时延策略,即优先走时延最小的链路。The routing policy includes but is not limited to the following three types: 1), the minimum hopping strategy, that is, the routing end point is reached after the least routing node; 2) the bandwidth balancing strategy, that is, preferentially taking the link with sufficient available bandwidth; 3), the minimum time The delay policy is the link with the smallest delay.
在一实施例中,可通过如下方式实现对SDN的初始化:In an embodiment, the initialization of the SDN can be implemented as follows:
获取SDN中各网络层级的子域的可用网络拓扑,以及SDN中各子域的边界节点;确定所述可用网络拓扑中各链路的链路权重,以及所述可用网络拓扑中各节点的节点里程。这里所述的边界节点指的是与相邻子域存在链路连接的节点。Obtaining an available network topology of each sub-domain of each network level in the SDN, and a boundary node of each sub-domain in the SDN; determining a link weight of each link in the available network topology, and a node of each node in the available network topology mileage. The boundary node described herein refers to a node that has a link connection with an adjacent sub-domain.
在一实施例中,可通过如下方式获取SDN中各网络层级的子域的可用网络拓扑,以及SDN中各子域的边界节点:In an embodiment, the available network topologies of the sub-domains of each network level in the SDN and the boundary nodes of each sub-domain in the SDN can be obtained as follows:
从接收到的路由获取请求中,提取本层子域的边界节点并保存(顶层子域不需要获取边界节点);基于路由获取请求中的路由策略,按照网络层级由高到低的顺序,依次获取SDN中各网络层级的子域的可用网络拓扑,以及下层子域的边界节点。From the received route acquisition request, the boundary node of the sub-domain of the current layer is extracted and saved (the top-level sub-domain does not need to obtain the boundary node); the routing policy in the route acquisition request is sequentially in accordance with the order of the network hierarchy from high to low. Obtain the available network topology of the sub-domains at each network level in the SDN, and the boundary nodes of the sub-domains of the lower layer.
在一实施例中,可通过如下方式实现按照网络层级由高到低的顺序,依次获取SDN中各网络层级的子域的可用网络拓扑,以及SDN中各子域的边界节点:In an embodiment, the available network topologies of the sub-domains of each network level in the SDN and the boundary nodes of each sub-domain in the SDN are sequentially obtained according to the order of the network hierarchy from high to low.
顶层控制器接收到业务管理器发送的路由获取请求后,执行第一操作,然后,按照本发明实施例中上述统一的请求报文格式,生成本层的第一请求并下发给下一层级子域的控制器;下一层级的控制器接收到顶层控制器下发的第一请求后完成第一操作,再生成本层的第一请求下发,以此类推,逐层下发对应的第一请求,直至最底层控制器,从而由上到下完成各层级子域的初始化。这里需要说明的是,虽然顶层控制器接收到路由获取请求后,逐层下发的第一个请求均命名为第一请求,然而该第一请求仅表征控制器所对应的操作阶段(初始化请求阶段),对应不同层级的控制器,第一请求中的发送方ID及请求参数所包括的内容均有所不同。After receiving the route acquisition request sent by the service manager, the top controller performs the first operation, and then generates the first request of the layer according to the unified request packet format in the embodiment of the present invention, and sends the first request to the next layer. The controller of the sub-domain; the controller of the next-level controller receives the first request sent by the top-level controller, completes the first operation, delivers the first request of the regenerative cost layer, and so on, and delivers the corresponding layer by layer. A request is made up to the lowest level controller, thereby completing the initialization of each level subfield from top to bottom. It should be noted that, although the top-level controller receives the route acquisition request, the first request sent by the layer is named as the first request, but the first request only represents the operation phase corresponding to the controller (initialization request) Phase), corresponding to different levels of controllers, the sender ID in the first request and the content of the request parameters are different.
其中,第一操作包括:从接收到的第一请求中提取并存储本子域的边界节点信息(顶层子域无此操作),依据路由请求中的请求参数获取本层可用网络拓扑及下层子域的边界节点,确定本层可用网络拓扑中各链路的链路权重,并初始化当前子域的节点的节点状态。这里,第一请求中的请求参数包括路由起点和终点信息、路由策略、边界节点信息等。The first operation includes: extracting and storing the boundary node information of the sub-domain from the received first request (the top-level sub-domain does not have the operation), and acquiring the available network topology and the lower sub-domain according to the request parameter in the routing request. The boundary node determines the link weight of each link in the available network topology of the layer, and initializes the node state of the node of the current sub-domain. Here, the request parameters in the first request include route start and end point information, routing policy, boundary node information, and the like.
在实际应用中,对本域的边界节点的存储方式可以为以下方式之一:1)本 地存储;2)分布式缓存。In practical applications, the storage method of the boundary node of the domain may be one of the following methods: 1) local storage; 2) distributed cache.
在实际实施时,SDN的各层级的完成本域的初始化后,需要向自身的上一层控制器进行初始化确认,即发送对应上述第一请求的第一应答,在一实施例中,发送的应答均采用统一格式的应答报文,如图4B所示为本发明实施例提供的应答报文的格式示意图,包括:路由ID、发送方ID、接收方ID、业务等级、业务类型、应答类型、应答参数。In actual implementation, after completing the initialization of the local domain, each level of the SDN needs to perform initialization confirmation to its own upper layer controller, that is, send a first response corresponding to the first request, in an embodiment, the sent The response is a response packet in a unified format. As shown in FIG. 4B, the format of the response packet provided by the embodiment of the present invention includes: a route ID, a sender ID, a receiver ID, a service class, a service type, and a response type. , response parameters.
其中,路由ID、发送方ID、接收方ID、业务等级及业务类型在应答报文中所表征的含义,与其在请求报文中所表征的含义相同。The meanings of the route ID, the sender ID, the receiver ID, the service class, and the service type in the response message are the same as those in the request message.
应答类型,标识该应答所对应的控制器的操作阶段。The response type identifies the operational phase of the controller corresponding to the response.
应答参数,包括该应答中携带的数据信息,由应答类型确定。The response parameter, including the data information carried in the response, is determined by the response type.
接下来以图2所示的SDN跨域网络举例说明,控制器0接收到业务管理器发送的路由获取请求后,依据路由请求参数,获取本层可用网络拓扑及下层子域1至子域4的边界节点,初始化本层可用网络拓扑中各链路的链路权重和节点状态(控制器0不需要获取本层子域的边界节点)。然后,控制器0按照本发明实施例中上述统一的请求报文格式,生成本层的第一请求下发给子域1至子域4对应的子域控制器01至04。子域控制器01至04分别执行上述第一操作,完成本域的初始化,并返回携带初始化完成信息的第一应答给控制器0。这里的第一应答的应答参数包括表征初始化完成的确认信息等。The SDN cross-domain network shown in FIG. 2 is used as an example. After receiving the route acquisition request sent by the service manager, the controller 0 obtains the available network topology of the layer and the sub-domain 1 to sub-domain 4 according to the routing request parameter. The boundary node initializes the link weight and node state of each link in the available network layer of the layer (controller 0 does not need to obtain the boundary node of the sublayer of the layer). Then, the controller 0 generates the first request of the local layer to be sent to the sub-domain controllers 01 to 04 corresponding to the sub-domain 1 to the sub-domain 4 according to the unified request packet format in the embodiment of the present invention. The sub-domain controllers 01 to 04 respectively perform the above-described first operations, complete the initialization of the domain, and return a first response carrying the initialization completion information to the controller 0. The response parameters of the first response here include confirmation information indicating that the initialization is completed, and the like.
步骤102:更新SDN中各子域的节点状态;所述节点状态至少包括:节点里程、节点的上一跳节点。Step 102: Update the node status of each sub-domain in the SDN. The node status includes at least: a node mileage, and a previous hop node of the node.
在实际应用中,基于接收到的上层控制器下发的第二请求,更新SDN中各子域的节点状态。所述节点里程是指在当前路由计算阶段当前节点到路由起始节点的距离,由各链路的权重确定,在实际应用中,相邻节点间的里程等价于链路权重。In a practical application, the node status of each sub-domain in the SDN is updated based on the received second request sent by the upper-layer controller. The node mileage refers to the distance from the current node to the routing start node in the current route calculation phase, which is determined by the weight of each link. In practical applications, the mileage between adjacent nodes is equivalent to the link weight.
在一实施例中,可通过如下方式更新SDN中各子域的节点状态:基于第二请请求中的的路由起点信息,更新所述SDN的路由起点所在子域的节点状态;基于更新后的所述SDN的路由起点所在子域的节点的节点状态,迭代更新所述SDN的其它子域的节点的节点状态。In an embodiment, the node status of each sub-domain in the SDN may be updated by: updating the node status of the sub-domain where the routing start point of the SDN is located based on the routing start information in the second request; The node status of the node of the sub-domain where the routing start point of the SDN is located, and iteratively updates the node status of the node of the other sub-domain of the SDN.
在一实施例中,可通过如下方式更新所述SDN的路由起点所在子域网络的节点状态:根据接收到的第二请求中的路由起始节点信息,可以采用最短路径算法确定所述SDN的路由起点所在子域的节点距路由起点的节点里程,以及所 述SDN的路由起点所在子域网络的节点的上一跳节点。In an embodiment, the node status of the sub-domain network where the routing start point of the SDN is located may be updated by: determining, according to the routing start node information in the received second request, the shortest path algorithm to determine the SDN The node of the subdomain where the route origination is located is the distance from the node of the route start point, and the last hop node of the node of the subdomain network where the route origination of the SDN is located.
在一实施例中,可通过如下方式迭代更新所述SDN的其它子域的节点的节点状态:获取所述SDN中各个子域的域间链路关系;基于所述域间链路关系,确定与所述SDN的路由起点所在子域相连的子域的路由起点;基于所确定的所述路由起点的节点状态,可以采用最短路径算法更新与所述SDN的路由起点所在子域相连的子域的节点状态;以此类推,迭代更新所述SDN的其它子域的节点状态。在迭代更新过程中,同一个子域的节点状态可以被多次更新,以获取当前子域各节点的最短里程。当路由终点所在子域完成节点状态的更新,迭代计算终止,其余未更新的子域无需继续进行路由计算。In an embodiment, the node status of the nodes of the other sub-domains of the SDN may be iteratively updated by: acquiring an inter-domain link relationship of each sub-domain in the SDN; determining, based on the inter-domain link relationship, a routing start point of the sub-domain connected to the sub-domain of the routing start point of the SDN; and based on the determined node status of the starting point of the routing, the shortest path algorithm may be used to update the sub-domain connected to the sub-domain where the routing start point of the SDN is located Node state; and so on, iteratively updates the node state of other subdomains of the SDN. During the iterative update process, the node status of the same sub-domain can be updated multiple times to obtain the shortest mileage of each node in the current sub-domain. When the sub-domain where the routing end point is located completes the update of the node status, the iterative calculation is terminated, and the remaining un-updated sub-domains do not need to continue the route calculation.
例如,顶层控制器接收到对应第一请求的携带初始化完成信息的第一应答报文后,查询SDN的路由起点(可从业务管理器发送的路由获取请求中得到)所在的下一层的子域,采用本发明实施例中上述统一的请求报文格式,将携带SDN的路由起点信息的第二请求下发至下一层控制器;下一层控制器查询SDN的路由起点所在的下一层的子域,继续下发第二请求直至SDN的路由起点所在的最底层子域对应的最底层控制器;最底层控制器将SDN的路由起点作为本域的路由起点,更新本域的节点的节点状态并保存,包括本域节点的里程(距路由起点的距离)、节点的上一跳节点等,再将更新后的本子域的边界节点的节点状态通过第二应答(采用上述统一的应答报文的格式)返回给上一层的控制器,上一层控制器根据下层子域返回的第二应答和本层可用拓扑,更新本层的节点状态并保存,然后根据更新结果确定待更新的下层子域及其起始节点,再生成对应的第二请求下发到待更新的子域。由此逐步完成此控制器下辖各子域的节点状态和本层子域节点的状态更新,然后向更上一层的控制器返回本层控制器的第二应答。当顶层控制器收到所有下层控制器的第二应答,且第二应答中边界节点状态无更新,则路由更新阶段完成。上述第二请求所对应的请求类型,标识该请求对应的控制器的操作阶段为路由更新阶段。当SDN的路由终点在当前子域时,SDN的路由终点的节点状态更新也需包含在第二应答中,以便确认路由更新是否完成。For example, after receiving the first response message carrying the initialization completion information corresponding to the first request, the top-level controller queries the next layer of the SDN route start point (which can be obtained from the route acquisition request sent by the service manager). The second request of the routing start point information carrying the SDN is sent to the next layer controller by using the unified request packet format in the embodiment of the present invention; the next layer controller queries the next route starting point of the SDN. The sub-domain of the layer continues to deliver the second request until the lowest-level controller corresponding to the lowest-level sub-domain where the SDN routing start point is located; the lowest-level controller uses the routing start point of the SDN as the routing starting point of the local domain, and updates the node of the local domain. The node state is saved and includes the mileage of the local node (distance from the starting point of the route), the previous hop node of the node, etc., and then the node state of the updated boundary node of the subdomain passes the second response (using the above unified The format of the response message is returned to the controller of the upper layer, and the upper layer controller updates the node status of the layer according to the second response returned by the lower subdomain and the available topology of the layer. Save, and then determined to be updated starting node and lower sub-domains according to the update result, and then generates a sub-field to be sent at a second update corresponding to the request. Thereby, the node state of each subdomain under the controller and the state update of the subdomain node of the layer are gradually completed, and then the second response of the layer controller is returned to the controller of the upper layer. The routing update phase is completed when the top-level controller receives a second response from all of the lower-level controllers and the state of the boundary node in the second response is not updated. The request type corresponding to the foregoing second request identifies that the operation phase of the controller corresponding to the request is a route update phase. When the routing end point of the SDN is in the current sub-domain, the node status update of the routing end point of the SDN also needs to be included in the second response to confirm whether the routing update is completed.
在一实施例中,本层节点的更新标准为本次更新的里程小于上一次更新后保存的里程,当上层控制器发现新的路由起点的里程大于已更新的SDN的路由终点的里程,丢弃该路由起点,停止向对应子域下发第二请求。In an embodiment, the update criterion of the layer node is less than the mileage saved after the last update, and the upper controller finds that the mileage of the new route start point is greater than the mileage of the updated SDN route end point, and discards. The starting point of the route stops sending the second request to the corresponding sub-domain.
步骤103:基于更新后的各子域的节点状态,对各所述子域分别进行最短 路径路由提取。Step 103: Perform shortest path route extraction for each of the subdomains based on the updated node status of each subdomain.
在一实施例中,可通过如下方式实现对各所述子域的最短路径路由提取:In an embodiment, the shortest path route extraction for each of the subdomains may be implemented as follows:
从接收到的所述路由获取请求中,提取所述SDN的路由终点;根据所述SDN的路由终点所在子域的节点的节点状态,从所述SDN的路由终点开始回溯,得到所述SDN的路由终点所在子域的最短路径路由;根据所得到的所述最短路径路由,迭代获取所述SDN的其它子域的最短路径路由。Extracting, from the received routing request, the routing end point of the SDN; backtracking from the routing end point of the SDN according to the node status of the node of the sub-domain where the routing end point of the SDN is obtained, to obtain the SDN The shortest path route of the subdomain in which the routing destination is located; iteratively obtains the shortest path route of the other subdomains of the SDN according to the obtained shortest path route.
在一实施例中,可通过如下方式迭代获取所述SDN的其它子域的最短路径路由:In an embodiment, the shortest path routing of other subdomains of the SDN may be iteratively obtained by:
根据所得到的SDN的路由终点所在子域的最短路径路由,确定与所述SDN的路由终点所在子域相连的子域的路由回溯节点;基于确定的所述路由回溯节点,以及路由更新阶段保存的所述路由回溯节点所在子域的节点状态,获取到达所述路由回溯节点所在子域的最短路径路由;以此类推,迭代得到所述SDN的其它子域的最短路径路由;其中,迭代得到的最后一个最短路径路由的路由起点为所述SDN的路由起点。Determining, according to the shortest path route of the sub-domain where the routing end point of the SDN is located, the route backtracking node of the sub-domain connected to the sub-domain where the routing end point of the SDN is located; saving the route backtracking node according to the determined route and the route update phase The state of the node in the subdomain where the route backtracking node is located, obtains the shortest path route to the subdomain where the route backtracking node is located; and so on, iteratively obtains the shortest path route of other subdomains of the SDN; The starting point of the route of the last shortest path route is the routing start point of the SDN.
对于层级架构的控制器来说,基于更新后的节点状态,顶层控制器确认各子域的路由更新完成后,查询路由终点所在的下一层子域,向该子域对应的控制器发送第三请求,然后该控制器查询路由终点所在的下一层子域,继续向下发送控制器直至路由终点所在的最底层子域,从路由终点开始回溯,得到该子域内通往路由终点的最短路径路由,然后返回携带该最短路径路由的第三应答给上一层控制器,上一层控制器根据本域网络拓扑及得到的最短路径路由的路由起点,确定与SDN的路由终点所在子域相连的子域的路由回溯节点,并基于该路由回溯节点下发第三请求至相应子域的控制器,使其得到该子域的最短路径路由。通过这种上、下层控制器之间的第三请求和第三应答的形式就可以逐域逐层完成各层子域的最短路径的提取和连接,当顶层控制器接收到下层子域的所有第三应答时,就得到了完整的跨域第一最短路径。顶层控制器将第一最短路径路由返回给业务管理器,以使业务管理器据此完成相应的业务操作和资源配置。For the controller of the hierarchical architecture, based on the updated node state, after confirming that the routing update of each subdomain is completed, the top controller queries the next subdomain where the routing destination is located, and sends the first subdomain to the corresponding controller of the subdomain. Three requests, then the controller queries the next subdomain where the routing endpoint is located, continues to send the controller down to the lowest subdomain where the routing endpoint is located, and traces back from the routing endpoint to get the shortest route to the routing endpoint in the subdomain. Path routing, and then returning a third response carrying the shortest path route to the upper layer controller, and the upper layer controller determines the subdomain of the routing end point with the SDN according to the network topology of the domain and the route starting point of the obtained shortest path route A route backtracking node of the connected sub-domain, and based on the route back-tracking node, the third request is sent to the controller of the corresponding sub-domain to obtain the shortest path route of the sub-domain. Through the third request and the third response between the upper and lower controllers, the shortest path extraction and connection of each layer subdomain can be completed layer by layer, when the top controller receives all the lower subdomains. In the third response, the complete cross-domain first shortest path is obtained. The top-level controller returns the first shortest path to the service manager, so that the service manager completes the corresponding business operations and resource configuration accordingly.
综上可知,第一最短路径的获取主要包括三个阶段:路由初始化阶段、路由更新阶段和路由提取阶段。在实际应用中,SDN的各层级的控制器协同通过采用统一格式的第一请求及第一应答的方式完成SDN的初始化,然后,SDN的各层级的控制器协同通过采用统一格式的第二请求及第二应答的方式完成子 域节点的节点状态更新,最后,SDN的各层级的控制器协同通过采用统一格式的第三请求及第三应答的方式完成跨域第一最短路径的提取。In summary, the acquisition of the first shortest path mainly includes three phases: a route initialization phase, a route update phase, and a route extraction phase. In practical applications, the controllers of each level of the SDN cooperate to complete the initialization of the SDN by adopting the first request and the first response in a unified format, and then, the controllers of each level of the SDN cooperate to adopt the second request in a unified format. And the second response mode completes the node state update of the sub-domain node. Finally, the controllers of each level of the SDN cooperate to complete the extraction of the first shortest path across the domain by adopting the third request and the third response in a unified format.
步骤104:连接所提取的各所述子域的最短路径路由,得到所述SDN的第一最短路径路由。Step 104: Connect the extracted shortest path routes of each of the subdomains to obtain a first shortest path route of the SDN.
在实际应用中,为了保证通信业务的服务质量,在业务开通时需要根据业务类型确定路由保护策略,以实现快速保护倒换。对于这一需求,在路由计算时需要同时计算两条路径,这两条路径要求相互分离,既不能有公共链路也不能有公共节点(SDN的路由起点和路由终点除外)In the actual application, in order to ensure the service quality of the communication service, the route protection policy needs to be determined according to the service type when the service is opened, so as to implement fast protection switching. For this requirement, two paths need to be calculated simultaneously in the route calculation. The two paths need to be separated from each other, and there can be neither a public link nor a public node (except for the routing start point and routing end point of the SDN).
在一实施例中,控制器根据SDN的路由获取请求,得到SDN的路由对应的业务类型,根据业务等级确定存在路由保护策略,则在得到上述第一最短路径路由之后,仍需获取与所述第一最短路径路由不同的SDN的第二最短路径路由(第一最短路径和第二最短路径的起点和终点可以相同,也可以只有起点或者终点相同,还可以没有任何的公共节点),第二最短路径路由的获取方式与第一最短路径路由的获取方式类似,不同的是,在获取第二最短路径路由之前,需要根据预设的权重策略,更新各子域中链路的链路权重,例如:根据以下公式更新各子域中链路的链路权重:In an embodiment, the controller obtains the request according to the route of the SDN, and obtains the service type corresponding to the route of the SDN, and determines that the route protection policy exists according to the service level, and after obtaining the first shortest path route, the controller still needs to acquire and The first shortest path routes the second shortest path route of the different SDNs (the start and end points of the first shortest path and the second shortest path may be the same, or only the start point or the end point may be the same, and there may be no public nodes), and the second The method for obtaining the shortest path route is similar to the method for obtaining the first shortest path route. The difference is that the link weight of the link in each subdomain needs to be updated according to the preset weight policy before the second shortest path is obtained. For example: Update the link weights of the links in each subdomain according to the following formula:
w'(u,v)=w(u,v)-d(A,v)+d(A,u);w'(u,v)=w(u,v)-d(A,v)+d(A,u);
其中,w'(u,v)为更新后的节点u和节点v之间的链路权重,w(u,v)为节点u和节点v之间的原始链路权重,d(A,v)为节点v距所述SDN的路由起点A的里程,d(A,u)为节点u距所述SDN的路由起点A的里程。Where w'(u,v) is the link weight between the updated node u and node v, and w(u,v) is the original link weight between node u and node v, d(A,v) ) is the mileage of the node v from the routing start point A of the SDN, and d(A, u) is the mileage of the node u from the routing start point A of the SDN.
在实际实施时,更新各子域中链路的链路权重之后,需要设置第一最短路径路由经过的正向链路不可用,并设置所述第一最短路径路由的反向链路权重为零;In an actual implementation, after updating the link weight of the link in each subdomain, the forward link that the first shortest path route passes is not available, and the reverse link weight of the first shortest path route is set to zero;
其中,可通过如下方式设置第一最短路径路由经过的正向链路不可用:设置第一最短路径路由的链路权重不小于权重阈值,所述权重阈值用于表示当链路权重小于阈值时为可用链路,反之为不可用链路。The forward link that the first shortest path route passes may be unavailable in the following manner: the link weight of the first shortest path route is not less than the weight threshold, and the weight threshold is used to indicate that when the link weight is less than the threshold It is an available link, and vice versa.
完成上述链路权重的更新及设置后,重复执行步骤102至步骤104,得到SDN的第二最短路径路由。After the update and setting of the link weights are completed, the steps 102 to 104 are repeatedly performed to obtain the second shortest path route of the SDN.
在一实施例中,得到第二最短路径路由后,判断第一最短路径路由与所述第二最短路径路由所构成的网络拓扑中是否存在重叠的链路,若存在重叠的链路,删除所述重叠的链路,从而获得由一条工作路径和一条保护路径组成的跨 域最短分离路径对。In an embodiment, after obtaining the second shortest path route, determining whether there is an overlapping link in the network topology formed by the first shortest path route and the second shortest path route, if there is an overlapping link, deleting the The overlapping links are described, thereby obtaining a cross-domain shortest separated path pair consisting of one working path and one protection path.
应用本发明上述实施例至少具备以下有益效果:The above embodiments of the present invention have at least the following beneficial effects:
1)能够准确的获取SDN网络中的跨域最短路径路由,即确保计算得到的端到端路由为全局最短。1) It is possible to accurately obtain the cross-domain shortest path route in the SDN network, that is, to ensure that the calculated end-to-end route is the shortest in the world.
2)无需提前确定路由经过哪些子域,且允许跨域路径多次穿过同一子域。2) It is not necessary to determine in advance which subdomains the route passes through, and it is allowed to cross the same subdomain multiple times across the domain path.
3)采用层级控制器架构,易于处理网络的分域和扩展,易于应对大规模网络的跨域路由计算。3) The hierarchical controller architecture is easy to handle the domain and extension of the network, and it is easy to deal with cross-domain routing calculation of large-scale networks.
4)采用统一格式的请求及应答报文,可以并发处理大量业务的路由计算请求,并可实现多厂商设备对接完成跨域路由计算。4) A unified format request and response message can be used to process routing calculation requests for a large number of services concurrently, and multi-vendor device interconnection can be implemented to complete cross-domain routing calculation.
5)同一层级的多个子域控制器相互独立,可并行完成各自子域的节点状态更新,提高计算效率。5) Multiple sub-domain controllers in the same level are independent of each other, and node status updates of respective sub-domains can be completed in parallel to improve computational efficiency.
6)路由数据可采分布式存储,增强了路由计算的稳定性和可靠性。6) Routing data can be distributed storage, which enhances the stability and reliability of route calculation.
7)可以方便的在跨域网络中应用Suurballe算法获取跨域最短分离路径对。7) It is convenient to apply the Suurballe algorithm in a cross-domain network to obtain the shortest cross-domain separation path pair.
接下来基于图5所示的SDN跨域网络架构,以获取由子域1中的A节点到子域4中的Z节点的跨域最短路径为例,对本发明实施例的SDN的路由获取方法进一步进行说明。本发明实施例提供的SDN的路由获取方法包括:Then, based on the SDN cross-domain network architecture shown in FIG. 5, to obtain the shortest path of the Z node in the sub-domain 1 to the Z-node in the sub-domain 4, the route obtaining method of the SDN according to the embodiment of the present invention is further Be explained. The method for obtaining the route of the SDN provided by the embodiment of the present invention includes:
步骤201:控制器0接收资源管理器发送的路由获取请求。Step 201: The controller 0 receives a route acquisition request sent by the resource manager.
这里,控制器0为SDN的顶层控制器,所述路由获取请求采用如图4A所示的请求格式,携带以下信息:路由标识ID、发送方ID、接收方ID、业务等级、业务类型、请求类型、请求参数。Here, the controller 0 is a top-level controller of the SDN, and the route acquisition request adopts a request format as shown in FIG. 4A, and carries the following information: a route identifier ID, a sender ID, a receiver ID, a service level, a service type, and a request. Type, request parameters.
其中,请求参数中包括以下信息:路由获取请求对应的路由起点及终点信息、路由策略、下层子域边界节点等。The request parameter includes the following information: a route start and end point information corresponding to the route acquisition request, a routing policy, and a lower layer sub-domain boundary node.
步骤202:控制器0基于路由获取请求执行第一操作,分别发送第一请求给控制器01至控制器04。Step 202: The controller 0 performs a first operation based on the route acquisition request, and sends a first request to the controller 01 to the controller 04, respectively.
这里,执行第一操作以完成本域的初始化,执行的第一操作包括:依据路由获取请求中的路由策略,获取本层可用网络拓扑(即图2中链路<D,F>、<E,K>、<G,J>、<I,L>、<H,N>和<M,O>)及下层子域的边界节点(子域1:D、E;子域2:J、K、L、M;子域3:F、G、H、I;子域4:N、O),初始化本层可用网络拓扑中各链路的链路权重和节点状态。Here, the first operation is performed to complete the initialization of the local domain, and the first operation performed includes: acquiring the available network topology of the layer according to the routing policy in the route acquisition request (that is, the links <D, F>, <E in FIG. 2) , K>, <G, J>, <I, L>, <H, N>, and <M, O>) and the boundary nodes of the lower subdomain (subdomain 1: D, E; subdomain 2: J, K, L, M; sub-domain 3: F, G, H, I; sub-domain 4: N, O), initialize the link weight and node status of each link in the available network topology of this layer.
采用如图4A所示的请求格式生成4个第一请求,分别发送给控制器01至 控制器04,这4个第一请求中携带的请求参数不同,对应控制器01的第一请求中的下层子域边界节点部分包括的是子域1的边界节点,对应控制器02的第一请求中的下层子域边界节点部分包括的是子域2的边界节点,相应的,对应控制器03、04的第一请求中的下层子域边界节点部分包括的是子域3、4的边界节点。The first request is generated by using the request format as shown in FIG. 4A, and is sent to the controller 01 to the controller 04 respectively. The request parameters carried in the four first requests are different, corresponding to the first request of the controller 01. The lower-layer sub-domain boundary node portion includes the boundary node of the sub-domain 1, and the lower-layer sub-domain boundary node portion in the first request corresponding to the controller 02 includes the boundary node of the sub-domain 2, and correspondingly, the corresponding controller 03, The lower subdomain boundary node portion of the first request of 04 includes the boundary nodes of the subdomains 3, 4.
步骤203:控制器01至控制器04分别根据第一请求,完成各相应子域的初始化。Step 203: The controller 01 to the controller 04 respectively complete the initialization of each corresponding sub-domain according to the first request.
这里,以控制器01为例进行说明,从接收到的第一请求中提取出本子域的边界节点信息并保存,依据第一请求中的路由策略,获取子域1的可用网络拓扑,初始化子域1的可用网络拓扑中各链路的链路权重和节点状态。Here, the controller 01 is taken as an example for description, and the boundary node information of the sub-domain is extracted and saved from the received first request, and the available network topology of the sub-domain 1 is obtained according to the routing policy in the first request, and the initialization sub-instance The link weight and node status of each link in the available network topology for Domain 1.
控制器01至控制器04并行实现对相应子域的初始化,提高了路由获取效率。图5所示为本发明实施例提供的初始化完成后的各层子域拓扑权重和节点状态示意图。其中,实线表示的链路边上的数字表示该链路的权重,例如链路<D,F>的权重为100。The controller 01 to the controller 04 implement initialization of the corresponding sub-domains in parallel, which improves the route acquisition efficiency. FIG. 5 is a schematic diagram showing topological weights and node states of sublayers in each layer after initialization is completed according to an embodiment of the present invention. The number on the side of the link indicated by the solid line indicates the weight of the link. For example, the weight of the link <D, F> is 100.
步骤204:控制器01至控制器04返回第一应答给控制器0。Step 204: The controller 01 to the controller 04 return the first response to the controller 0.
这里,第一应答采用如图4B所示的应答报文格式,并在应答参数部分携带相应子域初始化完成的确认信息。Here, the first response adopts a response message format as shown in FIG. 4B, and carries the confirmation information of the completion of the corresponding sub-domain initialization in the response parameter part.
步骤205:控制器0基于SDN的路由起点,发送第二请求给控制器01,以使控制器01进行节点状态更新。Step 205: The controller 0 sends a second request to the controller 01 based on the routing start point of the SDN, so that the controller 01 performs the node status update.
在实际实施时,控制器0确定路由起始节点A所在的子域为子域1,将A节点作为子域1的路由起点,生成第二请求,发送第二请求给子域1对应的控制器01,第二请求的请求参数部分包括子域1的路由起点A。这里,发送给控制器01的第二请求用于请求对子域1的节点状态进行更新;第二请求亦采用如图4A所示的报文格式,也即,该请求中的请求类型部分,标识该请求对应的控制器的操作阶段为路由更新阶段。控制器01利用最短路径算法更新子域1的节点状态。In actual implementation, controller 0 determines that the subdomain where the routing start node A is located is subdomain 1, and uses the A node as the routing start point of subdomain 1, generates a second request, and sends a second request to the corresponding control of subdomain 1. The request parameter part of the second request includes the routing start point A of the sub-domain 1. Here, the second request sent to the controller 01 is used to request to update the node status of the sub-domain 1; the second request also adopts the message format as shown in FIG. 4A, that is, the request type part in the request, The operation phase of the controller that identifies the request is the route update phase. The controller 01 updates the node state of the sub-domain 1 using the shortest path algorithm.
其中,节点状态至少包括:节点里程(距节点A的里程)及节点的上一跳节点。如图6A所示,图6A为本发明实施例提供的更新子域1的边界节点的节点状态的示意图。其中,路由器图标边上的数字表示该节点完成本次状态更新后到起始节点A的里程,例如子域1的边界节点D上方的数字为2,表示当前D节点到A节点的里程为2,同理,边界节点E下方的数字为2,表示其到A 节点的里程也是2。控制器图标边上的表格代表对应子域的边界节点的更新状态,例如控制器01边上的表格记录了本次节点状态更新后边界节点D、E的状态。各子域节点状态的保存可以采用本地存储,也可采用分布式存储。The node status includes at least: a node mileage (a mileage from the node A) and a previous hop node of the node. As shown in FIG. 6A, FIG. 6A is a schematic diagram of updating a node state of a boundary node of a sub-domain 1 according to an embodiment of the present invention. The number on the side of the router icon indicates the mileage of the node to the starting node A after completing the status update. For example, the number above the boundary node D of the sub-domain 1 is 2, indicating that the current D-node to the A-node has a mileage of 2 Similarly, the number below the boundary node E is 2, indicating that its mileage to the A node is also 2. The table on the side of the controller icon represents the update status of the boundary node of the corresponding sub-domain. For example, the table on the side of the controller 01 records the status of the boundary nodes D and E after the current status update of the node. The state of each sub-domain node can be saved locally or distributed.
步骤206:控制器01发送第二应答给控制器0,以使控制器0更新节点状态表,如图6A所示。Step 206: The controller 01 sends a second response to the controller 0 to cause the controller 0 to update the node status table, as shown in FIG. 6A.
这里,第二应答采用如图4B所示的应答报文格式,在应答参数部分携带控制器01对子域1的边界节点的节点状态的更新结果。Here, the second response adopts a response message format as shown in FIG. 4B, and the response parameter portion carries an update result of the node state of the boundary node of the sub-domain 1 by the controller 01.
步骤207:控制器0根据更新后的节点状态表,分别发送第二请求给控制器02及控制器03,以使控制器02及控制器03进行节点状态更新。Step 207: The controller 0 separately sends a second request to the controller 02 and the controller 03 according to the updated node state table, so that the controller 02 and the controller 03 perform node state update.
这里,在实际实施时,控制器0通过子域1与子域2、子域3的域间链路关系得到,由节点D经跨域链路<D,F>可达子域3、由节点E经跨域链路<E,K>可达子域2,于是确定接下来更新子域2、3,且子域2的路由起点为节点K(起始里程为3,上一跳节点为E),子域3的路由起点为节点F(起始里程为102,上一跳节点为D);发送给控制器02的第二请求的请求参数部分包括子域2的路由起点K,发送给控制器03的第二请求的请求参数部分包括子域3的路由起点。Here, in actual implementation, the controller 0 is obtained by the inter-domain link relationship between the sub-domain 1 and the sub-domain 2 and the sub-domain 3. The node D is connected to the sub-domain 3 via the cross-domain link <D, F> Node E reaches subdomain 2 via cross-domain link <E, K>, so it is determined that sub-domains 2, 3 are updated next, and the starting point of sub-domain 2 is node K (starting mileage is 3, last hop node) For E), the routing start point of subdomain 3 is node F (starting mileage is 102, and the last hop node is D); the request parameter part of the second request sent to controller 02 includes the routing start point K of subdomain 2, The request parameter portion of the second request sent to controller 03 includes the routing start of subdomain 3.
以控制器03为例进行说明,控制器03接收到第二请求后,提取第二请求的请求参数部分包括的路由起点F(起始里程为102,上一跳节点为D),基于路由起点F更新域内节点G、I、H的节点状态后,得到节点G的节点里程为103,其上一跳节点为节点F,节点I的节点里程为104,其上一跳节点为节点G,节点H的节点里程为103,其上一跳节点为节点F。如图6B所示,图6B为本发明实施例提供的更新子域3及子域2后的节点状态的示意图。Taking the controller 03 as an example, after receiving the second request, the controller 03 extracts the route start point F (the starting mileage is 102 and the last hop node is D) included in the request parameter part of the second request, based on the route starting point. F updates the node status of nodes G, I, and H in the domain, and obtains the node mileage of node G as 103, the previous hop node is node F, the node I has a node mileage of 104, and the previous hop node is node G, node. The node mileage of H is 103, and the last hop node is node F. As shown in FIG. 6B, FIG. 6B is a schematic diagram of a node state after sub-domain 3 and sub-domain 2 are updated according to an embodiment of the present invention.
步骤208:控制器02及控制器03发送第二应答给控制器0,以使控制器0更新节点状态表。Step 208: The controller 02 and the controller 03 send a second response to the controller 0 to cause the controller 0 to update the node status table.
步骤209:控制器0根据更新后的节点状态表,分别发送第二请求给控制器03及控制器04,以使控制器03及控制器04进行节点状态更新。Step 209: The controller 0 sends a second request to the controller 03 and the controller 04 according to the updated node state table, so that the controller 03 and the controller 04 perform node state update.
在实际应用中,当控制器0基于控制器02及控制器03返回的更新结果更新节点状态表后发现由节点J经链路<J,G>到达G的里程为5,比现有的G节点里程103更小,于是确定需要以节点G为新的路由起点重新对子域3进行节点状态更新;控制器0通过子域2、子域3与子域4的域间链路关系确定H和M节点经过域间链路<H,N>和<M,O>可达子域4,于是确定子域4的路由起点 为节点N(起始里程为203,上一跳为H)和节点O(起始里程为104,上一跳为M);生成对应控制器03及控制器04的第二请求。In practical applications, when the controller 0 updates the node state table based on the update result returned by the controller 02 and the controller 03, it is found that the mileage reached by the node J via the link <J, G> reaches 5, which is higher than the existing G. The node mileage 103 is smaller, so it is determined that the node G needs to be renewed for the sub-domain 3 with the node G as the new routing starting point; the controller 0 determines the H through the inter-domain link relationship of the sub-domain 2, the sub-domain 3 and the sub-domain 4. And the M node reaches the subdomain 4 through the inter-domain links <H, N> and <M, O>, so that the routing start point of the sub-domain 4 is determined to be the node N (the starting mileage is 203, the last hop is H) and Node O (starting mileage is 104, last hop is M); generating a second request corresponding to controller 03 and controller 04.
控制器03及控制器04分别提取第二请求的路由起点,完成子域3及子域4的边界节点的节点状态更新。如图6C所示,图6C为本发明实施例提供的更新子域3及子域4后的节点状态的示意图。The controller 03 and the controller 04 respectively extract the route start point of the second request, and complete the node state update of the boundary nodes of the sub-domain 3 and the sub-domain 4. As shown in FIG. 6C, FIG. 6C is a schematic diagram of a node state after sub-domain 3 and sub-domain 4 are updated according to an embodiment of the present invention.
步骤210:控制器03及控制器04发送第二应答给控制器0,以使控制器0更新节点状态表。Step 210: The controller 03 and the controller 04 send a second response to the controller 0 to cause the controller 0 to update the node status table.
步骤211:控制器0根据更新后的节点状态表,发送第二请求给控制器02,以使控制器02进行节点状态更新。Step 211: The controller 0 sends a second request to the controller 02 according to the updated node state table, so that the controller 02 performs node state update.
当控制器0基于控制器03及控制器04返回的更新结果更新节点状态表后发现由节点I经跨域链路<I,L>到达节点L的里程为9,比现有L节点的里程104小,于是以L为子域2的路由起点下发第二请求至控制器02,使得控制器02基于路由起点L完成子域2的边界节点的节点状态的更新。如图6D所示,图6D为本发明实施例提供的更新子域2后的节点状态的示意图。When the controller 0 updates the node state table based on the update result returned by the controller 03 and the controller 04, it is found that the mileage reached by the node I via the cross-domain link <I, L> to the node L is 9, which is the mileage of the existing L node. 104 is small, so that L is the routing start point of the sub-domain 2, and the second request is sent to the controller 02, so that the controller 02 completes the update of the node status of the boundary node of the sub-domain 2 based on the route start point L. As shown in FIG. 6D, FIG. 6D is a schematic diagram of a node state after updating subdomain 2 according to an embodiment of the present invention.
步骤212:控制器02发送第二应答给控制器0,以使控制器0更新节点状态表。Step 212: The controller 02 sends a second response to the controller 0 to cause the controller 0 to update the node status table.
步骤213:控制器0根据更新后的节点状态表,发送第二请求给控制器04,以使控制器04进行节点状态更新。Step 213: The controller 0 sends a second request to the controller 04 according to the updated node state table, so that the controller 04 performs node state update.
当控制器0基于控制器02返回的更新结果更新节点状态表后发现由节点M经跨域链路<M,O>到达O的里程为11,比现有里程104小,于是以O为子域4的路由起点向控制器04下发第二请求,使得控制器04基于路由起点O完成子域4的边界节点的节点状态的更新。如图6E所示,图6E为本发明实施例提供的更新子域4后的节点状态的示意图。When the controller 0 updates the node state table based on the update result returned by the controller 02, it is found that the mileage reached by the node M via the cross-domain link <M, O> reaches 11, which is smaller than the existing mileage 104, so O is the child. The routing start of the domain 4 issues a second request to the controller 04, so that the controller 04 completes the update of the node state of the border node of the subdomain 4 based on the routing start point O. As shown in FIG. 6E, FIG. 6E is a schematic diagram of a node state after updating subdomain 4 according to an embodiment of the present invention.
步骤214:控制器04发送第二应答给控制器0,以使控制器0更新节点状态表。Step 214: The controller 04 sends a second response to the controller 0 to cause the controller 0 to update the node status table.
这里,控制器0发现返回结果包含路由终点Z,且更新后子域4的边界节点的节点状态不能进一步用于更新其他子域的节点状态,于是不再下发第二请求,路由更新阶段结束。Here, the controller 0 finds that the return result includes the route end point Z, and the node state of the border node of the sub-domain 4 after the update cannot be further used to update the node state of the other sub-domains, so that the second request is no longer issued, and the route update phase ends. .
步骤215:控制器0基于更新后的节点状态表,得到SDN的第一最短路径路由。Step 215: The controller 0 obtains the first shortest path route of the SDN based on the updated node state table.
在实际实施时,控制器0查找到SDN的路由终点Z位于子域4,发送第三 请求给控制器04,控制器04根据路由更新阶段保存的节点状态表从Z节点开始回溯,得到子域4内通往节点Z的最短路径路由O-Q-Z,通过第三应答返回给控制器0;控制器0基于控制器04返回的结果及本域的可用网络拓扑确定本域内到达节点Z的路径为M-O-Q-Z,并确定接下来需提取子域2的最短路径,且路由回溯点为节点M,发送携带节点M信息的第三请求给控制器02,控制器02从M节点开始回溯,得到子域2的最短路径路由,通过第三应答返回给控制器0,控制器0将子域2内的最短路径与M-O-Q-Z连接,并确定接下来需要提取最短路径的子域;依次类推,得到各个子域的最短路径路由,然后将提取得到的各个子域的最短路径路由进行拼接,得到SDN的第一最短路径路由。如图7所示为本发明实施例提供的得到的SDN的第一最短路径路由示意图,参见图7,SDN的最短路径路由为箭头所示的链路,即路径P1:A-C-E-K-J-G-F-H-I-L-M-O-Q-Z。在实际实施中,考虑到子域信息的保密要求,各子域向上级控制器返回的子路径信息可以进行加密处理。In actual implementation, the controller 0 finds that the routing end point Z of the SDN is located in the sub-domain 4, and sends a third request to the controller 04. The controller 04 starts backtracking from the Z node according to the node state table saved in the routing update phase, and obtains the sub-domain. The shortest path route OQZ to node Z is returned to controller 0 through the third response; controller 0 determines that the path to node Z in the domain is MOQZ based on the result returned by controller 04 and the available network topology of the domain. And determining that the shortest path of the sub-domain 2 needs to be extracted, and the route backtracking point is the node M, sending a third request carrying the information of the node M to the controller 02, and the controller 02 starts backtracking from the M node, and obtains the shortest sub-domain 2 The path route is returned to the controller 0 through the third response, and the controller 0 connects the shortest path in the subdomain 2 with the MOQZ, and determines the subfield that needs to extract the shortest path next; and so on, to obtain the shortest path of each subdomain. Routing, and then splicing the extracted shortest path routes of each subdomain to obtain the first shortest path route of the SDN. FIG. 7 is a schematic diagram of a first shortest path route of an obtained SDN according to an embodiment of the present invention. Referring to FIG. 7, the shortest path route of the SDN is a link indicated by an arrow, that is, a path P1: A-C-E-K-J-G-F-H-I-L-M-O-Q-Z. In an actual implementation, considering the confidentiality requirement of the sub-domain information, the sub-path information returned by each sub-domain to the upper-level controller may be encrypted.
步骤216:控制器0确定存在对应第一最短路径路由的路由保护策略,获取与第一最短路径路由不同的第二最短路径路由。Step 216: The controller 0 determines that there is a route protection policy corresponding to the first shortest path route, and obtains a second shortest path route different from the first shortest path route.
在实际实施时,控制器0根据以下公式更新各子域中链路的链路权重:In actual implementation, controller 0 updates the link weights of the links in each subdomain according to the following formula:
w'(u,v)=w(u,v)-d(A,v)+d(A,u);w'(u,v)=w(u,v)-d(A,v)+d(A,u);
其中,w'(u,v)为更新后的节点u和节点v之间的链路权重,w(u,v)为节点u和节点v之间的原始链路权重,d(A,v)为节点v距所述SDN的路由起点A的里程,d(A,u)为节点u距所述SDN的路由起点A的里程。Where w'(u,v) is the link weight between the updated node u and node v, and w(u,v) is the original link weight between node u and node v, d(A,v) ) is the mileage of the node v from the routing start point A of the SDN, and d(A, u) is the mileage of the node u from the routing start point A of the SDN.
更新各子域中链路的链路权重之后,设置第一最短路径路由的反向链路权重为零,并设置第一最短路径路由的正向链路权重为不小于权重阈值的数值。如图8所示为本发明实施例提供的重新调整链路权重后的子域拓扑示意图。After the link weights of the links in the sub-domains are updated, the reverse link weight of the first shortest path route is set to zero, and the forward link weight of the first shortest path route is set to a value not less than the weight threshold. FIG. 8 is a schematic diagram of a sub-domain topology after re-adjusting link weights according to an embodiment of the present invention.
然后,再次初始化各层控制器的节点状态表,并重新采用与获取第一最短路径相同的方式,更新SDN中各子域的节点的节点状态;基于更新后的所述SDN中各子域的节点的节点状态,得到与第一最短路径路由的公共节点仅路由起点及终点的SDN的第二最短路径路由。如图9所示为本发明实施例提供的得到的SDN的第二最短路径路由示意图,参见图9,SDN的最短路径路由为箭头所示的链路,即路径P2:A-B-D-F-G-J-K-M-L-I-H-N-P-Z。Then, the node state table of each layer controller is initialized again, and the node state of the nodes of each subdomain in the SDN is updated in the same manner as the first shortest path is obtained; based on the updated subdomains of the SDN in the SDN The node state of the node obtains the second shortest path route of the SDN with only the start and end points of the public node of the first shortest path route. FIG. 9 is a schematic diagram of the second shortest path routing of the obtained SDN according to the embodiment of the present invention. Referring to FIG. 9, the shortest path route of the SDN is the link indicated by the arrow, that is, the path P2: A-B-D-F-G-J-K-M-L-I-H-N-P-Z.
步骤217:控制器0删除第一最短路径路由和第二最短路径路由中重叠的链路,获得满足业务类型要求的由一条工作路径和一条保护路径组成的跨域最 短路径对。Step 217: The controller 0 deletes the overlapping links in the first shortest path route and the second shortest path route, and obtains a cross-domain shortest path pair composed of one working path and one protection path that meets the service type requirement.
在实际实施时,控制器0获取第二最短路径路由后发现链路P1和链路P2存在重叠的链路<F,G>、<J,K>、<H,I>和<L,M>,如图10为本发明实施例提供的融合第一最短路径路由和第二最短路径路由的示意图,删除重叠的链路得到SDN的跨域最短分离路径对,即最短路径路由1:A-B-D-F-H-N-P-Z和最短路径路由2:A-C-E-K-M-O-Q-Z。如图11所示,图11为本发明实施例提供的得到的对应路由保护策略的最短路径路由对的示意图。In actual implementation, after acquiring the second shortest path route, the controller 0 finds that the link P1 and the link P2 have overlapping links <F, G>, <J, K>, <H, I>, and <L, M. As shown in FIG. 10, a schematic diagram of a first shortest path route and a second shortest path route is provided according to an embodiment of the present invention. The overlapping link is deleted to obtain the shortest path pair of the SDN, that is, the shortest path route 1: ABDFHNPZ and Shortest path route 2: ACEKMOQZ. As shown in FIG. 11, FIG. 11 is a schematic diagram of a shortest path routing pair corresponding to a route protection policy obtained according to an embodiment of the present invention.
接下来以多厂家设备对接的跨域最短路径计算为例对本发明实施例的SDN的路由获取方法进行说明。图12为本发明实施例提供的多厂家设备对接的SDN跨域路由场景示意图。在如图12所示的SDN网络中,两个上层子域分别由设备厂商A和B的控制器管理,两个子域内均划分了下一级的子域。A、B设备商控制器需支持本发明实施例的路由计算接口,然后顶层控制器就可以采用和前述实施例中相似的步骤完成跨不同设备商控制器的跨域路由计算。The method for obtaining the route of the SDN according to the embodiment of the present invention is described by taking the cross-domain shortest path calculation of the multi-vendor device as an example. FIG. 12 is a schematic diagram of an SDN cross-domain routing scenario in which a multi-vendor device is connected according to an embodiment of the present invention. In the SDN network shown in FIG. 12, the two upper sub-domains are respectively managed by the controllers of the device vendors A and B, and the sub-domains of the next level are divided in the two sub-domains. The A and B device controllers need to support the route calculation interface of the embodiment of the present invention, and then the top controller can perform cross-domain route calculation across different device vendors controllers by using steps similar to those in the foregoing embodiments.
假设某次跨域路由请求的路由起点及路由终点分别在子域1和2的下辖子域中,本发明实施例的SDN的路由获取方法包括:It is assumed that the routing start point and the routing end point of the cross-domain routing request are in the sub-domains of the sub-domains 1 and 2, respectively.
步骤301:顶层控制器收到业务管理器下发的路由获取请求后初始化本层可用网络拓扑,然后分别向下层A、B设备商控制器下发第一请求。Step 301: After receiving the route acquisition request sent by the service manager, the top controller initializes the available network topology of the layer, and then sends the first request to the device controllers of the lower layer A and B respectively.
步骤302:A、B设备商控制器收到第一请求后分别完成本域内各层子域的路由计算初始化任务并向顶层控制器返回确认应答。Step 302: After receiving the first request, the A and B device controllers respectively complete the route calculation initialization task of each layer subdomain in the domain and return an acknowledgement response to the top controller.
步骤303:顶层控制器向A设备商控制器下发第二请求,该控制器根据第二请求中A节点信息逐层更新节点状态,并将边界节点的更新结果返回给顶层控制器。Step 303: The top controller sends a second request to the device vendor controller, and the controller updates the node state layer by layer according to the A node information in the second request, and returns the update result of the boundary node to the top controller.
步骤304:顶层控制器根据A设备商控制器返回的第二应答和其可用网络拓扑确定用于更新B设备商控制器所辖子域的起始节点,然后向该控制器下发第二请求。Step 304: The top controller determines, according to the second response returned by the A device vendor controller and its available network topology, the starting node for updating the subdomain of the B device vendor controller, and then sends a second request to the controller. .
步骤305:B设备商控制器收到顶层控制器下发的第二请求后逐层更新其所辖子域的节点状态并将更新的边界节点和Z节点的状态信息作为第二应答返回给顶层控制器。Step 305: After receiving the second request sent by the top controller, the B device controller updates the node status of the subdomain under its jurisdiction layer by layer and returns the status information of the updated boundary node and the Z node to the top layer as the second response. Controller.
步骤306:顶层控制器收到B设备商控制器的第二应答后确认路由计算完成,然后通过向A、B设备商控制器下发第三请求获得跨域最短路径,并返回 给业务管理器,业务管理器据此完成相关业务操作。Step 306: After receiving the second response from the B-device vendor controller, the top-level controller confirms that the route calculation is complete, and then obtains the third-domain shortest path by sending a third request to the A and B device controllers, and returns the service to the service manager. The business manager completes related business operations accordingly.
接下来以大规模5G城域网的路由计算为例对本发明实施例的SDN的路由获取方法进行说明。未来的5G城域网络为了应对高带宽、大覆盖的需求,其规模会急剧增大,因此在实施本发明实施例的SDN的路由获取方法之前,可对5G城域网进行虚拟子域划分及子域控制器配置,具体包括:Next, the route acquisition method of the SDN according to the embodiment of the present invention will be described by taking the route calculation of the large-scale 5G metropolitan area network as an example. In the future, the 5G metropolitan area network can be used for the virtual subdomain division of the 5G metropolitan area network before the implementation of the SDN route acquisition method in the embodiment of the present invention. Subdomain controller configuration, including:
步骤401:将5G城域网划分为一定数量的虚拟子域。Step 401: Divide the 5G metropolitan area network into a certain number of virtual subdomains.
这里,对5G城域网的划分可以是手动划分或者基于社团识别和其他算法实现的自动化分。如图13所示为本发明实施例提供的将5G城域网按照区域划分成了9个虚拟子域的示意图。Here, the division of the 5G metropolitan area network may be a manual division or an automation score based on community identification and other algorithms. FIG. 13 is a schematic diagram of dividing a 5G metropolitan area network into nine virtual sub-domains according to an area according to an embodiment of the present invention.
步骤402:依据划分的虚拟子域分配相应的子域控制器。Step 402: Assign a corresponding sub-domain controller according to the divided virtual sub-domain.
这里的子域控制器可以是实体控制器,也可以是上层控制器中的一个实现控制器功能的进程。步骤401及步骤402可提前完成,并根据网络的变化动态调整,每次路由计算不需要重新划分子域。The subdomain controller here may be an entity controller or a process in the upper controller that implements the controller function. Step 401 and step 402 can be completed in advance and dynamically adjusted according to changes in the network, and the sub-domain does not need to be re-divided for each route calculation.
划分虚拟子域和分配子域控制器后,城域网具有和前述实施例类似的分层架构(图13),采用和前述实施例相似的步骤即可实现跨人工子域的路由计算获得SDN的最短路径路由。After dividing the virtual subdomain and assigning the subdomain controller, the metropolitan area network has a layered architecture similar to the previous embodiment (FIG. 13), and the steps similar to the previous embodiment can be used to implement routing calculation across the artificial subdomain. The shortest path route.
本实施例实现路由计算效率提升的关键就在于人工划分子域和分配子域控制器。假设原始的城域网节点总数为n(n非常大),如果平均划分为m个子域,则分域后路由计算的计算复杂度变为O(n 2/m),因此划分的子域越多,计算效率越高。但是划分子域后也带来了一定的控制器之间或者进程之间的通信开销,因此子域划分的数量也需要根据实际情况确定以实现计算效率的有效提升。 The key to improving the efficiency of routing calculation in this embodiment lies in manually dividing the subdomain and allocating the subdomain controller. Assume that the total number of original metropolitan area network nodes is n (n is very large). If the average is divided into m sub-domains, the computational complexity of the post-domain routing calculation becomes O(n 2 /m), so the sub-domains are divided. More, the higher the computational efficiency. However, after sub-domains are divided, the communication overhead between controllers or between processes is also brought. Therefore, the number of sub-domain partitions needs to be determined according to actual conditions to achieve effective improvement of computational efficiency.
图14所示为本发明实施例提供的SDN的路由获取装置的组成结构示意图,如图14所示,本发明实施例提供的SDN的路由获取装置包括:FIG. 14 is a schematic structural diagram of a device for obtaining an SDN route according to an embodiment of the present invention. As shown in FIG. 14, the device for obtaining an SDN according to an embodiment of the present invention includes:
初始化模块141,设置为响应于接收到的所述SDN的路由获取请求,初始化所述SDN;The initialization module 141 is configured to initialize the SDN in response to the received route acquisition request of the SDN;
更新模块142,设置为更新所述SDN中各子域的节点状态;所述节点状态至少包括:节点里程、上一跳节点;The update module 142 is configured to update a node status of each sub-domain in the SDN; the node status includes at least: a node mileage and a previous hop node;
提取模块143,设置为基于更新后的各子域的节点状态,对各所述子域分别进行最短路径路由提取,并连接所提取的各所述子域的最短路径路由,得到 所述SDN的第一最短路径路由。The extracting module 143 is configured to perform shortest path route extraction for each of the subdomains based on the updated node status of each subdomain, and connect the extracted shortest path routes of each of the subdomains to obtain the SDN The first shortest path route.
在一实施例中,所述SDN包括至少两个网络层级;相应的,In an embodiment, the SDN comprises at least two network levels; correspondingly,
所述初始化模块141,还设置为分别获取所述SDN中各网络层级的子域的可用网络拓扑,以及所述SDN中各子域的边界节点,并初始化各子域的节点状态;The initialization module 141 is further configured to acquire an available network topology of each sub-domain of each network level in the SDN, and a boundary node of each sub-domain in the SDN, and initialize a node status of each sub-domain;
依据路由获取请求确定所获取的所述可用网络拓扑中各链路的链路权重,并存储所获取的所述SDN中各子域的边界节点。Determining, according to the route acquisition request, the link weight of each link in the obtained available network topology, and storing the obtained boundary node of each sub-domain in the SDN.
在一实施例中,所述初始化模块141,还设置为从接收到的所述路由获取请求中,提取所述SDN的路由策略及边界节点;In an embodiment, the initialization module 141 is further configured to: extract the routing policy and the boundary node of the SDN from the received route acquisition request;
基于所述SDN的路由策略,按照网络层级由高到低的顺序,依次获取所述SDN中各网络层级的子域的可用网络拓扑,以及所述SDN中各子域的边界节点。And obtaining, according to the routing policy of the SDN, the available network topologies of the sub-domains of each network level in the SDN, and the boundary nodes of each sub-domain in the SDN, in descending order of the network level.
在一实施例中,所述更新模块142,还设置为基于所述SDN的路由起点,更新所述SDN的路由起点所在子域的节点的节点状态;In an embodiment, the updating module 142 is further configured to update a node status of a node of the sub-domain where the routing start point of the SDN is located, based on a routing start point of the SDN;
基于更新后的所述SDN的路由起点所在子域的节点的节点状态,迭代更新所述SDN的其它子域的节点的节点状态。Updating the node status of the nodes of the other sub-domains of the SDN based on the node status of the node of the sub-domain where the routing start point of the SDN is updated.
在一实施例中,所述更新模块142,还设置为将所述SDN的路由起点作为其所在子域的路由起点,确定所述SDN的路由起点所在子域的节点距路由起点的节点里程,以及所述SDN的路由起点所在子域网络的节点的上一跳节点。In an embodiment, the update module 142 is further configured to use the routing start point of the SDN as a routing start point of the sub-domain in which the SDN is located, and determine the node mileage of the node in the sub-domain where the routing start point of the SDN is located from the starting point of the routing. And a previous hop node of the node of the sub-domain network where the routing start point of the SDN is located.
在一实施例中,所述更新模块142,还设置为获取所述SDN中各个子域的域间链路关系;In an embodiment, the updating module 142 is further configured to acquire an inter-domain link relationship of each sub-domain in the SDN.
基于所述域间链路关系,确定与所述SDN的路由起点所在子域相连的子域的路由起点;Determining, according to the inter-domain link relationship, a route start point of the sub-domain connected to the sub-domain where the routing start point of the SDN is located;
基于所确定的所述路由起点的节点状态,更新与所述SDN的路由起点所在子域相连的子域的节点的节点状态;Updating a node status of a node of the sub-domain connected to the sub-domain where the routing start point of the SDN is located, based on the determined node status of the routing start point;
以此类推,迭代更新所述SDN的其它子域的节点的节点状态。By analogy, the node state of the nodes of the other sub-domains of the SDN is iteratively updated.
在一实施例中,所述提取模块143,还设置为从接收到的所述路由获取请求中,提取所述SDN的路由终点;In an embodiment, the extracting module 143 is further configured to extract a routing end point of the SDN from the received route obtaining request;
根据所述SDN的路由终点所在子域的节点的节点状态,从所述SDN的路由终点开始回溯,得到所述SDN的路由终点所在子域的最短路径路由;According to the node status of the node of the sub-domain where the routing end point of the SDN is located, starting from the routing end point of the SDN, obtaining the shortest path routing of the sub-domain where the routing end point of the SDN is located;
根据所得到的所述最短路径路由,迭代获取所述SDN的其它子域的最短路 径路由。According to the obtained shortest path route, iteratively obtains the shortest path route of other subdomains of the SDN.
在一实施例中,所述提取模块143,还设置为根据所得到的所述最短路径路由,确定与所述SDN的路由终点所在子域相连的子域的路由回溯节点;In an embodiment, the extracting module 143 is further configured to determine, according to the obtained shortest path route, a route backtracking node of the subdomain connected to the subdomain where the routing end point of the SDN is located;
基于确定的所述路由回溯节点,以及所述路由回溯节点所在子域的节点状态,获取所述路由回溯节点所在子域的最短路径路由;Obtaining, according to the determined route backtracking node, the node state of the subdomain where the route backtracking node is located, obtaining the shortest path route of the subdomain where the route backtracking node is located;
以此类推,迭代得到所述SDN的其它子域的最短路径路由;By analogy, iteratively obtains the shortest path route of other subdomains of the SDN;
其中,迭代得到的最后一个最短路径路由的路由起点为所述SDN的路由起点。The route origin of the last shortest path route obtained by the iteration is the route start point of the SDN.
在一实施例中,所述提取模块143还设置为连接从下层子域提取的子域最短路径,从而获取完整的由路由起点到终点的跨域最短路径。In an embodiment, the extraction module 143 is further configured to connect the sub-domain shortest path extracted from the lower sub-domain to obtain a complete cross-domain shortest path from the route start point to the end point.
在一实施例中,所述初始化模块141,还设置为根据所述SDN的路由获取请求,确定所述SDN的路由对应的业务等级和业务类型;In an embodiment, the initialization module 141 is further configured to determine a service level and a service type corresponding to the route of the SDN according to the route acquisition request of the SDN;
其中,业务类型用于确定是否存在路由保护策略,若存在则需要获取不同于所述第一最短路径路由的所述SDN的第二最短路径路由。The service type is used to determine whether a route protection policy exists. If yes, the second shortest path route of the SDN different from the first shortest path route needs to be obtained.
相应的,在一实施例中,所述初始化模块141,还设置为根据预设的权重策略和第一最短路径,重设各子域中链路的权重和再次初始化各子域的节点状态;Correspondingly, in an embodiment, the initialization module 141 is further configured to reset weights of links in each subdomain and reinitialize node states of each subdomain according to a preset weight policy and a first shortest path;
基于更新后的所述各子域中链路的链路权重,所述更新模块142还设置为再次更新所述SDN中各子域的节点的节点状态;The update module 142 is further configured to update the node status of the node of each sub-domain in the SDN again, based on the updated link weight of the link in each sub-domain;
所述提取模块,还设置为基于更新后的所述SDN中各子域的节点状态,得到不同于所述第一最短路径路由的所述SDN的第二最短路径路由。The extracting module is further configured to obtain a second shortest path route of the SDN different from the first shortest path route, based on the updated node status of each subdomain in the SDN.
在一实施例中,所述初始化模块141,还设置为根据以下公式更新各子域中链路的链路权重:In an embodiment, the initialization module 141 is further configured to update link weights of links in each subdomain according to the following formula:
w'(u,v)=w(u,v)-d(A,v)+d(A,u);w'(u,v)=w(u,v)-d(A,v)+d(A,u);
其中,w'(u,v)为更新后的节点u和节点v之间的链路权重,w(u,v)为节点u和节点v之间的原始链路权重,d(A,v)为节点v距所述SDN的路由起点A的里程,d(A,u)为节点u距所述SDN的路由起点A的里程。Where w'(u,v) is the link weight between the updated node u and node v, and w(u,v) is the original link weight between node u and node v, d(A,v) ) is the mileage of the node v from the routing start point A of the SDN, and d(A, u) is the mileage of the node u from the routing start point A of the SDN.
在一实施例中,所述初始化模块141,还设置为设置所述第一最短路径路由的正向链路权重不小于权重阈值,并设置所述第一最短路径路由的反向链路权重为零。In an embodiment, the initialization module 141 is further configured to set a forward link weight of the first shortest path route to be not less than a weight threshold, and set a reverse link weight of the first shortest path route to zero.
在一实施例中,所述提取模块143,还设置为确定所述SDN的第一最短路 径路由与所述第二最短路径路由所构成的网络拓扑中存在重叠的链路;In an embodiment, the extracting module 143 is further configured to determine a link that overlaps between a first shortest path route of the SDN and a network topology formed by the second shortest path route;
删除所确定的所述重叠的链路以得到由一条工作路径和一条保护路径组成的跨域最短分离路径对。The determined overlapping links are deleted to obtain a cross-domain shortest separated path pair consisting of one working path and one protection path.
在一实施例中,所述SDN的路由获取请求携带以下信息至少之一:In an embodiment, the route acquisition request of the SDN carries at least one of the following information:
所述路由获取请求对应的路由标识ID、所述路由获取请求对应的发送方ID、所述路由获取请求对应的接收方ID、所述路由获取请求对应的业务等级、所述路由获取请求对应的业务类型、所述路由获取请求对应的请求类型、所述路由获取请求对应的请求参数。a route identifier ID corresponding to the route acquisition request, a sender ID corresponding to the route acquisition request, a receiver ID corresponding to the route acquisition request, a service level corresponding to the route acquisition request, and a route acquisition request. The service type, the request type corresponding to the route acquisition request, and the request parameter corresponding to the route acquisition request.
图15为本发明实施例提供的SDN的路由获取装置的一个可选的硬件结构示意图,如图15所示,本发明实施例提供的SDN的路由获取装置包括:处理器61、存储器62以及至少一个外部通信接口63;存储器62中存储有存储介质621,所述处理器61、存储器62以及外部通信接口63均通过总线64连接;其中,FIG. 15 is a schematic diagram of an optional hardware structure of an SDN route obtaining apparatus according to an embodiment of the present invention. As shown in FIG. 15, the SDN route obtaining apparatus provided by the embodiment of the present invention includes: a processor 61, a memory 62, and at least An external communication interface 63; a storage medium 621 is stored in the memory 62, and the processor 61, the memory 62, and the external communication interface 63 are all connected by a bus 64;
存储器62,配置为存储可执行程序;a memory 62 configured to store an executable program;
处理器61,配置为执行所述存储器中存储的可执行程序时,实现上述SDN的路由获取方法。The processor 61 is configured to implement the route acquisition method of the SDN when configured to execute an executable program stored in the memory.
本发明实施例还提供了一种计算机存储介质,存储有可执行程序,所述可执行程序被处理器执行时,实现上述SDN的路由获取方法。The embodiment of the invention further provides a computer storage medium, which stores an executable program, and when the executable program is executed by the processor, implements the route acquisition method of the SDN.
这里需要指出的是:以上涉及SDN的路由获取装置的描述,与上述方法描述是类似的,同方法的有益效果描述,不做赘述。对于本发明所述SDN的路由获取装置实施例中未披露的技术细节,请参照本发明方法实施例的描述。It should be noted here that the above description of the route acquisition device related to the SDN is similar to the description of the above method, and the beneficial effects of the same method are described without further description. For technical details not disclosed in the embodiment of the route obtaining apparatus of the SDN of the present invention, refer to the description of the method embodiment of the present invention.
本领域普通技术人员可以理解:实现上述方法实施例的全部或部分步骤可以通过程序指令相关的硬件来完成,前述的程序可以存储于一计算机可读取存储介质中,该程序在执行时,执行包括上述方法实施例的步骤;而前述的存储介质包括:移动存储设备、只读存储器(ROM,Read-Only Memory)、随机存取存储器(RAM,Random Access Memory)、磁碟或者光盘等各种可以存储程序代码的介质。A person skilled in the art can understand that all or part of the steps of implementing the above method embodiments may be completed by using hardware related to the program instructions. The foregoing program may be stored in a computer readable storage medium, and the program is executed when executed. The foregoing storage device includes the following steps: the foregoing storage medium includes: a mobile storage device, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk. A medium that can store program code.
或者,本发明上述集成的单元如果以软件功能模块的形式实现并作为独立的产品销售或使用时,也可以存储在一个计算机可读取存储介质中。基于这样的理解,本发明实施例的技术方案本质上或者说对现有技术做出贡献的部分可 以以软件产品的形式体现出来,该计算机软件产品存储在一个存储介质中,包括若干指令用以使得一台计算机设备(可以是个人计算机、服务器、或者网络设备等)执行本发明各个实施例所述方法的全部或部分。而前述的存储介质包括:移动存储设备、ROM、RAM、磁碟或者光盘等各种可以存储程序代码的介质。Alternatively, the above-described integrated unit of the present invention may be stored in a computer readable storage medium if it is implemented in the form of a software function module and sold or used as a standalone product. Based on such understanding, the technical solution of the embodiments of the present invention may be embodied in the form of a software product in essence or in the form of a software product stored in a storage medium, including a plurality of instructions. A computer device (which may be a personal computer, server, or network device, etc.) is caused to perform all or part of the methods described in various embodiments of the present invention. The foregoing storage medium includes various media that can store program codes, such as a mobile storage device, a ROM, a RAM, a magnetic disk, or an optical disk.
以上所述,仅为本发明的具体实施方式,但本发明的保护范围并不局限于此,任何熟悉本技术领域的技术人员在本发明揭露的技术范围内,可轻易想到变化或替换,都应涵盖在本发明的保护范围之内。因此,本发明的保护范围应以所述权利要求的保护范围为准。The above is only a specific embodiment of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily think of changes or substitutions within the technical scope of the present invention. It should be covered by the scope of the present invention. Therefore, the scope of the invention should be determined by the scope of the appended claims.

Claims (29)

  1. 一种软件定义网络(SDN)的路由获取方法,所述SDN包括至少两个子域,所述方法包括:A method for obtaining a route of a software-defined network (SDN), the SDN includes at least two sub-domains, and the method includes:
    响应于接收到的所述SDN的路由获取请求,初始化所述SDN;And initializing the SDN in response to the received route acquisition request of the SDN;
    更新所述SDN中各子域的节点状态;所述节点状态至少包括:节点里程、节点的上一跳节点;Updating a node status of each sub-domain in the SDN; the node status includes at least: a node mileage, and a previous hop node of the node;
    基于更新后的各子域的节点状态,对各所述子域分别进行最短路径路由提取;Performing shortest path route extraction for each of the subdomains based on the updated node status of each subdomain;
    连接所提取的各所述子域的最短路径路由,得到所述SDN的第一最短路径路由。The shortest path route of each of the extracted sub-domains is connected to obtain a first shortest path route of the SDN.
  2. 根据权利要求1所述的方法,其中,所述SDN包括至少两个网络层级;相应的,所述初始化所述SDN,包括:The method of claim 1, wherein the SDN comprises at least two network levels; and correspondingly, the initializing the SDN comprises:
    分别获取所述SDN中各网络层级的子域的可用网络拓扑,以及所述SDN中各子域的边界节点;Obtaining an available network topology of each sub-domain of each network level in the SDN, and a boundary node of each sub-domain in the SDN;
    依据路由获取请求确定所获取的所述可用网络拓扑中各链路的链路权重,存储所获取的所述SDN中各子域的边界节点并初始化各子域节点的节点状态。The link weights of the links in the available network topology are determined according to the route acquisition request, the obtained boundary nodes of each sub-domain in the SDN are stored, and the node states of the sub-domain nodes are initialized.
  3. 根据权利要求2所述的方法,其中,所述分别获取所述SDN中各网络层级的子域的可用网络拓扑,以及所述SDN中各子域的边界节点,包括:The method of claim 2, wherein the obtaining the available network topologies of the sub-domains of the network tiers in the SDN, and the boundary nodes of the sub-domains in the SDN, respectively:
    从接收到的所述路由获取请求中,提取所述SDN的路由策略及边界节点;Extracting, from the received route obtaining request, a routing policy and a boundary node of the SDN;
    基于所述SDN的路由策略,按照网络层级由高到低的顺序,依次获取所述SDN中各网络层级的子域的可用网络拓扑,以及所述SDN中各子域的边界节点。And obtaining, according to the routing policy of the SDN, the available network topologies of the sub-domains of each network level in the SDN, and the boundary nodes of each sub-domain in the SDN, in descending order of the network level.
  4. 根据权利要求1所述的方法,其中,所述更新所述SDN中各子域的节点状态,包括:The method of claim 1, wherein the updating the node status of each sub-domain in the SDN comprises:
    基于所述SDN的路由起点,更新所述SDN的路由起点所在子域的节点的节点状态;Updating a node status of a node of the sub-domain where the routing start point of the SDN is located, based on a routing start point of the SDN;
    基于更新后的所述SDN的路由起点所在子域的边界节点的节点状态,迭代更新所述SDN的其它子域的节点的节点状态。Updating the node status of the nodes of the other sub-domains of the SDN based on the node status of the boundary node of the sub-domain where the routing start point of the SDN is updated.
  5. 根据权利要求4所述的方法,其中,所述更新所述SDN的路由起点所在子域网络的节点的节点状态,包括:The method according to claim 4, wherein the updating the node status of the node of the sub-domain network where the routing origin of the SDN is located includes:
    将所述SDN的路由起点作为其所在子域的路由起点,确定所述SDN的路 由起点所在子域的节点距路由起点的节点里程,以及所述SDN的路由起点所在子域网络的节点的上一跳节点。Determining the route starting point of the SDN as the starting point of the routing of the sub-domain, determining the node mileage of the node in the sub-domain where the routing start point of the SDN is located from the starting point of the routing, and the node of the sub-domain network where the routing starting point of the SDN is located One hop node.
  6. 根据权利要求4所述的方法,其中,所述基于更新后的所述SDN的路由起点所在子域的边界节点的节点状态,迭代更新所述SDN的其它子域的节点的节点状态,包括:The method according to claim 4, wherein the iteratively updating the node status of the nodes of the other sub-domains of the SDN based on the node status of the boundary node of the sub-domain in which the routing start point of the SDN is updated includes:
    获取所述SDN中各个子域的域间链路关系;Obtaining an inter-domain link relationship of each sub-domain in the SDN;
    基于所述域间链路关系,确定与所述SDN的路由起点所在子域相连的子域的路由起点;Determining, according to the inter-domain link relationship, a route start point of the sub-domain connected to the sub-domain where the routing start point of the SDN is located;
    基于所确定的所述路由起点的节点状态,更新与所述SDN的路由起点所在子域相连的子域的节点的节点状态;Updating a node status of a node of the sub-domain connected to the sub-domain where the routing start point of the SDN is located, based on the determined node status of the routing start point;
    以此类推,迭代更新所述SDN的其它子域的节点的节点状态。By analogy, the node state of the nodes of the other sub-domains of the SDN is iteratively updated.
  7. 根据权利要求1所述的方法,其中,所述对各所述子域分别进行最短路径路由提取,包括:The method of claim 1, wherein the performing the shortest path route extraction for each of the subdomains comprises:
    从接收到的所述路由获取请求中,提取所述SDN的路由终点;Extracting, from the received route acquisition request, a route end point of the SDN;
    根据所述SDN的路由终点所在子域的节点的节点状态,从所述SDN的路由终点开始回溯,得到所述SDN的路由终点所在子域的最短路径路由;According to the node status of the node of the sub-domain where the routing end point of the SDN is located, starting from the routing end point of the SDN, obtaining the shortest path routing of the sub-domain where the routing end point of the SDN is located;
    根据所得到的所述最短路径路由,迭代获取所述SDN的其它子域的最短路径路由。Obtaining the shortest path route of the other sub-domains of the SDN according to the obtained shortest path route.
  8. 根据权利要求7所述的方法,其中,所述根据所得到的所述最短路径路由,迭代获取所述SDN的其它子域的最短路径路由,包括:The method according to claim 7, wherein the iteratively obtaining the shortest path route of the other sub-domains of the SDN according to the obtained shortest path route includes:
    根据所得到的所述最短路径路由,确定与所述SDN的路由终点所在子域相连的子域的路由回溯节点;Determining, according to the obtained shortest path route, a route backtracking node of the subdomain connected to the subdomain where the routing end point of the SDN is located;
    基于确定的所述路由回溯节点,以及所述路由回溯节点所在子域的节点状态,获取所述路由回溯节点所在子域的最短路径路由;Obtaining, according to the determined route backtracking node, the node state of the subdomain where the route backtracking node is located, obtaining the shortest path route of the subdomain where the route backtracking node is located;
    以此类推,迭代得到所述SDN的其它子域的最短路径路由;By analogy, iteratively obtains the shortest path route of other subdomains of the SDN;
    其中,迭代得到的最后一个最短路径路由的路由起点为所述SDN的路由起点。The route origin of the last shortest path route obtained by the iteration is the route start point of the SDN.
  9. 根据权利要求1所述的方法,其中,所述方法还包括:The method of claim 1 wherein the method further comprises:
    根据所述SDN的路由获取请求,确定所述SDN的路由对应的业务类型;Determining, according to the route obtaining request of the SDN, a service type corresponding to the route of the SDN;
    根据所确定的所述业务类型,获取不同于所述第一最短路径路由的所述SDN的第二最短路径路由。And obtaining, according to the determined service type, a second shortest path route of the SDN different from the first shortest path route.
  10. 根据权利要求9所述的方法,其中,所述获取不同于所述第一最短路径路由的所述SDN的第二最短路径路由,包括:The method of claim 9, wherein the obtaining the second shortest path route of the SDN different from the first shortest path route comprises:
    根据预设的权重策略,更新各子域中链路的链路权重;Update link weights of links in each subdomain according to a preset weighting policy;
    初始化所述SDN各子域的节点状态;Initializing the node status of each sub-domain of the SDN;
    基于更新后的所述各子域中链路的链路权重,更新所述SDN中各子域的节点的节点状态;Updating a node status of a node of each sub-domain in the SDN based on the updated link weight of the link in each sub-domain;
    基于更新后的所述SDN中各子域的节点的节点状态,得到不同于所述第一最短路径路由的所述SDN的第二最短路径路由。And obtaining, according to the updated node status of the node of each sub-domain in the SDN, a second shortest path route of the SDN different from the first shortest path route.
  11. 根据权利要求10所述的方法,其中,所述根据预设的权重策略,更新各子域中链路的链路权重,包括:The method according to claim 10, wherein the updating the link weight of the link in each subdomain according to the preset weight policy comprises:
    根据以下公式更新各子域中链路的链路权重:Update the link weights of the links in each subdomain according to the following formula:
    w'(u,v)=w(u,v)-d(A,v)+d(A,u);w'(u,v)=w(u,v)-d(A,v)+d(A,u);
    其中,w'(u,v)为更新后的节点u和节点v之间的链路权重,w(u,v)为节点u和节点v之间的原始链路权重,d(A,v)为节点v距所述SDN的路由起点A的里程,d(A,u)为节点u距所述SDN的路由起点A的里程。Where w'(u,v) is the link weight between the updated node u and node v, and w(u,v) is the original link weight between node u and node v, d(A,v) ) is the mileage of the node v from the routing start point A of the SDN, and d(A, u) is the mileage of the node u from the routing start point A of the SDN.
  12. 根据权利要求10所述的方法,其中,所述方法还包括:The method of claim 10, wherein the method further comprises:
    设置所述第一最短路径路由的正向链路权重不小于权重阈值,并设置所述第一最短路径路由的反向链路权重为零。And setting a forward link weight of the first shortest path route to be not less than a weight threshold, and setting a reverse link weight of the first shortest path route to be zero.
  13. 根据权利要求10所述的方法,其中,所述方法还包括:The method of claim 10, wherein the method further comprises:
    确定所述SDN的第一最短路径路由与所述第二最短路径路由所构成的网络拓扑中存在重叠的链路;Determining that there is an overlapping link in the network topology formed by the first shortest path route of the SDN and the second shortest path route;
    删除所确定的所述重叠的链路,以得到由一条作为工作路径和一条作为保护路径的两条最短路径组成的最短分离路径对。The determined overlapping links are deleted to obtain a shortest separated path pair consisting of one working path and one shortest path as a protection path.
  14. 根据权利要求1至13任一项所述的方法,其中,The method according to any one of claims 1 to 13, wherein
    所述SDN的路由获取请求携带以下信息至少之一:The route acquisition request of the SDN carries at least one of the following information:
    所述路由获取请求对应的路由标识ID、所述路由获取请求对应的发送方ID、所述路由获取请求对应的接收方ID、所述路由获取请求对应的业务等级、所述路由获取请求对应的业务类型、所述路由获取请求对应的请求类型、所述路由获取请求对应的请求参数。a route identifier ID corresponding to the route acquisition request, a sender ID corresponding to the route acquisition request, a receiver ID corresponding to the route acquisition request, a service level corresponding to the route acquisition request, and a route acquisition request. The service type, the request type corresponding to the route acquisition request, and the request parameter corresponding to the route acquisition request.
  15. 一种软件定义网络SDN的路由获取装置,所述装置包括:A route obtaining device for a software-defined network SDN, the device comprising:
    初始化模块,设置为响应于接收到的所述SDN的路由获取请求,初始化所 述SDN;An initialization module, configured to initialize the SDN in response to the received route acquisition request of the SDN;
    更新模块,设置为更新所述SDN中各子域的节点状态;所述节点状态至少包括:节点里程、节点的上一跳节点;An update module, configured to update a node status of each sub-domain in the SDN; the node status includes at least: a node mileage, and a previous hop node of the node;
    提取模块,设置为基于更新后的各子域的节点状态,对各所述子域分别进行最短路径路由提取,并连接所提取的各所述子域的最短路径路由,得到所述SDN的第一最短路径路由。The extracting module is configured to perform shortest path routing extraction for each of the subdomains based on the updated node status of each subdomain, and connect the extracted shortest path routes of each of the subdomains to obtain the SDN number A shortest path route.
  16. 根据权利要求15所述的装置,其中,所述SDN包括至少两个网络层级;相应的,The apparatus of claim 15 wherein said SDN comprises at least two network levels; correspondingly,
    所述初始化模块,还设置为分别获取所述SDN中各网络层级的子域的可用网络拓扑,以及所述SDN中各子域的边界节点,并初始化各子域的节点状态;The initialization module is further configured to acquire an available network topology of each sub-domain of each network level in the SDN, and a boundary node of each sub-domain in the SDN, and initialize a node status of each sub-domain;
    依据路由获取请求确定所获取的所述可用网络拓扑中各链路的链路权重,并存储所获取的所述SDN中各子域的边界节点。Determining, according to the route acquisition request, the link weight of each link in the obtained available network topology, and storing the obtained boundary node of each sub-domain in the SDN.
  17. 根据权利要求16所述的装置,其中,The device according to claim 16, wherein
    所述初始化模块,还设置为从接收到的所述路由获取请求中,提取所述SDN的路由策略及边界节点;The initialization module is further configured to extract a routing policy and a boundary node of the SDN from the received route obtaining request;
    基于所述SDN的路由策略,按照网络层级由高到低的顺序,依次获取所述SDN中各网络层级的子域的可用网络拓扑,以及所述SDN中各子域的边界节点。And obtaining, according to the routing policy of the SDN, the available network topologies of the sub-domains of each network level in the SDN, and the boundary nodes of each sub-domain in the SDN, in descending order of the network level.
  18. 根据权利要求15所述的装置,其中,The device according to claim 15, wherein
    所述更新模块,还设置为基于所述SDN的路由起点,更新所述SDN的路由起点所在子域的节点的节点状态;The update module is further configured to update a node state of a node of the subdomain where the routing start point of the SDN is located, based on a routing start point of the SDN;
    基于更新后的所述SDN的路由起点所在子域的边界节点的节点状态,迭代更新所述SDN的其它子域的节点的节点状态。Updating the node status of the nodes of the other sub-domains of the SDN based on the node status of the boundary node of the sub-domain where the routing start point of the SDN is updated.
  19. 根据权利要求18所述的装置,其中,The device according to claim 18, wherein
    所述更新模块,还设置为将所述SDN的路由起点作为其所在子域的路由起点,确定所述SDN的路由起点所在子域的节点距路由起点的节点里程,以及所述SDN的路由起点所在子域网络的节点的上一跳节点。The update module is further configured to use the routing start point of the SDN as a routing start point of the sub-domain in which the SDN is located, determine the node mileage of the node in the sub-domain where the routing start point of the SDN is located, and the routing starting point of the SDN The last hop node of the node in the subdomain network.
  20. 根据权利要求18所述的装置,其中,The device according to claim 18, wherein
    所述更新模块,还设置为获取所述SDN中各个子域的域间链路关系;The update module is further configured to acquire an inter-domain link relationship of each sub-domain in the SDN;
    基于所述域间链路关系,确定与所述SDN的路由起点所在子域相连的子域的路由起点;Determining, according to the inter-domain link relationship, a route start point of the sub-domain connected to the sub-domain where the routing start point of the SDN is located;
    基于所确定的所述路由起点的节点状态,更新与所述SDN的路由起点所在子域相连的子域的节点的节点状态;Updating a node status of a node of the sub-domain connected to the sub-domain where the routing start point of the SDN is located, based on the determined node status of the routing start point;
    以此类推,迭代更新所述SDN的其它子域的节点的节点状态。By analogy, the node state of the nodes of the other sub-domains of the SDN is iteratively updated.
  21. 根据权利要求15所述的装置,其中,The device according to claim 15, wherein
    所述提取模块,还设置为从接收到的所述路由获取请求中,提取所述SDN的路由终点;The extracting module is further configured to extract a routing end point of the SDN from the received route obtaining request;
    根据所述SDN的路由终点所在子域的节点的节点状态,从所述SDN的路由终点开始回溯,得到所述SDN的路由终点所在子域的最短路径路由;According to the node status of the node of the sub-domain where the routing end point of the SDN is located, starting from the routing end point of the SDN, obtaining the shortest path routing of the sub-domain where the routing end point of the SDN is located;
    根据所得到的所述最短路径路由,迭代获取所述SDN的其它子域的最短路径路由。Obtaining the shortest path route of the other sub-domains of the SDN according to the obtained shortest path route.
  22. 根据权利要求21所述的装置,其中,The device according to claim 21, wherein
    所述提取模块,还设置为根据所得到的所述最短路径路由,确定与所述SDN的路由终点所在子域相连的子域的路由回溯节点;The extracting module is further configured to determine, according to the obtained shortest path route, a route backtracking node of the subdomain connected to the subdomain where the routing end point of the SDN is located;
    基于确定的所述路由回溯节点,以及所述路由回溯节点所在子域的节点状态,获取所述路由回溯节点所在子域的最短路径路由;Obtaining, according to the determined route backtracking node, the node state of the subdomain where the route backtracking node is located, obtaining the shortest path route of the subdomain where the route backtracking node is located;
    以此类推,迭代得到所述SDN的其它子域的最短路径路由;By analogy, iteratively obtains the shortest path route of other subdomains of the SDN;
    其中,迭代得到的最后一个最短路径路由的路由起点为所述SDN的路由起点。The route origin of the last shortest path route obtained by the iteration is the route start point of the SDN.
  23. 根据权利要求15所述的装置,其中,The device according to claim 15, wherein
    所述初始化模块,还设置为根据所述SDN的路由获取请求,确定所述SDN的路由对应的业务类型;The initialization module is further configured to determine a service type corresponding to the route of the SDN according to the route acquisition request of the SDN;
    以及,根据预设的权重策略,更新各子域中链路的链路权重,并初始化所述SDN各子域的节点的节点状态;And updating a link weight of the link in each subdomain according to a preset weight policy, and initializing a node state of the node of each subdomain of the SDN;
    所述更新模块,还设置为基于更新后的所述各子域中链路的链路权重,更新所述SDN中各子域的节点的节点状态;The update module is further configured to update a node state of a node of each subdomain in the SDN based on the updated link weight of the link in each subdomain;
    所述提取模块,还设置为基于更新后的所述SDN中各子域的节点的节点状态,得到不同于所述第一最短路径路由的所述SDN的第二最短路径路由。The extracting module is further configured to obtain a second shortest path route of the SDN different from the first shortest path route, based on the node status of the node of each subdomain in the updated SDN.
  24. 根据权利要求23所述的装置,其中,The device according to claim 23, wherein
    所述初始化模块,还设置为根据以下公式更新各子域中链路的链路权重:The initialization module is further configured to update link weights of links in each subdomain according to the following formula:
    w'(u,v)=w(u,v)-d(A,v)+d(A,u);w'(u,v)=w(u,v)-d(A,v)+d(A,u);
    其中,w'(u,v)为更新后的节点u和节点v之间的链路权重,w(u,v)为节点u 和节点v之间的原始链路权重,d(A,v)为节点v距所述SDN的路由起点A的里程,d(A,u)为节点u距所述SDN的路由起点A的里程。Where w'(u,v) is the link weight between the updated node u and node v, and w(u,v) is the original link weight between node u and node v, d(A,v) ) is the mileage of the node v from the routing start point A of the SDN, and d(A, u) is the mileage of the node u from the routing start point A of the SDN.
  25. 根据权利要求23所述的装置,其中,The device according to claim 23, wherein
    所述初始化模块,还设置为设置所述第一最短路径路由的正向链路权重不小于权重阈值,并设置所述第一最短路径路由的反向链路权重为零。The initialization module is further configured to set a forward link weight of the first shortest path route to be not less than a weight threshold, and set a reverse link weight of the first shortest path route to be zero.
  26. 根据权利要求23所述的装置,其中,The device according to claim 23, wherein
    所述提取模块,还设置为确定所述SDN的第一最短路径路由与所述第二最短路径路由所构成的网络拓扑中存在重叠的链路;The extracting module is further configured to determine a link that overlaps between the first shortest path route of the SDN and the second shortest path route;
    删除所确定的所述重叠的链路,以得到由一条作为工作路径和一条作为保护路径的两条最短路径组成的最短分离路径对。The determined overlapping links are deleted to obtain a shortest separated path pair consisting of one working path and one shortest path as a protection path.
  27. 根据权利要求15至26任一项所述的装置,其中,The apparatus according to any one of claims 15 to 26, wherein
    所述SDN的路由获取请求携带以下信息至少之一:The route acquisition request of the SDN carries at least one of the following information:
    所述路由获取请求对应的路由标识ID、所述路由获取请求对应的发送方ID、所述路由获取请求对应的接收方ID、所述路由获取请求对应的业务等级、所述路由获取请求对应的业务类型、所述路由获取请求对应的请求类型、所述路由获取请求对应的请求参数。a route identifier ID corresponding to the route acquisition request, a sender ID corresponding to the route acquisition request, a receiver ID corresponding to the route acquisition request, a service level corresponding to the route acquisition request, and a route acquisition request. The service type, the request type corresponding to the route acquisition request, and the request parameter corresponding to the route acquisition request.
  28. 一种软件定义网络SDN的路由获取装置,所述装置包括:A route obtaining device for a software-defined network SDN, the device comprising:
    存储器,配置为存储可执行程序;a memory configured to store an executable program;
    处理器,配置为执行所述存储器中存储的可执行程序时,实现如权利要求1至14任一项所述的SDN的路由获取方法。The processor, configured to perform the route acquisition method of the SDN according to any one of claims 1 to 14, when configured to execute an executable program stored in the memory.
  29. 一种存储介质,存储有可执行程序,所述可执行程序被处理器执行时,实现如权利要求1至14任一项所述的SDN的路由获取方法。A storage medium storing an executable program, the executable program being executed by a processor, implementing the route acquisition method of the SDN according to any one of claims 1 to 14.
PCT/CN2018/119604 2018-05-16 2018-12-06 Method and device for acquiring route of software-defined network and storage medium WO2019218649A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201810468360.2A CN110572323B (en) 2018-05-16 2018-05-16 Route acquisition method, device and storage medium of software defined network
CN201810468360.2 2018-05-16

Publications (1)

Publication Number Publication Date
WO2019218649A1 true WO2019218649A1 (en) 2019-11-21

Family

ID=68539378

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/119604 WO2019218649A1 (en) 2018-05-16 2018-12-06 Method and device for acquiring route of software-defined network and storage medium

Country Status (2)

Country Link
CN (1) CN110572323B (en)
WO (1) WO2019218649A1 (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113872669A (en) * 2021-09-27 2021-12-31 中国电子科技集团公司第五十四研究所 Stateless distributed networking control system suitable for low-earth-orbit satellite network
CN114124794A (en) * 2021-08-24 2022-03-01 广东省电信规划设计院有限公司 Service sub-domain bearing planning method and device based on multi-region optical network system

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112350948B (en) * 2020-10-28 2021-07-16 武汉大学 Distributed network tracing method of SDN-based distributed network tracing system

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104363173A (en) * 2014-10-31 2015-02-18 武汉烽火网络有限责任公司 Forwarding router information generation method, controller and software-defined networking system
CN105049231A (en) * 2015-06-19 2015-11-11 中国人民解放军信息工程大学 Layered cross-domain network management control system
CN106453077A (en) * 2015-08-10 2017-02-22 中国电信股份有限公司 Tiered routing management method, master controller, subdomain controller and SDN
US9794165B1 (en) * 2014-09-29 2017-10-17 Juniper Networks, Inc. Batched path computation in resource-constrained networks

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7330435B2 (en) * 2001-11-29 2008-02-12 Iptivia, Inc. Method and system for topology construction and path identification in a routing domain operated according to a link state routing protocol
US9729424B2 (en) * 2012-06-11 2017-08-08 Futurewei Technologies, Inc. Defining data flow paths in software-defined networks with application-layer traffic optimization
US9246803B2 (en) * 2014-01-02 2016-01-26 Futurewei Technologies, Inc. Method and apparatus for scalable content routing and mobility in named data networks
CN105656654A (en) * 2014-11-14 2016-06-08 中兴通讯股份有限公司 Path obtaining method, multi-domain controller, cross-domain business protection method and system
CN106375214B (en) * 2016-11-10 2019-05-17 北京邮电大学 A kind of Tiered routing determining method of path and device based on SDN
CN106850435A (en) * 2016-12-16 2017-06-13 北京格林伟迪科技股份有限公司 A kind of cross-domain end-to-end label exchange route setting method and system

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9794165B1 (en) * 2014-09-29 2017-10-17 Juniper Networks, Inc. Batched path computation in resource-constrained networks
CN104363173A (en) * 2014-10-31 2015-02-18 武汉烽火网络有限责任公司 Forwarding router information generation method, controller and software-defined networking system
CN105049231A (en) * 2015-06-19 2015-11-11 中国人民解放军信息工程大学 Layered cross-domain network management control system
CN106453077A (en) * 2015-08-10 2017-02-22 中国电信股份有限公司 Tiered routing management method, master controller, subdomain controller and SDN

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114124794A (en) * 2021-08-24 2022-03-01 广东省电信规划设计院有限公司 Service sub-domain bearing planning method and device based on multi-region optical network system
CN114124794B (en) * 2021-08-24 2023-12-26 广东省电信规划设计院有限公司 Service domain bearing planning method and device based on multi-area optical network system
CN113872669A (en) * 2021-09-27 2021-12-31 中国电子科技集团公司第五十四研究所 Stateless distributed networking control system suitable for low-earth-orbit satellite network

Also Published As

Publication number Publication date
CN110572323A (en) 2019-12-13
CN110572323B (en) 2022-03-22

Similar Documents

Publication Publication Date Title
US11463313B2 (en) Topology-aware controller associations in software-defined networks
CN104685838B (en) Virtualized using abstract and interface the software defined network of particular topology is serviced
US7382738B2 (en) Method and apparatus for computing metric information for abstracted network links
WO2019218649A1 (en) Method and device for acquiring route of software-defined network and storage medium
WO2007143904A1 (en) Method and system of multiple domain route computation
CN103548325A (en) Cloud service control and management architecture expanded to interface the network stratum
US10554500B2 (en) Modeling access networks as trees in software-defined network controllers
US20190020539A1 (en) Method and apparatus for implementing composed virtual private network vpn
CN108432191A (en) Communication between network controller
JP2013510459A (en) Separate path computation algorithm
CN104025513A (en) Hierarchy of control in a data center network
JP5869041B2 (en) Method for mapping network topology request to physical network, computer program product, mobile communication system, and network configuration platform
CN109417508A (en) The connection and access of hierarchical path computing unit (PCE)
WO2007062608A1 (en) A method for realizing the separate routes spanning domains
CN113242179B (en) SDN-based SR path calculation and label stack generation method and SDN controller
CN108092733A (en) Determining method of path that IP network is merged with optical transport network, apparatus and system
CN104718729A (en) Control apparatus, control method thereof, and program
WO2018095095A1 (en) Method and apparatus for establishing disjoint path
CN108400922B (en) Virtual local area network configuration system and method and computer readable storage medium thereof
Feamster et al. Network-wide BGP route prediction for traffic engineering
EP2983333B1 (en) A system and method for providing routes to physical residential gateways
JP6042838B2 (en) Management system, management server, and management method
EP3993356A1 (en) Interdomain path calculation based on an abstract topology
CN111884827B (en) Method for synchronizing topological information in SFC network and routing network element
RU2775146C1 (en) Method for automated provision of a virtual channel by a communication operator between data processing centers

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: 18918499

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 18918499

Country of ref document: EP

Kind code of ref document: A1