WO2007059652A1 - Procede de selection d'acheminements de services multidiffusion dans un reseau optique a commutation automatique - Google Patents

Procede de selection d'acheminements de services multidiffusion dans un reseau optique a commutation automatique Download PDF

Info

Publication number
WO2007059652A1
WO2007059652A1 PCT/CN2005/002006 CN2005002006W WO2007059652A1 WO 2007059652 A1 WO2007059652 A1 WO 2007059652A1 CN 2005002006 W CN2005002006 W CN 2005002006W WO 2007059652 A1 WO2007059652 A1 WO 2007059652A1
Authority
WO
WIPO (PCT)
Prior art keywords
routing
route
multicast
controller
connection
Prior art date
Application number
PCT/CN2005/002006
Other languages
English (en)
French (fr)
Inventor
Peng Gao
Desheng Sun
Ming Ke
Original Assignee
Zte Corporation
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 Zte Corporation filed Critical Zte Corporation
Priority to CN2005800513641A priority Critical patent/CN101243723B/zh
Priority to KR1020087013268A priority patent/KR100949323B1/ko
Priority to PCT/CN2005/002006 priority patent/WO2007059652A1/zh
Priority to EP05813846.2A priority patent/EP1954093A4/en
Publication of WO2007059652A1 publication Critical patent/WO2007059652A1/zh

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
    • H04Q11/0062—Network aspects
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B10/00—Transmission systems employing electromagnetic waves other than radio-waves, e.g. infrared, visible or ultraviolet light, or employing corpuscular radiation, e.g. quantum communication
    • H04B10/27—Arrangements for networking
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/16—Multipoint routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/48—Routing tree calculation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5603—Access techniques
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/20—Support for services
    • H04L49/201—Multicast operation; Broadcast operation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/35—Switches specially adapted for specific applications
    • H04L49/356—Switches specially adapted for specific applications for storage area networks
    • H04L49/357—Fibre channel switches
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
    • H04Q11/0062—Network aspects
    • H04Q2011/0073—Provisions for forwarding or routing, e.g. lookup tables

