WO2014005522A1 - Route computation method and device - Google Patents

Route computation method and device Download PDF

Info

Publication number
WO2014005522A1
WO2014005522A1 PCT/CN2013/078763 CN2013078763W WO2014005522A1 WO 2014005522 A1 WO2014005522 A1 WO 2014005522A1 CN 2013078763 W CN2013078763 W CN 2013078763W WO 2014005522 A1 WO2014005522 A1 WO 2014005522A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
link
network element
nodes
service
Prior art date
Application number
PCT/CN2013/078763
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 WO2014005522A1 publication Critical patent/WO2014005522A1/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks

Definitions

  • a transport network is the basis of an entire telecommunications network, which provides a transmission channel and a transmission platform for services carried by the entire network.
  • the related technologies of the transport network mainly use SDH (Synchronous Digital Hierarchy) technology and WDM (Wavelength Division Multiplexing) technology.
  • SDH Serial Digital Hierarchy
  • WDM Widelength Division Multiplexing
  • ITU International Telecommunication Union
  • OTN Optical Transport Network
  • the OTN network has the advantages of large-capacity WDM, high-speed, and long-distance transmission.
  • the OTN network mainly includes the following subsystems: WDM link, OXC (Optical Cross-Connects, optical cross-connects), DXC (Digital Cross-Connects), OEP (Optical Electronic Processor), etc. .
  • WDM link WDM link
  • OXC Optical Cross-Connects, optical cross-connects
  • DXC Digital Cross-Connects
  • OEP Optical Electronic Processor
  • FIG. 1 is a schematic structural diagram of a typical OTN network element according to the related art.
  • FIG. 2 is a schematic diagram of a topology of an OTN network composed of OTN network elements according to the related art.
  • a wavelength switching path needs to be calculated, and wavelength assignment is performed based on the Wavelength conversion, photoelectric processing, etc.
  • path computation is to divide the entire path computation into three parts: route calculation, wavelength assignment, and optical damage verification.
  • the route calculation is based on the network topology to select an appropriate route; the wavelength assignment is to allocate the available wavelengths for the route; the optical damage verification is to verify whether the optical signal meets the transmission requirements.
  • the three parts of route calculation, wavelength assignment and optical damage verification are independent of each other, in order.
  • the exchange particles of OXC are much larger than DXC, and the ability of OXC to process signals is much larger than that of DXC and OEP.
  • the network topology on which the route calculation is based is mainly composed of the WDM link and the OXC, and the resources such as DXC and OEP inside the network element are not considered, and the calculated path is for the WDM link and the OXC resource.
  • Optimal, but comprehensive consideration of DXC and OEP resources within the node is not necessarily optimal, and will bring waste of resources such as DXC and OEP to a certain extent.
  • DXC, OEP, and the like are wasted, and no effective solution has been proposed yet.
  • a route calculation method including: splitting each network element node in an optical transport network (OTN) into a plurality of network element sub-nodes; configuring child nodes for multiple network element sub-nodes Linking, and constructing extended topology information of multiple network element sub-nodes according to the child node link; performing route calculation on multiple network element child nodes according to the extended topology information.
  • OTN optical transport network
  • the network element node includes: a service head node, a service tail node, and a service intermediate node.
  • each network node in the optical transport network is split into a plurality of network element sub-nodes, including: when the network element node is the service first node, according to the number of the first link port of the service head node and the first A client port splits the service head node into M+1 first network element child nodes, and uses the first network element child node split according to the first client port as the service first child node, where the first link The number of ports is M.
  • configuring the child node link for the multiple network element sub-nodes includes: using the first link between the service head node and the other network element node as the first external link of the first network element child node, and The link cost of the first link is the first external link cost of the first external link; the first internal link is configured between the first network element sub-nodes, and the wavelength exchange is performed according to the first network element sub-node or The first resource required for wavelength conversion consumes the first internal link cost of configuring the first internal link.
  • each network node in the optical transmission network is split into a plurality of network element sub-nodes, including: when the network element node is a service tail node, according to the number of second link ports of the service tail node and the number The second client port splits the service tail node into N+1 second network element sub-nodes, and uses the second network element sub-node split according to the second client port as the service tail node, where the second link The number of ports is N.
  • configuring the child node link for the multiple network element sub-nodes includes: using the second link between the service tail node and the other network element node as the second external link of the second network element sub-node, and The link cost of the second link is the second external link cost of the second external link; the second internal link is configured between the second network element sub-nodes, and the wavelength exchange is performed according to the second network element sub-node or The second resource required for wavelength conversion consumes the second internal link cost of the second internal link.
  • each network node in the optical transport network is split into a plurality of network element sub-nodes, including: when the network element node is a service intermediate node, the service is performed according to the third link port number of the service intermediate node.
  • the intermediate node is split into P third network element sub-nodes, wherein the third link port number is P.
  • configuring the child node link for the multiple network element sub-nodes includes: using the third link between the service intermediate node and the other network element node as the third external link of the third network element sub-node, and The link cost of the third link is the third external link cost of the third external link; the third internal link is configured between the third network element sub-nodes, and the wavelength exchange is performed according to the third network element sub-node or The third resource required for wavelength conversion consumes the third internal link cost of the third internal link.
  • constructing extended topology information of the multiple network element sub-nodes according to the sub-node link includes: according to the first external link and the first external link cost, the first internal link, and the first internal link cost, Two external link and second outer link cost, second internal link and second internal link cost, third external link and third external link cost, and third internal link and third internal link cost
  • the extended topology information of multiple network element sub-nodes is jointly constructed as a child node link.
  • the routing calculation is performed on the plurality of network element sub-nodes according to the extended topology information, including: adopting a Constrained Shortest Path First (CSPF) algorithm, and performing routing calculation on the plurality of network element sub-nodes according to the extended topology information.
  • CSPF Constrained Shortest Path First
  • a routing computing apparatus including: a splitting module, configured to split each network element node in an optical transport network (OTN) into a plurality of network element sub-nodes;
  • the configuration module is configured to configure a child node link for multiple network element sub-nodes;
  • the building module is configured to construct extended topology information of multiple network element sub-nodes according to the child node link;
  • the computing module is set to multiple networks according to the extended topology information.
  • the meta-node performs route calculation.
  • the network element node includes: a service head node, a service tail node, and a service intermediate node.
  • the method for splitting each network element into a plurality of network element sub-nodes and then constructing the extended topology of the plurality of network element sub-nodes solves the problem that the existing route calculation method does not consider the DXC inside the network element.
  • Resources such as OEP cause waste of resources such as DXC and OEP, thereby achieving the effects of saving resources such as DXC and OEP, improving the effective use rate of OXC resources, and reducing service consumption.
  • FIG. 1 is a schematic diagram of a typical OTN network element structure according to the related art
  • FIG. 2 is a topological schematic diagram of an OTN network composed of OTN network elements according to the related art
  • 3 is a flowchart of a route calculation method according to an embodiment of the present invention
  • FIG. 4 is a flowchart of a route calculation method according to a preferred embodiment of the present invention
  • FIG. 5 is a schematic structural diagram of an extended topology example 1 constructed according to a preferred embodiment of the present invention
  • 6 is a block diagram showing an example of an extended topology example 2 constructed in accordance with a preferred embodiment of the present invention
  • FIG. 7 is a block diagram showing the structure of a route calculation device according to an embodiment of the present invention.
  • the method mainly includes the following steps (step S302-step S306): Step S302, each network element in an optical transport network (OTN) The node is split into a plurality of network element sub-nodes; Step S304, configuring a child node link for the plurality of network element child nodes, and constructing extended topology information of the plurality of network element child nodes according to the child node link; Step S306, according to the extension
  • the topology information performs route calculation on multiple network element sub-nodes.
  • the network element node may include: a service first node, a service tail node, and a service intermediate node.
  • step S302 can be implemented in three different situations:
  • the service first node When the network element node is the service first node, the service first node is split into M+1 first network element sub-nodes according to the first link port number of the service head node and the first client port, and The first network element sub-node split by the first client port is used as the service first child node, where the number of the first link port is M.
  • the service tail node When the network element node is a service tail node, the service tail node is split into N+1 second network element sub-nodes according to the second link port number of the service tail node and the second client port, and The second network element sub-node split by the second client port is used as the service tail node, and the number of the second link port is N.
  • the service intermediate node is split into P third network element sub-nodes according to the number of the third link port of the service intermediate node, where the number of the third link port is P .
  • the child node can be configured for the network element sub-nodes obtained by the above three different situations, and the specific implementation can be implemented as follows:
  • configuring the child node link for the first network element child node includes: using the first link between the service head node and other network element nodes as the first network element child node a first external link, and using a link cost of the first link as a first external link cost of the first external link; configuring a first internal link between the first network element sub-nodes, and according to the The first resource cost required for wavelength switching or wavelength conversion of a network element sub-node configures a first internal link cost of the first internal link.
  • configuring the child node link for the second network element child node includes: using the second link between the service tail node and the other network element node as the second network element child node a second external link, and a link cost of the second link as a second external link cost of the second external link; configuring a second internal link between the second network element sub-nodes, and according to the The second resource cost required for the two network element sub-nodes to perform wavelength switching or wavelength conversion configures the second internal link cost of the second internal link.
  • configuring the child node link for the third network element child node includes: using the third link between the service intermediate node and the other network element node as the third network element child node a third external link, and a link cost of the third link as a third external link cost of the third external link; configuring a third internal link between the third network element sub-nodes, and according to the The third resource cost required for the three-network sub-node to perform wavelength switching or wavelength conversion configures the third internal link cost of the third internal link.
  • the child node after configuring the child node link for the three different network element sub-nodes (the first network element child node, the second network element child node, and the third network element child node), the child node may be configured according to the child node.
  • the link constructs extended topology information of the multiple network element sub-nodes, including: according to the first external link and the first external link cost, the first internal link and the first internal link cost, the second external link, and the first Two external link costs, a second internal link and a second internal link cost, a third external link and a third external link cost, and a third internal link and a third internal link cost together as a child node link Construct extended topology information of multiple network element sub-nodes.
  • step S304 is performed, and then the constrained shortest path first CSPF algorithm is used to perform route calculation on multiple network element sub-nodes according to the extended topology information.
  • the method when performing route calculation on multiple network element sub-nodes according to the extended topology information, the method may be implemented in the following manner: using a Constrained Shortest Path First (CSPF) algorithm, and multiple network elements according to extended topology information.
  • CSPF Constrained Shortest Path First
  • the node performs route calculation.
  • the above route calculation method will be described in detail below with reference to FIGS. 4 to 6 and a preferred embodiment. 4 is a flowchart of a route calculation method according to a preferred embodiment of the present invention. As shown in FIG.
  • the process mainly includes the following steps (step S402-step S412): Step S402, pressing each network element node according to its link port. Splitting into a plurality of child nodes; Step S404, converting the link between the nodes into an external link between the child nodes, the link cost is unchanged; Step S406, setting an internal chain between the child nodes inside the node And configuring the cost of the link based on the resource consumption required for wavelength switching between the child nodes; Step S408, for the service head and tail node, according to the service access port (that is, the first client port or the second client port) Each of the sub-nodes is split and a new first-to-end node is calculated as a route; in step S410, an internal link between the sub-nodes associated with the egress-way port and the sub-nodes associated with the link port is set inside the service end-to-end node, And configuring the cost of the link based on the resource consumption required for the uplink and the egress between the child nodes
  • FIG. 5 is a schematic structural diagram of an extended topology example 1 constructed according to a preferred embodiment of the present invention.
  • the method shown in FIG. 4 can be implemented as follows:
  • node A has two links AB and AC, and is split into child nodes A1 and A2;
  • node B has two links AB and BD, and is split into child nodes Bl and B2;
  • the link between the nodes is converted into an external link between the child nodes, and the link cost is unchanged. Specifically, the link AB between the nodes is converted into the external link A1B1 between the child nodes, and the link cost is 10; the link AC between the nodes is converted into the external link A2C1 between the child nodes, the link cost Is 10;
  • the cost of the link is configured based on the resource consumption required for wavelength switching between the child nodes.
  • the cost of the link is set to 1 for the link cost; for Node B, there is no common available wavelength between the sub-nodes B1 and B2, but it can be accessed through resources such as DXC and OEP.
  • the cost of configuring the link is based on the resource consumption of OXC, DXC, and OEP, and the link cost is configured to be 100;
  • the first and last nodes of the service For the first and last nodes of the service, one sub-node is split according to the service port, and a new first-to-end node is calculated as the route. Specifically, the first and last nodes of the service are nodes A and D, respectively, and the child nodes A0 and DO are split. (5) Inside the service head and tail nodes, the child nodes related to the uplink and the downlink ports are set between the child nodes related to the link ports. The internal link, and the cost of configuring the link based on the resource consumption required for the uplink and the egress between the child nodes.
  • the cost of the link is configured based on the resource consumption of the OXC; if the port is connected to the OXC through resources such as DXC and OEP, the OXC, DXC, and OEP are used. Based on the resource consumption, configure the cost of the link; if the child node A0 is directly connected to the OXC, the cost of the link A0A1 is set to 1;
  • the route calculation based on the original topology the total cost of the path only includes the total cost of the WDM link, and does not take into account the cost of resource consumption such as DXC and OEP within the node. If the internal resource consumption of the node is considered, the actual total cost will be increase.
  • the total cost of the path includes not only the total cost of the WDM link, but also the cost of resource consumption such as DXC and OEP within the node. Since the extended topology integrates WDM links, OXC, DXC, OEP and other resources, The routing calculation results are optimized. Please refer to Table 1. Table 1. Results chart of route calculation based on original topology and extended topology example
  • FIG. 6 is a schematic structural diagram of an extended topology example 2 constructed according to a preferred embodiment of the present invention.
  • the method shown in FIG. 4 can be implemented as follows: (1) Split each network element node into several child nodes according to its link port. Specifically, the node A has two links AB and AC, and is split into child nodes A1 and A2; the node B has two links AB and BD, and is split into child nodes B1 and B2;
  • the link between the nodes is converted into an external link between the child nodes, and the link cost is unchanged. Specifically, the link AB between the nodes is converted into the external link A1B1 between the child nodes, and the link cost is 10; the link AC between the nodes is converted into the external link A2C1 between the child nodes, the link cost Is 10;
  • the cost of the link is configured based on the resource consumption required for wavelength switching between the child nodes. Specifically, for the nodes A, C, and D, the child nodes A1 and A2, CI and C2, and the common available wavelengths between D1 and D2 can be directly exchanged by OXC, and then configured based on the resource consumption of the OXC. The cost of the link is set to 1 for the link cost. If the node sub-nodes B1 and B2 cannot perform wavelength switching or wavelength conversion through resources such as DXC and OEP, the link is unavailable, and the cost of the link is configured as + ⁇ ;
  • the first and last nodes of the service For the first and last nodes of the service, one sub-node is split according to the service port, and a new first-to-end node is calculated as the route. Specifically, the first and last nodes of the service are nodes A and D, respectively, and the child nodes A0 and DO are split. (5) Inside the service head and tail nodes, the child nodes related to the uplink and the downlink ports are set between the child nodes related to the link ports. The internal link, and the cost of configuring the link based on the resource consumption required for the uplink and the egress between the child nodes.
  • the cost of the link is configured based on the resource consumption of the OXC; if the port is connected to the OXC through resources such as DXC and OEP, the OXC, DXC, and OEP are used. Based on the resource consumption, configure the cost of the link; if the child node A0 is directly connected to the OXC, the cost of the link A0A1 is set to 1;
  • the topology needs to be explained.
  • the main difference between the extended topology 1 and the extended topology 2 is:
  • the two sub-nodes of the node B can perform wavelength switching or wavelength conversion through resources such as DXC and OEP, and between the child nodes.
  • the link is available.
  • the two sub-nodes of the node B cannot perform wavelength switching or wavelength conversion through resources such as DXC and OEP, and the link between the child nodes is unavailable. Both of these situations can be considered in routing calculations by building an extended topology.
  • each network element node is first split into multiple network element sub-nodes, and then the expansion topology of multiple network element sub-nodes is constructed, which can solve the existing route calculation method without considering the internal network element.
  • the resources such as DXC and OEP cause waste of resources such as DXC and OEP, thereby achieving the effects of saving resources such as DXC and OEP, improving the effective use rate of OXC resources, and reducing service consumption.
  • FIG. 7 is a structural block diagram of a route calculation device according to an embodiment of the present invention. The device is used to implement the route calculation method provided by the foregoing embodiment. As shown in FIG.
  • the device mainly includes: a split module 10, a configuration module 20, The module 30 and the calculation module 40 are constructed.
  • the splitting module 10 is configured to split each network element node in the optical transport network OTN into multiple network element sub-nodes;
  • the configuration module 20 is connected to the splitting module 10, and is configured as multiple network element sub-nodes.
  • the computing module 40 connected to the building module 30, configured to be based on the extended topology The information is routed to multiple network element sub-nodes.
  • the network element node may include: a service first node, a service tail node, and a service intermediate node.
  • the routing calculation device provided by the foregoing embodiment first splits each network element node into multiple network element sub-nodes, and then constructs an expansion topology of multiple network element sub-nodes, which can solve the existing route calculation method without considering the internal network element.
  • the resources such as DXC and OEP cause waste of resources such as DXC and OEP, thereby achieving the effects of saving resources such as DXC and OEP, improving the effective use rate of OXC resources, and reducing service consumption.
  • the present invention achieves the following technical effects:
  • the method for splitting each network element node into multiple network element sub-nodes and then constructing the expansion topology of multiple network element sub-nodes is solved.
  • the existing route calculation method does not consider the resources such as DXC and OEP in the network element, which causes waste of resources such as DXC and OEP, thereby saving resources such as DXC and OEP, improving the effective use rate of OXC resources, and reducing service consumption. effect.
  • the above modules or steps of the present invention can be implemented by a general-purpose computing device, which can be concentrated on a single computing device or distributed over a network composed of multiple computing devices.
  • the computing device may be implemented by program code executable by the computing device, such that they may be stored in the storage device by the computing device and, in some cases, may be different from the order herein.
  • the steps shown or described are performed, or they are separately fabricated into individual integrated circuit modules, or a plurality of modules or steps are fabricated as a single integrated circuit module.
  • the invention is not limited to any specific combination of hardware and software.
  • the above is only the preferred embodiment of the present invention, and is not intended to limit the present invention, and various modifications and changes can be made to the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and scope of the present invention are intended to be included within the scope of the present invention.

