WO2016004752A1 - Method and device for determining end-to-end routing - Google Patents

Method and device for determining end-to-end routing Download PDF

Info

Publication number
WO2016004752A1
WO2016004752A1 PCT/CN2015/071133 CN2015071133W WO2016004752A1 WO 2016004752 A1 WO2016004752 A1 WO 2016004752A1 CN 2015071133 W CN2015071133 W CN 2015071133W WO 2016004752 A1 WO2016004752 A1 WO 2016004752A1
Authority
WO
WIPO (PCT)
Prior art keywords
subnet
route
effective
cross
valid
Prior art date
Application number
PCT/CN2015/071133
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 WO2016004752A1 publication Critical patent/WO2016004752A1/en

Links

Images

Definitions

  • the present invention relates to the field of mobile communications technologies, and in particular, to a method and apparatus for determining end-to-end routing.
  • the service is created by the user using the network control system to input the relevant information such as the starting and ending endpoints of the service.
  • the network control system uses the physical link and port data stored in the database or device to perform calculations.
  • the service configuration data is sent to the device, and then the configuration data is sent to the network element device to open a communication link.
  • the per-domain routing computer system is simple, suitable for simple route calculation between inter-domain connections, but it is difficult to find the optimal route for complex route calculation between inter-domain connections; reverse recursion
  • the advantage of route calculation is that the cross-domain end-to-end optimal route can be obtained.
  • the disadvantages are: need to run the protocol, repeated recursive calculation through distributed operation, the method is more complicated, and the calculation efficiency is low; the advantage of the hierarchical PCE route calculation method is that the cross-domain can be obtained. Domain end-to-end optimal routing, And the relative reverse recursive routing calculation method does not require recursive calculation, and the method is simple.
  • the cross-domain topology information used by the parent PCE to calculate the cross-domain topology information is the pre-obtained inter-domain link information, and is not the current real-time network topology. Therefore, the final cross-domain end-to-end optimal route is calculated. The accuracy is poor.
  • embodiments of the present invention are expected to provide a method and apparatus for determining end-to-end routing, and determining a cross-domain end-to-end shortest path with high accuracy by a simple calculation method.
  • An embodiment of the present invention provides a method for determining an end-to-end route, where the method includes: when receiving a first request, determining an effective cross-subnet route according to the first request; and routing to the effective cross-subnet route
  • the effective subnet sends the second request to obtain the topology information of the valid subnet; the end-to-end routing information is determined according to the effective cross-subnet routing and the topology information, and the route represented by the end-to-end routing information is selected as End-to-end routing.
  • the first request carries a start end point and a terminating end point.
  • determining the effective cross-subnet route according to the first request is specifically: determining that the lower level subnet to which the start end point belongs is Determining a subnet, determining that the subnet to which the terminating endpoint belongs is a terminating subnet, calculating a shortest cross-subnet route between the starting subnet and the terminating subnet by using a shortest path, and determining the shortest cross-subnet The route is the valid cross-subnet route.
  • the method further includes: setting a lower subnet through which the effective cross-subnet route passes as a valid subnet, and setting a lower subnet whose valid cross-subnet route has not passed as an invalid subnet.
  • the method before sending the second request to the valid subnet to which the effective cross-subnet route passes, the method further includes: acquiring a boundary point of the effective subnet; and calculating the effective cross according to the boundary point An abstract topology of subnet routes; according to the effective cross-subnet routing and the abstraction The topology obtains a valid abstract route, where the abstract topology is specifically: a route calculated by using the effective subnet as a full-cross object.
  • determining end-to-end routing information according to the effective cross-subnet routing and the topology information includes: calculating, according to the effective abstract route, a valid route in the subnet of the effective subnet on a boundary node of the effective subnet And generating the end-to-end routing information according to the valid abstract route and the effective route in the subnet.
  • the method further includes: selecting at least two end-to-end routes, setting an end-to-end route of the at least two end-to-end routes as a working route, and setting the other than the working route End-to-end routing is to protect routes.
  • the embodiment of the present invention further provides an apparatus for determining an end-to-end route, where the apparatus includes: a receiving module, an obtaining module, and a selecting module; wherein the receiving module is configured to receive the first request according to the Requesting to determine a valid cross-subnet route; the obtaining module, configured to send a second request to the valid subnet through which the effective cross-subnet route passes, obtain topology information of the effective subnet; To determine end-to-end routing information according to the effective cross-subnet routing and the topology information, the route characterized by the end-to-end routing information is selected as an end-to-end route.
  • the receiving module is specifically configured to: receive a first request that carries a start endpoint and terminate the endpoint; determine that the lower subnet to which the start endpoint belongs is a start subnet, and determine that the termination endpoint belongs to The lower subnet is the terminating subnet, and the shortest cross-subnet route between the starting subnet and the ending subnet is calculated by the shortest path by the policy, and the shortest cross-subnet route is determined to be the effective cross-subnet route.
  • the device further includes: a setting module, where the setting module is configured to set the lower subnet through which the effective cross-subnet route passes as a valid subnet, and the effective cross-subnet route is not passed.
  • the subnet is set to an invalid subnet.
  • the apparatus further includes: an abstract routing module; the abstract routing module, Configuring to obtain a boundary point of the effective subnet; calculating an abstract topology of the effective cross-subnet route according to the boundary point; obtaining an effective abstract route according to the effective cross-subnet route and the abstract topology;
  • the abstract topology is specifically: a route calculated by using the valid subnet as a full-cross object.
  • the selecting module is specifically configured to: calculate, according to the effective abstract route, a valid route in the subnet of the effective subnet on the boundary node of the effective subnet; according to the effective abstract route, in the subnet A valid route generates the end-to-end routing information.
  • the device further includes: a protection module, configured to select at least two end-to-end routes, and set an end-to-end route of the at least two end-to-end routes as a working route And setting the end-to-end route other than the working route as a protection route.
  • a protection module configured to select at least two end-to-end routes, and set an end-to-end route of the at least two end-to-end routes as a working route And setting the end-to-end route other than the working route as a protection route.
  • the receiving module, the obtaining module, the selecting module, the setting module, the abstract routing module, and the protection module adopt a central processing unit (CPU) and digital signal processing when performing processing. (DSP, Digital Singnal Processor) or Programmable Array (FPGA) implementation.
  • CPU central processing unit
  • DSP Digital Singnal Processor
  • FPGA Programmable Array
  • An embodiment of the present invention provides a method and an apparatus for determining an end-to-end route, where the method includes: receiving a first request, determining an effective cross-subnet route according to the first request, and routing to the effective cross-subnet route
  • the effective subnet sends the second request to obtain the topology information of the valid subnet;
  • the end-to-end routing information is determined according to the effective cross-subnet routing and the topology information, and the route represented by the end-to-end routing information is selected as End-to-end routing;
  • a highly accurate cross-domain end-to-end shortest path is determined by a simple calculation method, and the end-to-end short-circuit service can be directly created on the end-to-end short-circuit by directly creating a cross-subnet end-to-end service, thereby being large
  • the network scale that the network control system can manage is increased, the time of route calculation is reduced, and the accuracy of route calculation is improved.
  • FIG. 1 is a schematic network diagram of a method for determining end-to-end routing according to an embodiment of the present invention
  • FIG. 2 is a schematic flowchart of a method for determining end-to-end routing according to an embodiment of the present invention
  • FIG. 3 is a schematic flowchart diagram of a method for determining end-to-end routing according to a specific example
  • FIG. 4 is a schematic diagram of a network for calculating cross-subnet routes
  • Figure 5 is a schematic diagram of a network in which an invalid subnet is removed
  • FIG. 6 is a schematic diagram of a network for computing a subnet abstract topology
  • FIG. 7 is a schematic diagram of a network topology for calculating an end-to-end route
  • Figure 8 is a schematic diagram of a network of end-to-end routing
  • FIG. 9 is a schematic flow chart of a method for determining end-to-end routing according to a specific example
  • FIG. 10 is a schematic structural diagram of an apparatus for determining end-to-end routing according to an embodiment of the present disclosure
  • FIG. 11 is a schematic structural diagram of another apparatus for determining end-to-end routing according to an embodiment of the present invention.
  • the first request is received, the effective cross-subnet route is determined according to the first request, and the second request is sent to the valid subnet through which the effective cross-subnet route passes, and the effective subnet is obtained.
  • the topology information is determined according to the effective cross-subnet route and the topology information, and the route characterized by the end-to-end routing information is selected as an end-to-end route.
  • Routing A collection of nodes through which a service passes.
  • Edge refers to a specific relationship between the objects being studied. When calculating the route, it refers to the connectivity of the two objects under study.
  • Routing Constraint A resource entered by a user that requires the route calculation to calculate the result that must (or is prohibited) the passed resource.
  • Endpoint The starting or ending point of the business.
  • Network control system A system responsible for the creation of services. It can be a network management system, an Automatic Switch Optical Network (ASON), a Software Defined Network (SDN) controller, or the like.
  • ASON Automatic Switch Optical Network
  • SDN Software Defined Network
  • the network control system includes a superior subnet controller and a subordinate subnet controller.
  • the network controller of the upper subnet shown in FIG. 1 is an upper subnet controller, and a subnet (sn, Subnet)1, sn2, sn3, sn4, and sn5 are subordinate subnets under the upper subnet.
  • Each subnet has its own network controller, and the network controller of the subnet is the subnet controller.
  • a superior subnet may include a plurality of subnets.
  • the method includes the following steps:
  • Step 201 When receiving the first request, determine an effective cross-subnet route according to the first request.
  • the specified start end and the end point carried by the first request determine the subordinate to which the start end belongs.
  • the subnet is the starting subnet, and the subnet to which the terminating endpoint belongs is determined to be the terminating subnet.
  • the shortest path is used to calculate the shortest subnet route between the starting subnet and the ending subnet, and the shortest cross-subnet is determined.
  • the route is the valid cross-subnet route.
  • the shortest path is the cross-subnet route with the lowest routing cost.
  • the lower-level subnet through which the effective cross-subnet route passes is identified as a valid subnet, and the lower-level subnet through which the effective cross-subnet route is not passed is identified as an invalid subnet.
  • Step 202 Send a second request to the valid subnet through which the effective cross-subnet route passes, and acquire topology information of the effective subnet.
  • the sub-subnet controller After determining the effective cross-subnet route, sending a second request to the sub-subnet controller of all the sub-subnets through which the effective cross-subnet route passes, where all the sub-subnets through which the effective sub-subnet route passes are transmitted.
  • the topology information of the valid subnet report is received, where the topology information includes: the shortest path of the effective subnet, and the shortest path by the corresponding edge node.
  • the method further includes: acquiring a boundary point of the effective subnet; and calculating the effective cross-subnet route according to the boundary point
  • An abstract topology is obtained according to the effective cross-subnet route and the abstract topology; wherein the abstract topology is specifically: a route calculated by using the effective subnet as a full-cross object.
  • Step 203 Determine end-to-end routing information according to the effective cross-subnet routing and the topology information, and select the route represented by the end-to-end routing information as an end-to-end route.
  • the route characterized by the end-to-end routing information is an end-to-end route.
  • the method further includes: selecting at least two end-to-end routes, setting an end-to-end route of the at least two end-to-end routes as a working route, and setting the end-to-end route other than the working route as Protect the route.
  • a method for determining an end-to-end route is described by using an example in which a higher-level subnet includes five subnets as shown in FIG. 1, wherein five subnets included in the upper subnet are sn1, sn2, and sn3. , sn4, sn5, where the first request received by the upper subnet controller carries the starting endpoint as node A and the terminating endpoint as node M.
  • the method includes the following steps:
  • Step 301 Calculate a shortest path between subnets according to the first request
  • the upper-level subnet controller After receiving the first request that the starting endpoint is the node A and the terminating endpoint is the node M, the upper-level subnet controller acquires the topology connection across the subnet in the database, and saves the acquired topology connection. And as the edge of the end-to-end route is calculated, the obtained network topology is connected to the network structure shown in FIG. According to the obtained topology connection, it is determined that the subnet to which the node A belongs is sn1, that is, sn1 is the starting subnet, and the subnet to which the terminating terminal M belongs is sn4, that is, sn4 is the terminating subnet.
  • each subnet is assumed to be a node, and the topology across the subnet is taken as the edge, and the shortest path from sn1 to sn4 is calculated according to the shortest path by the policy.
  • the shortest cross-subnet of sn1 to sn4 is the link link2 at the cost of 100 for the route between the paths BG, NJ, and BG indicated by the thick line between sn1-sn2-sn4 in the figure.
  • the route between NJs is the link link6 at the cost of 100.
  • the routing cost of the shortest route across the subnet is the lowest compared to the routing of the other sn1 to sn4 routes, where the routing cost of each route is based on the cost of the path between the lower subnets through which the route passes.
  • the weights of the edges through which the route passes are summed, where the weight of the summation can be the corresponding routing cost for each link.
  • Step 302 Determine a valid subnet according to the shortest path
  • the shortest path determined in step 301 is read by the upper subnet controller for the path BG, NJ, and the shortest subnet is read by the subnet subnet controller.
  • the subnet subnet that passes through the shortest subnet includes: sn1, sn2, sn4, The upper subnet controller sets sn1, sn2, and sn4 as valid subnets, and sets sn3 and sn5 as invalid subnets.
  • the invalid subnets are deleted in the saved network topology connection to save the valid subroutine. network.
  • Step 303 Determine a boundary node of the effective subnet.
  • the upper subnet controller traverses the topology across the effective subnets.
  • the cross-subnet topology between the effective sub-networks sn1, sn2, and sn4 includes: link2, link3, link6, link7, where, link i represents the link identifier of topology i.
  • the A and M endpoints of these topologies are the starting point and ending point of the end-to-end route to be calculated respectively.
  • the boundary points of routing between sn1, sn2, and sn4 include B, C, G, H, N, I, and J. , K.
  • the boundary nodes of sn1 include: A (starting endpoint), B, C; the boundary nodes of sn2 include: G, H, N, I; the boundary nodes of sn3 include: J, K, M (terminating endpoint) .
  • Step 304 Calculate an abstract topology between boundary nodes of the effective subnet
  • the upper subnet controller sends a second request to sn1, sn2, sn4, and requests sn1, sn2, and sn4 to calculate their own abstract topologies.
  • the abstract topology of sn1 is the topology between A, B, and C;
  • the abstract topology of sn2 is the topology between G, H, N, and I, and the abstract topology of sn4 is between J, K, and M.
  • Topology The subnet controllers of sn1, sn2, and sn4 respectively calculate their own abstract topology according to the shortest path policy, and then report the calculated topology information to the superior subnet controller of the superior subnet, where the topology information is the abstract topology.
  • the abstract topology is a carrying weight, and the weight is a routing cost corresponding to the link between the nodes.
  • the shortest path algorithm is the shortest path algorithm, and the shortest path algorithm is the prior art, and will not be described here.
  • Step 305 Calculate a network element level route.
  • the upper-level sub-network controller combines the cross-subnet route between the effective sub-networks of the cross-subnet shortest path calculated in step 301 and the topology information calculated in step 304 to generate a network diagram of the network-level routing, where it is effective.
  • the subnet is regarded as a full-intersection object to determine the network-level route.
  • the boundary node of sn1 as the full-crossing object is A, B, C; and the boundary node of the full-intersection object is G, H, N, I; sn4
  • the boundary nodes that are full-intersection objects are J, K, and M.
  • the determined network element-level route is as shown in FIG. 8 , wherein the bold line is a valid abstract route determined according to the shortest cross-subnet route, and the nodes that the effective abstract route passes are: A, B, G, I, K, M.
  • Step 306 Send a second request, and calculate end-to-end routing information from the starting endpoint to the terminating endpoint.
  • each valid subnet is treated as a full cross object.
  • the shortest path in the subnet inside each effective subnet is calculated, taking sn2 as an example, the network element level routing is at the boundary node G of the sn2 to the node I, in the Sn2, from the node G to Node I has a variety of different routes, and the optimal route from node G to node I is calculated by the policy according to the shortest path.
  • the optimal route in the subnet of sn1 and sn4 is calculated, and the calculated optimal topology of each effective subnet is replaced with the abstract topology of the effective abstract route, as shown in FIG. 9, thereby obtaining a complete End-to-end routing information from the originating endpoint A to the terminating endpoint M.
  • Figure 9 shows a cross-subnet end-to-end route calculation method by taking the service of the bearer network as an example.
  • Step 901 Receive a first request.
  • the upper subnet network controller receives the first request, where the first request carries the information of the starting point and the ending point of the working interval for creating the service input by the user, respectively, A, M, and the starting and ending points of the protection interval.
  • the starting point and the ending point of the working interval and the guard interval are identical.
  • Step 902 Calculate an end-to-end route as a working route.
  • the method for calculating the working route is consistent with steps 201 to 203, specifically:
  • Step 9021 the upper subnet controller calculates the shortest path by the subnet
  • the superior subnet controller regards the subnet managed by itself as a full-crossing object, and assumes that the routing cost within the subnet is zero, that is, the superior subnet controller regards the subnet managed by itself as the route calculation. node.
  • the upper-level subnet obtains the topology connection of the sub-subnet from its own database, and obtains the topology connection of the sub-subnet as the edge of the route calculation, and forms a networking diagram in the memory, as shown in Figure 1. Calculate the shortest path across subnets.
  • the specific calculation method is the same as step 301.
  • Step 9022 The upper subnet controller determines a valid subnet
  • the superior subnet controller sets the subnet to be passed as a valid subnet according to the calculated shortest subnet.
  • the other subnets in the networking diagram that are not short-circuited by the cross-subnet are not valid subnets, are set to invalid subnets, and delete invalid subnets, as in step 302, to minimize the network element level at step 305.
  • the invalid subnet is not calculated at the time of calculation.
  • the topology between valid subnets is regarded as a valid topology resource, and other topology resources are regarded as invalid topology resources.
  • the shortest path at the network element level of step 305 will also not participate in the calculation when calculated.
  • Step 9023 the upper subnet controller determines a boundary node of the effective subnet
  • the upper subnet controller considers the starting subnet and the terminating subnet where the A and M endpoints of the effective topology are connected as the boundary node of the subnet. In this case, all the subnets are viewed by the superior subnet. For the node.
  • the superior subnet controller requests the subordinate subnet controller to calculate an abstract topology between its boundary nodes.
  • the superior subnet controller sends the boundary point of each subnet to the subnet controller of each subordinate effective subnet.
  • the abstract topology between the boundary nodes calculated by the subordinate subnet controller.
  • each effective subordinate subnet controller receives the boundary nodes and then parallelizes the connectivity between the boundary nodes of the respective subnets. Connectivity is seen as an abstract topology connection.
  • These "abstract topologies" can be obtained by finding the minimum spanning tree from the boundary nodes.
  • these abstract topologies have the weight of the topology, which expresses the cost of the connectivity between the boundary nodes, and can be used as the basis for calculating the network-level routing.
  • the subordinate subnet controller returns its abstracted topology to the superior subnet controller.
  • Step 9025 the upper subnet controller calculates the network element level shortest path by
  • the superior subnet controller receives the abstract topology calculated by each subnet and the effective topology of the effective cross-subnet in its own database, and sets the A and M network elements of these edges as nodes to form a network diagram. Calculate the shortest path from the network element level.
  • Step 9026 the upper subnet controller calculates specific routing information of the abstract topology.
  • the upper-level subnet controller sends the abstracted topology in the shortest path to the lower-level subnets to calculate the specific routing information of the abstract topology.
  • the subnet subnet uses the shortest path algorithm to calculate the A and Z points of the abstract topology, and the shortest result is returned, and the settlement result is returned to the superior subnet.
  • the upper subnet controller forms a complete cross-subnet route.
  • the upper subnet controller replaces the routing information of the abstract topology returned by each lower subnet with the corresponding abstract topology in the network element shortest path. Form a complete routing information from A to Z.
  • Step 903 calculating a protection route
  • the weight of the topology connection is increased by the network element through which the work route passes.
  • a protection route is calculated in the same manner as step 902.
  • the degree of separation between the calculated protection route and the working route may be determined to be: the route is completely the same, the route is completely separated, and the route part is separated.
  • the route is completely separated from the node that passes the protection route except the start endpoint and the termination endpoint.
  • the route is exactly the same as the node through which the protection route passes.
  • the route part is separated into the work route and The nodes through which the route is protected are partially identical and partially different.
  • the shortest path algorithm tries to select the edge with the smallest weight so that the weight and the minimum of the edge increase the weight, so that the protection route and the working route do not go through the same node as much as possible, so as to separate the protection route from the work route.
  • the routing information includes a path between the node through which the route passes and the node.
  • an error report may be triggered.
  • the calculated working route and the protection route can be displayed to the user, and the user selects whether to continue to configure the service.
  • Step 904 Generate configuration data, and enable the service to be created.
  • the upper-layer network controller generates the configuration data of the network element device of the service at each node by using the result of the route calculation, and the related data read from the database of the upper-level network controller network or the network element device of each node;
  • the NE device that is delivered to each node; each section
  • the network element device of the point enables the service configuration data to be enabled, so that the service to be created by the user is enabled.
  • the method for determining the end-to-end route provided by the embodiment of the present invention can improve the network size that the network control system can manage in the large-scale bearer network management, reduce the time of route calculation, and improve the accuracy of route calculation.
  • an embodiment of the present invention further provides an apparatus for determining an end-to-end route.
  • the apparatus includes: a receiving module 1001, an obtaining module 1002, and a selecting module 1003.
  • the receiving module 1001 is configured to: when receiving the first request, determine an effective cross-subnet route according to the first request;
  • the first request that carries the initial endpoint and the terminated endpoint is received; the lower subnet to which the initial endpoint belongs is determined to be the starting subnet, and the lower subnet to which the terminating endpoint belongs is determined to be the terminating subnet, and the shortest interval is adopted.
  • the routing policy calculates a shortest cross-subnet route between the starting subnet and the ending subnet, and determines that the shortest cross-subnet route is the effective cross-subnet route.
  • the obtaining module 1002 is configured to send a second request to the valid subnet through which the effective cross-subnet route passes, and obtain topology information of the effective subnet;
  • the acquiring module receives the topology information of the valid subnet report after sending the second request to the effective subnet, where the topology information includes: the shortest path of the effective subnet, and the shortest path is by the corresponding edge node. .
  • the selecting module 1003 is configured to determine the end-to-end routing information according to the effective cross-subnet routing and the topology information, and select the route represented by the end-to-end routing information as an end-to-end route.
  • the end-to-end routing information is generated by the corresponding edge node, and selecting The route characterized by the end-to-end routing information is an end-to-end route.
  • the device further includes: a setting module 1004;
  • Setting module 1004 configured to set the subnet to which the valid cross-subnet route passes is set to A valid subnet that sets the subnet that has not passed through the valid cross-subnet route to an invalid subnet.
  • the apparatus further includes: an abstract routing module 1005; an abstract routing module 1005 configured to acquire a boundary point of the effective subnet; and calculate an abstract topology of the effective cross-subnet route according to the boundary point; Obtaining an effective abstract route according to the effective cross-subnet route and the abstract topology; wherein the abstract topology is specifically: a route calculated by using the effective subnet as a full-cross object.
  • the apparatus further includes: a protection module 1006 configured to select at least two end-to-end routes, and set an end-to-end route of the at least two end-to-end routes as a working route, and set The end-to-end route other than the working route is a protection route.
  • a protection module 1006 configured to select at least two end-to-end routes, and set an end-to-end route of the at least two end-to-end routes as a working route, and set The end-to-end route other than the working route is a protection route.
  • the method, device, and system provided by the embodiments of the present invention are not only applicable to browsing a webpage, but also applicable to browsing various applications having a picture display function.
  • the device provided by the embodiment of the present invention may be a single system, or a logical unit that performs different functions may be added to an existing network element device, such as a network controller.
  • the receiving module 1001, the obtaining module 1002, the selecting module 1003, the setting module 1004, the abstract routing module 1005, and the protection module 1006 may be central processing units (CPU, Central Processing Unit) located in the mobile phone. ), digital signal processor (DSP, Digital Signal Processor), or Field Programmable Gate Array (FPGA) implementation.
  • CPU Central Processing Unit
  • DSP Digital Signal Processor
  • FPGA Field Programmable Gate Array
  • An embodiment of the present invention provides a method and an apparatus for determining an end-to-end route, where the method includes: receiving a first request, determining an effective cross-subnet route according to the first request, and routing to the effective cross-subnet route The effective subnet sends a second request to obtain topology information of the valid subnet; Determining end-to-end routing information according to the effective cross-subnet routing and the topology information, and selecting the route represented by the end-to-end routing information as an end-to-end route; thereby, determining a high accuracy by a simple calculation method Cross-domain end-to-end shortest path, and can create cross-subnet end-to-end services directly on the end-to-end shortest path, thereby improving the network scale that the network control system can manage and reducing the route calculation in large-scale bearer network management. Time to improve the accuracy of route calculations.

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