Definitions

  • the present invention relates to the field of optical networks, and in particular, to a route selection method for automatically exchanging optical network multicast services. Background technique
  • Optical network such as OTN (Optical Transmission Network) WDM (Wavelength-Division Multiplexing), SDH (Synchronous Digital Hierarchy), or SONET (Synchronous Optical Network) transmission
  • OTN Optical Transmission Network
  • WDM Widelength-Division Multiplexing
  • SDH Synchronous Digital Hierarchy
  • SONET Synchronous Optical Network
  • ASON Automatic Switched Optical Network
  • CP Control Plane
  • the technical problem to be solved by the present invention is to provide an automatic switching optical network multicast service.
  • the routing method proposes an implementation strategy from the perspective of routing to solve the problem that the current ASON network cannot provide multicast services.
  • the present invention provides a routing method for automatically exchanging an optical network multicast service, and implementing routing of a multicast connection by using a routing controller includes the following steps:
  • the routing controller monitors the routing query request from the connection controller to establish a multicast connection
  • the routing controller generates a routing database view for the current routing selection according to the received routing query request
  • the routing controller calculates the multicast route according to the generated routing database view to ensure that the total link weight between the multicast service source point and the multiple multicast service receiving points is the smallest;
  • the routing controller decomposes the point-to-multipoint multicast routing tree into point-to-point multiple routes according to the multicast routing calculation result;
  • the routing controller returns the routing calculation result to the routing connector of the query route.
  • the routing controller includes a routing controller, a link weight manager, a route calculation selector, and a route resolver. .
  • the step (2) includes:
  • the routing controller extracts the constraint in the route query request
  • the routing controller invokes a link weight manager
  • the link weight manager generates a routing database view for this routing based on the constraints.
  • the constraint in the route query request is the minimum hop count.
  • the weight of each link is adjusted to an equal value.
  • the step (3) includes:
  • the routing controller invokes a route calculation selector according to the generated routing database view to calculate a multicast route
  • the route calculation selector adopts the minimum spanning tree method according to the requirement of the shared bandwidth of the multicast service. Calculate multicast routing
  • the route calculation selector returns the multicast route calculation result to the routing controller.
  • the step (4) includes:
  • the routing controller invokes the route decomposer according to the received multicast routing calculation result; the route decomposer decomposes the point-to-multipoint multicast routing tree into point-to-point multiple routes.
  • the present invention also provides a routing method for automatically exchanging optical network multicast services. In the established multicast connection, routing controllers are used to implement routing of multicast branch connections, including the following steps:
  • the routing controller monitors a routing query request from the connection controller to increase the multicast branch connection
  • the routing controller generates a routing database view for the current routing selection according to the received routing query request
  • the routing controller calculates a multicast route according to the generated routing database view to ensure that the weight of the newly added multicast branch link is the smallest;
  • the routing controller decomposes the point-to-point connection route between the multicast service source point and the new multicast service receiving point from the multicast tree according to the multicast routing calculation result;
  • the routing controller returns the routing calculation result to the routing connector of the query route.
  • the routing controller includes a routing controller, a link weight manager, a route calculation selector, and a route resolver.
  • the step (2) includes:
  • the routing controller extracts the constraint in the route query request
  • the routing controller invokes a link weight manager
  • the link weight manager generates a routing database view for this routing based on the constraints.
  • the constraint in the route query request is the minimum hop count.
  • the weight of each link is Adjust to an equal value.
  • the step (3) includes:
  • the routing controller invokes a route calculation selector according to the generated routing database view to calculate a multicast route
  • the route calculation selector calculates the multicast route by adding the multicast service receiving point to the shortest path of the multicast tree according to the bandwidth shared by the multicast service and the requirement of the previous multicast routing.
  • the route calculation selector calculates the multicast route. The result is returned to the routing controller.
  • the step (4) includes:
  • the routing controller invokes the route decomposer according to the received multicast routing calculation result; the route decomposer decomposes the point-to-point connection route between the multicast service source point and the new multicast service receiving point from the multicast tree. .
  • the present invention further provides a routing method for automatically exchanging an optical network multicast service. In the established multicast connection, the routing controller is used to implement routing for restoring the multicast branch connection, including the following steps:
  • the routing controller monitors a route query request from the connection controller to restore the multicast branch connection
  • the routing controller generates a routing database view for the current routing selection according to the received routing query request;
  • the routing controller calculates a recovery connection route from the source of the multicast service to the destination branch node according to the generated routing database view, so as to ensure that the link value of the restored connection route of the current calculation is the smallest;
  • the routing controller returns the routing calculation result to the routing connector of the query route.
  • the routing controller includes a routing controller, a link weight manager, a route calculation selector, and a route resolver.
  • the step (2) includes:
  • the routing controller extracts the constraint in the routing query request;
  • the routing controller invokes a link weight manager;
  • the link weight manager generates a routing database view for this routing based on the constraints.
  • the constraint in the route query request is the minimum hop count.
  • the weight of each link is adjusted to an equal value.
  • the step (3) includes:
  • the routing controller invokes a route calculation selector according to the generated routing database view to calculate a multicast route
  • the route calculation selector calculates a recovery connection route from the multicast service source point to the destination branch node by using the shortest path method
  • the route calculation selector returns the multicast route calculation result to the routing controller.
  • the technology of the present invention decomposes a complex multicast service connection routing problem into multiple point-to-point connection routing processing methods, and realizes link resource sharing of the multicast service from the perspective of routing, and solves the problem that the ASON network supports the multicast service. Connection establishment, modification and recovery issues are simple and reliable. BRIEF abstract
  • FIG. 1 is a schematic diagram of an ASON network supporting a multicast service
  • FIG. 2 is a schematic diagram of components of a routing controller in an ASON network multicast function according to an embodiment of the present invention
  • FIG. 3 is a schematic diagram of an ASON network multicast connection routing tree according to an embodiment of the present invention
  • FIG. 4 is a schematic diagram of decomposing an ASON network multicast connection routing tree into a point-to-point connection route according to an embodiment of the present invention
  • 5 is a schematic diagram of a shortest path of a new multicast point to a multicast routing tree in an ASON network according to an embodiment of the present invention
  • 6 is a schematic diagram of adding a multicast connection routing tree of a multicast service receiver to an ASON network according to an embodiment of the present invention
  • FIG. 7 is a schematic diagram of an ASON network recovery multicast service branch connection route according to an embodiment of the present invention.
  • the core idea of the present invention is to decompose a point-to-multipoint multicast connection route query into multiple point-to-point connection routes according to the framework structure of the ASON network, and query the type of the multicast service route according to the connection control, and apply different routes. Select a method to implement bandwidth sharing for multicast services.
  • a routing controller is composed of a routing controller, a link weight manager, a route calculation selector, and a route resolver.
  • FIG. 1 is a schematic diagram of the routing controller component corresponding to the ASON network multicast function
  • FIG. 3 is a schematic diagram of the ASON network supporting the multicast service multicast routing routing tree shown in FIG. 1
  • 4 is a schematic diagram of the multicast connection routing tree of FIG. 3 decomposed into a point-to-point connection route
  • FIG. 5 is a schematic diagram of the shortest path of the new multicast point of the ASON network to all points of the multicast connection routing tree shown in FIG. 3
  • FIG. 6 is an ASON The network adds a multicast service receiver connection routing tree to the multicast service shown in Figure 1.
  • Figure 7 is a schematic diagram of the ASON network restoring the multicast branch connection route based on the multicast service of Figure 6.
  • the specific implementation includes the following steps:
  • Step 1 As shown in Figure 1, the ASON network element A control plane RC monitors the route query from the connection controller (CC) to establish a multicast connection. After requesting (the sender is A, the receiver is Zl, Z2, Z3, and Z4), go to the next step; Step 2: After the RC receives the route query request, the further processing can be decomposed into: routing The controller extracts the constraint in the route query request, where the constraint condition of the route query is the minimum hop count, and the link weight manager adjusts the weight of each link to an equal value according to the constraint of the minimum hop count. , if the weight is 1. The link view (RDB view) with equal weights will be used for this route calculation and will be transferred to the next step;
  • Step 3 The routing controller in the RC, according to the RDB view generated in step 2, invokes a route calculation selector, and sends a route calculation request to the route calculation selector to calculate the multicast route, and proceeds to the next step;
  • Step 4 After receiving the route calculation request of step 3, the route calculation selector calculates the connection connection route by using the minimum spanning tree method according to the requirement of the shared bandwidth of the multicast service, and ensures the total connection between the multicast service connection source and the multiple destinations.
  • the link weight is the smallest.
  • Figure 3 shows the minimum spanning tree of the multicast service.
  • the weight of the spanning tree is 4 (the weight of each link is 1), which is the tree with the smallest weight. From the perspective of routing A-Z4, A-Z2 shares the link bandwidth of A-Z2, and the route calculation selector returns the calculation result to the routing controller, and proceeds to the next step;
  • Step 5 After receiving the multicast routing calculation result in step 4, the routing controller invokes the route decomposer to decompose the point-to-multipoint multicast routing tree into point-to-point multiple routes, and FIG. 4 is the same as FIG.
  • the multicast connection routing tree is decomposed into four (A-Z1, A-Z2, A-Z3, A-Z4) point-to-point connection routes;
  • Step 6 The RC returns the routing calculation result to the CC of the query route.
  • the second embodiment uses the multicast service A and Z1, Z2, Z3, and Z4 to increase the multicast service receiver Z5 as an example, and uses a source routing policy to indicate that the present invention is increased.
  • the specific implementation includes the following steps:
  • Step 1 The ASON network element A control plane RC shown in Figure 1 monitors the route query request from the connection controller CC to increase the multicast branch connection (source multicast service A, receiver) For Zl, Z2, Z3 and Z4, after adding the multicast service receiver point Z5), go to the next step;
  • Step 2 After the RC receives the route query request, the further processing can be decomposed into: The controller extracts the constraint in the route query request, where the constraint condition of the route query is the minimum hop count, and the link weight manager adjusts the weight of each link to an equal value according to the constraint of the minimum hop count. , if the weight is 1.
  • the link view (RDB view) with equal weights will be used for this route calculation and will be transferred to the next step;
  • Step 3 The routing controller in the RC, according to the RDB view generated in step 2, invokes a route calculation selector, and sends a route calculation request to the route calculation selector to calculate the multicast route, and proceeds to the next step;
  • Step 4 After receiving the route calculation request of step 3, the route calculation selector calculates the selection by using the method of adding a new multicast point to the multicast tree to calculate the shortest path according to the bandwidth shared by the multicast service and the requirement of not changing the previous multicast route. Connect the route to ensure that the weight of the newly added multicast branch link is the smallest.
  • Figure 3 shows the minimum spanning tree of the multicast service.
  • Figure 5 shows the newly added multicast node to all the nodes in the minimum spanning tree shown in Figure 3.
  • the shortest path, the shortest path from Z5 to A is:
  • Z5-B-Z3-A The shortest path from Z5 to Z1 is: Z5-B-Z2-Z1; The shortest path from Z5 to Z2 is: Z5-B-Z2; The shortest path from Z5 to Z3 is: Z5-B- Z3 ; The shortest path from Z5 to Z4 is: Z5-Z4.
  • the shortest path to add multicast point Z5 to the multicast tree is: Z5-Z4, Figure 6 shows the multicast connection routing tree after Z5 is added.
  • the route calculation selector returns the calculation result to the routing controller and goes to the next step. ;
  • Step 5 After receiving the multicast routing calculation result in step 4, the routing controller invokes the route decomposer to select a point-to-point connection route between the multicast service source point and the new multicast service receiving point from the multicast tree. Decomposed, the new multicast point-to-point connection route in Figure 6 is A-Z2-Z4-Z5; Step 6. The RC returns the routing calculation result to the CC of the query route.
  • the third embodiment in conjunction with Figures 1, 2, 6, and 7, uses the above multicast services A and Zl, Z2
  • the Z4-Z5 branch link is faulty, and the multicast service source node to the multicast branch Z5 restores the route of the branch connection as an example, which illustrates the multicast service recovery of the present invention.
  • An implementation of a connected route An implementation of a connected route.
  • the specific implementation includes the following steps:
  • Step 1 The AS0N network element A control plane RC shown in Figure 1 monitors the route query request from the connection controller CC for the recovery connection (as shown in Figure 6, the source multicast service A, the receiver is Zl, Z2, Z3 , Z4 and Z5, after the failure of the multicast branch Z5, the connection of the branch Z5 needs to be restored), and then proceeds to the next step;
  • Step 2 After the RC receives the route query request, the further processing may be decomposed into: a routing controller, which extracts a constraint condition in the route query request, where the constraint condition of the route query is the minimum hop count, the link The weight manager adjusts the weight of each link to an equal value according to the constraint of the minimum number of hops, for example, the weight is 1.
  • the link view (RDB view) with equal weights will be used for this route calculation and will be moved to the next step.
  • Step 3 The routing controller in the RC, according to the RDB view generated in step 2, invokes a route calculation selector, and sends a request for calculating a route connection to the route calculation selector to calculate a multicast route, and proceeds to “one step;
  • Step 4 After receiving the route calculation request of step 3, the routing controller applies the shortest path method to calculate a recovery connection route from the multicast service source node to the destination branch node, and ensures that the calculated connection connection route weight is minimum.
  • the recovery connection route calculated as shown in Figure 7 is A-Z3-B-Z5. From the perspective of routing, the connection route A-Z3-B-Z5 and the multicast branch A-Z3 do not share the link resources, and the route calculation result is obtained. Returned to the routing controller;
  • Step 5 The RC returns the routing calculation result to the CC of the query route.
  • the invention decomposes a complex multicast service connection routing problem into multiple point-to-point connection routing processing methods, and realizes link resource sharing of the multicast service from the perspective of routing, and solves the connection of the AS0N network supporting the multicast service. Create, modify, and recover problems with simplicity and reliability.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computing Systems (AREA)
  • Physics & Mathematics (AREA)
  • Electromagnetism (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Description

自动交换光网络组播业务的路由选择方法 技术领域
本发明涉及光网络领域，尤其涉及一种自动交换光网络组播业务的路 由选择方法。 背景技术
光网络， 例如 OTN ( Optical Transmission Network， 光传送网络） WDM (Wavelength-Division Multiplexing,波分复用）、 SDH ( Synchronous Digital Hierarchy, 同步数字系列） 、 或 SONET ( Synchronous Optical Network, 同步光网络） 传送网， 在电信领域已经得到广泛应用。
自动交换光网络（Automatic Switched Optical Network, 简称 ASON) 是近年来光网络领域的研究热点。 ITU-TG.8080建议提出了 ASON的概 念， 通过设置专门的控制平面 （Control Plane, 简称 CP) 完成 ASON网 络的功能。 ITU-TG.7715建议规定了 ASON网络中路由部分的架构和组 件， 规定了路由信息的格式和约束路由方式， 为连接建立的路由査询提 供了实现规范。
近年来，快速增长的互连网业务推动了组播业务的需求，组播技术在 数据网络中得到了广泛应用， 例如广播电视等。 如附图 1所示， 这种业 务只涉及一个用户发送方和多个业务接收方， 例如附图 1中的发送方 A 和接收方 Zl、 Z2、 Z3和 Z4。 在基于分组的网络中， 组播技术己经得到 了广泛使用， 但在基于电路或波长的光网络中实现难度却很大。 近年来， 组播技术虽然已经被 ASON确定为实现需求， 但 ASON相关建议标准却 没有给出实现方法。 发明内容
本发明所要解决的技术问题在于提供一种自动交换光网络组播业务 的路由选择方法， 从路由选择的角度提出了一种实现策略， 用以解决目 前 ASON网络无法提供组播业务的问题。
本发明提供一种自动交换光网络组播业务的路由选择方法，通过路由 控制器来实现建立组播连接的路由选择， 包括如下步骤：
( 1 ) 路由控制器监测来自连接控制器的建立组播连接的路由查询请 求；
(2) 路由控制器根据接收到的路由查询请求， 生成用于本次路由选 择的路由数据库视图；
(3 ) 路由控制器根据所生成的路由数据库视图， 计算组播路由， 以 保证组播业务源点和多个组播业务接收点之间总的链路权值最小；
(4) 路由控制器根据组播路由计算结果， 将点到多点的组播路由树 分解为点到点多条路由；
( 5 )路由控制器将路由选择计算结果返回给査询路由的路由连接器。 其中， 所述路由控制器包括路由选择控制器、链路权值管理器、路由 计算选择器和路由分解器。 .
所述步骤 （2) 中包括：
路由选择控制器提取路由查询请求中的约束条件；
路由选择控制器调用链路权值管理器；
链路权值管理器根据约束条件，生成用于本次路由选择的路由数据库 视图。
所述路由査询请求中的约束条件为最小跳数。
所述链路权值管理器生成的路由数据库视图中，每条链路的权值均被 调整为相等值。
所述步骤 （3 ) 中包括：
路由选择控制器根据所生成的路由数据库视图调用路由计算选择器， 以计算组播路由；
路由计算选择器根据组播业务共享带宽的要求，采用最小生成树方法 计算组播路由；
路由计算选择器将组播路由计算结果返回给路由选择控制器。
所述步骤 （4 ) 中包括：
路由选择控制器根据收到的组播路由计算结果， 调用路由分解器； 路由分解器将点到多点的组播路由树分解为点到点多条路由。 本发明还提供一种自动交换光网络组播业务的路由选择方法，在已建 · 立的组播连接中， 通过路由控制器来实现增加组播分支连接的路由选择， 包括如下步骤：
( 1 ) 路由控制器监测来自连接控制器的增加组播分支连接的路由查 询请求；
(2) 路由控制器根据接收到的路由查询请求， 生成用于本次路由选 择的路由数据库视图；
( 3 ) 路由控制器根据所生成的路由数据库视图， 计算组播路由， 以 保证本次新增的组播分支链路权值最小；
(4) 路由控制器根据组播路由计算结果， 从组播树中将组播业务源 点到新增组播业务接收点间的点到点连接路由分解出；
( 5 )路由控制器将路由选择计算结果返回给查询路由的路由连接器。 其中， 所述路由控制器包括路由选择控制器、链路权值管理器、路由 计算选择器和路由分解器。
所述步骤 （2) 中包括：
路由选择控制器提取路由查询请求中的约束条件；
路由选择控制器调用链路权值管理器；
链路权值管理器根据约束条件，生成用于本次路由选择的路由数据库 视图。
所述路由查询请求中的约束条件为最小跳数。
所述链路权值管理器生成的路由数据库视图中，每条链路的权值均被 调整为相等值。
所述步骤 （3 ) 中包括：
路由选择控制器根据所生成的路由数据库视图调用路由计算选择器， 以计算组播路由；
路由计算选择器根据组播业务共享带宽和不改变以前组播路由的要 求， 采用新增组播业务接收点到组播树最短路径的方法计算组播路由； 路由计算选择器将组播路由计算结果返回给路由选择控制器。
所述步骤 （4 ) 中包括：
路由选择控制器根据收到的组播路由计算结果， 调用路由分解器； 路由分解器从组播树中将组播业务源点到新增组播业务接收点间的 点到点连接路由分解出。 本发明还提供一种自动交换光网络组播业务的路由选择方法，在已建 立的组播连接中， 通过路由控制器来实现恢复组播分支连接的路由选择， 包括如下步骤：
( 1 ) 路由控制器监测来自连接控制器的恢复组播分支连接的路由查 询请求；
(2.) 路由控制器根据接收到的路由查询请求， 生成用于本次路由选 择的路由数据库视图；
( 3 ) 路由控制器根据所生成的路由数据库视图， 计算一条从组播业 务源点到目的分支节点的恢复连接路由， 以保证本次计算的恢复连接路 由链路权值最小；
( 4 )路由控制器将路由选择计算结果返回给査询路由的路由连接器。 其中， 所述路由控制器包括路由选择控制器、链路权值管理器、路由 计算选择器和路由分解器。
所述歩骤 （2 ) 中包括：
路由选择控制器提取路由查询请求中的约束 件;. 路由选择控制器调用链路权值管理器；
链路权值管理器根据约束条件，生成用于本次路由选择的路由数据库 视图。
所述路由查询请求中的约束条件为最小跳数。
所述链路权值管理器生成的路由数据库视图中，每条链路的权值均被 调整为相等值。
所述步骤 （3 ) 中包括：
路由选择控制器根据所生成的路由数据库视图调用路由计算选择器， 以计算组播路由；
路由计算选择器采用最短路径的方法计算一条从组播业务源点到目 的分支节点的恢复连接路由；
' 路由计算选择器将组播路由计算结果返回给路由选择控制器。 本发明技术采用将一个复杂的组播业务连接路由选择问题分解为多 条点对点连接路由选择处理方法， 并从路由选择的角度实现组播业务的 链路资源共享， 解决 ASON网络支持组播业务的连接建立、 修改和恢复 问题， 具备简洁、 可靠的优点。 附图概述
图 1是 ASON网络支持组播业务的示意图；
图 2是根据本发明实施例的 ASON网络组播功能中路由控制器的组 件示意图；
图 3是根据本发明实施例的 ASON网络组播连接路由树示意图； 图 4是根据本发明实施例的 ASON网络组播连接路由树分解为点到 点连接路由示意图；
图 5是根据本发明实施例的 ASON网络新增组播点到组播路由树所 有点最短路径示意图； 图 6是根据本发明实施例的 ASON网络增加组播业务接收方组播连 接路由树示意图；
图 7是根据本发明实施例的 ASON网络恢复组播业务分支连接路由 示意图。 本发明的最佳实施方式
本发明的核心思想是依据 ASON网络的框架结构， 将点对多点的组 播连接路由査询， 分解为多个点对点的连接路由， 根据连接控制查询组 播业务路由的类型， 应用不同的路由选择方法， 实现组播业务的带宽共 享。
本发明中路由控制器 （Routing Controller, 简称 RC ) 由路由选择控 制器、 链路权值管理器、 路由计算选择器和路由分解器组成。
下面结合附图和实施例对本发明作进一步的详细说明。
其中， 图 1在背景技术中已经进行过说明； 图 2是对应于 ASON网 络组播功能路由控制器组件示意图； 图 3是 ASON网络支持图 1所示组 播业务组播连接路由树示意图； 图 4是图 3的组播连接路由树分解为点 到点连接路由示意图； 图 5是 ASON网络新增组播点到图 3所示组播连 接路由树所有点的最短路径示意图； 图 6是 ASON网络在图 1所示组播 业务基础上增加组播业务接收方连接路由树示意图； 图 7是 ASON网络 在图 6组播业务基础上恢复组播分支连接路由示意图。 第一实施例， 结合图 1、 2、 3和 4， 建立以 A网元为业务发送方， 以 Zl、 Z2、 Z3和 Z4为业务接收方的组播连接为例， 采用源路由策略， 说 明本发明组播连接路由选择的实施方案。
具体实施方案包括如下步骤：
步骤一、 图 1所示 ASON网络网元 A控制平面 RC监测到来自连接 控制器（Connection Controller, 简称 CC ) 的建立组播连接的路由查询请 求 （发送方为 A， 接收方为 Zl、 Z2、 Z3和 Z4) 后， 转入下一步； 步骤二、步骤一所述的 RC接收到路由查询请求后， 进一步的处理可 分解为： 路由选择控制器， 提取路由查询请求中的约束条件， 这里路由 查询的约束条件为最少跳数， 链路权值管理器， 根据最少跳数的约束条 件将每条链路的权值均调整为相等值， 如权值都为 1。权值均相等的链路 视图 （RDB视图） 将用于本次路由计算， 转入下一步；
步骤三、 RC内的路由选择控制器， 根据步骤二生成的 RDB视图， 调用路由计算选择器， 向路由计算选择器发送路由计算请求， 以计算组 播路由， 转入下一步；
步骤四、路由计算选择器收到步骤三的路由计算请求后，根据组播业 务共享带宽的要求， 采用最小生成树方法计算选择连接路由， 保证组播 业务连接源和多个目的之间总的链路权值最小， 图 3所示为组播业务的 最小生成树， 生成树的权值为 4 (每条链路的权值均为 1 ) ， 是权值最小 的树。 从路由的角度 A-Z4， A-Z2共享 A-Z2的链路带宽， 路由计算选择 器将计算结果返回给路由选择控制器， 转入下一步骤；
步骤五、路由选择控制器收到步骤四的组播路由计算结果后，调用路 由分解器， 将点到多点的组播路由树分解为点到点多条路由， 图 4是将 图 3的组播连接路由树分解为 4条（A-Z1、 A-Z2、 A-Z3、 A-Z4) 点到点 连接路由的示意图；
步骤六、 RC将路由选择计算结果返回给査询路由的 CC。 第二实施例， 结合图 1、 2、 3、 5和 6， 以上述组播业务 A和 Zl、 Z2、 Z3和 Z4增加组播业务接收方 Z5为例， 采用源路由策略， 说明本发明增 加组播分支连接的路由选择实施方案。
具体实施方案包括如下步骤：
步骤一、 图 1所示 ASON网络网元 A控制平面 RC监测到来自连接 控制器 CC的增加组播分支连接的路由查询请求（源组播业务 A， 接收方 为 Zl， Z2， Z3和 Z4， 新增加组播业务接收方点 Z5 ) 后， 转入下一步； 步骤二、步骤一所述的 RC接收路由查询请求后， 进一步的处理可分 解为： 路由选择控制器， 提取路由查询请求中的约束条件， 这里路由查 询的约束条件为最少跳数， 链路权值管理器， 根据最少跳数的约束条件 将每条链路的权值均调整为相等值， 如权值都为 1。权值均相等的链路视 图 （RDB视图） 将用于本次路由计算， 转入下一步；
步骤三、 RC内的路由选择控制器， 根据步骤二生成的 RDB视图， 调用路由计算选择器， 向路由计算选择器发送路由计算请求， 以计算组 播路由， 转入下一步骤；
步骤四、路由计算选择器收到步骤三的路由计算请求后，根据组播业 务共享带宽和不改变以前组播路由的要求， 采用新增组播点到组播树计 算最短路径的方法计算选择连接路由， 保证本次新增的组播分支链路权 值最小， 图 3所示为组播业务的最小生成树， 图 5为新增组播节点到图 3 所示最小生成树上所有节点的最短路径， Z5到 A的最短路径为：
Z5-B-Z3-A; Z5到 Z1的最短路径为： Z5-B-Z2-Z1 ; Z5到 Z2的最短路径 为： Z5-B-Z2; Z5到 Z3的最短路径为： Z5-B-Z3 ; Z5到 Z4的最短路径 为: Z5-Z4。 新增组播点 Z5到组播树的最短路径为： Z5-Z4, 图 6为增加 Z5后的组播连接路由树， 路由计算选择器将计算结果返回给路由选择控 制器， 转入下一步；
步骤五、路由选择控制器收到步骤四的组播路由计算结果后，调用路 由分解器， 从组播树中将组播业务源点到新增组播业务接收点间的点到 点连接路由分解出， 图 6中新增组播点到点连接路由为 A-Z2-Z4-Z5; 步骤六、 RC将路由选择计算结果返回给查询路由的 CC。 第三实施例， 结合图 1、 2、 6、 7， 以上述组播业务 A和 Zl、 Z2、
Z3、 Z4、 Z5组播业务中 Z4-Z5间分支链路发生故障， 组播业务源节点到 组播分支 Z5恢复该分支连接的路由选择为例， 说明本发明组播业务恢复 连接的路由选择的实施方案。
具体实施方案包括如下步骤：
步骤一、 图 1所示 AS0N网络网元 A控制平面 RC监测到来自连接 控制器 CC的恢复连接的路由查询请求（如图 6所示， 源组播业务 A， 接 收方为 Zl、 Z2、 Z3、 Z4和 Z5， 组播分支 Z5发生故障后， 需恢复分支 Z5的连接） 后， 转入下一步；
步骤二、步骤一所述的 RC接收路由查询请求后， 进一步的处理可分 解为： 路由选择控制器， 提取路由查询请求中的约束条件， 这里路由査 询的约束条件为最少跳数， 链路权值管理器， 根据最少跳数的约束将每 条链路的权值均调整为相等值， 如权值都为 1。 权值均相等的链路视图 (RDB视图） 将用于本次路由计算， 转入下一步。
步骤三、 RC内的路由选择控制器， 根据步骤二生成的 RDB视图， 调用路由计算选择器， 向路由计算选择器发送计算路由连接的请求， 以 计算组播路由， 转入 "一步；
步骤四、路由选择控制器收到步骤三的路由计算请求后，应用最短路 径方法， 计算一条从组播业务源节点到目的分支节点的恢复连接路由， 保证本次计算的恢复连接路由权值最小， 如图 7所示计算的恢复连接路 由为 A-Z3-B-Z5，从路由的角度恢复连接路由 A-Z3-B-Z5与组播分支 A-Z3 不共享连路资源， 路由计算结果返回给路由选择控制器；
步骤五、 RC将路由选择计算结果返回给査询路由的 CC。 工业实用性
本发明采用将一个复杂的组播业务连接路由选择问题分解为多条点 对点连接路由选择处理方法， 并从路由选择的角度实现组播业务的链路 资源共享， 解决 AS0N网络支持组播业务的连接建立、 修改和恢复问题， 具备简洁、 可靠的优点。

Claims

权 利 要 求 书
1、 一种自动交换光网络组播业务的路由选择方法， 通过路由控制器 来实现建立组播连接的路由选择， 其特征在于， 包括如下步骤：
( 1 ) 路由控制器监测来自连接控制器的建立组播连接的路由查询请 求；
(2) 路由控制器根据接收到的路由查询请求， 生成用于本次路由选 择的路由数据库视图；
(3 ) 路由控制器根据所生成的路由数据库视图， 计算组播路由， 以 保证组播业务源点和多个组播业务接收点之间总的链路权值最小；
(4 ) 路由控制器根据组播路由计算结果， 将点到多点的组播路由树 分解为点到点多条路由；
( 5 )路由控制器将路由选择计算结果返回给查询路由的路由连接器。
2、 如权利要求 1所述的方法， 其特征在于， 所述路由控制器包括路 由选择控制器、 链路权值管理器、 路由计算选择器和路由分解器；
所述步骤 （2) 中包括：
路由选择控制器提取路由查询请求中的约束条件；
路由选择控制器调用链路权值管理器；
链路权值管理器根据约束条件，生成用于本次路由选择的路由数据库 视图；
所述步骤 （3 ) 中包括：
路由选择控制器根据所生成的路由数据库视图调用路由计算选择器， 以计算组播路由；
路由计算选择器根据组播业务共享带宽的要求，采用最小生成树方法 计算组播路由；
路由计算选择器将组播路由计算结果返回给路由选择控制器； 所述步骤 （4) 中包括： 路由选择控制器根据收到的组播路由计算结果， 调用路由分解器； 路由分解器将点到多点的组播路由树分解为点到点多条路由。
3、 如权利要求 2所述的方法， 其特征在于， 所述路由查询请求中的 约束条件为最小跳数。
4、 如权利要求 2所述的方法， 其特征在于， 所述链路权值管理器生 成的路由数据库视图中， 每条链路的权值均被调整为相等值。
5、 一种自动交换光网络组播业务的路由选择方法， 在己建立的组播 连接中， 通过路由控制器来实现增加组播分支连接的路由选择， 其特征在 于， 包括如下步骤：
( 1 ) 路由控制器监测来自连接控制器的增加组播分支连接的路由查 询请求；
(2) 路由控制器根据接收到的路由查询请求， 生成用于本次路由选 择的路由数据库视图；
(3 ) 路由控制器根据所生成的路由数据库视图， 计算组播路由， 以 保证本次新增的组播分支链路权值最小；
(4) 路由控制器根据组播路由计算结果， 从组播树中将组播业务源 点到新增组播业务接收点间的点到点连接路由分解出；
( 5 )路由控制器将路由选择计算结果返回给査询路由的路由连接器。
6、 如权利要求 5所述的方法， 其特征在于， 所述路由控制器包括路 由选择控制器、 链路权值管理器、 路由计算选择器和路由分解器；
所述步骤 （2 ) 中包括：
路由选择控制器提取路由查询请求中的约束条件；
路由选择控制器调用链路权值管理器；
链路权值管理器根据约束条件，生成用于本次路由选择的路由数据库 视图；
所述步骤 （3 ) 中包括：
路由选择控制器根据所生成的路由数据库视图调用路由计算选择器， 以计算组播路由；
路由计算选择器根据组播业务共享带宽和不改变以前组播路由的要 求， 采用新增组播业务接收点到组播树最短路径的方法计算组播路由； 路由计算选择器将组播路由计算结果返回给路由选择控制器； 所述步骤 （4) 中包括- 路由选择控制器根据收到的组播路由计算结果， 调用路由分解器； 路由分解器从组播树中将组播业务源点到新增组播业务接收点间的 点到点连接路由分解出。
7、 如权利要求 6所述的方法， 其特征在于， 所述路由查询请求中的 约束条件为最小跳数。
8、 如权利要求 6所述的方法， 其特征在于， 所述链路权值管理器生 成的路由数据库视图中， 每条链路的权值均被调整为相等值。
9、 一种自动交换光网络组播业务的路由选择方法， 在已建立的组播 连接中， 通过路由控制器来实现恢复组播分支连接的路由选择， 其特征在 于， 包括如下步骤：
( 1 ) 路由控制器监测来自连接控制器的恢复组播分支连接的路由查 询请求；
(2) 路由控制器根据接收到的路由查询请求， 生成用于本次路由选 择的路由数据库视图； '
( 3 ) 路由控制器根据所生成的路由数据库视图， 计算一条从组播业 务源点到目的分支节点的恢复连接路由， 以保证本次计算的恢复连接路由 链路权值最小；
(4)路由控制器将路由选择计算结果返回给查询路由的路由连接器。
10、 如权利要求 9所述的方法， 其特征在于， 所述路由控制器包括路 由选择控制器、 链路权值管理器、 路由计算选择器和路由分解器；
所述步骤 （2) 中包括：
路由选择控制器提取路由査询请求中的约束条件； 路由选择控制器调用链路权值管理器；
链路权值管理器根据约束条件，生成用于本次路由选择的路由数据库 视图；
所述步骤 （3 ) 中包括：
路由选择控制器根据所生成的路由数据库视图调用路由计算选择器， 以计算组播路由；
路由计算选择器采用最短路径的方法计算一条从组播业务源点到目 的分支节点的恢复连接路由；
路由计算选择器将组播路由计算结果返回给路由选择控制器。
1 1、 如权利要求 10所述的方法， 其特征在于， 所述路由查询请求中 的约束条件为最小跳数。
12、 如权利要求 10所述的方法， 其特征在于， 所述链路权值管理器 生成的路由数据库视图中， 每条链路的权值均被调整为相等值。
PCT/CN2005/002006 2005-11-25 2005-11-25 Procede de selection d'acheminements de services multidiffusion dans un reseau optique a commutation automatique WO2007059652A1 (fr)

