WO2008037124A1 - Procédé de requête de recherche dans un réseau optique à commutation automatique - Google Patents

Procédé de requête de recherche dans un réseau optique à commutation automatique Download PDF

Info

Publication number
WO2008037124A1
WO2008037124A1 PCT/CN2006/002581 CN2006002581W WO2008037124A1 WO 2008037124 A1 WO2008037124 A1 WO 2008037124A1 CN 2006002581 W CN2006002581 W CN 2006002581W WO 2008037124 A1 WO2008037124 A1 WO 2008037124A1
Authority
WO
WIPO (PCT)
Prior art keywords
routing
route
signaling
network element
query request
Prior art date
Application number
PCT/CN2006/002581
Other languages
English (en)
French (fr)
Inventor
Desheng Sun
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 BRPI0622033-9A priority Critical patent/BRPI0622033B1/pt
Priority to PL06791167T priority patent/PL2071811T3/pl
Priority to PT67911677T priority patent/PT2071811E/pt
Priority to ES06791167T priority patent/ES2402778T3/es
Priority to JP2009529490A priority patent/JP4778586B2/ja
Priority to EP20060791167 priority patent/EP2071811B1/en
Priority to US12/443,123 priority patent/US8055131B2/en
Priority to PCT/CN2006/002581 priority patent/WO2008037124A1/zh
Priority to CN2006800373903A priority patent/CN101283569B/zh
Priority to KR1020097008776A priority patent/KR101021621B1/ko
Publication of WO2008037124A1 publication Critical patent/WO2008037124A1/zh

Links

Classifications

    • 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
    • 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
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • 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/02—Topology update or discovery
    • H04L45/10—Routing in connection-oriented networks, e.g. X.25 or ATM
    • 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
    • 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/0088—Signalling aspects