Disclosed is a method for determining end-to-end routing, and the method comprises the steps of: when a first request is received, valid cross subnet routing is determined according to the first request; a second request is transmitted to valid subnets passed by the valid cross subnet routing to acquire the topology information of the valid subnets; end-to-end routing information is determined according to the valid cross subnet routing and the topology information, and the routing that is indicated by end-to-end routing information is selected as the end-to-end routing. The embodiments of the present invention also provide a device for determining the end-to-end routing.

Description

一种确定端到端路由的方法及装置Method and device for determining end-to-end routing 技术领域Technical field
本发明涉及移动通信技术领域,尤其涉及一种确定端到端路由的方法及装置。The present invention relates to the field of mobile communications technologies, and in particular, to a method and apparatus for determining end-to-end routing.
背景技术Background technique
本申请发明人在实现本申请实施例技术方案的过程中,至少发现相关技术中存在如下技术问题:In the process of implementing the technical solutions of the embodiments of the present application, at least the following technical problems exist in the related technologies:
在承载网络中,业务创建的方法是,用户利用网络控制系统,输入业务起止端点等相关信息,网络控制系统利用保存在数据库或设备中的物理链路、端口等数据进行计算,产生需下发到设备的业务配置数据,然后将这些配置数据下发到网元设备,从而开通一条通信链路。In the bearer network, the service is created by the user using the network control system to input the relevant information such as the starting and ending endpoints of the service. The network control system uses the physical link and port data stored in the database or device to perform calculations. The service configuration data is sent to the device, and then the configuration data is sent to the network element device to open a communication link.
目前承载网络中,网络的规模非常庞大。路由计算的节点数目非常多。以至于这些节点和边的信息集中存放维护非常困难。同时,要在这么多节点的网络上计算最短路由也非常困难。为了解决上述问题采用了分子网路由计算的方法。In the current bearer network, the scale of the network is very large. The number of nodes calculated by the route is very large. Therefore, it is very difficult to store and maintain the information of these nodes and edges. At the same time, it is very difficult to calculate the shortest path on a network of so many nodes. In order to solve the above problem, a method of molecular network route calculation is adopted.
为了计算跨子网的端到端路由,目前有如下三种技术方法:(1)每域路由计算;(2)反向递归路由计算;(3)层次路由计算实体(PCE,Path Computation Element)路由计算。In order to calculate the end-to-end routing across subnets, there are currently three technical methods: (1) per-domain routing calculation; (2) reverse recursive routing calculation; (3) hierarchical routing computing entity (PCE, Path Computation Element) Route calculation.
这三种技术方法都有各自的技术难点:每域路由计算机制简单,适用于域间连接简单的路由计算,但对于域间连接复杂的路由计算,很难找出最优路由;反向递归路由计算的优点是可以获得跨域端到端最优路由,缺点是:需要运行协议,通过分布式操作反复递归计算,方法比较复杂,计算效率低;层次PCE路由计算方法的优点是可以获得跨域端到端最优路由, 并且相对反向递归路由计算方法,不需要递归计算,方法简单。但是由于父PCE用于计算跨域路由的跨域拓扑信息是预先获取的域间链路信息,并不是实时获取的当前网络拓扑实际情况,因此,最终计算得到的跨域端到端最优路由的准确性较差。These three technical methods have their own technical difficulties: the per-domain routing computer system is simple, suitable for simple route calculation between inter-domain connections, but it is difficult to find the optimal route for complex route calculation between inter-domain connections; reverse recursion The advantage of route calculation is that the cross-domain end-to-end optimal route can be obtained. The disadvantages are: need to run the protocol, repeated recursive calculation through distributed operation, the method is more complicated, and the calculation efficiency is low; the advantage of the hierarchical PCE route calculation method is that the cross-domain can be obtained. Domain end-to-end optimal routing, And the relative reverse recursive routing calculation method does not require recursive calculation, and the method is simple. However, the cross-domain topology information used by the parent PCE to calculate the cross-domain topology information is the pre-obtained inter-domain link information, and is not the current real-time network topology. Therefore, the final cross-domain end-to-end optimal route is calculated. The accuracy is poor.
然而,对于上述问题,相关技术并未存在有效的解决方案。However, for the above problems, there is no effective solution to the related art.
发明内容Summary of the invention
有鉴于此,本发明实施例期望提供一种确定端到端路由的方法及装置,通过简单的计算方法确定准确性高的跨域端到端最短路由。In view of this, embodiments of the present invention are expected to provide a method and apparatus for determining end-to-end routing, and determining a cross-domain end-to-end shortest path with high accuracy by a simple calculation method.
本发明实施例的技术方案是这样实现的:The technical solution of the embodiment of the present invention is implemented as follows:
本发明实施例提供一种确定端到端路由的方法,所述方法包括:接收到第一请求时,根据所述第一请求确定有效跨子网路由;向所述有效跨子网路由经过的有效子网发送第二请求,获取所述有效子网的拓扑信息;根据所述有效跨子网路由、所述拓扑信息确定端到端路由信息,选择所述端到端路由信息表征的路由为端到端路由。An embodiment of the present invention provides a method for determining an end-to-end route, where the method includes: when receiving a first request, determining an effective cross-subnet route according to the first request; and routing to the effective cross-subnet route The effective subnet sends the second request to obtain the topology information of the valid subnet; the end-to-end routing information is determined according to the effective cross-subnet routing and the topology information, and the route represented by the end-to-end routing information is selected as End-to-end routing.
上述方案中,所述第一请求携带起始端点、终止端点,相应的,所述根据所述第一请求确定有效跨子网路由具体为:确定所述起始端点所属的下级子网为起始子网,确定所述终止端点所属的下级子网为终止子网,采用最短路由策略计算所述起始子网、终止子网之间的最短跨子网路由,确定所述最短跨子网路由为所述有效跨子网路由。In the above solution, the first request carries a start end point and a terminating end point. Correspondingly, determining the effective cross-subnet route according to the first request is specifically: determining that the lower level subnet to which the start end point belongs is Determining a subnet, determining that the subnet to which the terminating endpoint belongs is a terminating subnet, calculating a shortest cross-subnet route between the starting subnet and the terminating subnet by using a shortest path, and determining the shortest cross-subnet The route is the valid cross-subnet route.
上述方案中,所述方法还包括:将所述有效跨子网路由经过的下级子网设置为有效子网,将所述有效跨子网路由未经过的下级子网设置为无效子网。In the above solution, the method further includes: setting a lower subnet through which the effective cross-subnet route passes as a valid subnet, and setting a lower subnet whose valid cross-subnet route has not passed as an invalid subnet.
上述方案中,在向所述有效跨子网路由经过的有效子网发送第二请求之前,所述方法还包括:获取所述有效子网的边界点;根据所述边界点计算所述有效跨子网路由的抽象拓扑;根据所述有效跨子网路由与所述抽象 拓扑得到有效抽象路由;其中,所述抽象拓扑具体为:以所述有效子网为全交叉对象计算的路由。In the foregoing solution, before sending the second request to the valid subnet to which the effective cross-subnet route passes, the method further includes: acquiring a boundary point of the effective subnet; and calculating the effective cross according to the boundary point An abstract topology of subnet routes; according to the effective cross-subnet routing and the abstraction The topology obtains a valid abstract route, where the abstract topology is specifically: a route calculated by using the effective subnet as a full-cross object.
上述方案中,根据所述有效跨子网路由、所述拓扑信息确定端到端路由信息包括:根据有效抽象路由在所述有效子网上的边界节点计算所述有效子网的子网内有效路由;根据所述有效抽象路由、所述子网内有效路由生成所述端到端路由信息。In the foregoing solution, determining end-to-end routing information according to the effective cross-subnet routing and the topology information includes: calculating, according to the effective abstract route, a valid route in the subnet of the effective subnet on a boundary node of the effective subnet And generating the end-to-end routing information according to the valid abstract route and the effective route in the subnet.
上述方案中,所述方法还包括:选择至少两条端到端路由,设置所述至少两条的端到端路由中的一条端到端路由为工作路由,设置所述工作路由以外的所述端到端路由为保护路由。In the above solution, the method further includes: selecting at least two end-to-end routes, setting an end-to-end route of the at least two end-to-end routes as a working route, and setting the other than the working route End-to-end routing is to protect routes.
本发明实施例还提供一种确定端到端路由的装置,所述装置包括:接收模块、获取模块、选择模块;其中,所述接收模块,配置为接收到第一请求时,根据所述第一请求确定有效跨子网路由;所述获取模块,配置为向所述有效跨子网路由经过的有效子网发送第二请求,获取所述有效子网的拓扑信息;所述选择模块,配置为根据所述有效跨子网路由、所述拓扑信息确定端到端路由信息,选择所述端到端路由信息表征的路由为端到端路由。The embodiment of the present invention further provides an apparatus for determining an end-to-end route, where the apparatus includes: a receiving module, an obtaining module, and a selecting module; wherein the receiving module is configured to receive the first request according to the Requesting to determine a valid cross-subnet route; the obtaining module, configured to send a second request to the valid subnet through which the effective cross-subnet route passes, obtain topology information of the effective subnet; To determine end-to-end routing information according to the effective cross-subnet routing and the topology information, the route characterized by the end-to-end routing information is selected as an end-to-end route.
上述方案中,所述接收模块,具体配置为:接收携带起始端点、终止端点的第一请求;确定所述起始端点所属的下级子网为起始子网,确定所述终止端点所属的下级子网为终止子网,采用最短路由策略计算所述起始子网、终止子网之间的最短跨子网路由,确定所述最短跨子网路由为所述有效跨子网路由。In the foregoing solution, the receiving module is specifically configured to: receive a first request that carries a start endpoint and terminate the endpoint; determine that the lower subnet to which the start endpoint belongs is a start subnet, and determine that the termination endpoint belongs to The lower subnet is the terminating subnet, and the shortest cross-subnet route between the starting subnet and the ending subnet is calculated by the shortest path by the policy, and the shortest cross-subnet route is determined to be the effective cross-subnet route.
上述方案中,所述装置还包括:设置模块;所述设置模块,配置为将所述有效跨子网路由经过的下级子网设置为有效子网,将所述有效跨子网路由未经过的下级子网设置为无效子网。In the above solution, the device further includes: a setting module, where the setting module is configured to set the lower subnet through which the effective cross-subnet route passes as a valid subnet, and the effective cross-subnet route is not passed. The subnet is set to an invalid subnet.
上述方案中,所述装置还包括:抽象路由模块;所述抽象路由模块, 配置为获取所述有效子网的边界点;根据所述边界点计算所述有效跨子网路由的抽象拓扑;根据所述有效跨子网路由与所述抽象拓扑得到有效抽象路由;其中,所述抽象拓扑具体为:以所述有效子网为全交叉对象计算的路由。In the above solution, the apparatus further includes: an abstract routing module; the abstract routing module, Configuring to obtain a boundary point of the effective subnet; calculating an abstract topology of the effective cross-subnet route according to the boundary point; obtaining an effective abstract route according to the effective cross-subnet route and the abstract topology; The abstract topology is specifically: a route calculated by using the valid subnet as a full-cross object.
上述方案中,所述选择模块具体配置为:根据有效抽象路由在所述有效子网上的边界节点计算所述有效子网的子网内有效路由;根据所述有效抽象路由、所述子网内有效路由生成所述端到端路由信息。In the above solution, the selecting module is specifically configured to: calculate, according to the effective abstract route, a valid route in the subnet of the effective subnet on the boundary node of the effective subnet; according to the effective abstract route, in the subnet A valid route generates the end-to-end routing information.
上述方案中,所述装置还包括:保护模块;所述保护模块,配置为选择至少两条端到端路由,设置所述至少两条的端到端路由中的一条端到端路由为工作路由,设置所述工作路由以外的所述端到端路由为保护路由。In the foregoing solution, the device further includes: a protection module, configured to select at least two end-to-end routes, and set an end-to-end route of the at least two end-to-end routes as a working route And setting the end-to-end route other than the working route as a protection route.
所述接收模块、所述获取模块、所述选择模块、所述设置模块、所述抽象路由模块、所述保护模块在执行处理时,采用中央处理器(CPU,Central Processing Unit)、数字信号处理器(DSP,Digital Singnal Processor)或可编程逻辑阵列(FPGA,Field-Programmable Gate Array)实现。The receiving module, the obtaining module, the selecting module, the setting module, the abstract routing module, and the protection module adopt a central processing unit (CPU) and digital signal processing when performing processing. (DSP, Digital Singnal Processor) or Programmable Array (FPGA) implementation.
本发明实施例提供一种确定端到端路由的方法及装置,所述方法包括:接收第一请求,根据所述第一请求确定有效跨子网路由;向所述有效跨子网路由经过的有效子网发送第二请求,获取所述有效子网的拓扑信息;根据所述有效跨子网路由、所述拓扑信息确定端到端路由信息,选择所述端到端路由信息表征的路由为端到端路由;由此,通过简单的计算方法确定准确性高的跨域端到端最短路由,并且能够在该端到端最短路由上直接创建跨子网的端到端业务,从而在大规模承载网络管理中提高网络控制系统能够管理的网络规模,降低路由计算的时间,提高路由计算的精度。An embodiment of the present invention provides a method and an apparatus for determining an end-to-end route, where the method includes: receiving a first request, determining an effective cross-subnet route according to the first request, and routing to the effective cross-subnet route The effective subnet sends the second request to obtain the topology information of the valid subnet; the end-to-end routing information is determined according to the effective cross-subnet routing and the topology information, and the route represented by the end-to-end routing information is selected as End-to-end routing; thus, a highly accurate cross-domain end-to-end shortest path is determined by a simple calculation method, and the end-to-end short-circuit service can be directly created on the end-to-end short-circuit by directly creating a cross-subnet end-to-end service, thereby being large In the scale bearer network management, the network scale that the network control system can manage is increased, the time of route calculation is reduced, and the accuracy of route calculation is improved.
附图说明DRAWINGS
图1为本发明实施例提供的一种应用确定端到端路由的方法的网络示意图; 1 is a schematic network diagram of a method for determining end-to-end routing according to an embodiment of the present invention;
图2为本发明实施例提供的一种确定端到端路由的方法的流程示意图;2 is a schematic flowchart of a method for determining end-to-end routing according to an embodiment of the present invention;
图3一具体实例的确定端到端路由的方法的流程示意图;FIG. 3 is a schematic flowchart diagram of a method for determining end-to-end routing according to a specific example;
图4为计算跨子网路由的网络示意图;4 is a schematic diagram of a network for calculating cross-subnet routes;
图5为去掉无效子网的网络示意图;Figure 5 is a schematic diagram of a network in which an invalid subnet is removed;
图6为计算子网抽象拓扑的网络示意图;6 is a schematic diagram of a network for computing a subnet abstract topology;
图7为计算端到端路由的网络拓扑示意图;7 is a schematic diagram of a network topology for calculating an end-to-end route;
图8为端到端路由的网络示意图;Figure 8 is a schematic diagram of a network of end-to-end routing;
图9为一具体实例的确定端到端路由的方法的流程示意图;9 is a schematic flow chart of a method for determining end-to-end routing according to a specific example;
图10为本发明实施例提供的一种确定端到端路由的装置的结构示意图;FIG. 10 is a schematic structural diagram of an apparatus for determining end-to-end routing according to an embodiment of the present disclosure;
图11为本发明实施例提供的另一种确定端到端路由的装置的结构示意图。FIG. 11 is a schematic structural diagram of another apparatus for determining end-to-end routing according to an embodiment of the present invention.
具体实施方式detailed description
在本发明实施例中,接收第一请求,根据所述第一请求确定有效跨子网路由;向所述有效跨子网路由经过的有效子网发送第二请求,获取所述有效子网的拓扑信息;根据所述有效跨子网路由、所述拓扑信息确定端到端路由信息,选择所述端到端路由信息表征的路由为端到端路由。In the embodiment of the present invention, the first request is received, the effective cross-subnet route is determined according to the first request, and the second request is sent to the valid subnet through which the effective cross-subnet route passes, and the effective subnet is obtained. The topology information is determined according to the effective cross-subnet route and the topology information, and the route characterized by the end-to-end routing information is selected as an end-to-end route.
在对本发明实施例进行进一步详细说明之前,首先对本发明实施例中使用的术语进行说明。Before the embodiments of the present invention are further described in detail, the terms used in the embodiments of the present invention are first described.
业务:为用户提供信号的传递能力。Business: Provide users with the ability to transmit signals.
路由:业务经过的节点集合。Routing: A collection of nodes through which a service passes.
边:指被研究对象之间的某种特定关系。路由计算时,特指2个被研究对象的连通关系。Edge: refers to a specific relationship between the objects being studied. When calculating the route, it refers to the connectivity of the two objects under study.
路由约束:由用户输入资源,要求路由计算计算出的结果必须(或禁止)经过的资源。 Routing Constraint: A resource entered by a user that requires the route calculation to calculate the result that must (or is prohibited) the passed resource.
端点:业务的起点或终点。Endpoint: The starting or ending point of the business.
网络控制系统:负责业务的创建的系统.可以是网管、自动交换光网络(ASON,Automatic Switch Optical Network)、软件定义网络(SDN,Software Define Network)控制器或者其他类似的系统。网络控制系统包含上级子网控制器和下级子网控制器。Network control system: A system responsible for the creation of services. It can be a network management system, an Automatic Switch Optical Network (ASON), a Software Defined Network (SDN) controller, or the like. The network control system includes a superior subnet controller and a subordinate subnet controller.
需要说明的是,本发明实施例提供的方法及装置可在图1所示的网络结构中应用,图1所示的上级子网的网络控制器为上级子网控制器,子网(sn,subnet)1、sn2、sn3、sn4、sn5为上级子网下的下级子网,每一下级子网设有自身的网络控制器,下级子网的网络控制器为下级子网控制器。这里,一个上级子网可包括有多个下级子网。It should be noted that the method and apparatus provided by the embodiments of the present invention may be applied in the network structure shown in FIG. 1. The network controller of the upper subnet shown in FIG. 1 is an upper subnet controller, and a subnet (sn, Subnet)1, sn2, sn3, sn4, and sn5 are subordinate subnets under the upper subnet. Each subnet has its own network controller, and the network controller of the subnet is the subnet controller. Here, a superior subnet may include a plurality of subnets.
下面通过附图及具体实施例对本发明再做进一步的详细说明。The invention will be further described in detail below with reference to the drawings and specific embodiments.
图2为本发明实施例提供的一种确定端到端路由的方法,该方法应用于上级子网控制器,如图2所示,该方法包括以下步骤:2 is a method for determining an end-to-end route according to an embodiment of the present invention. The method is applied to an upper subnet controller. As shown in FIG. 2, the method includes the following steps:
步骤201,接收到第一请求时,根据所述第一请求确定有效跨子网路由;Step 201: When receiving the first request, determine an effective cross-subnet route according to the first request.
具体的,当上级子网控制器接收到用户用于计算端到端的路由而触发的第一请求时,根据所述第一请求携带的指定的起始端点、终止端点确定起始端点所属的下级子网为起始子网,确定所述终止端点所属的下级子网为终止子网,采用最短路由策略计算起始子网、终止子网之间的最短跨子网路由,确定最短跨子网路由为所述有效跨子网路由。Specifically, when the upper subnet controller receives the first request triggered by the user to calculate the end-to-end route, the specified start end and the end point carried by the first request determine the subordinate to which the start end belongs. The subnet is the starting subnet, and the subnet to which the terminating endpoint belongs is determined to be the terminating subnet. The shortest path is used to calculate the shortest subnet route between the starting subnet and the ending subnet, and the shortest cross-subnet is determined. The route is the valid cross-subnet route.
这里,最短路由策略为路由代价最低的跨子网路由。Here, the shortest path is the cross-subnet route with the lowest routing cost.
这里,在确定有效跨子网路由后,将有效跨子网路由经过的下级子网标识为有效子网,将所述有效跨子网路由未经过的下级子网标识为无效子网。Here, after determining the effective cross-subnet route, the lower-level subnet through which the effective cross-subnet route passes is identified as a valid subnet, and the lower-level subnet through which the effective cross-subnet route is not passed is identified as an invalid subnet.
步骤202,向所述有效跨子网路由经过的有效子网发送第二请求,获取所述有效子网的拓扑信息; Step 202: Send a second request to the valid subnet through which the effective cross-subnet route passes, and acquire topology information of the effective subnet.
具体的,在确定有效跨子网路由后,向有效跨子网路由经过的所有的下级子网的下级子网控制器发送第二请求,这里,有效跨子网路由经过的所有的下级子网为有效子网;在发送第二请求后,接收有效子网上报的拓扑信息,其中,拓扑信息包括:有效子网最短路由,以及最短路由对应的边节点。Specifically, after determining the effective cross-subnet route, sending a second request to the sub-subnet controller of all the sub-subnets through which the effective cross-subnet route passes, where all the sub-subnets through which the effective sub-subnet route passes are transmitted. After the second request is sent, the topology information of the valid subnet report is received, where the topology information includes: the shortest path of the effective subnet, and the shortest path by the corresponding edge node.
在向所述有效跨子网路由经过的有效子网发送第二请求之前,所述方法还包括:获取所述有效子网的边界点;根据所述边界点计算所述效跨子网路由的抽象拓扑;根据所述有效跨子网路由与所述抽象拓扑得到有效抽象路由;其中,所述抽象拓扑具体为:以所述有效子网为全交叉对象计算的路由。Before sending the second request to the valid subnet to which the effective cross-subnet route passes, the method further includes: acquiring a boundary point of the effective subnet; and calculating the effective cross-subnet route according to the boundary point An abstract topology is obtained according to the effective cross-subnet route and the abstract topology; wherein the abstract topology is specifically: a route calculated by using the effective subnet as a full-cross object.
步骤203,根据所述有效跨子网路由、所述拓扑信息确定端到端路由信息,选择所述端到端路由信息表征的路由为端到端路由;Step 203: Determine end-to-end routing information according to the effective cross-subnet routing and the topology information, and select the route represented by the end-to-end routing information as an end-to-end route.
具体的,根据有效抽象路由在所述有效子网上的边界节点计算所述有效子网的子网内有效路由;根据所述有效抽象路由、所述子网内有效路由生成所述端到端路由信息。所述端到端路由信息表征的路由为端到端路由。Specifically, calculating, according to the effective abstract route, a valid route in the subnet of the effective subnet on the boundary node of the effective subnet; generating the end-to-end route according to the valid abstract route and the effective route in the subnet information. The route characterized by the end-to-end routing information is an end-to-end route.
该方法还包括:选择至少两条端到端路由,设置所述至少两条的端到端路由中的一条端到端路由为工作路由,设置所述工作路由以外的所述端到端路由为保护路由。The method further includes: selecting at least two end-to-end routes, setting an end-to-end route of the at least two end-to-end routes as a working route, and setting the end-to-end route other than the working route as Protect the route.
如图3所示,以图1所示的一个上级子网包括5个子网的组网为例说明确定端到端路由的方法,其中,上级子网包括的5个子网为sn1、sn2、sn3、sn4、sn5,这里,上级子网控制器接收的第一请求携带的其起始端点为节点A,终止端点为节点M。该方法包括以下步骤:As shown in FIG. 3, a method for determining an end-to-end route is described by using an example in which a higher-level subnet includes five subnets as shown in FIG. 1, wherein five subnets included in the upper subnet are sn1, sn2, and sn3. , sn4, sn5, where the first request received by the upper subnet controller carries the starting endpoint as node A and the terminating endpoint as node M. The method includes the following steps:
步骤301、根据第一请求计算跨子网最短路由;Step 301: Calculate a shortest path between subnets according to the first request;
上级子网控制器接收到起始端点为节点A、终止端点为节点M的第一请求后,在数据库中获取跨下级子网的拓扑连接,将获取的拓扑连接保存 并作为计算端到端路由的边,获取的网络拓扑连接如图1所示的网络结构。根据获取的拓扑连接确定节点A所属下级子网为sn1,即sn1为起始子网,终止端点M所属的下级子网为sn4,即sn4为终止子网。此时,将每个下级子网假设为一个节点,将跨子网的拓扑作为边,根据最短路由策略计算sn1到sn4的最短路由。如图4所示,sn1到sn4的跨子网最短路由为图中sn1-sn2-sn4之间的粗线所示的路径B-G、N-J,B-G之间的路由为代价为100的链路link2,N-J之间的路由为代价为100的链路link6。跨子网最短路的路由的路由代价相对于其他的sn1到sn4的路由的路由代价为最低,其中,每条路由的路由代价根据该条路由经过的下级子网间的路径的代价得出,为路由所经过的边的权值求和,这里,求和的权值可为每条链路的对应的路由代价。After receiving the first request that the starting endpoint is the node A and the terminating endpoint is the node M, the upper-level subnet controller acquires the topology connection across the subnet in the database, and saves the acquired topology connection. And as the edge of the end-to-end route is calculated, the obtained network topology is connected to the network structure shown in FIG. According to the obtained topology connection, it is determined that the subnet to which the node A belongs is sn1, that is, sn1 is the starting subnet, and the subnet to which the terminating terminal M belongs is sn4, that is, sn4 is the terminating subnet. At this point, each subnet is assumed to be a node, and the topology across the subnet is taken as the edge, and the shortest path from sn1 to sn4 is calculated according to the shortest path by the policy. As shown in FIG. 4, the shortest cross-subnet of sn1 to sn4 is the link link2 at the cost of 100 for the route between the paths BG, NJ, and BG indicated by the thick line between sn1-sn2-sn4 in the figure. The route between NJs is the link link6 at the cost of 100. The routing cost of the shortest route across the subnet is the lowest compared to the routing of the other sn1 to sn4 routes, where the routing cost of each route is based on the cost of the path between the lower subnets through which the route passes. The weights of the edges through which the route passes are summed, where the weight of the summation can be the corresponding routing cost for each link.
步骤302、根据最短路由确定有效子网;Step 302: Determine a valid subnet according to the shortest path;
这里,在步骤301中确定的最短路由为路径B-G、N-J,上级子网控制器读取跨子网最短路由,可以看到跨子网最短路由经过的下级子网包括:sn1、sn2、sn4,上级子网控制器将sn1、sn2、sn4设置为有效子网,将sn3、sn5设置为无效子网,如图5所示,在保存的网络拓扑连接中将无效子网删除,至保存有效子网。Here, the shortest path determined in step 301 is read by the upper subnet controller for the path BG, NJ, and the shortest subnet is read by the subnet subnet controller. It can be seen that the subnet subnet that passes through the shortest subnet includes: sn1, sn2, sn4, The upper subnet controller sets sn1, sn2, and sn4 as valid subnets, and sets sn3 and sn5 as invalid subnets. As shown in Figure 5, the invalid subnets are deleted in the saved network topology connection to save the valid subroutine. network.
步骤303、确定有效子网的边界节点;Step 303: Determine a boundary node of the effective subnet.
具体的,上级子网控制器遍历跨有效子网的拓扑,如图6所示,有效子网sn1,sn2,sn4之间的跨子网拓扑包括:link2、link3、link6、link7,其中,link i表示拓扑i的链路标识。这些拓扑的A,M端点分别为待计算端到端路由的起始点、终止点,同时,sn1,sn2,sn4之间进行路由的边界点包括B、C、G、H、N、I、J、K。也就是说,sn1的边界节点包括:A(起始端点),B,C;sn2的边界节点包括:G,H,N,I;sn3的边界节点包括:J,K,M(终止端点)。 Specifically, the upper subnet controller traverses the topology across the effective subnets. As shown in FIG. 6, the cross-subnet topology between the effective sub-networks sn1, sn2, and sn4 includes: link2, link3, link6, link7, where, link i represents the link identifier of topology i. The A and M endpoints of these topologies are the starting point and ending point of the end-to-end route to be calculated respectively. Meanwhile, the boundary points of routing between sn1, sn2, and sn4 include B, C, G, H, N, I, and J. , K. That is to say, the boundary nodes of sn1 include: A (starting endpoint), B, C; the boundary nodes of sn2 include: G, H, N, I; the boundary nodes of sn3 include: J, K, M (terminating endpoint) .
步骤304、计算有效子网的边界节点间的抽象拓扑;Step 304: Calculate an abstract topology between boundary nodes of the effective subnet;
这里,此时,上级子网控制器下发第二请求到sn1,sn2,sn4,请求sn1,sn2,sn4计算分别自身的抽象拓扑。如图7所示,sn1的抽象拓扑为A,B,C之间的拓扑;sn2的抽象拓扑为G,H,N,I之间的拓扑,sn4的抽象拓扑为J,K,M之间的拓扑。sn1,sn2,sn4的子网控制器分别根据最短路径策略计算出自身的抽象拓扑后,上报计算的拓扑信息至上级子网的上级子网控制器,其中,这里的拓扑信息即为抽象拓扑的拓扑信息。其中,抽象拓扑是携带权值,所述权值为节点之间的链路对应的路由代价。最短路径策略即为最短路径算法,最短路径算法为现有技术,在此不再赘述。Here, at this time, the upper subnet controller sends a second request to sn1, sn2, sn4, and requests sn1, sn2, and sn4 to calculate their own abstract topologies. As shown in Figure 7, the abstract topology of sn1 is the topology between A, B, and C; the abstract topology of sn2 is the topology between G, H, N, and I, and the abstract topology of sn4 is between J, K, and M. Topology. The subnet controllers of sn1, sn2, and sn4 respectively calculate their own abstract topology according to the shortest path policy, and then report the calculated topology information to the superior subnet controller of the superior subnet, where the topology information is the abstract topology. Topology information. The abstract topology is a carrying weight, and the weight is a routing cost corresponding to the link between the nodes. The shortest path algorithm is the shortest path algorithm, and the shortest path algorithm is the prior art, and will not be described here.
步骤305、计算网元级路由;Step 305: Calculate a network element level route.
上级子网控制器将步骤301计算的跨子网最短路由的有效子网之间的跨子网路由和步骤304计算的拓扑信息进行组合,生成网元级路由的组网图,这里,将有效子网所视作全交叉对象来确定网元级路由,其中,sn1作为全交叉对象的边界节点为A,B,C;sn2作为全交叉对象的边界节点为G,H,N,I;sn4作为全交叉对象的边界节点为J,K,M。确定的网元级路由如图8所示,其中,加粗的线条为根据最短跨子网路由确定的有效抽象路由,有效抽象路由经过的节点依次为:A、B、G、I、K、M。The upper-level sub-network controller combines the cross-subnet route between the effective sub-networks of the cross-subnet shortest path calculated in step 301 and the topology information calculated in step 304 to generate a network diagram of the network-level routing, where it is effective. The subnet is regarded as a full-intersection object to determine the network-level route. The boundary node of sn1 as the full-crossing object is A, B, C; and the boundary node of the full-intersection object is G, H, N, I; sn4 The boundary nodes that are full-intersection objects are J, K, and M. The determined network element-level route is as shown in FIG. 8 , wherein the bold line is a valid abstract route determined according to the shortest cross-subnet route, and the nodes that the effective abstract route passes are: A, B, G, I, K, M.
步骤306,发送第二请求,计算起始端点到终止端点的端到端路由信息。Step 306: Send a second request, and calculate end-to-end routing information from the starting endpoint to the terminating endpoint.
这里,在步骤305中,每个有效子网被当做全交叉对象看待。此时,根据网元级最短路由计算每个有效子网内部的子网内最短路由,以sn2为例,网元级路由在sn2的边界节点G到节点I,在Sn2中,从节点G到节点I存在多种不同的路由,根据最短路由策略计算从节点G到节点I的最优路由。同理,计算出sn1、sn4的子网内的最优路由,将计算出的每一有效子网内的最优路由替换有效抽象路由的抽象拓扑,如图9所示,从而得到一条完整的从起始端点A至终止端点M的端到端的路由信息。 Here, in step 305, each valid subnet is treated as a full cross object. At this time, according to the shortest path at the network element level, the shortest path in the subnet inside each effective subnet is calculated, taking sn2 as an example, the network element level routing is at the boundary node G of the sn2 to the node I, in the Sn2, from the node G to Node I has a variety of different routes, and the optimal route from node G to node I is calculated by the policy according to the shortest path. Similarly, the optimal route in the subnet of sn1 and sn4 is calculated, and the calculated optimal topology of each effective subnet is replaced with the abstract topology of the effective abstract route, as shown in FIG. 9, thereby obtaining a complete End-to-end routing information from the originating endpoint A to the terminating endpoint M.
需要说明的是,在本发明实施例中,“路径”和“路由”意义相同,“跨子网路由”与“下级子网间路由”意义相同。如未说明“上级子网”,则“子网”与“下级子网”都指的是“下级子网”。It should be noted that, in the embodiment of the present invention, “path” and “route” have the same meaning, and “cross-subnet route” has the same meaning as “route between sub-subnets”. If the "superior subnet" is not described, both "subnet" and "subordinate subnet" refer to "subordinate subnet".
图9以承载网络的业务开通为例,实现了一种跨子网端到端路由计算方法。Figure 9 shows a cross-subnet end-to-end route calculation method by taking the service of the bearer network as an example.
步骤901,接收第一请求;Step 901: Receive a first request.
上级子网网络控制器接收第一请求,第一请求携带用户输入的创建业务的工作区间起始点、终止点的信息,分别为A、M,以及保护区间的起止点。这里,工作区间和保护区间的起始点、终止点一致。The upper subnet network controller receives the first request, where the first request carries the information of the starting point and the ending point of the working interval for creating the service input by the user, respectively, A, M, and the starting and ending points of the protection interval. Here, the starting point and the ending point of the working interval and the guard interval are identical.
步骤902、计算端到端路由作为工作路由;Step 902: Calculate an end-to-end route as a working route.
这里,计算工作路由的方法同步骤201至步骤203一致,具体的:Here, the method for calculating the working route is consistent with steps 201 to 203, specifically:
步骤9021,上级子网控制器计算跨子网最短路由;Step 9021, the upper subnet controller calculates the shortest path by the subnet;
上级子网控制器将自己管理的下级子网看作全交叉对象,并且假设子网内的路由代价为零,也就是说,上级子网控制器将自己管理的下级子网看作路由计算的节点。上级子网从自己的数据库中获取跨下级子网的拓扑连接,并将获取的跨下级子网的拓扑连接作为路由计算的边,并在内存中形成组网图,如图1所示,并计算跨子网最短路由,具体的计算方法同步骤301。The superior subnet controller regards the subnet managed by itself as a full-crossing object, and assumes that the routing cost within the subnet is zero, that is, the superior subnet controller regards the subnet managed by itself as the route calculation. node. The upper-level subnet obtains the topology connection of the sub-subnet from its own database, and obtains the topology connection of the sub-subnet as the edge of the route calculation, and forms a networking diagram in the memory, as shown in Figure 1. Calculate the shortest path across subnets. The specific calculation method is the same as step 301.
步骤9022,上级子网控制器确定有效下级子网;Step 9022: The upper subnet controller determines a valid subnet;
上级子网控制器根据计算出的跨子网最短路由将经过的下级子网,设置为有效子网。组网图中其他的未经过跨子网最短路由的下级子网都不是有效子网,设置为无效子网,并将无效子网删除,同步骤302,以在步骤305的网元级最短路由计算时不对无效子网进行计算。同时,将有效子网之间的拓扑看作有效的拓扑资源,其他的拓扑资源看作无效的拓扑资源。在步骤305的的网元级最短路由计算时也将不会参与计算。 The superior subnet controller sets the subnet to be passed as a valid subnet according to the calculated shortest subnet. The other subnets in the networking diagram that are not short-circuited by the cross-subnet are not valid subnets, are set to invalid subnets, and delete invalid subnets, as in step 302, to minimize the network element level at step 305. The invalid subnet is not calculated at the time of calculation. At the same time, the topology between valid subnets is regarded as a valid topology resource, and other topology resources are regarded as invalid topology resources. The shortest path at the network element level of step 305 will also not participate in the calculation when calculated.
步骤9023,上级子网控制器确定有效子网的边界节点;Step 9023, the upper subnet controller determines a boundary node of the effective subnet;
上级子网控制器把有效子网的有效拓扑连接的A,M端点所在的起始子网和终止子网看作下级子网的边界节点,此时,所有的下级子网被上级子网视为节点。The upper subnet controller considers the starting subnet and the terminating subnet where the A and M endpoints of the effective topology are connected as the boundary node of the subnet. In this case, all the subnets are viewed by the superior subnet. For the node.
步骤9024,上级子网控制器请求下级子网控制器计算其边界节点间的抽象拓扑。In step 9024, the superior subnet controller requests the subordinate subnet controller to calculate an abstract topology between its boundary nodes.
上级子网控制器将每个子网的边界点下发到各个下级有效子网的子网控制器。下级子网控制器计算的边界节点间的抽象拓扑,具体的:各个有效下级子网控制器接收到边界节点后并行计算各自子网的边界节点之间可连通的能力,将边界节点之间的连通能力看作抽象拓扑连接。这些“抽象拓扑”可以通过从边界节点出发求最小生成树来得到。另外,这些抽象拓扑会有拓扑的权值,表达了边界节点之间连通的代价,可以用作网元级路由计算依据。下级子网控制器将自己计算出来的抽象拓扑返回给上级子网控制器。The superior subnet controller sends the boundary point of each subnet to the subnet controller of each subordinate effective subnet. The abstract topology between the boundary nodes calculated by the subordinate subnet controller. Specifically, each effective subordinate subnet controller receives the boundary nodes and then parallelizes the connectivity between the boundary nodes of the respective subnets. Connectivity is seen as an abstract topology connection. These "abstract topologies" can be obtained by finding the minimum spanning tree from the boundary nodes. In addition, these abstract topologies have the weight of the topology, which expresses the cost of the connectivity between the boundary nodes, and can be used as the basis for calculating the network-level routing. The subordinate subnet controller returns its abstracted topology to the superior subnet controller.
步骤9025,上级子网控制器计算网元级最短路由Step 9025, the upper subnet controller calculates the network element level shortest path by
上级子网控制器把收到每个子网计算出的抽象拓扑、以及自己数据库中的有效跨子网的有效拓扑最为边,把这些边的A,M网元为节点,形成组网图,再次计算网元级最短路由。The superior subnet controller receives the abstract topology calculated by each subnet and the effective topology of the effective cross-subnet in its own database, and sets the A and M network elements of these edges as nodes to form a network diagram. Calculate the shortest path from the network element level.
步骤9026,上级子网控制器计算抽象拓扑的具体的路由信息Step 9026, the upper subnet controller calculates specific routing information of the abstract topology.
上级子网控制器将计算出来的最短路径中的抽象拓扑分别下发到各个下级子网,计算抽象拓扑的具体的路由信息。下级子网使用最短路径算法计算抽象拓扑的A,Z点最短路由,并将结算结果返回给上级子网。上级子网控制器形成完整的跨子网路由,具体:上级子网控制器将各个下级子网返回的抽象拓扑的路由信息替换“网元级最短路径由”中对应的抽象拓扑。形成一个从A到Z的完整的路由信息。 The upper-level subnet controller sends the abstracted topology in the shortest path to the lower-level subnets to calculate the specific routing information of the abstract topology. The subnet subnet uses the shortest path algorithm to calculate the A and Z points of the abstract topology, and the shortest result is returned, and the settlement result is returned to the superior subnet. The upper subnet controller forms a complete cross-subnet route. The upper subnet controller replaces the routing information of the abstract topology returned by each lower subnet with the corresponding abstract topology in the network element shortest path. Form a complete routing information from A to Z.
此时,将计算出的端到端的路由设置为工作路由。At this point, the calculated end-to-end route is set to the working route.
步骤903,计算保护路由;Step 903, calculating a protection route;
首先将工作路由经过的网元,拓扑连接的权值加大。采用同步骤902同样的方法计算一条保护路由。这里,根据保护路由与工作路由的具体的路由信息,可确定计算的保护路由与工作路由的分离程度包括:路由完全相同、路由完全分离、路由部分分离。First, the weight of the topology connection is increased by the network element through which the work route passes. A protection route is calculated in the same manner as step 902. Here, according to the specific routing information of the protection route and the working route, the degree of separation between the calculated protection route and the working route may be determined to be: the route is completely the same, the route is completely separated, and the route part is separated.
其中,路由完全分离为除了起始端点,终止端点之外,工作路由与保护路由经过的节点完全不相同;路由完全相同为工作路由与保护路由经过的节点完全相同;路由部分分离为工作路由与保护路由经过的节点,有一部分相同,有一部分不同。The route is completely separated from the node that passes the protection route except the start endpoint and the termination endpoint. The route is exactly the same as the node through which the protection route passes. The route part is separated into the work route and The nodes through which the route is protected are partially identical and partially different.
这里,最短路径算法会尽量选择权值最小的边以便边的权值和最小,将权值加大,使保护路由与工作路由尽量不经过相同的节点,实现保护路由与工作路由的分离。Here, the shortest path algorithm tries to select the edge with the smallest weight so that the weight and the minimum of the edge increase the weight, so that the protection route and the working route do not go through the same node as much as possible, so as to separate the protection route from the work route.
这里,需要说明的,路由信息包括路由经过的节点与节点之间的路径。Here, it should be noted that the routing information includes a path between the node through which the route passes and the node.
可以通过检查工作路由和保护路由的分离关系是否满足用户输入的工作路由与保护路由的分离程度时,当两者不一致时,可触发错误报告。When checking whether the separation relationship between the working route and the protection route satisfies the degree of separation between the working route and the protection route input by the user, when the two are inconsistent, an error report may be triggered.
在实际应用中,可将计算出来的工作路由和保护路由展示出给用户,由用户选择是否继续配置业务。In the actual application, the calculated working route and the protection route can be displayed to the user, and the user selects whether to continue to configure the service.
当接收到用户对计算结果满意的指令时,执行操作904;When receiving an instruction that the user is satisfied with the calculation result, performing operation 904;
若用户对计算结果不满意,通过重新设置路由约束、重新计算,以获得所需的路由计算结果。If the user is not satisfied with the calculation result, reset the routing constraint and recalculate to obtain the required route calculation result.
步骤904、生成配置数据,使待创建业务使能。Step 904: Generate configuration data, and enable the service to be created.
上级网络控制器利用路由计算结果,以及从上级网络控制器网的数据库或各个节点的网元设备中读取的相关数据,生成业务在各个节点的网元设备的配置数据;将业务的配置数据下发到各个节点的网元设备;各个节 点的网元设备使业务配置数据生效,从而使得用户待创建的业务使能。The upper-layer network controller generates the configuration data of the network element device of the service at each node by using the result of the route calculation, and the related data read from the database of the upper-level network controller network or the network element device of each node; The NE device that is delivered to each node; each section The network element device of the point enables the service configuration data to be enabled, so that the service to be created by the user is enabled.
通过本发明实施例提供的确定端到端路由的方法,可在大规模承载网络管理中提高网络控制系统能够管理的网络规模,降低路由计算的时间,提高路由计算的精度。The method for determining the end-to-end route provided by the embodiment of the present invention can improve the network size that the network control system can manage in the large-scale bearer network management, reduce the time of route calculation, and improve the accuracy of route calculation.
为实现上述方法,本发明实施例还提供一种确定端到端路由的装置,如图10所示,该装置包括:接收模块1001、获取模块1002、选择模块1003;其中,To implement the above method, an embodiment of the present invention further provides an apparatus for determining an end-to-end route. As shown in FIG. 10, the apparatus includes: a receiving module 1001, an obtaining module 1002, and a selecting module 1003.
接收模块1001,配置为接收到第一请求时,根据所述第一请求确定有效跨子网路由;The receiving module 1001 is configured to: when receiving the first request, determine an effective cross-subnet route according to the first request;
具体的,接收携带起始端点、终止端点的第一请求;确定所述起始端点所属的下级子网为起始子网,确定所述终止端点所属的下级子网为终止子网,采用最短路由策略计算所述起始子网、终止子网之间的最短跨子网路由,确定所述最短跨子网路由为所述有效跨子网路由。Specifically, the first request that carries the initial endpoint and the terminated endpoint is received; the lower subnet to which the initial endpoint belongs is determined to be the starting subnet, and the lower subnet to which the terminating endpoint belongs is determined to be the terminating subnet, and the shortest interval is adopted. The routing policy calculates a shortest cross-subnet route between the starting subnet and the ending subnet, and determines that the shortest cross-subnet route is the effective cross-subnet route.
获取模块1002,配置为向所述有效跨子网路由经过的有效子网发送第二请求,获取所述有效子网的拓扑信息;The obtaining module 1002 is configured to send a second request to the valid subnet through which the effective cross-subnet route passes, and obtain topology information of the effective subnet;
具体的,获取模块在向有效子网发送第二请求后,接收有效子网上报的拓扑信息,其中,所述拓扑信息包括:所述有效子网最短路由,以及所述最短路由对应的边节点。Specifically, the acquiring module receives the topology information of the valid subnet report after sending the second request to the effective subnet, where the topology information includes: the shortest path of the effective subnet, and the shortest path is by the corresponding edge node. .
选择模块1003,配置为根据所述有效跨子网路由、所述拓扑信息确定端到端路由信息,选择所述端到端路由信息表征的路由为端到端路由。The selecting module 1003 is configured to determine the end-to-end routing information according to the effective cross-subnet routing and the topology information, and select the route represented by the end-to-end routing information as an end-to-end route.
具体的,根据所述起始端点、所述终止端点、所述最短跨子网路由、所述有效子网最短路由,以及所述最短路由对应的边节点生成所述端到端路由信息,选择所述端到端路由信息表征的路由为端到端路由。Specifically, according to the starting endpoint, the terminating endpoint, the shortest cross-subnet route, the shortest path of the effective subnet, and the shortest path, the end-to-end routing information is generated by the corresponding edge node, and selecting The route characterized by the end-to-end routing information is an end-to-end route.
如图11所示,该装置还包括:设置模块1004;As shown in Figure 11, the device further includes: a setting module 1004;
设置模块1004,配置为将所述有效跨子网路由经过的下级子网设置为 有效子网,将所述有效跨子网路由未经过的下级子网设置为无效子网。 Setting module 1004, configured to set the subnet to which the valid cross-subnet route passes is set to A valid subnet that sets the subnet that has not passed through the valid cross-subnet route to an invalid subnet.
如图11所示,该装置还包括:抽象路由模块1005;抽象路由模块1005,配置为获取所述有效子网的边界点;根据所述边界点计算所述有效跨子网路由的抽象拓扑;根据所述有效跨子网路由与所述抽象拓扑得到有效抽象路由;其中,所述抽象拓扑具体为:以所述有效子网为全交叉对象计算的路由。As shown in FIG. 11, the apparatus further includes: an abstract routing module 1005; an abstract routing module 1005 configured to acquire a boundary point of the effective subnet; and calculate an abstract topology of the effective cross-subnet route according to the boundary point; Obtaining an effective abstract route according to the effective cross-subnet route and the abstract topology; wherein the abstract topology is specifically: a route calculated by using the effective subnet as a full-cross object.
如图11所示,该装置还包括:保护模块1006,配置为选择至少两条端到端路由,设置所述至少两条的端到端路由中的一条端到端路由为工作路由,设置所述工作路由以外的所述端到端路由为保护路由。As shown in FIG. 11, the apparatus further includes: a protection module 1006 configured to select at least two end-to-end routes, and set an end-to-end route of the at least two end-to-end routes as a working route, and set The end-to-end route other than the working route is a protection route.
在实际应用中,本发明实施例提供的方法、装置及系统不仅适用于浏览网页的页面,同样适用于浏览具有图片显示功能的各种应用。In an actual application, the method, device, and system provided by the embodiments of the present invention are not only applicable to browsing a webpage, but also applicable to browsing various applications having a picture display function.
在实际应用中,本发明实施例提供的装置可以是单独的一个系统,也可以在现有的网元设备如网络控制器中增加完成不同功能的逻辑单元。In an actual application, the device provided by the embodiment of the present invention may be a single system, or a logical unit that performs different functions may be added to an existing network element device, such as a network controller.
如果在网络控制器中增加逻辑单元,那么,接收模块1001、获取模块1002、选择模块1003、设置模块1004、抽象路由模块1005及保护模块1006可由位于手机中的中央处理器(CPU,Central Processing Unit)、数字信号处理器(DSP,Digital Signal Processor)、或可编程门阵列(FPGA,Field Programmable Gate Array)实现。If a logical unit is added to the network controller, the receiving module 1001, the obtaining module 1002, the selecting module 1003, the setting module 1004, the abstract routing module 1005, and the protection module 1006 may be central processing units (CPU, Central Processing Unit) located in the mobile phone. ), digital signal processor (DSP, Digital Signal Processor), or Field Programmable Gate Array (FPGA) implementation.
以上所述,仅为本发明的较佳实施例而已,并非用于限定本发明的保护范围,凡在本发明的精神和原则之内所作的任何修改、等同替换和改进等,均应包含在本发明的保护范围之内。The above is only the preferred embodiment of the present invention, and is not intended to limit the scope of the present invention. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in Within the scope of protection of the present invention.
工业实用性Industrial applicability
本发明实施例提供一种确定端到端路由的方法及装置,所述方法包括:接收第一请求,根据所述第一请求确定有效跨子网路由;向所述有效跨子网路由经过的有效子网发送第二请求,获取所述有效子网的拓扑信息;根 据所述有效跨子网路由、所述拓扑信息确定端到端路由信息,选择所述端到端路由信息表征的路由为端到端路由;由此,通过简单的计算方法确定准确性高的跨域端到端最短路由,并且能够在该端到端最短路由上直接创建跨子网的端到端业务,从而在大规模承载网络管理中提高网络控制系统能够管理的网络规模,降低路由计算的时间,提高路由计算的精度。 An embodiment of the present invention provides a method and an apparatus for determining an end-to-end route, where the method includes: receiving a first request, determining an effective cross-subnet route according to the first request, and routing to the effective cross-subnet route The effective subnet sends a second request to obtain topology information of the valid subnet; Determining end-to-end routing information according to the effective cross-subnet routing and the topology information, and selecting the route represented by the end-to-end routing information as an end-to-end route; thereby, determining a high accuracy by a simple calculation method Cross-domain end-to-end shortest path, and can create cross-subnet end-to-end services directly on the end-to-end shortest path, thereby improving the network scale that the network control system can manage and reducing the route calculation in large-scale bearer network management. Time to improve the accuracy of route calculations.