Priority Applications (4)

Application Number Priority Date Filing Date Title
CN2005800513641A CN101243723B (zh) 2005-11-25 2005-11-25 自动交换光网络组播业务的路由选择方法
KR1020087013268A KR100949323B1 (ko) 2005-11-25 2005-11-25 자동 교환 광 네트워크 멀티캐스트 서비스의 루트 선택방법
PCT/CN2005/002006 WO2007059652A1 (fr) 2005-11-25 2005-11-25 Procede de selection d'acheminements de services multidiffusion dans un reseau optique a commutation automatique
EP05813846.2A EP1954093A4 (en) 2005-11-25 2005-11-25 METHOD FOR SELECTING MULTICAST SERVICE ROUTINGS IN AN AUTOMATICALLY SWITCHABLE OPTICAL NETWORK

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2005/002006 WO2007059652A1 (fr) 2005-11-25 2005-11-25 Procede de selection d'acheminements de services multidiffusion dans un reseau optique a commutation automatique

Publications (1)

Publication Number Publication Date
WO2007059652A1 true WO2007059652A1 (fr) 2007-05-31

Family

ID=38066893

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2005/002006 WO2007059652A1 (fr) 2005-11-25 2005-11-25 Procede de selection d'acheminements de services multidiffusion dans un reseau optique a commutation automatique

