WO2009065279A1 - Procédé de reroutage conditionnel dans un réseau optique commuté automatique - Google Patents

Procédé de reroutage conditionnel dans un réseau optique commuté automatique Download PDF

Info

Publication number
WO2009065279A1
WO2009065279A1 PCT/CN2008/000008 CN2008000008W WO2009065279A1 WO 2009065279 A1 WO2009065279 A1 WO 2009065279A1 CN 2008000008 W CN2008000008 W CN 2008000008W WO 2009065279 A1 WO2009065279 A1 WO 2009065279A1
Authority
WO
WIPO (PCT)
Prior art keywords
connection
node
rerouting
routing
soft
Prior art date
Application number
PCT/CN2008/000008
Other languages
English (en)
French (fr)
Inventor
Faming Yang
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 EP08700568.2A priority Critical patent/EP2219328B1/en
Priority to ES08700568.2T priority patent/ES2526396T3/es
Publication of WO2009065279A1 publication Critical patent/WO2009065279A1/zh

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0805—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability
    • H04L43/0811—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability by checking connectivity
    • 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/28—Routing or path finding of packets in data switching networks using route fault recovery
    • 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/62—Wavelength based
    • 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
    • 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
    • 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/0079—Operation or maintenance aspects
    • H04Q2011/0081—Fault tolerance; Redundancy; Recovery; Reconfigurability