Claims (12)

  1. 一种确定端到端路由的方法,所述方法包括:A method of determining end-to-end routing, the method comprising:
    接收到第一请求时,根据所述第一请求确定有效跨子网路由;Upon receiving the first request, determining an effective cross-subnet route according to the first request;
    向所述有效跨子网路由经过的有效子网发送第二请求,获取所述有效子网的拓扑信息;Sending a second request to the valid subnet through which the effective cross-subnet route passes, and acquiring topology information of the effective subnet;
    根据所述有效跨子网路由、所述拓扑信息确定端到端路由信息,选择所述端到端路由信息表征的路由为端到端路由。Determining the end-to-end routing information according to the effective cross-subnet routing and the topology information, and selecting the route represented by the end-to-end routing information as an end-to-end route.
  2. 根据权利要求1所述的方法,其中,所述第一请求携带起始端点、终止端点,相应的,The method of claim 1 wherein said first request carries a starting endpoint, a terminating endpoint, correspondingly,
    所述根据所述第一请求确定有效跨子网路由为:Determining, according to the first request, that the effective cross-subnet route is:
    确定所述起始端点所属的下级子网为起始子网,确定所述终止端点所属的下级子网为终止子网,采用最短路由策略计算所述起始子网、终止子网之间的最短跨子网路由,确定所述最短跨子网路由为所述有效跨子网路由。Determining that the subnet to which the starting endpoint belongs is the starting subnet, determining that the subnet to which the terminating endpoint belongs is the terminating subnet, and calculating the starting subnet and ending the subnet by using the shortest path by the policy The shortest cross-subnet route determines that the shortest cross-subnet route is the valid cross-subnet route.
  3. 根据权利要求2所述的方法,其中,所述方法还包括:The method of claim 2, wherein the method further comprises:
    将所述有效跨子网路由经过的下级子网设置为有效子网,将所述有效跨子网路由未经过的下级子网设置为无效子网。Set the subnet to which the valid cross-subnet route passes as a valid subnet, and set the subnet that has not passed the effective cross-subnet route to an invalid subnet.
  4. 根据权利要求1所述的方法,其中,在向所述有效跨子网路由经过的有效子网发送第二请求之前,所述方法还包括:The method of claim 1, wherein the method further comprises: before transmitting the second request to the valid subnet through which the effective cross-subnet route passes, the method further comprising:
    获取所述有效子网的边界点;Obtaining a boundary point of the valid subnet;
    根据所述边界点计算所述有效跨子网路由的抽象拓扑;Calculating an abstract topology of the effective cross-subnet route according to the boundary point;
    根据所述有效跨子网路由与所述抽象拓扑得到有效抽象路由;Obtaining an effective abstract route according to the effective cross-subnet route and the abstract topology;
    其中,所述抽象拓扑为:以所述有效子网为全交叉对象计算的路由。The abstract topology is: a route calculated by using the effective subnet as a full cross object.
  5. 根据权利要求4所述的方法,其中,根据所述有效跨子网路由、所述拓扑信息确定端到端路由信息包括: The method of claim 4, wherein determining end-to-end routing information according to the effective cross-subnet routing and the topology information comprises:
    根据有效抽象路由在所述有效子网上的边界节点计算所述有效子网的子网内有效路由;Calculating a valid route within the subnet of the effective subnet according to a valid abstract route on a boundary node of the effective subnet;
    根据所述有效抽象路由、所述子网内有效路由生成所述端到端路由信息。Generating the end-to-end routing information according to the valid abstract route and the effective route in the subnet.
  6. 根据权利要求1所述的方法,其中,所述方法还包括:选择至少两条端到端路由,设置所述至少两条的端到端路由中的一条端到端路由为工作路由,设置所述工作路由以外的所述端到端路由为保护路由。The method according to claim 1, wherein the method further comprises: selecting at least two end-to-end routes, setting an end-to-end route of the at least two end-to-end routes as a working route, setting a location The end-to-end route other than the working route is a protection route.
  7. 一种确定端到端路由的装置,所述装置包括:接收模块、获取模块、选择模块;其中,An apparatus for determining end-to-end routing, the apparatus comprising: a receiving module, an obtaining module, and a selecting module; wherein
    所述接收模块,配置为接收到第一请求时,根据所述第一请求确定有效跨子网路由;The receiving module is configured to: when receiving the first request, determine an effective cross-subnet route according to the first request;
    所述获取模块,配置为向所述有效跨子网路由经过的有效子网发送第二请求,获取所述有效子网的拓扑信息;The acquiring module is configured to send a second request to the valid subnet through which the effective cross-subnet route passes, and acquire topology information of the effective subnet;
    所述选择模块,配置为根据所述有效跨子网路由、所述拓扑信息确定端到端路由信息,选择所述端到端路由信息表征的路由为端到端路由。The selecting module is configured to determine end-to-end routing information according to the effective cross-subnet routing and the topology information, and select the route represented by the end-to-end routing information as an end-to-end route.
  8. 根据权利要求7所述的装置,其中,所述接收模块,还配置为:The apparatus according to claim 7, wherein the receiving module is further configured to:
    接收携带起始端点、终止端点的第一请求;Receiving a first request carrying a start endpoint and terminating the endpoint;
    确定所述起始端点所属的下级子网为起始子网,确定所述终止端点所属的下级子网为终止子网,采用最短路由策略计算所述起始子网、终止子网之间的最短跨子网路由,确定所述最短跨子网路由为所述有效跨子网路由。Determining that the subnet to which the starting endpoint belongs is the starting subnet, determining that the subnet to which the terminating endpoint belongs is the terminating subnet, and calculating the starting subnet and ending the subnet by using the shortest path by the policy The shortest cross-subnet route determines that the shortest cross-subnet route is the valid cross-subnet route.
  9. 根据权利要求8所述的装置,其中,所述装置还包括:设置模块;The device according to claim 8, wherein the device further comprises: a setting module;
    所述设置模块,配置为将所述有效跨子网路由经过的下级子网设置为有效子网,将所述有效跨子网路由未经过的下级子网设置为无效子网。The setting module is configured to set the lower subnet through which the valid cross-subnet route passes as a valid subnet, and set the lower subnet whose valid cross-subnet route has not passed as an invalid subnet.
  10. 根据权利要求7所述的装置,其中,所述装置还包括:抽象路由 模块;The apparatus of claim 7 wherein said apparatus further comprises: abstract routing Module
    所述抽象路由模块,配置为获取所述有效子网的边界点;根据所述边界点计算所述有效跨子网路由的抽象拓扑;根据所述有效跨子网路由与所述抽象拓扑得到有效抽象路由;其中,所述抽象拓扑为:以所述有效子网为全交叉对象计算的路由。The abstract routing module is configured to acquire a boundary point of the effective subnet; calculate an abstract topology of the effective cross-subnet route according to the boundary point; and obtain an effective manner according to the effective cross-subnet route and the abstract topology An abstract route; wherein the abstract topology is: a route calculated by using the valid subnet as a full-cross object.
  11. 根据权利要求10所述的装置,其中,所述选择模块配置为:The apparatus of claim 10 wherein said selection module is configured to:
    根据有效抽象路由在所述有效子网上的边界节点计算所述有效子网的子网内有效路由;Calculating a valid route within the subnet of the effective subnet according to a valid abstract route on a boundary node of the effective subnet;
    根据所述有效抽象路由、所述子网内有效路由生成所述端到端路由信息。Generating the end-to-end routing information according to the valid abstract route and the effective route in the subnet.
  12. 根据权利要求7所述的装置,其中,所述装置还包括:保护模块;The device of claim 7, wherein the device further comprises: a protection module;
    所述保护模块,配置为选择至少两条端到端路由,设置所述至少两条的端到端路由中的一条端到端路由为工作路由,设置所述工作路由以外的所述端到端路由为保护路由。 The protection module is configured to select at least two end-to-end routes, and set an end-to-end route of the at least two end-to-end routes as a working route, and set the end-to-end except the working route Routes are protected routes.