Abstract

Disclosed are a route computation method and device, the method comprising: splitting each network element node in an optical transport network (OTN) into a plurality of network element sub-nodes; allocating sub-node links for the plurality of network element sub-nodes, and constructing expansion topology information for the plurality of network element sub-nodes according to the sub-node links; and employing a constrained shortest path first (CSPF) algorithm to conduct route computation on the plurality of network element sub-nodes according to the expansion topology information. The present invention saves resources such as DXC, OEP and the like, improves the effective use rate of OXC resource, and reduces service consumption.

Description

路由计算方法及装置  Route calculation method and device
技术领域 本发明涉及通信领域, 具体而言, 涉及一种路由计算方法及装置。 背景技术 传送网是整个电信网的基础, 它为整个网络所承载的业务提供传输通道和传输平 台。 传送网相关技术主要使用 SDH ( Synchronous Digital Hierarchy, 同步数字体系) 技术和 WDM (Wavelength Division Multiplexing,波分复用)技术。针对 SDH和 WDM 技术各自的优缺点, ITU (International Telecommunication Union, 国际电信联盟) 提 出了 OTN ( Optical Transport Network, 光传送网)架构。 OTN网络既具有 WDM大容 量、 高速率、 长距离传输等优点, 也具备 SDH接入类型丰富、 调度灵活、 保护功能强 大、 OAM (Operation Administration and Maintenance, 操作管理与维护) 功能丰富等 优点。 OTN网络主要包括以下几个子系统: WDM链路、 OXC (Optical Cross-Connects, 光交叉互联器)、 DXC ( Digital Cross-Connects , 数字交叉互联器)、 OEP ( Optical Electronic Processor,光电处理器)等。请参考图 1,图 1是根据相关技术的典型的 OTN 网元结构组成示意图。 请参考图 2, 图 2是根据相关技术的由 OTN网元组成的 OTN网络的拓扑示意图, 在 OTN网络中建立业务时,首先需要计算出波长交换路径,并以此为基础进行波长指 配、 波长转换、 光电处理等配置。 目前, 对路径计算的普遍做法是将整个路径计算分 为三个部分: 路由计算、 波长分配和光损伤验证。 其中, 路由计算是基于网络拓扑选 择合适的路由; 波长分配则是为该路由分配可用的波长; 光损伤验证则是验证光信号 是否满足传输要求。 路由计算、 波长分配和光损伤验证三个部分彼此独立, 按顺序进 行。 在 OTN网络中, OXC的交换颗粒要远大于 DXC, OXC处理信号的能力也远大 于 DXC、 OEP。 在现有技术中, 路由计算依据的网络拓扑主要由 WDM链路及 OXC 构成, 而未考虑网元内部的 DXC、 OEP等资源, 所计算出的路径, 对于 WDM链路及 OXC资源来说是最优的, 但是综合考虑节点内部的 DXC、 OEP资源, 却未必是最优 的, 在一定程度上将带来 DXC、 OEP等资源的浪费。 针对相关技术中路由计算时未考虑网元内部的 DXC、 OEP等资源而导致 DXC、 OEP等资源浪费的问题, 目前尚未提出有效的解决方案。 发明内容 本发明提供了一种路由计算方法及装置, 以至少解决上述问题之一。 根据本发明的一个方面, 提供了一种路由计算方法, 包括: 将光传输网络(0TN) 中的各个网元节点拆分为多个网元子节点; 为多个网元子节点配置子节点链路, 并根 据子节点链路构建多个网元子节点的扩展拓扑信息; 根据扩展拓扑信息对多个网元子 节点进行路由计算。 优选地, 网元节点包括: 业务首节点、 业务尾节点以及业务中间节点。 优选地, 将光传输网络(OTN) 中的各个网络节点拆分为多个网元子节点, 包括: 当网元节点为业务首节点时, 根据业务首节点的第一链路端口数和第一客户端口将业 务首节点拆分为 M+1个第一网元子节点,并将根据第一客户端口拆分出的第一网元子 节点作为业务首子节点, 其中, 第一链路端口数为 M。 优选地, 为多个网元子节点配置子节点链路, 包括: 将业务首节点与其他网元节 点之间的第一链路作为第一网元子节点的第一外部链路, 并将第一链路的链路代价作 为第一外部链路的第一外部链路代价; 在第一网元子节点之间配置第一内部链路, 并 根据第一网元子节点进行波长交换或波长转换所需要的第一资源耗费配置第一内部链 路的第一内部链路代价。 优选地, 将光传输网络(0TN) 中的各个网络节点拆分为多个网元子节点, 包括: 当网元节点为业务尾节点时, 根据业务尾节点的第二链路端口数和第二客户端口将业 务尾节点拆分为 N+1个第二网元子节点, 并将根据第二客户端口拆分出的第二网元子 节点作为业务尾子节点, 其中, 第二链路端口数为 N。 优选地, 为多个网元子节点配置子节点链路, 包括: 将业务尾节点与其他网元节 点之间的第二链路作为第二网元子节点的第二外部链路, 并将第二链路的链路代价作 为第二外部链路的第二外部链路代价; 在第二网元子节点之间配置第二内部链路, 并 根据第二网元子节点进行波长交换或波长转换所需要的第二资源耗费配置第二内部链 路的第二内部链路代价。 优选地, 将光传输网络(OTN) 中的各个网络节点拆分为多个网元子节点, 包括: 当网元节点为业务中间节点时, 根据业务中间节点的第三链路端口数将业务中间节点 拆分为 P个第三网元子节点, 其中, 第三链路端口数为 P。 优选地, 为多个网元子节点配置子节点链路, 包括: 将业务中间节点与其他网元 节点之间的第三链路作为第三网元子节点的第三外部链路, 并将第三链路的链路代价 作为第三外部链路的第三外部链路代价; 在第三网元子节点之间配置第三内部链路, 并根据第三网元子节点进行波长交换或波长转换所需要的第三资源耗费配置第三内部 链路的第三内部链路代价。 优选地, 根据子节点链路构建多个网元子节点的扩展拓扑信息, 包括: 根据第一 外部链路和第一外部链路代价、 第一内部链路和第一内部链路代价、 第二外部链路和 第二外部链路代价、 第二内部链路和第二内部链路代价、 第三外部链路和第三外部链 路代价以及第三内部链路和第三内部链路代价共同作为子节点链路构建多个网元子节 点的扩展拓扑信息。 优选地, 根据扩展拓扑信息对多个网元子节点进行路由计算, 包括: 采用约束最 短路径优先 (CSPF) 算法, 根据扩展拓扑信息对多个网元子节点进行路由计算。 根据本发明的另一方面, 提供了一种路由计算装置, 包括: 拆分模块, 设置为将 光传输网络 (OTN) 中的各个网元节点拆分为多个网元子节点; 配置模块, 设置为为 多个网元子节点配置子节点链路; 构建模块, 设置为根据子节点链路构建多个网元子 节点的扩展拓扑信息; 计算模块, 设置为根据扩展拓扑信息对多个网元子节点进行路 由计算。 优选地, 网元节点包括: 业务首节点、 业务尾节点以及业务中间节点。 通过本发明, 采用先将各个网元节点拆分为多个网元子节点, 再构建多个网元子 节点的扩张拓扑的方式,解决了现有路由计算方法未考虑网元内部的 DXC、 OEP等资 源而导致 DXC、 OEP等资源浪费的问题, 进而达到了节省 DXC、 OEP等资源、 提高 OXC资源的有效使用率、 降低业务消耗的效果。 附图说明 此处所说明的附图用来提供对本发明的进一步理解, 构成本申请的一部分, 本发 明的示意性实施例及其说明用于解释本发明, 并不构成对本发明的不当限定。 在附图 中- 图 1是根据相关技术的典型的 OTN网元结构组成示意图; 图 2是根据相关技术的由 OTN网元组成的 OTN网络的拓扑示意图; 图 3是根据本发明实施例的路由计算方法流程图; 图 4是根据本发明优选实施例的路由计算方法流程图; 图 5是根据本发明优选实施例构建的扩展拓扑示例一的结构示意图; 图 6是根据本发明优选实施例构建的扩展拓扑示例二的结构示意图; 以及 图 7是根据本发明实施例的路由计算装置的结构框图。 具体实施方式 下文中将参考附图并结合实施例来详细说明本发明。 需要说明的是, 在不冲突的 情况下, 本申请中的实施例及实施例中的特征可以相互组合。 图 3是根据本发明实施例的路由计算方法流程图, 如图 3所示, 该方法主要包括 以下步骤 (步骤 S302-步骤 S306): 步骤 S302, 将光传输网络 (OTN) 中的各个网元节点拆分为多个网元子节点; 步骤 S304, 为多个网元子节点配置子节点链路, 并根据子节点链路构建多个网元 子节点的扩展拓扑信息; 步骤 S306, 根据扩展拓扑信息对多个网元子节点进行路由计算。 在本实施例中, 网元节点可以包括: 业务首节点、业务尾节点以及业务中间节点。 在本实施例中, 步骤 S302可以按照三种不同的情况来实施: TECHNICAL FIELD The present invention relates to the field of communications, and in particular to a route calculation method and apparatus. BACKGROUND OF THE INVENTION A transport network is the basis of an entire telecommunications network, which provides a transmission channel and a transmission platform for services carried by the entire network. The related technologies of the transport network mainly use SDH (Synchronous Digital Hierarchy) technology and WDM (Wavelength Division Multiplexing) technology. For the advantages and disadvantages of SDH and WDM technologies, the ITU (International Telecommunication Union) has proposed an OTN (Optical Transport Network) architecture. The OTN network has the advantages of large-capacity WDM, high-speed, and long-distance transmission. It also has the advantages of rich SDH access, flexible scheduling, strong protection, and OAM (Operation Administration and Maintenance). The OTN network mainly includes the following subsystems: WDM link, OXC (Optical Cross-Connects, optical cross-connects), DXC (Digital Cross-Connects), OEP (Optical Electronic Processor), etc. . Please refer to FIG. 1. FIG. 1 is a schematic structural diagram of a typical OTN network element according to the related art. Referring to FIG. 2, FIG. 2 is a schematic diagram of a topology of an OTN network composed of OTN network elements according to the related art. When establishing a service in an OTN network, first, a wavelength switching path needs to be calculated, and wavelength assignment is performed based on the Wavelength conversion, photoelectric processing, etc. Currently, the common practice for path computation is to divide the entire path computation into three parts: route calculation, wavelength assignment, and optical damage verification. The route calculation is based on the network topology to select an appropriate route; the wavelength assignment is to allocate the available wavelengths for the route; the optical damage verification is to verify whether the optical signal meets the transmission requirements. The three parts of route calculation, wavelength assignment and optical damage verification are independent of each other, in order. In the OTN network, the exchange particles of OXC are much larger than DXC, and the ability of OXC to process signals is much larger than that of DXC and OEP. In the prior art, the network topology on which the route calculation is based is mainly composed of the WDM link and the OXC, and the resources such as DXC and OEP inside the network element are not considered, and the calculated path is for the WDM link and the OXC resource. Optimal, but comprehensive consideration of DXC and OEP resources within the node is not necessarily optimal, and will bring waste of resources such as DXC and OEP to a certain extent. In view of the problem that resources such as DXC and OEP are not considered in the calculation of the route in the related art, DXC, OEP, and the like are wasted, and no effective solution has been proposed yet. SUMMARY OF THE INVENTION The present invention provides a route calculation method and apparatus to solve at least one of the above problems. According to an aspect of the present invention, a route calculation method is provided, including: splitting each network element node in an optical transport network (OTN) into a plurality of network element sub-nodes; configuring child nodes for multiple network element sub-nodes Linking, and constructing extended topology information of multiple network element sub-nodes according to the child node link; performing route calculation on multiple network element child nodes according to the extended topology information. Preferably, the network element node includes: a service head node, a service tail node, and a service intermediate node. Preferably, each network node in the optical transport network (OTN) is split into a plurality of network element sub-nodes, including: when the network element node is the service first node, according to the number of the first link port of the service head node and the first A client port splits the service head node into M+1 first network element child nodes, and uses the first network element child node split according to the first client port as the service first child node, where the first link The number of ports is M. Preferably, configuring the child node link for the multiple network element sub-nodes includes: using the first link between the service head node and the other network element node as the first external link of the first network element child node, and The link cost of the first link is the first external link cost of the first external link; the first internal link is configured between the first network element sub-nodes, and the wavelength exchange is performed according to the first network element sub-node or The first resource required for wavelength conversion consumes the first internal link cost of configuring the first internal link. Preferably, each network node in the optical transmission network (OTN) is split into a plurality of network element sub-nodes, including: when the network element node is a service tail node, according to the number of second link ports of the service tail node and the number The second client port splits the service tail node into N+1 second network element sub-nodes, and uses the second network element sub-node split according to the second client port as the service tail node, where the second link The number of ports is N. Preferably, configuring the child node link for the multiple network element sub-nodes includes: using the second link between the service tail node and the other network element node as the second external link of the second network element sub-node, and The link cost of the second link is the second external link cost of the second external link; the second internal link is configured between the second network element sub-nodes, and the wavelength exchange is performed according to the second network element sub-node or The second resource required for wavelength conversion consumes the second internal link cost of the second internal link. Preferably, each network node in the optical transport network (OTN) is split into a plurality of network element sub-nodes, including: when the network element node is a service intermediate node, the service is performed according to the third link port number of the service intermediate node. The intermediate node is split into P third network element sub-nodes, wherein the third link port number is P. Preferably, configuring the child node link for the multiple network element sub-nodes includes: using the third link between the service intermediate node and the other network element node as the third external link of the third network element sub-node, and The link cost of the third link is the third external link cost of the third external link; the third internal link is configured between the third network element sub-nodes, and the wavelength exchange is performed according to the third network element sub-node or The third resource required for wavelength conversion consumes the third internal link cost of the third internal link. Preferably, constructing extended topology information of the multiple network element sub-nodes according to the sub-node link includes: according to the first external link and the first external link cost, the first internal link, and the first internal link cost, Two external link and second outer link cost, second internal link and second internal link cost, third external link and third external link cost, and third internal link and third internal link cost The extended topology information of multiple network element sub-nodes is jointly constructed as a child node link. Preferably, the routing calculation is performed on the plurality of network element sub-nodes according to the extended topology information, including: adopting a Constrained Shortest Path First (CSPF) algorithm, and performing routing calculation on the plurality of network element sub-nodes according to the extended topology information. According to another aspect of the present invention, a routing computing apparatus is provided, including: a splitting module, configured to split each network element node in an optical transport network (OTN) into a plurality of network element sub-nodes; The configuration module is configured to configure a child node link for multiple network element sub-nodes; the building module is configured to construct extended topology information of multiple network element sub-nodes according to the child node link; and the computing module is set to multiple networks according to the extended topology information. The meta-node performs route calculation. Preferably, the network element node includes: a service head node, a service tail node, and a service intermediate node. According to the present invention, the method for splitting each network element into a plurality of network element sub-nodes and then constructing the extended topology of the plurality of network element sub-nodes solves the problem that the existing route calculation method does not consider the DXC inside the network element. Resources such as OEP cause waste of resources such as DXC and OEP, thereby achieving the effects of saving resources such as DXC and OEP, improving the effective use rate of OXC resources, and reducing service consumption. BRIEF DESCRIPTION OF THE DRAWINGS The accompanying drawings, which are set to illustrate,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,, 1 is a schematic diagram of a typical OTN network element structure according to the related art; FIG. 2 is a topological schematic diagram of an OTN network composed of OTN network elements according to the related art; 3 is a flowchart of a route calculation method according to an embodiment of the present invention; FIG. 4 is a flowchart of a route calculation method according to a preferred embodiment of the present invention; FIG. 5 is a schematic structural diagram of an extended topology example 1 constructed according to a preferred embodiment of the present invention; 6 is a block diagram showing an example of an extended topology example 2 constructed in accordance with a preferred embodiment of the present invention; and FIG. 7 is a block diagram showing the structure of a route calculation device according to an embodiment of the present invention. BEST MODE FOR CARRYING OUT THE INVENTION Hereinafter, the present invention will be described in detail with reference to the accompanying drawings. It should be noted that the embodiments in the present application and the features in the embodiments may be combined with each other without conflict. FIG. 3 is a flowchart of a route calculation method according to an embodiment of the present invention. As shown in FIG. 3, the method mainly includes the following steps (step S302-step S306): Step S302, each network element in an optical transport network (OTN) The node is split into a plurality of network element sub-nodes; Step S304, configuring a child node link for the plurality of network element child nodes, and constructing extended topology information of the plurality of network element child nodes according to the child node link; Step S306, according to the extension The topology information performs route calculation on multiple network element sub-nodes. In this embodiment, the network element node may include: a service first node, a service tail node, and a service intermediate node. In this embodiment, step S302 can be implemented in three different situations:
( 1 )当网元节点为业务首节点时,根据业务首节点的第一链路端口数和第一客户 端口将业务首节点拆分为 M+1个第一网元子节点,并将根据第一客户端口拆分出的第 一网元子节点作为业务首子节点, 其中, 第一链路端口数为 M。 (2)当网元节点为业务尾节点时,根据业务尾节点的第二链路端口数和第二客户 端口将业务尾节点拆分为 N+1个第二网元子节点, 并将根据第二客户端口拆分出的第 二网元子节点作为业务尾子节点, 其中, 第二链路端口数为 N。 (1) When the network element node is the service first node, the service first node is split into M+1 first network element sub-nodes according to the first link port number of the service head node and the first client port, and The first network element sub-node split by the first client port is used as the service first child node, where the number of the first link port is M. (2) When the network element node is a service tail node, the service tail node is split into N+1 second network element sub-nodes according to the second link port number of the service tail node and the second client port, and The second network element sub-node split by the second client port is used as the service tail node, and the number of the second link port is N.
(3 )当网元节点为业务中间节点时,根据业务中间节点的第三链路端口数将业务 中间节点拆分为 P个第三网元子节点, 其中, 第三链路端口数为 P。 在将上述三种网元节点都拆分各自不同的网元子节点后, 就可以为上述三种不同 情况拆分得到的网元子节点配置子节点链路了, 具体可以这样实施: (3) When the network element node is a service intermediate node, the service intermediate node is split into P third network element sub-nodes according to the number of the third link port of the service intermediate node, where the number of the third link port is P . After the above three network element nodes are split into different network element sub-nodes, the child node can be configured for the network element sub-nodes obtained by the above three different situations, and the specific implementation can be implemented as follows:
( 1 )当网元节点为业务首节点时, 为第一网元子节点配置子节点链路包括: 将业 务首节点与其他网元节点之间的第一链路作为第一网元子节点的第一外部链路, 并将 第一链路的链路代价作为第一外部链路的第一外部链路代价; 在第一网元子节点之间 配置第一内部链路, 并根据第一网元子节点进行波长交换或波长转换所需要的第一资 源耗费配置第一内部链路的第一内部链路代价。 (1) When the network element node is the service first node, configuring the child node link for the first network element child node includes: using the first link between the service head node and other network element nodes as the first network element child node a first external link, and using a link cost of the first link as a first external link cost of the first external link; configuring a first internal link between the first network element sub-nodes, and according to the The first resource cost required for wavelength switching or wavelength conversion of a network element sub-node configures a first internal link cost of the first internal link.
(2)当网元节点为业务尾节点时, 为第二网元子节点配置子节点链路包括: 将业 务尾节点与其他网元节点之间的第二链路作为第二网元子节点的第二外部链路, 并将 第二链路的链路代价作为第二外部链路的第二外部链路代价; 在第二网元子节点之间 配置第二内部链路, 并根据第二网元子节点进行波长交换或波长转换所需要的第二资 源耗费配置第二内部链路的第二内部链路代价。 (2) When the network element node is the service tail node, configuring the child node link for the second network element child node includes: using the second link between the service tail node and the other network element node as the second network element child node a second external link, and a link cost of the second link as a second external link cost of the second external link; configuring a second internal link between the second network element sub-nodes, and according to the The second resource cost required for the two network element sub-nodes to perform wavelength switching or wavelength conversion configures the second internal link cost of the second internal link.
(3 )当网元节点为业务中间节点时, 为第三网元子节点配置子节点链路包括: 将 业务中间节点与其他网元节点之间的第三链路作为第三网元子节点的第三外部链路, 并将第三链路的链路代价作为第三外部链路的第三外部链路代价; 在第三网元子节点 之间配置第三内部链路, 并根据第三网元子节点进行波长交换或波长转换所需要的第 三资源耗费配置第三内部链路的第三内部链路代价。 在本实施例中, 在为上述三种不同网元子节点 (第一网元子节点、 第二网元子节 点、 第三网元子节点) 配置子节点链路之后, 就可以根据子节点链路构建多个网元子 节点的扩展拓扑信息, 包括: 根据第一外部链路和第一外部链路代价、 第一内部链路 和第一内部链路代价、 第二外部链路和第二外部链路代价、 第二内部链路和第二内部 链路代价、 第三外部链路和第三外部链路代价以及第三内部链路和第三内部链路代价 共同作为子节点链路构建多个网元子节点的扩展拓扑信息。 至此, 步骤 S304就执行完成了, 接着就可以根据扩展拓扑信息, 采用约束最短路 径优先 CSPF算法对多个网元子节点进行路由计算。 在本实施例中, 当根据扩展拓扑信息对多个网元子节点进行路由计算时, 可以通 过这样的方式实施: 采用约束最短路径优先 (CSPF)算法, 根据扩展拓扑信息对多个 网元子节点进行路由计算。 下面结合图 4至图 6以及优选实施例对上述路由计算方法进行详细说明。 图 4是根据本发明优选实施例的路由计算方法流程图, 如图 4所示, 该流程主要 包括以下步骤 (步骤 S402-步骤 S412): 步骤 S402, 将各个网元节点按其链路端口, 拆分为若干个子节点; 步骤 S404, 将节点之间的链路, 转化为子节点之间的外部链路, 链路代价不变; 步骤 S406, 在节点内部, 设置子节点之间的内部链路, 并根据子节点之间进行波 长交换所需的资源耗费为基础, 配置链路的代价; 步骤 S408, 对业务首尾节点, 按业务上下路端口 (即上述第一客户端口或第二客 户端口) 各拆分出 1个子节点, 并作为路由计算新的首尾节点; 步骤 S410, 在业务首尾节点内部, 设置上下路端口相关的子节点与链路端口相关 的子节点之间的内部链路, 并根据子节点之间进行上下路所需的资源耗费为基础, 配 置链路的代价; 步骤 S412, 以子节点及子节点之间的链路为基础, 构成所有子节点的扩展拓扑, 调用约束最短路径优先 (Constrained Shortest Path First, 简称为 CSPF) 算法进行路由 计算。 下面结合图 5对图 4所示的路由计算方法进行进一步的描述。 请参考图 5, 图 5是根据本发明优选实施例构建的扩展拓扑示例一的结构示意图, 采用图 5所示的扩展拓扑时, 图 4所示的方法可以这样实施: (3) When the network element node is a service intermediate node, configuring the child node link for the third network element child node includes: using the third link between the service intermediate node and the other network element node as the third network element child node a third external link, and a link cost of the third link as a third external link cost of the third external link; configuring a third internal link between the third network element sub-nodes, and according to the The third resource cost required for the three-network sub-node to perform wavelength switching or wavelength conversion configures the third internal link cost of the third internal link. In this embodiment, after configuring the child node link for the three different network element sub-nodes (the first network element child node, the second network element child node, and the third network element child node), the child node may be configured according to the child node. The link constructs extended topology information of the multiple network element sub-nodes, including: according to the first external link and the first external link cost, the first internal link and the first internal link cost, the second external link, and the first Two external link costs, a second internal link and a second internal link cost, a third external link and a third external link cost, and a third internal link and a third internal link cost together as a child node link Construct extended topology information of multiple network element sub-nodes. At this point, step S304 is performed, and then the constrained shortest path first CSPF algorithm is used to perform route calculation on multiple network element sub-nodes according to the extended topology information. In this embodiment, when performing route calculation on multiple network element sub-nodes according to the extended topology information, the method may be implemented in the following manner: using a Constrained Shortest Path First (CSPF) algorithm, and multiple network elements according to extended topology information. The node performs route calculation. The above route calculation method will be described in detail below with reference to FIGS. 4 to 6 and a preferred embodiment. 4 is a flowchart of a route calculation method according to a preferred embodiment of the present invention. As shown in FIG. 4, the process mainly includes the following steps (step S402-step S412): Step S402, pressing each network element node according to its link port. Splitting into a plurality of child nodes; Step S404, converting the link between the nodes into an external link between the child nodes, the link cost is unchanged; Step S406, setting an internal chain between the child nodes inside the node And configuring the cost of the link based on the resource consumption required for wavelength switching between the child nodes; Step S408, for the service head and tail node, according to the service access port (that is, the first client port or the second client port) Each of the sub-nodes is split and a new first-to-end node is calculated as a route; in step S410, an internal link between the sub-nodes associated with the egress-way port and the sub-nodes associated with the link port is set inside the service end-to-end node, And configuring the cost of the link based on the resource consumption required for the uplink and the egress between the child nodes; Step S412, the link between the child node and the child node Based on the extended topology of all the child nodes, the Constrained Shortest Path First (CSPF) algorithm is used to perform route calculation. The route calculation method shown in FIG. 4 will be further described below with reference to FIG. 5. Please refer to FIG. 5. FIG. 5 is a schematic structural diagram of an extended topology example 1 constructed according to a preferred embodiment of the present invention. When the extended topology shown in FIG. 5 is adopted, the method shown in FIG. 4 can be implemented as follows:
( 1 ) 将各个网元节点按其链路端口, 拆分为若干个子节点。 具体地, 节点 A有 两条链路 AB、 AC, 则拆分为子节点 Al、 A2; 节点 B有两条链路 AB、 BD, 则拆分 为子节点 Bl、 B2; (1) Split each network element node into several child nodes according to its link port. Specifically, node A has two links AB and AC, and is split into child nodes A1 and A2; node B has two links AB and BD, and is split into child nodes Bl and B2;
(2)将节点之间的链路,转化为子节点之间的外部链路,链路代价不变。具体地, 节点之间的链路 AB转化为子节点之间的外部链路 A1B1, 链路代价为 10; 节点之间 的链路 AC转化为子节点之间的外部链路 A2C1, 链路代价为 10; (2) The link between the nodes is converted into an external link between the child nodes, and the link cost is unchanged. Specifically, the link AB between the nodes is converted into the external link A1B1 between the child nodes, and the link cost is 10; the link AC between the nodes is converted into the external link A2C1 between the child nodes, the link cost Is 10;
(3 )在节点内部, 设置子节点之间的内部链路, 并根据子节点之间进行波长交换 所需的资源耗费为基础, 配置链路的代价。 具体地, 对于节点 A、 C、 D, 子节点 Al 与 A2、 CI与 C2、 Dl与 D2之间拥有公共的可用波长, 可以直接通过 OXC进行波长 交换, 则以 OXC的资源消耗为基础, 配置链路的代价, 将链路代价设置为 1 ; 对于节 点 B, 子节点 B1与 B2之间没有公共的可用波长, 但可以通过 DXC、 OEP等资源进 行波长交换或者波长转换, 则以 OXC、 DXC、 OEP 的资源消耗为基础, 配置链路的 代价, 将链路代价配置为 100; (3) Inside the node, the internal link between the child nodes is set, and the cost of the link is configured based on the resource consumption required for wavelength switching between the child nodes. Specifically, for the nodes A, C, and D, the child nodes A1 and A2, CI and C2, and the common available wavelengths between D1 and D2 can be directly exchanged by OXC, and then configured based on the resource consumption of the OXC. The cost of the link is set to 1 for the link cost; for Node B, there is no common available wavelength between the sub-nodes B1 and B2, but it can be accessed through resources such as DXC and OEP. For the wavelength switching or wavelength conversion, the cost of configuring the link is based on the resource consumption of OXC, DXC, and OEP, and the link cost is configured to be 100;
(4)对业务首尾节点, 按业务上下路端口各拆分出 1个子节点, 并作为路由计算 新的首尾节点。 具体地, 业务首尾节点分别为节点 A、 D, 则拆分出子节点 A0、 DO; (5 )在业务首尾节点内部, 设置上下路端口相关的子节点与链路端口相关的子节 点之间的内部链路, 并根据子节点之间进行上下路所需的资源耗费为基础, 配置链路 的代价。 具体地, 如果上下路端口与 OXC直连, 则以 OXC的资源消耗为基础, 配置 链路的代价; 如果上下路端口需要通过 DXC、 OEP等资源与 OXC相连, 则以 OXC、 DXC、 OEP的资源消耗为基础, 配置链路的代价; 子节点 A0与 OXC直连, 则将链路 A0A1的代价设置为 1 ; (4) For the first and last nodes of the service, one sub-node is split according to the service port, and a new first-to-end node is calculated as the route. Specifically, the first and last nodes of the service are nodes A and D, respectively, and the child nodes A0 and DO are split. (5) Inside the service head and tail nodes, the child nodes related to the uplink and the downlink ports are set between the child nodes related to the link ports. The internal link, and the cost of configuring the link based on the resource consumption required for the uplink and the egress between the child nodes. Specifically, if the port is directly connected to the OXC, the cost of the link is configured based on the resource consumption of the OXC; if the port is connected to the OXC through resources such as DXC and OEP, the OXC, DXC, and OEP are used. Based on the resource consumption, configure the cost of the link; if the child node A0 is directly connected to the OXC, the cost of the link A0A1 is set to 1;
(6) 以子节点及子节点之间的链路为基础, 构成扩展拓扑, 调用 CSPF (约束最 短路径优先, Constrained Shortest Path First)算法进行路由计算。 具体地, 基于原始拓 扑进行路由计算, 路径总代价仅包含 WDM链路总代价, 并未将节点内部 DXC、 OEP 等资源消耗的代价计算在内, 如果考虑节点内部资源消耗, 实际总代价将会增加。 基 于扩展拓扑进行路由计算, 路径总代价不仅包含 WDM链路总代价, 也包含了节点内 部 DXC、 OEP等资源消耗的代价, 由于扩展拓扑综合考虑了 WDM链路、 OXC、 DXC、 OEP等资源, 路由计算结果得到优化。 请参考表 1。 表 1、 基于原始拓扑及扩展拓扑示例一分别进行路由计算的结果图表 (6) Based on the link between the child node and the child node, form an extended topology, and call the CSPF (Constrained Shortest Path First) algorithm for route calculation. Specifically, the route calculation based on the original topology, the total cost of the path only includes the total cost of the WDM link, and does not take into account the cost of resource consumption such as DXC and OEP within the node. If the internal resource consumption of the node is considered, the actual total cost will be increase. Based on the extended topology for route calculation, the total cost of the path includes not only the total cost of the WDM link, but also the cost of resource consumption such as DXC and OEP within the node. Since the extended topology integrates WDM links, OXC, DXC, OEP and other resources, The routing calculation results are optimized. Please refer to Table 1. Table 1. Results chart of route calculation based on original topology and extended topology example
Figure imgf000008_0001
Figure imgf000008_0001
下面结合图 6对图 4所示的路由计算方法进行进一步的描述。 请参考图 6, 图 6是根据本发明优选实施例构建的扩展拓扑示例二的结构示意图, 采用图 6所示的扩展拓扑时, 图 4所示的方法可以这样实施: ( 1 ) 将各个网元节点按其链路端口, 拆分为若干个子节点。 具体地, 节点 A有 两条链路 AB、 AC, 则拆分为子节点 Al、 A2; 节点 B有两条链路 AB、 BD, 则拆分 为子节点 Bl、 B2; The route calculation method shown in FIG. 4 will be further described below with reference to FIG. Please refer to FIG. 6. FIG. 6 is a schematic structural diagram of an extended topology example 2 constructed according to a preferred embodiment of the present invention. When the extended topology shown in FIG. 6 is adopted, the method shown in FIG. 4 can be implemented as follows: (1) Split each network element node into several child nodes according to its link port. Specifically, the node A has two links AB and AC, and is split into child nodes A1 and A2; the node B has two links AB and BD, and is split into child nodes B1 and B2;
(2)将节点之间的链路,转化为子节点之间的外部链路,链路代价不变。具体地, 节点之间的链路 AB转化为子节点之间的外部链路 A1B1, 链路代价为 10; 节点之间 的链路 AC转化为子节点之间的外部链路 A2C1, 链路代价为 10; (2) The link between the nodes is converted into an external link between the child nodes, and the link cost is unchanged. Specifically, the link AB between the nodes is converted into the external link A1B1 between the child nodes, and the link cost is 10; the link AC between the nodes is converted into the external link A2C1 between the child nodes, the link cost Is 10;
(3 )在节点内部, 设置子节点之间的内部链路, 并根据子节点之间进行波长交换 所需的资源耗费为基础, 配置链路的代价。 具体地, 对于节点 A、 C、 D, 子节点 Al 与 A2、 CI与 C2、 Dl与 D2之间拥有公共的可用波长, 可以直接通过 OXC进行波长 交换, 则以 OXC的资源消耗为基础, 配置链路的代价, 将链路代价设置为 1 ; 对于节 点 子节点 Bl、 B2不能通过 DXC、 OEP等资源进行波长交换或者波长转换, 则链 路不可用, 将链路的代价配置为 +∞; (3) Inside the node, the internal link between the child nodes is set, and the cost of the link is configured based on the resource consumption required for wavelength switching between the child nodes. Specifically, for the nodes A, C, and D, the child nodes A1 and A2, CI and C2, and the common available wavelengths between D1 and D2 can be directly exchanged by OXC, and then configured based on the resource consumption of the OXC. The cost of the link is set to 1 for the link cost. If the node sub-nodes B1 and B2 cannot perform wavelength switching or wavelength conversion through resources such as DXC and OEP, the link is unavailable, and the cost of the link is configured as +∞;
(4)对业务首尾节点, 按业务上下路端口各拆分出 1个子节点, 并作为路由计算 新的首尾节点。 具体地, 业务首尾节点分别为节点 A、 D, 则拆分出子节点 A0、 DO; (5 )在业务首尾节点内部, 设置上下路端口相关的子节点与链路端口相关的子节 点之间的内部链路, 并根据子节点之间进行上下路所需的资源耗费为基础, 配置链路 的代价。 具体地, 如果上下路端口与 OXC直连, 则以 OXC的资源消耗为基础, 配置 链路的代价; 如果上下路端口需要通过 DXC、 OEP等资源与 OXC相连, 则以 OXC、 DXC、 OEP的资源消耗为基础, 配置链路的代价; 子节点 A0与 OXC直连, 则将链路 A0A1的代价设置为 1 ; (4) For the first and last nodes of the service, one sub-node is split according to the service port, and a new first-to-end node is calculated as the route. Specifically, the first and last nodes of the service are nodes A and D, respectively, and the child nodes A0 and DO are split. (5) Inside the service head and tail nodes, the child nodes related to the uplink and the downlink ports are set between the child nodes related to the link ports. The internal link, and the cost of configuring the link based on the resource consumption required for the uplink and the egress between the child nodes. Specifically, if the port is directly connected to the OXC, the cost of the link is configured based on the resource consumption of the OXC; if the port is connected to the OXC through resources such as DXC and OEP, the OXC, DXC, and OEP are used. Based on the resource consumption, configure the cost of the link; if the child node A0 is directly connected to the OXC, the cost of the link A0A1 is set to 1;
(6) 以子节点及子节点之间的链路为基础, 构成扩展拓扑, 调用 CSPF (约束最 短路径优先, Constrained Shortest Path First)算法进行路由计算。 具体地, 由于原始拓 扑主要由 WDM链路及 OXC构成, 对于链路之间无法进行波长变换的情况, 路由计 算将得到无效的结果。 基于扩展拓扑进行路由计算, 不仅考虑 WDM链路及 OXC资 源, 也考虑了节点内部链路之间通过 DXC、 OEP进行波长变换的情况, 可以得到有效 的结果。 请参考表 2。 表 2、 基于原始拓扑及扩展拓扑示例一分别进行路由计算的结果图表 路由 最短路径 实际最短路径(含节 实际总 路 径 点内部资源消耗) 代价(含 是 否 结果 节点 内 有效 (6) Based on the link between the child node and the child node, form an extended topology, and call the CSPF (Constrained Shortest Path First) algorithm for route calculation. Specifically, since the original topology is mainly composed of a WDM link and an OXC, the route calculation will obtain an invalid result for the case where the wavelength conversion cannot be performed between the links. Based on the extended topology for routing calculation, not only the WDM link and OXC resources are considered, but also the wavelength conversion between the internal links of the nodes through DXC and OEP is considered, and effective results can be obtained. Please refer to Table 2. Table 2, the result graph of the route calculation based on the original topology and the extended topology example Route shortest path Actual shortest path (including the actual total path point internal resource consumption) Cost (including whether the result node is valid
部资源  Department resources
消耗)  Consumption)
基于 A-B-D A0-A1-B1-B2-D1-D0 20 无效 原始  Based on A-B-D A0-A1-B1-B2-D1-D0 20 Invalid Original
拓扑 基于 A0-A2-C1-C2-D2-D0 A0-A2-C1-C2-D2-D0 33 33 有效 扩展  Topology Based on A0-A2-C1-C2-D2-D0 A0-A2-C1-C2-D2-D0 33 33 Effective Extension
拓扑 需要说明, 扩展拓扑一与扩展拓扑二的主要区别在于: 在扩展拓扑示例一中, 节 点 B的两个子节点之间可以通过 DXC、 OEP等资源进行波长交换或者波长转换, 子 节点之间的链路可用;在扩展拓扑示例二中,节点 B的两个子节点之间不能通过 DXC、 OEP等资源进行波长交换或者波长转换, 子节点之间的链路不可用。 这两种情况都可 以通过构建扩展拓扑, 在路由计算中得到考虑。 采用上述实施例提供的路由计算方法,先将各个网元节点拆分为多个网元子节点, 再构建多个网元子节点的扩张拓扑, 可以解决现有路由计算方法未考虑网元内部的 DXC、 OEP等资源而导致 DXC、 OEP等资源浪费的问题,进而达到了节省 DXC、 OEP 等资源、 提高 OXC资源的有效使用率、 降低业务消耗的效果。 图 7是根据本发明实施例的路由计算装置的结构框图, 该装置用以实现上述实施 例提供的路由计算方法, 如图 7所示, 该装置主要包括: 拆分模块 10、 配置模块 20、 构建模块 30以及计算模块 40。其中, 拆分模块 10, 设置为将光传输网络 OTN中的各 个网元节点拆分为多个网元子节点; 配置模块 20, 连接至拆分模块 10, 设置为为多个 网元子节点配置子节点链路; 构建模块 30, 连接至配置模块 20, 设置为根据子节点链 路构建多个网元子节点的扩展拓扑信息; 计算模块 40, 连接至构建模块 30, 设置为根 据扩展拓扑信息对多个网元子节点进行路由计算。 在本实施例中, 网元节点可以包括: 业务首节点、业务尾节点以及业务中间节点。 采用上述实施例提供的路由计算装置,先将各个网元节点拆分为多个网元子节点, 再构建多个网元子节点的扩张拓扑, 可以解决现有路由计算方法未考虑网元内部的 DXC、 OEP等资源而导致 DXC、 OEP等资源浪费的问题,进而达到了节省 DXC、 OEP 等资源、 提高 OXC资源的有效使用率、 降低业务消耗的效果。 从以上的描述中, 可以看出, 本发明实现了如下技术效果: 采用先将各个网元节 点拆分为多个网元子节点, 再构建多个网元子节点的扩张拓扑的方式, 解决了现有路 由计算方法未考虑网元内部的 DXC、 OEP等资源而导致 DXC、 OEP等资源浪费的问 题, 进而达到了节省 DXC、 OEP等资源、 提高 OXC资源的有效使用率、 降低业务消 耗的效果。 显然, 本领域的技术人员应该明白, 上述的本发明的各模块或各步骤可以用通用 的计算装置来实现, 它们可以集中在单个的计算装置上, 或者分布在多个计算装置所 组成的网络上, 可选地, 它们可以用计算装置可执行的程序代码来实现, 从而, 可以 将它们存储在存储装置中由计算装置来执行, 并且在某些情况下, 可以以不同于此处 的顺序执行所示出或描述的步骤, 或者将它们分别制作成各个集成电路模块, 或者将 它们中的多个模块或步骤制作成单个集成电路模块来实现。 这样, 本发明不限制于任 何特定的硬件和软件结合。 以上所述仅为本发明的优选实施例而已, 并不用于限制本发明, 对于本领域的技 术人员来说, 本发明可以有各种更改和变化。 凡在本发明的精神和原则之内, 所作的 任何修改、 等同替换、 改进等, 均应包含在本发明的保护范围之内。 The topology needs to be explained. The main difference between the extended topology 1 and the extended topology 2 is: In the extended topology example 1, the two sub-nodes of the node B can perform wavelength switching or wavelength conversion through resources such as DXC and OEP, and between the child nodes. The link is available. In the extended topology example 2, the two sub-nodes of the node B cannot perform wavelength switching or wavelength conversion through resources such as DXC and OEP, and the link between the child nodes is unavailable. Both of these situations can be considered in routing calculations by building an extended topology. According to the route calculation method provided in the foregoing embodiment, each network element node is first split into multiple network element sub-nodes, and then the expansion topology of multiple network element sub-nodes is constructed, which can solve the existing route calculation method without considering the internal network element. The resources such as DXC and OEP cause waste of resources such as DXC and OEP, thereby achieving the effects of saving resources such as DXC and OEP, improving the effective use rate of OXC resources, and reducing service consumption. FIG. 7 is a structural block diagram of a route calculation device according to an embodiment of the present invention. The device is used to implement the route calculation method provided by the foregoing embodiment. As shown in FIG. 7, the device mainly includes: a split module 10, a configuration module 20, The module 30 and the calculation module 40 are constructed. The splitting module 10 is configured to split each network element node in the optical transport network OTN into multiple network element sub-nodes; the configuration module 20 is connected to the splitting module 10, and is configured as multiple network element sub-nodes. Configuring a child node link; a building module 30, connected to the configuration module 20, configured to construct extended topology information of the plurality of network element sub-nodes according to the child node link; the computing module 40, connected to the building module 30, configured to be based on the extended topology The information is routed to multiple network element sub-nodes. In this embodiment, the network element node may include: a service first node, a service tail node, and a service intermediate node. The routing calculation device provided by the foregoing embodiment first splits each network element node into multiple network element sub-nodes, and then constructs an expansion topology of multiple network element sub-nodes, which can solve the existing route calculation method without considering the internal network element. The resources such as DXC and OEP cause waste of resources such as DXC and OEP, thereby achieving the effects of saving resources such as DXC and OEP, improving the effective use rate of OXC resources, and reducing service consumption. From the above description, it can be seen that the present invention achieves the following technical effects: The method for splitting each network element node into multiple network element sub-nodes and then constructing the expansion topology of multiple network element sub-nodes is solved. The existing route calculation method does not consider the resources such as DXC and OEP in the network element, which causes waste of resources such as DXC and OEP, thereby saving resources such as DXC and OEP, improving the effective use rate of OXC resources, and reducing service consumption. effect. Obviously, those skilled in the art should understand that the above modules or steps of the present invention can be implemented by a general-purpose computing device, which can be concentrated on a single computing device or distributed over a network composed of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device, such that they may be stored in the storage device by the computing device and, in some cases, may be different from the order herein. The steps shown or described are performed, or they are separately fabricated into individual integrated circuit modules, or a plurality of modules or steps are fabricated as a single integrated circuit module. Thus, the invention is not limited to any specific combination of hardware and software. The above is only the preferred embodiment of the present invention, and is not intended to limit the present invention, and various modifications and changes can be made to the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and scope of the present invention are intended to be included within the scope of the present invention.