Definitions

  • the present invention relates to the field of optical communications, and more particularly to a soft rerouting method for an automatic switched optical network.
  • BACKGROUND OF THE INVENTION With the rapid growth of traffic in the transmission network, especially due to the rapid increase in the amount of data traffic, the Synchronous Digital Hierarchy (SDH)/Wavelength Division Multiplexing (WDM) optical transport network traffic Growth, the means of providing services through manual configuration in traditional optical networks has become increasingly unsuitable, especially traditional means have greatly increased operating costs. It is in this case that the Automatically Switched Optical Network (ASON) technology, which automatically establishes connections through the interaction of signaling protocols to automatically configure services, was born and began to be applied.
  • ASON Automatically Switched Optical Network
  • ASON technology can not only provide services quickly, but also provide new routes for services already transmitted in the network for management and maintenance purposes (such as route optimization, network maintenance, and planning engineering), and establish new routes that follow new routes through signaling protocols. Connect and switch services from the original connection to the new connection, so that management and maintenance purposes can be realized conveniently and quickly, and network resources can be optimized. Obviously, the operation caused by management and maintenance cannot affect the transmission of the original service in the network.
  • the International Telecommunications Union (ITU) International Standard G.8080 proposes a soft rerouting technology that takes a "first build and then split" approach to solve this problem by first establishing a new route connection that can replace the original connection. And then delete the original connection.
  • the soft rerouting technology proposed by ITU G.8080 does not consider how the service can be switched from the original connection to the new connection. This will result in short-term service interruption due to inconsistent service switching actions between the source and destination of the connection.
  • the publication number is: CN1710993
  • the name is: the patent of the service path optimization method in the intelligent optical network
  • a new method is proposed for the business path optimization goal, and the method is In the process of establishing a new label switching path (ie, a new routing connection), the dual label selection is performed at the bifurcation point of the new label switching path and the label switching path to be optimized (ie, the original connection), so that the new label switching path is established.
  • the dual-issue selection mechanism can be used at the bifurcation point to automatically switch the service to the new standard relatively quickly. Sign the exchange path.
  • the method further reduces the service interruption time caused by the soft rerouting process, since it is switched by the selection mechanism, that is, switching at the selection point by deleting the fault caused by the original working connection, still causing no The service is interrupted for a certain period of time (ie, from the time the deletion actually occurs until the failure is detected until the last time the switch is completed).
  • the bridging point in the following content of the present invention means: along the direction of service transmission, the original connection and the re-routing connection pass through the node, and the service to be transmitted is the same at the entry position of the node (for example, the same chain is used at the entry location)
  • the road is connected to the resource), and the service to be transmitted is different in the exit position of the node (for example, the exit location uses different link connection resources);
  • the bridge operation refers to the bridge point sending the service to the next node of the original connection. Send the service to the next node of the reroute connection.
  • the switching point in the following content of the present invention means: along the direction of service transmission, the original connection and the re-routing connection pass through the node, and the service to be transmitted is different at the entry location of the node (for example, different links are used at the entry location) Connection resources), and the service to be transmitted is the same at the exit position of the node (for example, the same link connection resource is used for the port location); the switching operation means that the switchover point terminates the reception of the service from the original connection and starts the connection from the re-routing. Receive business on.
  • the soft rerouting method in the automatic switched optical network includes the following steps: Step 1: The first node of the original connection to be rerouted first determines a complete route of the rerouting connection with the same first and last nodes; Then initiate the soft rerouting connection establishment process, and in the process of establishing the soft rerouting connection, all the bridging points through which the rerouting connection passes perform the bridging operation; Step 2: After the first node confirms that the rerouting connection is established, the downstream of the rerouting connection is established The node sends a service switching request, and all the switching points of the rerouting connection complete the switching operation. After the switching is completed, the first node is notified of the service switching.
  • Step 3 After receiving the service switching completion notification, the first node deletes the original connection, and the rerouting connection is completed.
  • the complete route of the rerouting connection refers to all the nodes and links through which the rerouting connection passes.
  • the step one specifically includes the following steps: Step A: The first node of the original connection to be rerouted determines the complete route of the rerouting connection with the same first and last nodes; Step B: The first node starts the rerouting connection in the establishment process of the node, and connects to the rerouting The next node sends a soft rerouting connection establishment request; the establishment process of the connection here in the node includes: if the node is a bridging point, performing a bridging operation; Step C: In the middle of each rerouting connection except the last node After receiving the soft rerouting connection establishment request, the node starts the rerouting connection establishment process in the local node, and sends a soft rerouting connection establishment request
  • Step E After receiving the re-routing connection establishment completion notification, the intermediate node of each re-routing connection except the first node notifies the previous node that the re-routing connection is established after the re-routing connection is established; otherwise After the establishment of the node is completed, the routing connection is notified to the previous node that the re-routing connection is established.
  • the head node determines a complete route of the rerouting connection according to the constraint routing information in the management plane request.
  • the first node can calculate the complete connection route by one of the following two methods: The first node calculates a complete route according to the current route topology resource; or can request other control units, for example, PCE (route calculation unit) ), calculate a complete route based on the current routing topology resource.
  • the first step is automatically triggered by the first node of the original connection or manually triggered.
  • the step 2 includes the following steps: a. After the first node determines that the re-routing connection is established, the re-routing connection is monitored within a certain period of time.
  • the next step is performed; b. if the first node is switched Point, then perform a switching operation, and then send a service switching operation request to the downstream node of the rerouting connection, otherwise directly send the service switching operation request to the next node; If the rerouting connection and the original connection do not share the link connection resource, the first node may directly send the switching request to the destination node or the next node connected; otherwise, the first node needs to send the switching request to the next node of the connection. c.
  • the switching request is sent to the next node.
  • the switching operation is performed first, and then the first node service switching operation is notified, otherwise the first node service switching operation is directly notified.
  • the reroute connection and the original connection may use link connection resources in the same transport network.
  • the soft rerouting connection establishment request in the step B includes a rerouting connection identifier.
  • FIG. 1 is a flow chart of a method according to an embodiment of the present invention
  • FIG. 2 is a schematic diagram of a connection of an original service according to an embodiment of the present invention
  • FIG. 3 is a schematic diagram of a connection after a rerouting connection is established according to an embodiment of the present invention
  • FIG. 5 is a schematic diagram of a connection after completing a soft rerouting process according to an embodiment of the present invention.
  • FIG. DETAILED DESCRIPTION OF THE INVENTION The present invention will be further described in detail below with reference to the accompanying drawings.
  • this embodiment triggers an automatic switching optical network to complete a rerouting connection process by sending a soft rerouting request to a head node of an original connection carrying a unidirectional service through a network management, specifically including : ⁇ Next step: Step 1: The first node of the original connection to be rerouted determines the complete route of the rerouting connection with the same first and last nodes.
  • the rerouting connection starts the establishment process of the node: If the node is a bridge point , then perform a bridging operation.
  • the complete route refers to all the nodes and links that the connection passes through; the first node needs to determine the complete reason for the rerouting connection according to the constraint routing information in the management plane request, including when the network management request does not give a complete route.
  • the first node needs to calculate a complete route of the connection according to the current routing topology resource; the re-routing connection establishment process of the first node includes allocating link connection resources required for the connection; the bridging operation refers to sending the service to the original connection.
  • the next node also sends traffic to the next node of the rerouting connection.
  • Fig. 2 Fig.
  • a circle indicates a node
  • a dotted arrow indicates a subnet connection
  • a solid arrow indicates a link connection.
  • the original connection is through nodes A, B, C, E, F, Z
  • the re-routing connection determined by the original node is re-routed through A, B, D, F, and Z.
  • the connection and the original connection use the same link connection resource between node A and node B, B is the bridge point
  • the rerouting connection and the original connection use the same link connection resource between node F and node Z
  • F is the switching point.
  • Step 2 The first node sends a soft rerouting connection establishment request to the next node of the rerouting connection, and the soft rerouting connection establishment request includes the connection identifier of the rerouting connection.
  • Step 3 After each intermediate node except the last node receives the soft rerouting connection establishment request, it starts the rerouting connection establishment process in the local node; if the local node is a bridging point, performs the corresponding bridging operation, and sends The soft reroute connection establishes the request to the next node of the rerouting connection; if the node is a switching point, the corresponding crossover cannot be established.
  • the intermediate node may not need to wait for the re-routing connection to send a soft re-routing connection establishment request to the next node after the establishment process of the node is completed. As can be seen from FIG.
  • Step 3 After the end node receives the software rerouting connection establishment request, completes the re-routing connection establishment process in the local node, and notifies the last node of the rerouting connection after the establishment of the local node is "heavy way" The connection establishment process is completed.
  • the connection establishment process of the last node includes allocating link connection resources.
  • Step 5 After receiving the re-routing connection establishment completion notification, the intermediate node of each re-routing connection except the first node receives If the node completes the re-routing connection in the establishment process of the node, it notifies the previous node of the re-routing connection that "re-routing connection establishment is completed", otherwise, it waits for the re-routing connection to notify the re-routing connection upstream after the establishment process of the local node is completed.
  • Step 6 After the first node determines that the re-routing connection is established, it monitors the re-routing connection within a certain period of time. If the re-routing connection has no fault, proceed to the next step.
  • Step 7 The first node The next node of the rerouting connection sends a service switching request, and all the switching points that the rerouting connection passes through perform the switching operation, that is, terminate. Receiving the service from the original connection and starting to receive the service from the re-routing connection, specifically including the following steps: a. If the first node is a switching point, the switching operation is performed, and then the service switching operation request is sent to the next node of the re-routing connection, otherwise Send the service switching operation request directly to the next section
  • the first node A sends a service switching request to the node B.
  • the intermediate node receives the service switching request, if the local node is a switching point, the switching operation is performed, and then the service switching request is sent to the next node. Otherwise, The service switching request is directly sent to the next node.
  • the intermediate points B and D are not the switching nodes. Therefore, the service switching request is sent to the downstream nodes D and F respectively after receiving the service switching request. F is the switching point. After receiving the switching request, it needs to delete the subnet crossing of the original connection and establish a rerouting connection at the subnet of the local node to complete the service switching, and then send the service switching request to the Downstream node Z.
  • Step 8 After receiving the service switching completion notification of the last node, the first point starts the deletion process of the original connection, deletes the original connection, and the rerouting connection is completed. As shown in Figure 5, the original connection has been deleted, leaving the rerouting connection for the transport service.
  • the service switching operation is started, that is, the service is terminated from the original connection and the service is received from the re-routing connection, and then deleted.
  • the original connection avoids service interruption, or the time of service interruption can be considered negligible, because the switching operation is instantaneous, and before the switching, the service is transmitted and received on the original connection without failure.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Environmental & Geological Engineering (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Telephonic Communication Services (AREA)

Description

自动交换光网络中的软重路由方法 技术领域 本发明涉及光通信领域， 特别是一种自动交换光网络的软重路由方法。 背景技术 随着传送网络业务量急剧增长，特别是因数据业务信息量的急剧增长导 致同步数字体系（ Synchronous Digital Hierarchy, SDH )/波分复用（ Wavelength Division Multiplexing, WDM ) 光传送网业务量的增长， 传统光网络中通过 人工配置来提供业务的手段已经显得越来越不适应， 特别是传统手段已经大 大增加了运营成本。 正是在这样的情况下， 通过信令协议的交互来自动建立 连接从而自动配置业务的自动交换光网络 (简称 ASON )技术诞生并开始得 到应用。
ASON技术不仅可以快速提供业务， 也可因管理和维护的目的（如路由 优化、 网络维护、 计划工程） 为已在网络中传送的业务提供新路由， 通过信 令协议交互建立遵循新路由的新连接，并将业务从原连接上切换到新连接上， 从而方便和快捷地实现管理维护目的， 优化网络资源。 显然管理维护所引起操作不能影响网络中原有业务的传送。 为此， 国际 电信联盟 （ITU ) 国际标准 G.8080 提出了软重路由技术， 该技术采取 "先 建后拆" 来解决这一问题， 即先建立一个可以替代原连接的经过新路由的连 接， 然后删除原来的连接。 ITU G.8080 提出的软重路由技术没有考虑业务如何从原连接切换到新 连接上， 这样由于在连接的源和目的地的业务切换动作不一致， 仍会导致短 时间的业务中断。 为了使软重路由过程做到业务无损切换， 公开号为： CN1710993 、 名 称为： 智能光网络中的业务路径优化方法的专利中，针对业务路径优化目标， 提出了一个新方法， 该方法是在建立新标签交换路径 （即新路由连接） 的过 程中， 通过在新标签交换路径和待优化标签交换路径 （即原连接） 的分叉点 进行双发选收， 使得在新标签交换路径建立完毕而随后删除待优化标签交换 路径业务时能够在分叉点利用双发选收机制将业务比较快地自动切换到新标 签交换路径上。 该方法虽然进一步减少了软重路由过程中导致的业务中断时 间， 但是由于它是靠选收机制进行切换， 即靠删除原工作连接引起的故障而 在选收点进行切换， 仍引起了的不可忽略的一定时间 （即从删除实际发生到 检测到故障， 直至最后倒换完成的时间） 业务中断。 发明内容 本发明所要解决的技术问题是，提供一种新的自动交换光网络中的软重 路由方法， 该方法可使得业务中断的时间忽略不计。 本发明以下内容中的桥接点是指： 沿着业务传送方向， 原连接和重路由 连接经过本节点，.并且要传送的业务在本节点的入口位置相同 （如， 入口位 置使用了相同的链路连接资源），而要传送的业务在本节点出口位置不同（如， 出口位置使用了不同的链路连接资源）;桥接操作是指桥接点将业务发送给原 连接的下一个节点的同时也将业务发送到重路由连接的下一个节点。 本发明以下内容中的倒换点是指： 沿着业务传送方向， 原连接和重路由 连接经过本节点， 并且要传送的业务在本节点的入口位置不同 （如， 入口位 置使用了不同的链路连接资源），而要传送的业务在本节点出口位置相同（如， 出 '口位置使用了相同的链路连接资源）;倒换操作是指倒换点终止从原连接上 接收业务并开始从重路由连接上接收业务。 本发明所述的自动交换光网络中的软重路由方法， 包括以下步骤： 步骤一：待重路由的原连接的首节点首先确定和原连接具有相同首末节 点的重路由连接的完整路由； 然后发起软重路由连接建立过程， 并且在软重 路由连接建立过程中， 重路由连接经过的所有桥接点执行桥接操作； 步骤二： 首节点确认重路由连接建立完毕后， 向重路由连接的下游节点 发送业务倒换请求， 重路由连接经过的所有倒换点完成倒换操作， 倒换完成 后通知首节点业务倒换完成； 步骤三： 首节点收到业务倒换完成通知后， 删除原连接， 重路由连接完 成。 所述重路由连接的完整路由是指重路由连接经过的所有节点和链路。 所述步骤一具体包括以下步骤： 步骤 A:待重路由的原连接的首节点确定和原连接具有相同首末节点的 重路由连接的完整路由； 步骤 B: 首节点开始重路由连接在本节点的建立过程， 并向重路由连接 的下一个节点发送软重路由连接建立请求； 这里的连接在本节点的建立过程 包括： 若本节点是桥接点， 则执行桥接操作； 步骤 C: 除末节点外的每个重路由连接的中间节点收到软重路由连接建 立请求后， 开始重路由连接在本节点的建立过程， 并向下一个节点发送软重 路由连接建立请求； 这里的连接在本节点的建立过程包括： 若本节点是桥接 点， 则执行桥接操作； 步骤 D: 末节点收到软重路由连接建立请求后， 开始重路由连接在本节 点的建立过程， 重路由建立完成后， 末节点通知重路由连接的上一个节点重 路由连接建立完成； 这里的连接在本节点的建立过程包括： 若本节点是桥接 点， 则执行桥接操作。 步骤 E: 除首节点外的每个重路由连接的中间节点收到重路由连接建立 完成通知后， 若重路由连接在本节点建立完毕， 则通知上一个节点重路由连 接建立完毕； 否则等重路由连接在本节点的建立完毕后再通知上一个节点重 路由连接建立完毕。 所述首节点根据管理平面请求中的约束路由信息来确定重路由连接的完 整路由。 首节点在确定连接完整路由时， 可采取下述两个方法之一计算连接完 整路由： 首节点根据当前路由拓朴资源计算出完整路由；或者可以请求其它控制 单元， 例如， PCE (路由计算单元），根据当前路由拓朴资源计算出完整路由。 所述步骤一由原连接的首节点自动触发或由人工触发。 所述步骤二具体包括以下步骤： a、 首节点确定重路由连接建立完成后， 在一定时间内监视重路由连接， 若重路由连接无故障， 则进行下一步操作； b、 若首节点是倒换点， 则执行倒换操作， 然后向重路由连接的下游节 点发送业务倒换操作请求，否则直接将业务倒换操作请求发送给下一个节点； 其中若重路由连接和原连接不共享链路连接资源 , 首节点可把倒换请求直接 发送到目的节点或连接的下一个节点， 否则， 首节点需把倒换请求发送到连 接的下一个节点。 c、 除末节点外的每个重路由连接的中间节点收到业务倒换请求后， 若 本节点是倒换点， 则执行倒换操作， 然后将业务倒换操作请求发送给下一个 节点， 否则直接将业务倒换请求发送给下一个节点； d、 末节点收到业务倒换请求后， 若本节点是倒换点， 则先执行倒换操 作， 然后通知首节点业务倒换操作完成， 否则直接通知首节点业务倒换操作 完成。 所述重路由连接和原连接可以使用相同传送网络中的链路连接资源。 所述步骤 B中的软重路由连接建立请求中包含重路由连接标识。 本发明是在重路由连接建立完毕并且业务已桥接到重路由连接后，才开 始执行业务倒换操作的， 而倒换操作又是瞬时完成的， 倒换前， 业务是在无 故障的原连接上传送和接收的， 从而避免了业务中断， 或者可以认为业务中 断的时间可以忽略不计。 附图说明 图 1是本发明实施例的方法流程图； 图 2是本发明实施例的原业务连接示意图； 图 3是本发明实施例的重路由连接建立后的连接示意图； 图 4是本发明实施例的业务倒换完成后的连接示意图； 图 5是本发明实施例的完成软重路由过程后的连接示意图。 具体实施方式 下面结合附图对本发明作进一步的详细说明。 如图 1所述，本实施例是通过网管向一个承载单向业务的原连接的首节 点发出软重路由请求而触发自动交换光网络完成重路由连接过程， 具体包括 ： ^下步骤: 步骤 1 : 待重路由的原连接的首节点确定和原连接具有相同首末节点的 重路由连接的完整路由开始重路由连接在本节点的建立过程： 若本节点是桥 接点， 则执行桥接操作。 其中， 所述完整路由是指连接经过的所有节点和链 路； 所述首节点需要根据管理平面请求中的约束路由信息来确定重路由连接 的完整理由， 包括当网管请求未给出完整路由时， 首节点需要根据当前路由 拓朴资源计算出连接的完整路由； 所述首节点的重路由连接建立过程包括分 配连接需要的链路连接资源； 所述桥接操作是指将业务发送给原连接的下一 个节点的同时也将业务发送到重路由连接的下一个节点。 图 2、 图 3、 图 4以及图 5中， 圆圏表示节点， 虚线箭头表示子网连接， 实线箭头表示链路连接。 如图 2及图 3所示， 原连接经过节点 A、 B、 C、 E、 F、 Z， 原连接的 首节点所确定的重路由连接经过 A、 B、 D、 F、 Z, 其中重路由连接和原连 接使用了节点 A和节点 B间的相同链路连接资源， B是桥接点， 重路由连接 和原连接使用了节点 F和节点 Z间的相同链路连接资源， F是倒换点。 由于 首节点在建立过程中， 在出口方向它选择了和原连接相同的连接资源 （在节 点 A和节点 B间）， 它不是桥接节点， 所以它不需要执行桥接操作。 步骤 2: 首节点发送软重路由连接建立请求到重路由连接的下一个节 点， 软重路由连接建立请求包含重路由连接的连接标识。 步骤 3: 除末节点外的每个中间节点收到软重路由连接建立请求后， 则 开始重路由连接在本节点的建立过程； 若本节点是桥接点， 则执行相应的桥 接操作， 并发送软重路由连接建立请求到重路由连接的下一个节点； 若本节 点是倒换点， 则不能建立相应的交叉。 中间节点可不需要等待重路由连接在 本节点的建立过程完毕就可向下一个节点发送软重路由连接建立请求。 通过图 3可以看出， 重路由连接经过的中间网元 B、 D、 F需要分配相 应的链路连接资源。 B是桥接点， 它通过建立重路由连接在本节点的子网交 叉完成了桥接操作。 在 D点建立了子网交叉； F是倒换点， 因此重路由连接 在本网元的子网交叉暂时不能被建立。 步骤 4: 末节点收到软件重路由连接建立请求后完成重路由连接在本节 点的建立过程， 并在本节点建立完成后通知重路由连接的上一个节点 "重路 由连接建立完成"。 其中末节点的连接建立过程包括分配链路连接资源。 通过图 3可以看出，在重路由连接经过的末节点网元 Z, 在入口处（点 F和节点 Z间） 重路由连接选择了和原连接相同的链路连接资源， 不需要新 的子网交叉建立。 步骤 5: 除首节点外的每个重路由连接的中间节点收到重路由连接建立 完成通知后， 若本节点完成重路由连接在本节点的建立过程， 则通知重路由 连接的上一个节点 "重路由连接建立完成"， 否则等待重路由连接在本节点的 建立过程完成后再通知重路由连接上游节点 "重路由连接建立完成"。 步骤 6: 首节点确定重路由连接建立完成后， 在一定时间内监视重路由 连接， 若重路由连接无故障， 则进行下一步操作。 步骤 7: 首节点向重路由连接的下一个节点发送业务倒换请求， 重路由 连接经过的所有倒换点执行倒换操作， 即终止从原连接上接收业务并开始从 重路由连接上接收业务， 具体包括一下步骤： a、 若首节点是倒换点， 即执行倒换操作， 然后向重路由连接的下一个 节点发送业务倒换操作请求， 否则直接将业务倒换操作请求发送给下一个节
如图 4, 首节点 A发送业务倒换请求到节点 B; b、 中间节点收到业务倒换请求后， 若本节点是倒换点， 则执行倒换操 作， 然后将业务倒换请求发送给下一个节点， 否则直接将业务倒换请求发送 给下一个节点； 如图 4， 中间点 B和 D 不是倒换节点， 因此只需要在收到业务倒换请 求后直接将业务倒换请求分别发送到下游节点 D、 F。 F是倒换点， 它在收到 倒换请求后， 需要删除原连接在本节点的子网交叉并建立重路由连接在本节 点的子网交叉， 从而完成业务倒换， 然后再发送业务倒换请求发送到下游节 点 Z。 c、 末节点收到业务倒换请求后， 若本节点是倒换点， 则停止在原连接 上接收业务， 开始从重路由连接上接收业务， 然后通知首节点倒换完成， 否 则直接通知首节点倒换完成。 如图 4, Z不是倒换点， 它便直接通知首节点 A倒换完成。 步骤 8: 首点收到末节点的业务倒换完成通知后， 启动原连接的删除过 程， 删除原连接， 至此， 重路由连接完成。 如图 5， 原连接已被删除， 剩下了传送业务的重路由连接。 从上述技术方案可以看出：在重路由连接建立完毕并且业务已桥接到重 路由连接后， 才开始执行业务倒换操作， 即终止从原连接接收业务并开始从 重路由连接上接收业务， 然后才删除原连接， 从而避免了业务中断， 或者可 以认为业务中断的时间可以忽略不计， 因为倒换操作是瞬时完成的， 而倒换 前， 业务是在无故障的原连接上传送和接收的。