PCT/CN2015/071133 2014-07-11 2015-01-20 Method and device for determining end-to-end routing WO2016004752A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201410331116.3 2014-07-11
CN201410331116.3A CN105282025A (en) 2014-07-11 2014-07-11 Method of determining end-to-end routing and apparatus thereof

Publications (1)

Publication Number Publication Date
WO2016004752A1 true WO2016004752A1 (en) 2016-01-14

Family

ID=55063551

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2015/071133 WO2016004752A1 (en) 2014-07-11 2015-01-20 Method and device for determining end-to-end routing

Country Status (2)

Country Link
CN (1) CN105282025A (en)
WO (1) WO2016004752A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI750570B (en) * 2016-07-29 2021-12-21 南韓商三星顯示器有限公司 Display device

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107181680B (en) 2016-03-11 2020-11-03 中兴通讯股份有限公司 Method and system for realizing SDO function and SDON system
CN108989222B (en) * 2017-06-05 2022-02-25 中兴通讯股份有限公司 Method and device for releasing network route
CN107465615B (en) * 2017-08-03 2020-05-05 全球能源互联网研究院有限公司 Routing determination method based on layered multi-domain and controller

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1588920A (en) * 2004-09-17 2005-03-02 清华大学 Establishing method for parallel layer light mark exchanging path in layer light network
CN1859170A (en) * 2005-12-02 2006-11-08 华为技术有限公司 Method for realizing cross-domain route separation
CN101147348A (en) * 2005-07-28 2008-03-19 中兴通讯股份有限公司 Automatic exchange optical network layered route calculation and connection establishing method

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020042875A1 (en) * 2000-10-11 2002-04-11 Jayant Shukla Method and apparatus for end-to-end secure data communication
US6999437B2 (en) * 2002-12-17 2006-02-14 Nokia Corporation End-to-end location privacy in telecommunications networks
CN1330141C (en) * 2004-01-09 2007-08-01 华为技术有限公司 Optical network route selecting method
CN101888326A (en) * 2009-05-15 2010-11-17 华为技术有限公司 Business connection establishment method, path computing unit device and network system
CN103379032B (en) * 2012-04-24 2018-02-27 中兴通讯股份有限公司 The acquisition methods and device, sub-route computational entity of cross-domain end-to-end route

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1588920A (en) * 2004-09-17 2005-03-02 清华大学 Establishing method for parallel layer light mark exchanging path in layer light network
CN101147348A (en) * 2005-07-28 2008-03-19 中兴通讯股份有限公司 Automatic exchange optical network layered route calculation and connection establishing method
CN1859170A (en) * 2005-12-02 2006-11-08 华为技术有限公司 Method for realizing cross-domain route separation

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI750570B (en) * 2016-07-29 2021-12-21 南韓商三星顯示器有限公司 Display device