Claims

权 利 要 求 书 Claims
1. 一种路由计算方法, 包括: 1. A route calculation method, comprising:
将光传输网络 OTN中的各个网元节点拆分为多个网元子节点; 为所述多个网元子节点配置子节点链路, 并根据所述子节点链路构建所述 多个网元子节点的扩展拓扑信息;  Splitting each network element node in the optical transport network OTN into a plurality of network element sub-nodes; configuring a child node link for the plurality of network element child nodes, and constructing the multiple network according to the child node link Extended topology information of the meta-node;
根据所述扩展拓扑信息对所述多个网元子节点进行路由计算。  Performing route calculation on the plurality of network element sub-nodes according to the extended topology information.
2. 根据权利要求 1所述的方法, 其中, 所述网元节点包括: 业务首节点、 业务尾 节点以及业务中间节点。 The method according to claim 1, wherein the network element node comprises: a service head node, a service tail node, and a service intermediate node.
3. 根据权利要求 2所述的方法, 其中, 将光传输网络 OTN中的各个网络节点拆 分为多个网元子节点, 包括: The method according to claim 2, wherein splitting each network node in the optical transport network OTN into multiple network element sub-nodes includes:
当所述网元节点为业务首节点时, 根据所述业务首节点的第一链路端口数 和第一客户端口将所述业务首节点拆分为 M+1个第一网元子节点,并将根据所 述第一客户端口拆分出的第一网元子节点作为业务首子节点, 其中, 所述第一 链路端口数为 M。  When the network element node is the service first node, the service first node is split into M+1 first network element sub-nodes according to the first link port number of the service head node and the first client port. And the first network element sub-node that is split according to the first client port is used as the service first child node, where the number of the first link port is M.
4. 根据权利要求 3所述的方法, 其中, 为所述多个网元子节点配置子节点链路, 包括: The method according to claim 3, wherein configuring the child node link for the plurality of network element sub-nodes comprises:
将所述业务首节点与其他所述网元节点之间的第一链路作为所述第一网元 子节点的第一外部链路, 并将所述第一链路的链路代价作为所述第一外部链路 的第一外部链路代价;  Using the first link between the service head node and the other network element node as the first external link of the first network element child node, and using the link cost of the first link as a Describe a first external link cost of the first external link;
在所述第一网元子节点之间配置第一内部链路, 并根据所述第一网元子节 点进行波长交换或波长转换所需要的第一资源耗费配置所述第一内部链路的第 一内部链路代价。  Configuring a first internal link between the first network element sub-nodes, and configuring the first internal link according to a first resource cost required for wavelength switching or wavelength conversion of the first network element sub-node The first internal link cost.
5. 根据权利要求 4所述的方法, 其中, 将光传输网络 OTN中的各个网络节点拆 分为多个网元子节点, 包括: The method according to claim 4, wherein splitting each network node in the optical transport network OTN into multiple network element sub-nodes includes:
当所述网元节点为业务尾节点时, 根据所述业务尾节点的第二链路端口数 和第二客户端口将所述业务尾节点拆分为 N+1个第二网元子节点,并将根据所 述第二客户端口拆分出的第二网元子节点作为业务尾子节点, 其中, 所述第二 链路端口数为 N。 When the network element node is a service tail node, the service tail node is split into N+1 second network element sub-nodes according to the second link port number of the service tail node and the second client port. And the second network element sub-node that is split according to the second client port is used as a service tail node, where the number of the second link port is N.
6. 根据权利要求 5所述的方法, 其中, 为所述多个网元子节点配置子节点链路, 包括: The method according to claim 5, wherein configuring the child node link for the multiple network element sub-nodes includes:
将所述业务尾节点与其他所述网元节点之间的第二链路作为所述第二网元 子节点的第二外部链路, 并将所述第二链路的链路代价作为所述第二外部链路 的第二外部链路代价;  Using a second link between the service tail node and the other network element node as a second external link of the second network element sub-node, and using the link cost of the second link as a Describe a second external link cost of the second external link;
在所述第二网元子节点之间配置第二内部链路, 并根据所述第二网元子节 点进行波长交换或波长转换所需要的第二资源耗费配置所述第二内部链路的第 二内部链路代价。  Configuring a second internal link between the second network element sub-nodes, and configuring the second internal link according to the second resource consumption required for performing wavelength switching or wavelength conversion on the second network element sub-node Second internal link cost.
7. 根据权利要求 6所述的方法, 其中, 将光传输网络 OTN中的各个网络节点拆 分为多个网元子节点, 包括: The method according to claim 6, wherein splitting each network node in the optical transport network OTN into multiple network element sub-nodes includes:
当所述网元节点为业务中间节点时, 根据所述业务中间节点的第三链路端 口数将所述业务中间节点拆分为 P个第三网元子节点, 其中, 所述第三链路端 口数为 P。  When the network element node is a service intermediate node, the service intermediate node is split into P third network element sub-nodes according to the third link port number of the service intermediate node, where the third chain The number of port ports is P.
8. 根据权利要求 7所述的方法, 其中, 为所述多个网元子节点配置子节点链路, 包括:  8. The method according to claim 7, wherein configuring the child node link for the plurality of network element sub-nodes comprises:
将所述业务中间节点与其他所述网元节点之间的第三链路作为所述第三网 元子节点的第三外部链路, 并将所述第三链路的链路代价作为所述第三外部链 路的第三外部链路代价;  Using a third link between the service intermediate node and the other network element node as a third external link of the third network element sub-node, and using the link cost of the third link as a Describe a third external link cost of the third external link;
在所述第三网元子节点之间配置第三内部链路, 并根据所述第三网元子节 点进行波长交换或波长转换所需要的第三资源耗费配置所述第三内部链路的第 三内部链路代价。  Configuring a third internal link between the third network element sub-nodes, and configuring the third internal link according to the third resource consumption required for performing wavelength switching or wavelength conversion on the third network element sub-node Third internal link cost.
9. 根据权利要求 8所述的方法, 其中, 根据所述子节点链路构建所述多个网元子 节点的扩展拓扑信息, 包括- 根据所述第一外部链路和所述第一外部链路代价、 所述第一内部链路和所 述第一内部链路代价、 所述第二外部链路和所述第二外部链路代价、 所述第二 内部链路和所述第二内部链路代价、 第三外部链路和所述第三外部链路代价以 及所述第三内部链路和所述第三内部链路代价共同作为所述子节点链路构建所 述多个网元子节点的扩展拓扑信息。 根据权利要求 1至 8中任一项所述的方法, 其中, 根据所述扩展拓扑信息对所 述多个网元子节点进行路由计算, 包括: 采用约束最短路径优先 CSPF算法, 根据所述扩展拓扑信息对所述多个网 元子节点进行路由计算。 9. The method according to claim 8, wherein the extended topology information of the plurality of network element sub-nodes is constructed according to the child node link, including: according to the first external link and the first external Link cost, the first internal link and the first internal link cost, the second external link and the second external link cost, the second internal link, and the second An internal link cost, a third external link and the third external link cost, and the third internal link and the third internal link cost together as the child node link to construct the plurality of networks Extended topology information of the meta-node. The method according to any one of claims 1 to 8, wherein performing routing calculation on the plurality of network element sub-nodes according to the extended topology information comprises: The constrained shortest path first CSPF algorithm is used to perform route calculation on the plurality of network element subnodes according to the extended topology information.
11. 一种路由计算装置, 包括: 11. A routing computing device, comprising:
拆分模块, 设置为将光传输网络 OTN 中的各个网元节点拆分为多个网元 子节点;  The splitting module is configured to split each network element node in the optical transport network OTN into multiple network element sub-nodes;
配置模块, 设置为为所述多个网元子节点配置子节点链路;  a configuration module, configured to configure a child node link for the multiple network element sub-nodes;
构建模块, 设置为根据所述子节点链路构建所述多个网元子节点的扩展拓 扑信息;  a building module, configured to construct extended topology information of the plurality of network element sub-nodes according to the child node link;
计算模块, 设置为根据所述扩展拓扑信息对所述多个网元子节点进行路由 计算。  And a calculation module, configured to perform route calculation on the plurality of network element sub-nodes according to the extended topology information.
12. 根据权利要求 11所述的装置, 其中, 所述网元节点包括: 业务首节点、业务尾 节点以及业务中间节点。 The device according to claim 11, wherein the network element node comprises: a service head node, a service tail node, and a service intermediate node.
PCT/CN2013/078763 2012-07-03 2013-07-03 Route computation method and device WO2014005522A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201210227433.1A CN102769563B (en) 2012-07-03 2012-07-03 Route computing method and device
CN201210227433.1 2012-07-03