Definitions

  • the present invention relates to the field of optical networks, and in particular, to a route query method for automatically switching optical networks.
  • Optical network such as OTN (Optical Transmission Network), WDM (Wavelength-division multiplexing), SDH (Synchronous Digital Hierarchy) or SONET (Synchronous Optical Network)
  • OTN Optical Transmission Network
  • WDM Widelength-division multiplexing
  • SDH Synchronous Digital Hierarchy
  • SONET Synchronous Optical Network
  • ASON Automatic switched optical network
  • the ITU-T G.8080 recommendation proposes the concept of ASON, which is implemented by setting up a special Control Plane (CP).
  • CP Control Plane
  • the ITU-T Recommendation G.7713 specifies the implementation framework for distributed call and connection in ASON networks, and provides implementation specifications for the automatic establishment, modification and deletion of calls and connections.
  • Standards such as ITU-T G.7715 provide implementation models and methods and methods for connected route queries (route queries described in the following sections, unless otherwise stated, refer to connected route queries).
  • connection control component responsible for connection control (including establishment, deletion, modification, etc.) to the routing control and routing calculation when an ASON network element (referred to as NE) needs to query the connection route.
  • the component (referred to as RC) initiates a route query request (referred to as Route Request), and the RC invokes a routing algorithm according to the request (a commonly used routing algorithm is a constraint-based shortest path algorithm, referred to as CSPF), which is based on the local routing database (referred to as RDB).
  • CSPF constraint-based shortest path algorithm
  • the RDB of a node is generally difficult to have complete routing information of the entire ASON network, so the model method shown in Figure 1 often cannot meet the requirements of routing query and calculation.
  • related technical proposals have proposed a model as shown in FIG. 2. The model is based on the model shown in Figure 1.
  • the RC invokes CSPF according to the request, and completes the route calculation based on the RDB of the node. If the related route is not queried, the local RC sends a Route Request to the other ASON NEs with more complete RDBs through the protocol control component (PC).
  • PC protocol control component
  • the RC of the relevant ASON NE receives the Route Request through the PC, and calls CSPF.
  • the route calculation is completed based on the RDB of the local node, and the result is returned to the ASON network element that initiated the request.
  • This ASON network element returns the routing result to the CC.
  • ITU-T G.8080 recommends that the ASON control plane adopt a flexible architecture, that is, any ASON network element may be missing some components, such as RC. In this case, the ASON NE needs to be queried. If there is no RC, the route query problem cannot be solved by using the method shown in Figure 1 or Figure 2. Summary of the invention
  • the technical problem to be solved by the present invention is to provide a route query method for automatically exchanging an optical network, which solves the problem of routing query when an ASON network element lacks RC.
  • the present invention provides an automatic exchange optical network route query method for implementing a route query including a protocol control component PC and a connection control component CC but lacking a network element of the route control component RC, the method comprising the following steps:
  • the network element NE1 lacking the RC sends a route query request signaling to the remote network element NE2 when the local network element CC needs to query the route;
  • the network element NE2 obtains a routing result according to the routing query request, and returns a routing result to the network element NE1 that initiates the routing query request by using the routing result signaling;
  • the PC of NE1 After receiving the routing result signaling, the PC of NE1 sends the routing result back to the local network element CC. Further, the step (1) includes:
  • the network element NE1 constructs a route query request signal by the CC when the CC determines that the route needs to be queried;
  • the routing query request signaling is sent to the remote network element NE2 by the PC of the network element NE1.
  • the remote network element NE2 includes an RC, a PC, and an automatic switched optical network.
  • the routing database RDB of the complete routing information of the ASON, the step (2) includes: after receiving the routing query request signaling, the PC of the NE2 forwards the signaling to the NE2
  • the RC of the E2 completes the route calculation according to the route query request, the call routing algorithm, the NE2-based RDB, and constructs the route calculation for the knot signaling;
  • the route calculation result signaling is returned to the router that initiates the route query request by the PC of the NE2.
  • step (2) further includes:
  • the NE3 includes RC, PC and a complete RDB;
  • the PC of the NE3 After receiving the routing query request signaling, the PC of the NE3 forwards the signaling to the RC of the NE3;
  • the RC of the NE3 invokes a routing algorithm according to the received routing query request, and performs routing calculation based on the DB of the local network element. After the success, the route calculation result signaling is constructed.
  • the PC of the NE3 returns the route calculation result signaling to the network element NE2 and the network element NE1 step by step until the CC of the NE1 receives the route calculation result.
  • the step (2) includes: the PC of the NE2 receives the After routing query request signaling, the signaling is forwarded to NE2.
  • the CC of the NE2 sends a route query request of the NE2 to the RC of the NE2 according to the route query request;
  • the RC of the NE2 performs a route query request sent by the CC of the NE2, invokes a routing algorithm, completes a route calculation based on the R2 of the NE2, and returns the routing result to the CC of the NE2;
  • the CC of the NE2 constructs a routing calculation result signaling according to the received routing result, and returns the signaling to the network element E1 that initiates the routing query request by using the PC of the NE2. Further, the step (2) further includes:
  • the NE3 includes R (:, PC and a complete RDB;
  • the PC of the NE3 After receiving the routing query request signaling, the PC of the NE3 forwards the signaling to the RC of the NE3;
  • the RC of the NE3 invokes a routing algorithm, and performs routing calculation based on the RDB of the local network element, and successfully constructs a routing calculation result signaling after successful;
  • the PC of the NE3 returns the route calculation result signaling to the network element NE2, and the CC of the NE2 reconstructs the route according to the route calculation and calculates the knot signal to be sent to the network element NE1 until the CC of the NE1 receives the route. Calculation results.
  • routing algorithm described above is a constrained shortest path algorithm CSPF.
  • the method of the present invention can perform the routing query work when the network element lacks the RC by using the signaling to interact with the remote network element, and is compatible with the existing route query technology, and has the advantages of simplicity and reliability.
  • FIG. 1 is a schematic diagram of route query of a single ASON network element in the prior art
  • FIG. 2 is a schematic diagram of a single network element of an ASON that needs to cooperate with a remote ASON network element to implement route query because there is no complete RDB;
  • FIG. 3 is a schematic diagram of a route query performed by a CC-RC collaborative mode between an ASON network element lacking RC and a remote ASON network element;
  • FIG. 4 is a schematic diagram of a route query performed by an ASON network element lacking RC and a remote ASON network element through CC-CC cooperation;
  • FIG. 5 is a schematic diagram of implementing a route query in a cooperative manner based on the ASON network element lacking RC and the remote multiple ASON network elements shown in FIG. 3;
  • FIG. 6 is a schematic diagram of implementing route query based on the lack of RC ASON network element and the remote multiple ASON network elements shown in FIG. Preferred embodiment of the invention
  • the present invention solves the problem that the ASON network element lacking RC cannot implement the route query function, and proposes an implementation strategy according to the prior art.
  • the core of the present invention is to complete the route query function according to the cooperation between the existing CC component of the ASON network element and the remote network element.
  • the feature is that: the ASON network element lacking the RC needs to query the route, and the CC passes the routing request through the protocol signaling (for example, the Open End Path Protocol, referred to as OSPF-TE; the resource reservation protocol, referred to as RSVP-TE)
  • OSPF-TE Open End Path Protocol
  • RSVP-TE resource reservation protocol
  • FIG. 1 is a schematic diagram of a route query performed by a single ASON network element through a local CC and an RC interaction in the background;
  • FIG. 2 is a schematic diagram of a single network element that needs to cooperate with a remote ASON network element to complete a route query because there is no complete RDB;
  • Figure 4 shows the ASON NE that lacks the RC interacts with the CC of the remote ASON NE through the local CC.
  • FIG. 5 is a schematic diagram of a route query further extended based on FIG. 3;
  • FIG. 6 is a schematic diagram of a route query further extended based on FIG.
  • FIG. 3 two NEs of NE1 and NE2 are shown in FIG. 3, wherein NE1 lacks RC, and NE1 needs to complete the route query function as an example to illustrate the implementation of the method according to the present invention.
  • the specific embodiment 1 includes the following steps:
  • step 301 the CC determines that the route needs to be queried, and proceeds to the next step. If the route is not required to be queried, the detection is continued.
  • Step 302 The CC of the NE1 constructs a route query request signaling, and sends the route query request signaling to the network element NE2 through the PC of the NE1.
  • Step 303 the PC of the NE2 receives the route query request signaling of the NE1, and then, the PC will This signaling is forwarded to the RC of NE2;
  • Step 304 The RC of the NE2 invokes the CSPF according to the received routing query request, and completes the route calculation based on the RDB of the local network element node.
  • Step 305 The RC of the NE2 constructs signaling according to the routing result, and sends, by using the PC, signaling that carries the routing result to the NE1.
  • Step 306 After receiving the feedback routing result signaling, the PC of the NE1 transmits the related routing result to the local node cc.
  • FIG. 4 two NEs of NE1 and NE2 are shown in FIG. 4, wherein NE1 lacks RC, and NE1 needs to complete the route query function as an example, and the second embodiment of the method of the present invention is illustrated. .
  • the specific embodiment 2 includes the following steps:
  • Step 401 NE1 shown in FIG. 4, the CC determines that the route needs to be queried, and proceeds to the next step; Step 402, the CC of the NE1 constructs a route query request signaling, and sends the route query request message to the NE2 through the local PC. Order
  • Step 403 The PC of the NE2 receives the route query request signaling of the NE1, and the PC of the NE2 forwards the signaling to the CC of the local network element.
  • Step 404 The CC component of the NE2 sends a route query request of the NE1 to the RC according to the received signaling, and the RC invokes a routing algorithm to complete the route calculation based on the RDB of the node.
  • Step 405 The RC of the NE2 returns the routing result to the CC of the local network element, and the CC constructs signaling according to the result, and sends the signaling carrying the routing result to the NE1 by using the local PC.
  • Step 406 After receiving the route feedback, the PC of the NE1 transmits the related routing result to the local element node CC.
  • Step 501 NE1 shown in FIG. 5, the CC determines that the route needs to be queried, and proceeds to the next step;
  • Step 502 The CC of the NE1 constructs a route query request signaling, and sends the signal to the NE2 through the local PC;
  • Step 503 the PC of the NE2 receives the route query request signaling of the NE1, and the PC forwards the signal to the RC of the NE2;
  • Step 504 The RC of the NE2 invokes the CSPF according to the received routing query request, and completes the route calculation based on the RDB of the node.
  • Step 505 The RC of the NE2 determines the routing result. If the result is that the query fails, and the failure reason is that the local RDB is incomplete, the RC constructs the signaling of the route query request again, and sends the signaling to the NE3 through the PC.
  • Step 506 The PC of the NE3 receives the signaling of the route query request, and the PC of the NE3 forwards the signal to the RC component of the NE3.
  • Step 507 the RC of the NE3 invokes a routing algorithm according to the received routing query request, and completes the route calculation based on the RDB of the node;
  • Step 508 The RC of the NE3 determines that the route query is successful, and constructs signaling according to the routing result, and sends the signaling carrying the routing result to the NE2 through the PC, and finally transmits the NE1 to the original route query request through the NE2.
  • Step 509 After receiving the route feedback, the PC of the NE1 transmits the related routing result to the node CC.
  • FIG. 6 there are three network elements NE1, NE2, and NE3 shown in FIG. 6, where NE1 lacks RC, and NE2's RDB is incomplete. NE1 needs to complete the route query function as an example. Embodiment 4 of the method of the present invention.
  • Step 601 NE1 shown in FIG. 6, the CC judges that the route needs to be queried, and proceeds to the next step; Step 602, the CC of the NE1 constructs a route query request signaling, and passes the local PC to NE2 sends;
  • Step 603 the PC of the NE2 receives the route query request signaling of the NE1, and the PC of the NE2 forwards the signaling to the CC of the NE2;
  • Step 604 The CC component of the NE2 sends a route query request of the NE1 to the RC of the NE2 according to the received signaling, and the RC invokes a routing algorithm to complete the route calculation based on the local node R B.
  • Step 605 The RC of the NE2 determines the routing result. If the result is that the query fails, and the failure reason is that the local RDB is incomplete, the RC constructs the signaling of the routing query request again, and sends the signaling to the NE3 through the PC.
  • Step 606 The PC of the NE3 receives the signaling of the route query request, and the PC of the NE3 forwards the signal to the RC component of the NE3.
  • Step 607 The RC of the NE3 invokes a routing algorithm according to the received routing query request, and completes the route calculation based on the RDB of the node;
  • Step 608 The RC of the NE3 determines that the route query is successful.
  • the RC constructs the signaling according to the routing result, and sends the signaling carrying the routing result to the NE1 through the PC.
  • the RC of the NE2 returns the routing result.
  • the network element CC and then the CC constructs signaling according to the result, and sends the signaling carrying the routing result to the NE1 by using the PC;
  • Step 609 After receiving the route feedback, the PC of the NE1 transmits the related routing result to the node cc.
  • NE2 if NE2 receives the NE1 request, the calculation of the route fails, unless there is no other NE to choose from, a response to the failure of the route query is returned, otherwise the request should be continuously sent to other NEs. If the remote NE NE2 also has no RC, NE2 can send a request to the next remote NE NE3; or, the return route calculation fails.
  • the present invention uses the RC of the network element to interact with the CC or RC of the remote network element through the CC of the network element.
  • the end network element or multiple remote network elements complete the route query work, which has the advantages of simplicity and reliability.
  • the invention discloses an automatic switched optical network route query method, which is used for implementing route query of a network element including a protocol control component PC and a connection control component CC but lacking a route control component RC, and the network element NE1 lacking the RC
  • the remote network element NE2 sends the routing query request signaling, and the NE2 obtains the routing result according to the routing query request, and returns the routing result to the network element NE1 that initiates the routing query request by the routing result signaling, and the PC of the network element NE1 receives the routing result. After the signaling, the routing result is sent back to the local network element CC.
  • the method of the present invention interacts with the CC or RC of the remote network element by means of the protocol signaling, and completes the route query work through a remote network element or multiple remote network elements, which has the advantages of being clean and reliable, and can be applied to Data field, in the automatic exchange of optical networks.

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)
  • Telephonic Communication Services (AREA)