Claims

权 利 要 求 书
1. 一种自动交换光网络中的软重路由方法， 其特征在于， 包括以下步骤： 步骤一：待重路由的原连接的首节点首先确定和原连接具有相同首 末节点的重路由连接的完整路由； 然后发起软重路由连接建立过程， 并 且在软重路由连接建立过程中， 重路由连接经过的所有桥接点执行桥接 操作；
步骤二： 首节点确认重路由连接建立完毕后， 向重路由连接的下游 节点发送业务倒换请求， 重路由连接经过的所有倒换点完成倒换操作 , 倒换完成后通知首节点业务倒换完成；
步骤三： 首节点收到业务倒换完成通知后， 删除原连接， 重路由连 接完成。
2. 如权利要求 1所述的自动交换光网络中的软重路由方法， 其特征在于， 所述重路由连接的完整路由是指重路由连接经过的所有节点和链路。
3. 如权利要求 1所述的自动交换光网络中的软重路由方法， 其特征在于， 所述步骤一具体包括以下步骤：
步骤 A: 待重路由的原连接的首节点确定和原连接具有相同首末节 点的重路由连接的完整路由；
步骤 B: 首节点开始重路由连接在本节点的建立过程， 并向重路由 连接的下一个节点发送软重路由连接建立请求； 这里的连接在本节点的 建立过程包括： 若本节点是桥接点， 则执行桥接操作；
步骤 C: 除末节点外的每个重路由连接的中间节点收到软重路由连 接建立请求后， 开始重路由连接在本节点的建立过程， 并向下一个节点 发送软重路由连接建立请求； 这里的连接在本节点的建立过程包括： 若 本节点是桥接点， 则执行桥接操作；
步骤 D: 末节点收到软重路由连接建立请求后， 开始重路由连接在 本节点的建立过程， 重路由建立完成后， 末节点通知重路由连接的上一 个节点重路由连接建立完成； 这里的连接在本节点的建立过程包括： 若 本节点是桥接点， 则执行桥接操作； 步骤 E: 除首节点外的每个重路由连接的中间节点收到重路由连接 建立完成通知后， 若重路由连接在本节点建立完毕， 则通知上一个节点 重路由连接建立完毕； 否则等重路由连接在本节点的建立完毕后再通知 上一个节点重路由连接建立完毕。
4. 如权利要求 1所述的自动交换光网络中的软重路由方法， 其特征在于， 所述首节点根据管理平面请求中的约束路由信息来确定重路由连接的完 整路由， 其中， 所述首节点在确定连接完整路由时， 计算连接完整路由 的方法为：
首节点根据当前路由拓朴资源计算出完整路由； 或者 请求其它控制单元计算出连接完整路由。
5. 如权利要求 1所述的自动交换光网络中的软重路由方法， 其特征在于， 所述步骤一由原连接的首节点自动触发或由人工触发。
6. 如权利要求 1所述的自动交换光网络中的软重路由方法， 其特征在于， 所述步骤二具体包括以下步骤：
a、 首节点确定重路由连接建立完成后， 在一定时间内监视重路由 连接， 若重路由连接无故障， 则进行下一步操作；
b、 若首节点是倒换点， 则执行倒换操作， 然后向重路由连接的下 游节点发送业务倒换操作请求， 否则直接将业务倒换操作请求发送给下 一个节点； 其中， 若重路由连接和原连接不共享链路连接资源， 首节点 可把倒换请求直接发送到目的节点或连接的下一个节点， 否则， 首节点 需把倒换请求发送到连接的下一个节点。
c、除末节点外的每个重路由连接的中间节点收到业务倒换请求后， 若本节点是倒换点， 则执行倒换操作， 然后将业务倒换操作请求发送给 下一个节点， 否则直接将业务倒换请求发送给下一个节点；
d、 末节点收到业务倒换请求后， 若本节点是倒换点， 则先执行倒 换操作， 然后经过通知首节点业务倒换操作完成， 否则通知首节点业务 倒换操作完成。
7. 如权利要求 1所述的自动交换光网络中的软重路由方法， 其特征在于， 所述重路由连接和原连接可以使用相同传送网络中的链路连接资源。 θ 如权利要求 1或 3所述的自动交换光网络中的软重路由方法， 其特征在 于， 所述步骤 B中的软重路由连接建立请求中包含重路由连接标识。
PCT/CN2008/000008 2007-11-21 2008-01-02 Procédé de reroutage conditionnel dans un réseau optique commuté automatique WO2009065279A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP08700568.2A EP2219328B1 (en) 2007-11-21 2008-01-02 A method for soft re-routing in ASON
ES08700568.2T ES2526396T3 (es) 2007-11-21 2008-01-02 Un método de reencaminamiento suave en ASON

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN2007101245877A CN101170494B (zh) 2007-11-21 2007-11-21 自动交换光网络中的软重路由方法
CN200710124587.7 2007-11-21