Also Published As

Publication number Publication date
CN105282025A (en) 2016-01-27

Similar Documents

Publication Publication Date Title
CN103379032B (en) The acquisition methods and device, sub-route computational entity of cross-domain end-to-end route
US8848544B2 (en) Event correlation using network data flow simulation over unmanaged network segments
US11463313B2 (en) Topology-aware controller associations in software-defined networks
JP5651756B2 (en) Method and communication system for mapping network topology requirements to physical networks
CN107547333B (en) Method and apparatus for implementing a combined virtual private network VPN
US8572485B2 (en) Splitting and merging routing domains
JP2013510459A (en) Separate path computation algorithm
WO2016004752A1 (en) Method and device for determining end-to-end routing
EP3682597B1 (en) Modeling access networks as trees in software-defined network controllers
CN108650177B (en) Method and system for performing cross-domain service configuration on SPTN (shortest Path bridging) equipment
KR101674177B1 (en) Transport Software-Defined Network controller of providing E-LAN between multi-nodes and method thereof
CN109818858A (en) For realizing the methods, devices and systems of topological relation automatic Mosaic between domain
CN113347059B (en) In-band network telemetering optimal detection path planning method based on fixed probe position
CN103825826A (en) Method and device for implementing dynamic routing
CN109600291B (en) Cross-domain QoS (quality of service) adjusting method and device
WO2015196646A1 (en) Method for acquiring cross-domain separation paths, path computation element and related storage medium
WO2019218649A1 (en) Method and device for acquiring route of software-defined network and storage medium
Feamster et al. Network-wide BGP route prediction for traffic engineering
WO2016184369A1 (en) Method for configuring clock tracking and control device
JP2009038717A (en) Method of determining communication route in overlay network, overlay node, overlay network and program
JP4553314B2 (en) Communication path determination method and communication path determination system in overlay network
JP7282210B2 (en) Network control method, device and system
JP2004248177A (en) Alternative route management method and system thereof
WO2015096415A1 (en) Cross-domain path processing method and device
CN113810282B (en) Path determining method, device and storage medium

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

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

Country of ref document: EP

Kind code of ref document: A1