Description

一种自动交换光网络路由查询方法
技术领域
本发明涉及光网络领域， 尤其涉及一种自动交换光网络的路由查询方 法。
背景技术
光网络， 例如 OTN ( Optical transmission network, 光传送网络）、 WDM ( Wavelength-division multiplexing, 波分复用 ) 、 SDH ( Synchronous digital hierarchy, 同步数字系列）或 SONET ( Synchronous optical network, 同步光 网络）传送网， 在电信领域已经得到广泛应用。
自动交换光网絡（ Automatic switched optical network, 简称 ASON )是 近年来光网络领域的研究热点。 ITU-T G.8080建议提出了 ASON的概念， 通过设置专门的控制平面 （Control Plane, 简称 CP ) 完成 ASON网络的功 能。 ITU-T G.7713建议规定了 ASON网络中分布式呼叫与连接的实现框架， 为呼叫、 连接的自动建立、 修改和删除等提供了实现规范。 ITU-T G.7715 等标准为连接的路由查询提供了实现模型与方式、 方法（以下部分描述的路 由查询， 除非特别声明， 否则都是指连接的路由查询） 。
然而， 现颁布的 ITU-T G.7715、 ITU-T G.7715.1都是采用如图 1所示的 模型。 这种路由模型是某个 ASON网元（英文简称 NE )需要查询连接路由 时， 负责连接控制（包括建立、 删除、 修改等）的连接控制組件（简称 CC ) 向负责路由查询和计算的路由控制组件 （简称 RC )发起连接的路由查询请 求（简称 Route Request ) , RC根据请求调用路由算法 （常用的路由算法为 基于约束的最短路径算法， 简称 CSPF )，该算法基于本节点路由数据库（简 称 RDB )完成路由计算，并向 CC返回路由计算结果（简称 Route Response )。
然而， 一个节点的 RDB—般很难拥有完备的整个 ASON网络的路由信 息， 这样图 1所示模型方法往往不能满足路由查询和计算的要求。 为此， 近 年来相关技术提案提出如图 2所示的模型。该模型是在图 1所示模型的基础 上扩展而来， 即， 当某个 ASON 网元 NE的 CC向 RC发起连接的路由查询 请求（Route Request ) 时， RC根据请求调用 CSPF, 基于本节点 RDB完成 路由计算。如果查询不到相关路由，则本地 RC通过协议控制组件（简称 PC )， 向相关其他具有更完备 RDB的 ASON网元传递 Route Request, 相关 ASON 网元的 RC通过 PC接收到此 Route Request, 调用 CSPF， 基于本节点 RDB 完成路由计算， 并将结果返回到发起请求的 ASON网元。 此 ASON网元将 路由结果返回到 CC。
ITU-T G.8080建议 ASON控制平面采用灵活的构架， 即任何 ASON网 元都有可能缺少某些组件， 例如 RC。 这样， 需要查询路由的 ASON网元， 如果没有 RC, 无论采用图 1还是图 2所示的方法， 都无法解决路由查询问 题。 发明内容
本发明所要解决的技术问题在于提供一种自动交换光网络的路由查询 方法， 解决当某个 ASON网元缺少 RC时的路由查询问题。
本发明提供一种自动交换光网络路由查询方法，用于实现包括协议控制 组件 PC和连接控制组件 CC但缺少路由控制组件 RC的网元的路由查询， 所述方法包括如下步骤：
( 1 ) 所述缺少 RC的网元 NE1在本网元 CC需要查询路由时， 向远端 网元 NE2发送路由查询请求信令；
( 2 )所述网元 NE2根据路由查询请求得到路由结果， 通过路由结果信 令向所述发起路由查询请求的网元 NE1返回路由结果；
( 3 )网元 NE1的 PC收到路由结果信令后，将路由结果传回本网元 CC。 进一步地， 所述步骤（ 1 ) 包括：
所述网元 NE1在 CC判断需要查询路由时， 由 CC构造路由查询请求信 令；
通过该网元 NE1的 PC向远端网元 NE2发送所述路由查询请求信令。 进一步地， 所述远端网元 NE2 包括 RC、 PC 和具有自动交换光网絡 ASON的完备路由信息的路由数据库 RDB, 则所述步骤（2 ) 包括： 所述 NE2的 PC接收到路由查询请求信令后， 将该信令转发至 NE2的
RC;
所述 E2的 RC根据路由查询请求、 调用路由算法、 基于 NE2的 RDB 完成路由计算， 并构造路由计算结杲信令；
通过 NE2 的 PC 将该路由计算结果信令返回至发起路由查询请求的 丽。
进一步地， 所述步骤（2 )进一步包括：
所述 NE2的 RC完成路由计算后，判断路由失败未找到所请求的路由信 息， 则该 RC依所述路由查询请求构造路由查询请求信令， 通过 NE2的 PC 发送至其它远端网元 NE3 , 该 NE3包括 RC、 PC和完备的 RDB;
所述 NE3的 PC接收到所述路由查询请求信令后，将该信令转发给 NE3 的 RC;
所述 NE3的 RC根据接收的路由查询请求，调用路由算法，基于本网元 DB完成路由计算， 成功后， 构造路由计算结果信令；
所述 NE3的 PC将该路由计算结果信令逐级返回到网元 NE2、网元 NE1, 直到 NE1的 CC收到所述路由计算结果。
进一步地， 如果所述远端网元 NE2包括 RC；、 PC、 CC和具有自动交换 光网络 ASON的完备路由信息的路由数据库 RDB， 则所述步骤（2 ) 包括： 所述 NE2的 PC接收到路由查询请求信令后， 将该信令转发至 NE2的
CC;
该 NE2的 CC根据路由查询请求， 向 NE2的 RC发送 NE2的路由查询 请求；
该 NE2的 RC根据 NE2的 CC发送来的路由查询请求， 调用路由算法、 基于 NE2的 RDB完成路由计算， 并将路由结果返回至 NE2的 CC;
所述 NE2的 CC根据收到的所述路由结果构造路由计算结果信令，将该 信令通过 NE2的 PC返回至发起路由查询请求的所述网元 E1。 进一步地， 所述步骤（2 )进一步包括：
所述 NE2的 RC完成路由计算后，判断路由失败未找到所请求的路由信 息， 则该 RC依所述路由查询请求构造路由查询请求信令， 通过 NE2的 PC 发送至其它远端网元 NE3, 该 NE3包括 R (：、 PC和完备的 RDB;
所述 NE3的 PC接收到所述路由查询请求信令后，将该信令转发给 NE3 的 RC;
所述 NE3的 RC根据接收的路由查询请求，调用路由算法，基于本网元 RDB完成路由计算， 成功后， 构造路由计算结果信令；
所述 NE3的 PC将该路由计算结果信令返回到网元 NE2, 由 NE2的 CC 根据路由计算结杲重新构造路由计算结杲信令发送到网元 NE1,直到 NE1的 CC收到所述路由计算结果。
进一步地， 上面所述路由算法是基于约束的最短路径算法 CSPF。
应用本发明所述的方法， 能够通过信令与远端网元交互， 完成在本网元 缺少 RC时的路由查询工作， 同时兼容现有的路由查询技术， 具备简洁、 可 靠的优点。 附图概迷
图 1是现有技术中单个 ASON网元的路由查询示意图；
图 2是 ASON单个网元因没有完备的 RDB而需要与远端 ASON网元通 过协作方式实现路由查询的示意图；
图 3是缺乏 RC的 ASON网元与远端 ASON网元通过 CC-RC协作方式 实现路由查询的示意图；
图 4是缺乏 RC的 ASON网元与远端 ASON网元通过 CC-CC协作方式 实现路由查询的示意图；
图 5是基于图 3所示的缺乏 RC的 ASON网元与远端多个 ASON网元通 过协作方式实现路由查询的示意图； 图 6是基于图 4所示的缺乏 RC的 ASON网元与远端多个 ASON网元通 过协作方式实现路由查询的示意图。 本发明的较佳实施方式
下面结合附图和实施例对本发明作进一步的详细说明。
本发明为解决目前缺乏 RC的 ASON网元无法实现路由查询功能，依据 现有技术提出一种实现策略。本发明的核心是依据 ASON网元已有的 CC组 件与远端网元通过协作方式， 完成路由查询功能。 其特点在于， 包括： 缺少 RC的 ASON网元需要查询路由时，其 CC将路由请求通过协议信令（例如， 开放式最端路径协议， 简称 OSPF-TE; 资源预留协议， 简称 RSVP-TE等等） 向远端 ASON网元发送； 远端 ASON网元的 CC或 RC接收到此请求后， 通 过本节点完成路由计算； 之后， 将路由结果返回至发起请求的网元。
图 1是背景技术中单个 ASON网元通过本地 CC及 RC交互完成路由查 询的示意图； 图 2是单个网元由于没有完备的 RDB而需要和远端 ASON网 元协作完成路由查询的示意图； 图 3通过本地 CC与远端 ASON网元的 RC 直接交互， 通过远端 ASON网元的 RC完成路由查询功能的示意图； 图 4是 缺乏 RC的 ASON网元通过本地 CC与远端 ASON网元的 CC交互， 通过远 端 ASON网元的 RC完成路由查询功能的示意图；图 5是基于图 3进一步扩 展的路由查询的示意图； 图 6是基于图 4进一步扩展的路由查询的示意图。
下面结合图 1、图 2和图 3, 以图 3所示 NE1、 NE2两个网元，其中 NE1 缺乏 RC, NE1需要完成路由查询功能为例， 说明本发明所述方法的实施方 案。
该具体实施方案 1 , 包括如下步骤：
步骤 301， 如图 3所示的 NE1 , 其 CC判断需要查询路由， 并转入下一 步， 如果不需要查询路由， 则继续进行检测判断；
步骤 302, NE1的 CC构造路由查询请求的信令， 并通过本网元 NE1的 PC向网元 NE2发送该路由查询请求信令；
步骤 303， NE2的 PC接收到 NE1的路由查询请求信令， 然后， PC将 此信令转发至 NE2的 RC;
步骤 304， NE2的 RC根据接收到的路由查询请求， 调用 CSPF, 基于 本网元节点的 RDB完成路由计算；
步骤 305， NE2的 RC根据路由结果构造信令， 通过 PC将承载该路由 结果的信令向 NE1发送；
步骤 306， NE1的 PC接收到反馈的路由结果信令后， 将相关路由结果 传送至本节点 cc。
下面结合图 1、 图 2和图 4, 以图 4所示 NE1、NE2两个网元，其中 NE1 缺乏 RC, NE1需要完成路由查询功能为例， 说明本发明所述方法的第二种 实施方案。
该具体实施方案 2, 包括如下步驟：
步骤 401 , 图 4所示的 NE1， 其 CC判断需要查询路由， 并转入下一步； 步骤 402, NE1的 CC构造路由查询请求的信令， 并通过本地的 PC向 NE2发送该路由查询请求信令；
步骤 403, NE2的 PC接收到 NE1 的路由查询请求信令， 本网元 NE2 的 PC将此信令转发至本网元的 CC;
步骤 404， NE2的 CC组件根据接收到的信令， 将 NE1的路由查询请求 发送至 RC， RC调用路由算法， 基于本节点 RDB完成路由计算；
步骤 405, NE2的 RC将路由结果返回本网元的 CC,该 CC根据此结果 构造信令， 通过本地 PC将承载该路由结果的信令向 NE1发送；
步骤 406, NE1的 PC接收到路由反馈后， 将相关路由结果传送至本网 元节点 CC。
结合图 1、 图 2、 图 3和图 5, 以图 5所示 NE1、 NE2、 NE3三个网元， 其中 NE1缺乏 RC, NE2的 RDB不完备， NE1需要完成路由查询功能为例， 说明根据本发明所述方法的的实施方案 3。 具体实施方案 3 , 包括如下步骤：
步骤 501， 图 5所示的 NE1 , 其 CC判断需要查询路由， 并转入下一步； 步骤 502, NE1的 CC构造路由查询请求的信令， 并通过本地的 PC向 NE2发送；
步骤 503, NE2的 PC接收到 NE1的路由查询请求信令， 该 PC将此信 令转发至 NE2的 RC;
步骤 504， NE2的 RC根据接收到的路由查询请求， 调用 CSPF, 基于 本节点 RDB完成路由计算；
步骤 505, NE2的 RC判断路由结果， 如果结果为查询失败， 失败原因 示是本地 RDB不完备， 则 RC再次构造此路由查询请求的信令， 并通过 PC 向 NE3发送；
步骤 506, NE3的 PC接收到路由查询请求的信令， NE3的 PC将此信 令转发至 NE3的 RC组件；
步骤 507， NE3的 RC根据接收到的路由查询请求， 调用路由算法， 基 于本节点 RDB完成路由计算；
步骤 508， NE3的 RC判断路由查询成功， 并根据路由结果构造信令， 通过 PC将承载该路由结果的信令向 NE2发送， 最后通过 NE2传送到最初 发起路由查询请求的 NE1。
步骤 509, NE1的 PC接收到路由反馈后， 将相关路由结果传送至本节 点 CC。
结合图 1、 图 2、 图 4和图 6, 以图 6所示 NE1、 NE2、 NE3三个网元， 其中 NE1缺乏 RC, NE2的 RDB不完备， NE1需要完成路由查询功能为例， 说明依据本发明所述方法的实施方案 4。
具体实施方案 4, 包括如下步骤：
步骤 601 , 图 6所示的 NE1 , 其 CC判断需要查询路由， 并转入下一步； 步骤 602, NE1的 CC构造路由查询请求的信令， 并通过本地的 PC向 NE2发送；
步骤 603, NE2的 PC接收到 NE1的路由查询请求信令， NE2的 PC将 此信令转发至 NE2的 CC;
步骤 604, NE2的 CC组件根据接收到的信令， 将 NE1的路由查询请求 发送至 NE2的 RC：， 该 RC调用路由算法， 基于本节点 R B完成路由计算。
步骤 605， NE2的 RC判断路由结果， 如果结果为查询失败， 失败原因 是本地 RDB不完备， 则 RC再次构造此路由查询请求的信令， 并通过 PC向 NE3发送；
步骤 606, NE3的 PC接收到路由查询请求的信令， NE3的 PC将此信 令转发至 NE3的 RC组件；
步骤 607， NE3的 RC根据接收到的路由查询请求， 调用路由算法， 基 于本节点 RDB完成路由计算；
步骤 608, NE3的 RC判断路由查询成功， 此 RC根据路由结果构造信 令， 通过 PC将承载该路由结果的信令向 NE1 的方向发送， 当传送至 NE2 时， 此 NE2的 RC将路由结果返回本网元 CC, 再由 CC根据此结果构造信 令， 通过 PC将承载该路由结果的信令向 NE1发送；
步驟 609， NE1的 PC接收到路由反馈后， 将相关路由结果传送至本节 点 cc。
在本发明中， 如果 NE2收到 NE1请求后， 计算路由失败， 除非没有其 他 NE可供选择， 返回一个路由查询失败的响应， 否则应该向其它的 NE继 续发送请求。 如果远端网元 NE2也是没有 RC, NE2可以再向下一远端网元 NE3发送请求； 或者， 返回路由计算失败。
从上面各个具体实施方式分析可知， 本发明以当前需要查询路由的 ASON网元没有 RC为出发点， 通过该网元的 CC, 借助协议信令与远端网 元的 CC或 RC交互，通过一个远端网元或多个远端网元完成路由查询工作， 具备简洁、 可靠的优点。
当然， 本发明还可有其他多种实施例， 在不背离本发明精神及其实盾的 情况下， 熟悉本领域的技术人员当可根据本发明作出各种相应的改变和变 形， 但这些相应的改变和变形都应属于本发明所附的权利要求的保护范围。 工业实用性
本发明所公开的一种自动交换光网络路由查询方法，用于实现包括协议 控制组件 PC和连接控制组件 CC但缺少路由控制组件 RC的网元的路由查 询，所迷缺少 RC的网元 NE1向远端网元 NE2发送路由查询请求信令， NE2 根据路由查询请求得到路由结果，通过路由结果信令向所述发起路由查询请 求的网元 NE1返回路由结果， 网元 NE1的 PC收到路由结果信令后， 将路 由结果传回本网元 CC。 本发明所述的方法借助协议信令与远端网元的 CC 或 RC交互， 通过一个远端网元或多个远端网元完成路由查询工作， 具备筒 洁、 可靠的优点， 可应用于数据领域、 自动交换光网络中。

Claims

权 利 要 求 书
1、 一种自动交换光网络路由查询方法， 用于实现包括协议控制组件 PC 和连接控制组件 CC但缺少路由控制组件 RC的网元的路由查询，其特征在于， 所述方法包括如下步骤：
( 1 ) 所述缺少 RC的网元 NE1在本网元 CC需要查询路由时， 向远端 网元 NE2发送路由查询请求信令；
( 2 )所述网元 NE2根据路由查询请求得到路由结果， 通过路由结果信 令向所述发起路由查询请求的网元 NE1返回路由结果；
( 3 )网元 NE1的 PC收到路由结果信令后，将路由结果传回本网元 CC。
2、 如权利要求 1所述的方法， 其特征在于， 所述步骤（1 ) 包括： 所述网元 NE1在 CC判断需要查询路由时，由 CC构造路由查询请求信 令；
通过该网元 NE1的 PC向远端网元 NE2发送所述路由查询请求信令。 3、 如权利要求 1所述的方法，其特征在于，所述远端网元 NE2包括 RC、 PC和具有自动交换光网络 ASON的完备路由信息的路由数据库 RDB, 则所 述步骤（ 2 ) 包括：
所述 NE2的 PC接收到路由查询请求信令后， 将该信令转发至 NE2的
RC;
所述 NE2的 RC根据路由查询请求、 调用路由算法、 基于 NE2的 RDB 完成路由计算， 并构造路由计算结果信令；
通过 NE2 的 PC 将该路由计算结果信令返回至发起路由查询请求的 NEL
4、 如权利要求 3所述的方法， 其特征在于， 所述步骤（2 )进一步包括： 所述 NE2的 RC完成路由计算后，判断路由失败未找到所请求的路由信 息， 则该 RC依所述路由查询请求构造路由查询请求信令， 通过 NE2的 PC 发送至其它远端网元 NE3, 该 NE3包括 RC、 PC和完备的 RDB;
所述 NE3的 PC接收到所述路由查询请求信令后，将该信令转发给 NE3 的 RC;
所述 NE3的 RC根据接收的路由查询请求，调用路由算法，基于本网元 RDB完成路由计算， 成功后， 构造路由计算结果信令；
所述 E3的 PC将该路由计算结果信令逐级返回到网元 NE2、网元 NEl, 直到 NE1的 CC收到所述路由计算结果。
5、 如权利要求 1所述的方法， 其特征在于， 如果所述远端网元 NE2包 括 RC、 PC、 CC和具有自动交换光网络 ASON的完备路由信息的路由数据库 RDB, 则所述步骤（2 ) 包括：
所述 NE2的 PC接收到路由查询请求信令后， 将该信令转发至 NE2的 CC;
该 NE2的 CC根据路由查询请求， 向 NE2的 RC发送 NE2的路由查询 请求；
该 NE2的 RC根据 NE2的 CC发送来的路由查询请求， 调用路由算法、 基于 NE2的 RDB完成路由计算， 并将路由结果返回至 NE2的 CC;
所述 NE2的 CC根据收到的所述路由结果构造路由计算结果信令，将该 信令通过 NE2的 PC返回至发起路由查询请求的所述网元 NE1。
6、 如权利要求 5所述的方法， 其特征在于， 所述步骤（2 )进一步包括： 所述 NE2的 RC完成路由计算后，判断路由失败未找到所请求的路由信 息， 则该 RC依所述路由查询请求构造路由查询请求信令， 通过 NE2的 PC 发送至其它远端网元 NE3, 该 NE3包括 R (：、 PC和完备的 RDB;
所述 NE3的 PC接收到所述路由查询请求信令后，将该信令转发给 NE3 的 RC;
所述 NE3的 RC根据接收的路由查询请求，调用路由算法，基于本网元 RDB完成路由计算， 成功后， 构造路由计算结果信令；
所述 NE3的 PC将该路由计算结果信令返回到网元 NE2, 由 NE2的 CC 根据路由计算结果重新构造路由计算结果信令发送到网元 NE1,直到 NE1的 CC收到所述路由计算结果。
7、 如权利要求 3至 6之中的任一权利要求所述的方法' 其特征在于， 所 述路由算法是基于约束的最短路径算法 CSPF。
PCT/CN2006/002581 2006-09-29 2006-09-29 Procédé de requête de recherche dans un réseau optique à commutation automatique WO2008037124A1 (fr)

Priority Applications (10)

Application Number Priority Date Filing Date Title
BRPI0622033-9A BRPI0622033B1 (pt) 2006-09-29 2006-09-29 Método de consulta de rota em ason
PL06791167T PL2071811T3 (pl) 2006-09-29 2006-09-29 Sposób zapytania o trasę w ASON
PT67911677T PT2071811E (pt) 2006-09-29 2006-09-29 Um método de consulta de rota na ason
ES06791167T ES2402778T3 (es) 2006-09-29 2006-09-29 Método de consulta de ruta en una red ASON
JP2009529490A JP4778586B2 (ja) 2006-09-29 2006-09-29 自動交換光ネットワークのルート照会方法
EP20060791167 EP2071811B1 (en) 2006-09-29 2006-09-29 A route query method in ason
US12/443,123 US8055131B2 (en) 2006-09-29 2006-09-29 Route query method in ASON
PCT/CN2006/002581 WO2008037124A1 (fr) 2006-09-29 2006-09-29 Procédé de requête de recherche dans un réseau optique à commutation automatique
CN2006800373903A CN101283569B (zh) 2006-09-29 2006-09-29 一种自动交换光网络路由查询方法
KR1020097008776A KR101021621B1 (ko) 2006-09-29 2006-09-29 자동교환 광 네트웍 라우트 조회방법

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2006/002581 WO2008037124A1 (fr) 2006-09-29 2006-09-29 Procédé de requête de recherche dans un réseau optique à commutation automatique

Publications (1)

Publication Number Publication Date
WO2008037124A1 true WO2008037124A1 (fr) 2008-04-03

Family

ID=39229706

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2006/002581 WO2008037124A1 (fr) 2006-09-29 2006-09-29 Procédé de requête de recherche dans un réseau optique à commutation automatique

Country Status (10)

Country Link
US (1) US8055131B2 (zh)
EP (1) EP2071811B1 (zh)
JP (1) JP4778586B2 (zh)
KR (1) KR101021621B1 (zh)
CN (1) CN101283569B (zh)
BR (1) BRPI0622033B1 (zh)
ES (1) ES2402778T3 (zh)
PL (1) PL2071811T3 (zh)
PT (1) PT2071811E (zh)
WO (1) WO2008037124A1 (zh)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008064518A1 (en) * 2006-11-28 2008-06-05 Zte Corporation A united route query method in the automatic switched optical network

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1545079A1 (fr) * 2003-12-19 2005-06-22 Alcatel Procédé d'établissement d'une connexion logique entre un noeud de départ et un noeud d'arrivée non adjacents d'un réseau de télécommunications
CN1764323A (zh) * 2005-11-11 2006-04-26 中兴通讯股份有限公司 自动交换光网络中避免同源突发业务资源冲突的一种方法

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1545079A1 (fr) * 2003-12-19 2005-06-22 Alcatel Procédé d'établissement d'une connexion logique entre un noeud de départ et un noeud d'arrivée non adjacents d'un réseau de télécommunications
CN1764323A (zh) * 2005-11-11 2006-04-26 中兴通讯股份有限公司 自动交换光网络中避免同源突发业务资源冲突的一种方法

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
CHEN Y.: "Signaling and Routing for the Automatically Switched Optical Network", TELECOMMUNICATIONS SCIENCE, no. 9, September 2002 (2002-09-01), pages 37 - 42, XP008105848 *
LI Y.: "Analysis of the working mechanism of Routing on ASON", OPTICAL COMMUNICATION TECHNOLOGY, no. 3, March 2004 (2004-03-01), pages 30 - 33 *
See also references of EP2071811A4 *

Also Published As

Publication number Publication date
EP2071811B1 (en) 2013-01-16
BRPI0622033A2 (pt) 2014-04-22
JP4778586B2 (ja) 2011-09-21
PL2071811T3 (pl) 2013-06-28
PT2071811E (pt) 2013-04-15
KR101021621B1 (ko) 2011-03-17
JP2010505300A (ja) 2010-02-18
US8055131B2 (en) 2011-11-08
EP2071811A1 (en) 2009-06-17
EP2071811A4 (en) 2012-05-30
ES2402778T3 (es) 2013-05-08
US20100086299A1 (en) 2010-04-08
BRPI0622033B1 (pt) 2019-06-18
KR20090086967A (ko) 2009-08-14
CN101283569A (zh) 2008-10-08
CN101283569B (zh) 2011-02-16

Similar Documents

Publication Publication Date Title
EP2075966B1 (en) Method and apparatus for computing a service path
US7990946B2 (en) Node apparatus and path setup method
EP2096802B1 (en) A hierarchical routing query method of automatic switched optical network
JP3830953B2 (ja) 伝送システム
US20080056159A1 (en) Method for setting path and node apparatus
US20070274224A1 (en) Path setting method, node device, and monitoring/control device
WO2006133633A1 (fr) Procede d'identification de joignabilite de noeud, procede d'identification de liaison, procede de calcul de route et procede de diffusion d'information d'adresse de noeud
WO2006034629A1 (fr) Procede de rearrangement de protection dans un systeme mpls
WO2009146652A1 (zh) 一种自动交换光网络中连接迁移方法和系统
EP2328307B1 (en) Barrier boundary node and method for establishing connection between barrier bound ary nodes
EP2096801B1 (en) A united route query method in the automatic switched optical network
KR100842256B1 (ko) 지.엠.피.엘.에스 기반 네트워크에서 물리계층의 레이블 스위칭 경로에 대한 연결성 검사 방법 및 그 시스템
WO2008037124A1 (fr) Procédé de requête de recherche dans un réseau optique à commutation automatique
WO2012159442A1 (zh) 一种实现内部链路洪泛的方法及装置
WO2007019727A1 (fr) Nœud de commande complexe dans des réseaux de transport à commutation automatique et méthode de commande de celui-ci
US7898938B2 (en) Transmitting apparatus and transmitting method
CN101176280B (zh) 一种自动交换光网络控制实体拓扑的自动发现方法
WO2007071114A1 (fr) Procede pour le reacheminement sans interruption en reseau optique
EP2395773B1 (en) Method and apparatus of sub-network connection protection (sncp) service migration
CN1889397B (zh) 一种智能光网络中的业务路径建立方法
WO2008086641A1 (fr) Procédé de protection de haut-parleurs du protocole inter-domaines dans un réseau optique
JP2004194019A (ja) ネットワーク管理方法

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 200680037390.3

Country of ref document: CN

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 06791167

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 12443123

Country of ref document: US

ENP Entry into the national phase

Ref document number: 2009529490

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 2006791167

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 1020097008776

Country of ref document: KR

ENP Entry into the national phase

Ref document number: PI0622033

Country of ref document: BR

Kind code of ref document: A2

Effective date: 20090327