Publications (1)

Publication Number Publication Date
WO2009065279A1 true WO2009065279A1 (fr) 2009-05-28

Family

ID=39390967

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2008/000008 WO2009065279A1 (fr) 2007-11-21 2008-01-02 Procédé de reroutage conditionnel dans un réseau optique commuté automatique

Country Status (5)

Country Link
EP (1) EP2219328B1 (zh)
CN (1) CN101170494B (zh)
ES (1) ES2526396T3 (zh)
PT (1) PT2219328E (zh)
WO (1) WO2009065279A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
RU2479943C1 (ru) * 2009-08-10 2013-04-20 Зти Корпорейшн Способ и устройство миграции услуг защиты соединений подсетей

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102624602A (zh) * 2011-01-31 2012-08-01 华为技术有限公司 标签交换路径处理方法和系统以及节点设备
CN102843618B (zh) * 2011-06-20 2017-09-29 中兴通讯股份有限公司 Ason与传统网络对接时sncp保护的方法及装置

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1520102A (zh) * 2003-01-22 2004-08-11 华为技术有限公司 一种建立和删除分叉标记交换路径的方法
CN1588890A (zh) * 2004-10-08 2005-03-02 烽火通信科技股份有限公司 Ason网络中控制平面参与保护倒换的方法
CN1710869A (zh) * 2005-07-14 2005-12-21 广东省电信有限公司研究院 自动交换光网络中连接的增强型主备保护的实现方法
CN1710993A (zh) 2004-06-18 2005-12-21 华为技术有限公司 智能光网络中的业务路径优化方法

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3578960B2 (ja) * 2000-02-28 2004-10-20 日本電信電話株式会社 超高速光パケット転送リングネットワーク、光挿入分岐型多重分離ノード装置及び光挿入分岐型多重分離ノード装置の動作方法
DE60230446D1 (de) * 2001-09-04 2009-01-29 Rumi Sheryar Gonda Verfahren zum unterstützen von sdh/sonet-aps auf ethernet
US20060013210A1 (en) * 2004-06-18 2006-01-19 Bordogna Mark A Method and apparatus for per-service fault protection and restoration in a packet network
CN1866806B (zh) * 2005-12-22 2011-11-02 华为技术有限公司 共享格状网恢复的实现方法
WO2007071114A1 (fr) * 2005-12-23 2007-06-28 Zte Corporation Procede pour le reacheminement sans interruption en reseau optique

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1520102A (zh) * 2003-01-22 2004-08-11 华为技术有限公司 一种建立和删除分叉标记交换路径的方法
CN1710993A (zh) 2004-06-18 2005-12-21 华为技术有限公司 智能光网络中的业务路径优化方法
CN1588890A (zh) * 2004-10-08 2005-03-02 烽火通信科技股份有限公司 Ason网络中控制平面参与保护倒换的方法
CN1710869A (zh) * 2005-07-14 2005-12-21 广东省电信有限公司研究院 自动交换光网络中连接的增强型主备保护的实现方法