Country Status (4)

Country Link
EP (1) EP1954093A4 (zh)
KR (1) KR100949323B1 (zh)
CN (1) CN101243723B (zh)
WO (1) WO2007059652A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2009056054A1 (en) * 2007-10-26 2009-05-07 Huawei Technologies Co., Ltd. Path computation element method to support routing and wavelength assignment in wavelength switched optical networks

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101508683B1 (ko) 2014-11-10 2015-04-07 홍덕산업(주) 고무 보강용 스틸코드 및 그 제조방법
CN113490777B (zh) 2019-04-25 2023-11-17 高丽钢线株式会社 橡胶增强用钢丝帘线及其制造方法

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1384618A (zh) * 2002-06-07 2002-12-11 清华大学 自动交换光网络中的光通道建立方法
US6813276B2 (en) * 2001-01-30 2004-11-02 The Regents Of The University Of California Optical layer multicasting using a single sub-carrier header with active header detection, deletion, and re-insertion via a circulating optical path

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100194608B1 (ko) * 1996-11-20 1999-06-15 이계철 Atm 통신망에서의 멀티캐스트 경로 할당방법
US6529498B1 (en) * 1998-04-28 2003-03-04 Cisco Technology, Inc. Routing support for point-to-multipoint connections
US7583601B2 (en) * 2003-02-07 2009-09-01 Nippon Telegraph And Telephone Corporation Multicast transfer route setting method, and multicast label switching method for implementing former method

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6813276B2 (en) * 2001-01-30 2004-11-02 The Regents Of The University Of California Optical layer multicasting using a single sub-carrier header with active header detection, deletion, and re-insertion via a circulating optical path
CN1384618A (zh) * 2002-06-07 2002-12-11 清华大学 自动交换光网络中的光通道建立方法

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP1954093A4 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2009056054A1 (en) * 2007-10-26 2009-05-07 Huawei Technologies Co., Ltd. Path computation element method to support routing and wavelength assignment in wavelength switched optical networks
US8059960B2 (en) 2007-10-26 2011-11-15 Futurewei Technologies, Inc. Path computation element method to support routing and wavelength assignment in wavelength switched optical networks
US8666246B2 (en) 2007-10-26 2014-03-04 Futurewei Technologies, Inc. Path computation element method to support routing and wavelength assignment in wavelength switched optical networks