Publications (1)

Publication Number Publication Date
WO2014005522A1 true WO2014005522A1 (en) 2014-01-09

Family

ID=47096819

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2013/078763 WO2014005522A1 (en) 2012-07-03 2013-07-03 Route computation method and device

Country Status (2)

Country Link
CN (1) CN102769563B (en)
WO (1) WO2014005522A1 (en)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102769563B (en) * 2012-07-03 2017-11-03 中兴通讯股份有限公司 Route computing method and device
CN104579956A (en) * 2013-10-25 2015-04-29 中兴通讯股份有限公司 Routing strategy configuration method and system
CN106330705A (en) * 2015-06-30 2017-01-11 中兴通讯股份有限公司 Path computation method and device and path computation element (PCE)
CN105611435B (en) * 2016-01-07 2019-01-15 烽火通信科技股份有限公司 The calculation method of the electric layer wavelet long route across photosphere based on WSON network
CN107359938B (en) * 2016-05-09 2019-09-20 腾讯科技(深圳)有限公司 The implementation method and device controlled in data center's Transmission system, system
CN107888282B (en) * 2017-12-04 2020-07-31 科大国创软件股份有限公司 Circuit whole-course route calculation method of optical transmission network
CN115276779B (en) * 2022-06-23 2023-07-04 中国联合网络通信集团有限公司 Optical transport network circuit information acquisition method, device, system and storage medium

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100113019A1 (en) * 2008-11-05 2010-05-06 Samsung Electronics Co., Ltd. UE mobility state detection apparatus and method for wireless communication system
CN101730081A (en) * 2009-11-18 2010-06-09 中兴通讯股份有限公司 Method and device for processing motion state of mobile terminal
CN101902406A (en) * 2010-08-12 2010-12-01 中兴通讯股份有限公司 Method and device for calculating path
CN101925148A (en) * 2009-06-11 2010-12-22 上海无线通信研究中心 Method for estimating speed class of mobile terminal in multilevel cellular system
CN102769563A (en) * 2012-07-03 2012-11-07 中兴通讯股份有限公司 Router calculation method and device

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100113019A1 (en) * 2008-11-05 2010-05-06 Samsung Electronics Co., Ltd. UE mobility state detection apparatus and method for wireless communication system
CN101925148A (en) * 2009-06-11 2010-12-22 上海无线通信研究中心 Method for estimating speed class of mobile terminal in multilevel cellular system
CN101730081A (en) * 2009-11-18 2010-06-09 中兴通讯股份有限公司 Method and device for processing motion state of mobile terminal
CN101902406A (en) * 2010-08-12 2010-12-01 中兴通讯股份有限公司 Method and device for calculating path
CN102769563A (en) * 2012-07-03 2012-11-07 中兴通讯股份有限公司 Router calculation method and device