Non-Patent Citations (1)

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

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
RU2479943C1 (ru) * 2009-08-10 2013-04-20 Зти Корпорейшн Способ и устройство миграции услуг защиты соединений подсетей
US8554073B2 (en) 2009-08-10 2013-10-08 Zte Corporation Method and apparatus for migrating sub-network connection protection (SNCP) service

Also Published As

Publication number Publication date
EP2219328B1 (en) 2014-11-19
EP2219328A4 (en) 2013-01-16
CN101170494B (zh) 2010-06-02
EP2219328A1 (en) 2010-08-18
ES2526396T3 (es) 2015-01-12
CN101170494A (zh) 2008-04-30
PT2219328E (pt) 2014-12-22

Similar Documents

Publication Publication Date Title
CN1866806B (zh) 共享格状网恢复的实现方法
US8068483B2 (en) Method for migration between a permanent connection and a switched connection in a transmission network
US20020172149A1 (en) Method and apparatus for protection path setup
WO2006026930A1 (fr) Procede de restauration d'un service de maillage optique
JP3914087B2 (ja) シグナリング制御方法及びシグナリング対応通信装置及びネットワーク管理システム
WO2007128176A1 (fr) Procédé de commutation de service et noeud de réseau associé
US20070274224A1 (en) Path setting method, node device, and monitoring/control device
US20050232231A1 (en) Path setting method and communication apparatus in communication network performing communications through a plurality of layers
WO2005122442A1 (fr) Procede d'execution d'associations dans un reseau optique a commutation automatique
WO2023015897A1 (zh) 一种光网络智能控制方法、装置及系统
WO2010028560A1 (zh) 在mesh网络中实现永久环网保护的方法
WO2008064612A1 (fr) Procédé, dispositif et système permettant d'effectuer un reroutage rapide dans un réseau mpls
US20100128640A1 (en) Apparatus and method for calculating an optimum route between a pair of nodes in a communication network
EP2328307B1 (en) Barrier boundary node and method for establishing connection between barrier bound ary nodes
CN101860769B (zh) 一种ip与光融合的方法、装置和系统
JP2009060673A (ja) 経路計算システム、経路計算方法、及び通信ノード
WO2009065279A1 (fr) Procédé de reroutage conditionnel dans un réseau optique commuté automatique
US20040125745A9 (en) Two-stage reconnect system and method
US20030043427A1 (en) Method of fast circuit recovery using local restoration
WO2010111919A1 (zh) 一种自动交换光网络业务错联阻错的方法及系统
CN109005473B (zh) 一种协同选择路径的方法、装置及系统
CN102201970B (zh) 一种对关联双向lsp进行路由优化的方法及系统
WO2008040254A1 (fr) Procédé de traitement destiné aux informations de liaison d'ingénierie de trafic
CN113169939B (zh) 一种业务路径建立的方法、网络设备和系统
WO2007071114A1 (fr) Procede pour le reacheminement sans interruption en reseau optique

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

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 2008700568

Country of ref document: EP