Also Published As

Publication number Publication date
KR20080072700A (ko) 2008-08-06
CN101243723B (zh) 2011-02-23
CN101243723A (zh) 2008-08-13
EP1954093A1 (en) 2008-08-06
KR100949323B1 (ko) 2010-03-23
EP1954093A4 (en) 2015-05-27

Similar Documents

Publication Publication Date Title
US6856627B2 (en) Method for routing information over a network
US7352758B2 (en) Dynamic bandwidth management using signaling protocol and virtual concatenation
EP2352261B1 (en) Path computation method, node device and path computation element
US8958691B2 (en) Method and system for providing fault recovery using composite transport groups
US7414985B1 (en) Link aggregation
EP2096802B1 (en) A hierarchical routing query method of automatic switched optical network
Yang et al. Inter-domain dynamic routing in multi-layer optical transport networks
US20030223357A1 (en) Scalable path protection for meshed networks
Doverspike et al. Structural overview of ISP networks
CN101322343A (zh) Wdm光网络中组播保护方法及装置
EP1983712B1 (en) An automatic discovering method and device for client layer link
US8848712B2 (en) Distributed RSVP-TE in a multi-chassis node architecture
WO2007059652A1 (fr) Procede de selection d'acheminements de services multidiffusion dans un reseau optique a commutation automatique
US7652986B2 (en) Route determination with differential delay compensation for virtually-concatenated data traffic
EP2665324A1 (en) Connection establishment method and device for forwarding adjacency - label switched path
Xu et al. Generalized MPLS-based distributed control architecture for automatically switched transport networks
CN101133601A (zh) 自动交换传送网络中的复杂控制节点及其控制方法
CN101621448A (zh) 一种保证网络带宽的方法、装置和系统
WO2015062045A1 (zh) 一种控制通道的建立方法、装置及系统
Karasan et al. Robust path design algorithms for traffic engineering with restoration in MPLS networks
CN101228736A (zh) 用于自动交换光网络组播业务的连接控制方法和装置
Strand Optical network architecture evolution
Bernstein et al. Optical network control—concepts, standardization and interoperability
EP2141866B1 (en) Method and apparatus for finding a path in a GMPLS controlled network
WO2014176729A1 (zh) 传送网控制方法、控制器和节点

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application
WWE Wipo information: entry into national phase

Ref document number: 200580051364.1

Country of ref document: CN

WWE Wipo information: entry into national phase

Ref document number: 2005813846

Country of ref document: EP

NENP Non-entry into the national phase

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 1020087013268

Country of ref document: KR

WWP Wipo information: published in national office

Ref document number: 2005813846

Country of ref document: EP