Also Published As

Publication number Publication date
CN102769563B (en) 2017-11-03
CN102769563A (en) 2012-11-07

Similar Documents

Publication Publication Date Title
WO2014005522A1 (en) Route computation method and device
EP3364605B1 (en) Data centre network system and signal transmission system
WO2015124026A1 (en) Flow table entry generation method and device
US20120099863A1 (en) Hybrid optical/electrical switching system for data center networks
US8000323B2 (en) Method and system for announcing traffic engineering parameters of composite transport groups
US9417396B2 (en) Optoelectronic switch
WO2008061461A1 (en) Method and device of group broadcast protection in wdm optical network
Kamchevska et al. Experimental demonstration of multidimensional switching nodes for all-optical data center networks
Wang et al. RPNoC: A ring-based packet-switched optical network-on-chip
Guo et al. Multicast grooming algorithm in waveband switching optical networks
JP5739960B2 (en) Method and system for providing external optical data packets to a destination node of a packet optical network
Chen et al. Intelligence on optical transport SDN
GB2530833A (en) Optoelectronic switch
EP3038279B1 (en) Bandwidth map update method and device
WO2011017932A1 (en) Optoelectronic processinig apparatus and processing method for constraint information
US20130230052A1 (en) Unidirectional asymmetric traffic pattern systems and methods in switch matrices
WO2021027434A1 (en) Service transmission method, device and system
Wu et al. Joint scheduling and routing for QoS guaranteed packet transmission in energy efficient reconfigurable WDM mesh networks
Karanam et al. Intermediate node initiated (INI) signalling: a hybrid resevation technique for optical burst-switched networks
WO2013178005A1 (en) Path setting method and apparatus
Lin et al. From small to large: Clos network for scaling all-optical switching
CN109698982B (en) Control channel implementation method, device, equipment, storage medium and processing method
Lu et al. Asymmetric CDC ROADM architecture for efficient support of bi-directional asymmetric traffic demands
Li et al. Experiment of segment routing based service-oriented fast path construction for F5G
EP2226952B1 (en) An automatically switched optical network and method for data transmission in the network

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

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

Country of ref document: EP

Kind code of ref document: A1