WO2012062092A1 - Apparatus and method for route inquiry - Google Patents

Apparatus and method for route inquiry Download PDF

Info

Publication number
WO2012062092A1
WO2012062092A1 PCT/CN2011/073838 CN2011073838W WO2012062092A1 WO 2012062092 A1 WO2012062092 A1 WO 2012062092A1 CN 2011073838 W CN2011073838 W CN 2011073838W WO 2012062092 A1 WO2012062092 A1 WO 2012062092A1
Authority
WO
WIPO (PCT)
Prior art keywords
query
route
constraint
query request
request
Prior art date
Application number
PCT/CN2011/073838
Other languages
French (fr)
Chinese (zh)
Inventor
马西照
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2012062092A1 publication Critical patent/WO2012062092A1/en

Links

Classifications

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

Definitions

  • the present invention relates to the field of communications, and in particular to a route query apparatus and method.
  • BACKGROUND With the development of related technologies in the information field, especially the strong promotion of the data service by the Internet, the optical network is required to adjust the logical topology of the network in real time and dynamically, and realize the optimal utilization of resources, which can be fast and high quality. It provides users with various bandwidth services and applications, and has more comprehensive protection and recovery functions, greater operability and scalability.
  • Automatically Switched Optical Network is an IP, Synchronous Optical Network/Synchronous Digital Hierarchy (SONET/SDH), Dense Wavelength Division Multiplexing (Dense Wavelength Division Multiplexing).
  • Routing technology is one of the core technologies of ASON, and plays an important role in realizing the dynamic routing of connections.
  • the routing protocol used in the traditional IP network is the Open Shortest Pass First (OSPF) protocol, which enables dynamic routing of routes.
  • OSPF Open Shortest Pass First
  • GPLS Generalized Multi Protocol Label Switching
  • the routing structure component of ASON includes a routing controller (Router Controller, referred to as RC for short), a routing information database (Data Base, referred to as DB), a link resource manager (LRM for short), and a protocol controller (Protocol). Controller, referred to as PC).
  • RC routing controller
  • DB routing information database
  • LRM link resource manager
  • PC protocol controller
  • the Routing Controller is responsible for responding to the request for routing information by the Connect Controller (CC) for establishing a connection. It exchanges routing information with the peer RC, and answers the routing query after querying the routing information database. It is also responsible for returning the topology information needed for the management network.
  • the channel selection for a connection request will be Constraint Shortest Path First (CSPF).
  • CSPF is mostly integrated in the RC and is responsible for constraining route calculations.
  • the constraints of the route query include, but are not limited to, the bandwidth, the link protection type is strictly matched, the minimum hop count, the minimum link cost, the load balancing, the preemption, the priority, the specified partial explicit route, and the like.
  • a route query apparatus for an automatic switched optical network including: a query policy establishment module, configured to establish a query policy template according to a query policy template when receiving a route query request that has not been received before a query policy corresponding to the route query request that has not been received; the query policy saving module is configured to save the correspondence between the route query request that has not been received and the query policy corresponding to the route query request that has not been received.
  • the query policy execution module is configured to search for and execute the query policy corresponding to the received route query request in the corresponding relationship.
  • the foregoing query policy template includes: a first query unit sub-template, configured to generate a first query unit according to the route query request that has not been received, where the first query unit is configured to parse the received route query request and send the first
  • the second query unit sub-template is configured to generate a second query unit according to the route query request that has not been received, wherein the second query unit is configured to determine whether the received route response of the first query request satisfies receiving The constraint of the route query request to, if not satisfied
  • the foot constraint determines whether the constraint can be changed. If the constraint can be changed, the change constraint sends a second query request.
  • the foregoing first query request includes at least one of the following: an actual route query request, and a full network topology query request.
  • the second query unit is further configured to determine whether the routing response of the first query request satisfies the user-defined extended constraint simultaneously on the premise that the routing response of the first query request satisfies the constraint of the received routing query request.
  • the foregoing query policy execution module includes: a first execution unit, configured to search for a query policy corresponding to the received route query request in the corresponding relationship, and trigger a first query unit of the query policy, parse the received route query request, and send the a second query unit, configured to trigger a second query unit of the query policy corresponding to the received route query request, and determine whether the route response of the received first query request satisfies the received route query request Constraints and/or user-defined extended constraints, if the constraints are not met, determine whether the constraints can be changed, if the constraints can be changed, then change the constraints and send a second query request.
  • the second query unit is further configured to determine whether the routing response of the second query request satisfies the changed constraint, and if not, determine whether the constraint can be changed again until the query succeeds or the query fails because the constraint cannot be changed.
  • a route query method for an automatic switched optical network including: generating a query policy corresponding to a route query request that has not been received before; and saving the unreceived Corresponding relationship between the route query request and the query policy corresponding to the route query request that has not been received; searching for the query policy corresponding to the received route query request in the correspondence relationship and executing.
  • the foregoing query policy template includes: a first query unit sub-template, configured to generate a first query unit according to a route query request that has not been received, where the first query unit is configured to parse the received route query request and send the same a first query request corresponding to the route query request; the second query unit sub-template is configured to generate a second query unit according to the route query request that has not been received, wherein the second query unit is configured to determine the received Whether the query response of the query request satisfies the constraint of the received route query request, if the constraint is satisfied, the query is successful, otherwise it is judged whether the constraint can be changed. If the constraint can be changed, the constraint is changed and the corresponding route query request is sent.
  • the second query request otherwise the query fails.
  • the foregoing first query request includes at least one of the following: an actual route query request, and a full network topology query request.
  • the second query unit After determining that the routing response of the first query request satisfies the constraint of the received routing query request, the second query unit continues to determine whether the routing response satisfies the user-defined extended constraint.
  • the executing the query policy includes: triggering the first query unit, parsing the received route query request, and sending the first query request; triggering the second query unit, determining whether the route response of the received first query request satisfies the received route Query the constraint of the request and/or the user-defined extended constraint.
  • the query is successful; if it is not satisfied, it is judged whether the constraint can be changed. If the constraint can be changed, the constraint is changed and the second query request is sent, otherwise the query fails; Whether the routing response of the second query request satisfies the changed constraint, if yes, the query is successful, otherwise it is judged whether the constraint can be changed again until the query succeeds or the query fails because the constraint cannot be changed.
  • FIG. 1 is a flowchart of a route query method according to an embodiment of the present invention
  • FIG. 2 is a flowchart of a route query method according to an example of the present invention
  • FIG. 3 is a route query device according to an embodiment of the present invention
  • FIG. 4 is a schematic structural diagram of a route inquiring device according to a preferred embodiment of the present invention.
  • the route query method according to the embodiment of the present invention includes: Step S102: Establish a query policy corresponding to a route query request that has not been received before according to the query policy template. Step S104: The correspondence between the unreceived route query request and the query policy corresponding to the unreceived route query request is saved.
  • Step S106 Search for a query policy corresponding to the received route query request in the foregoing correspondence and execute the query policy.
  • the method for establishing the query strategy makes different or even contradictory query strategies. It can exist at the same time, avoiding the establishment and clearing of query strategies due to different and contradictory query requests, which greatly improves the flexibility of route query.
  • the query policy template mentioned in step S102 may further include:
  • the first query unit sub-template is configured to generate a first query unit according to the unreceived route query request, where the first query unit is configured to parse the received route query request and send the route query request Corresponding first query request.
  • the second query unit sub-template is configured to generate a second query unit according to the route query request that has not been received, where the second query unit is configured to determine whether the route response of the received first query request satisfies the above
  • the constraint of the received route query request if the constraint is met, the query is successful, otherwise it is determined whether the constraint can be changed. If the constraint can be changed, the second query corresponding to the received route query request is sent after the constraint is changed. Request, otherwise the query fails.
  • the above query policy template is the basis for establishing a query policy.
  • the information included in the route query request that has never occurred is only required to use the above query policy template as a framework (mainly The information of various constraints is populated into the query policy template, and an executable query policy can be obtained, and the final route query result can be obtained by executing the strategy.
  • the foregoing first query request may include a request of at least one of the following: an actual route query request, a full network topology query request. In the specific implementation process, before the actual route query is performed, you can perform the topology query of the entire network to obtain the topology response of the entire network, and then perform the actual route query.
  • the foregoing second query unit may further determine whether the routing response meets the user-defined extended constraint at the same time.
  • the above steps actually correspond to a user extension function, that is, the user can further add constraints according to the needs of the original routing query request, and the constraints are determined when the routing response of the first query request meets the requirements. Also have to be considered.
  • performing the foregoing query policy in step S106 may further include the following processing:
  • each query policy saved in the corresponding relationship is actually a specific executable The process of its execution corresponds to the structure of the query policy template. It is worth noting that when the constraints are variable, the query process can be executed cyclically until the query is successful, or the constraints cannot be changed.
  • FIG. 2 is a flow chart of a route query method in accordance with an example of the present invention.
  • This example is used to implement the following query request constraints:
  • When establishing a service it must strictly follow the link of the multiplex section level.
  • This service fault is dynamically restored, it is preferentially placed on the link of the multiplex section level, but Walk on the unprotected type of link.
  • the RC's constrained route calculation is generally isolated from the service. Therefore, the establishment of the service and the recovery of the service are respectively corresponding to one route query in the RC.
  • the RC-to-link protection type routing algorithm of this example is as follows: Provides the specified "link protection level” constraint, provides "whether it is strictly matched, and constrains. When the user does not specify the link protection level, the route calculation does not Consider this constraint, that is, any level of link can be used as an alternate route. When the user specifies "link protection level, when, at the same time, specify” strict match, then only the user-specified link is considered in the route calculation, and any other level of link is excluded. When the user specifies the "link protection level” and simultaneously specifies "non-strict matching," the route calculation considers a link greater than or equal to this level, excluding any links below this level. Combining routing requests with RC routing algorithms The following two different routing query strategies are constructed for service establishment and service recovery.
  • Step S202 Construct a query policy, that is, construct a query policy according to the route query request, where the query policy includes: a first query unit,
  • This route request constraint includes only the strictly matched link level, and does not need to query the entire network topology, because jt ⁇ constructs a route query message to the RC in the jtb unit.
  • the multiplex section level link is specified in this query and is strictly matched, and carries constraints such as bandwidth, preemption, and priority.
  • the second query unit determines the query result of the RC. If the CC request is satisfied, the query result is transmitted to the CC. Otherwise, it is determined whether the query constraint can be relaxed.
  • step S204 the correspondence relationship is saved, and the storage space is allocated for the query policy, and the storage space address is specifically represented by a function pointer. Establish a query request and a query strategy-correspondence relationship, where the query request can be embodied as a set of query constraints. This correspondence can be set in advance or dynamically registered.
  • Step S206 searching for a query policy, that is, inverting the query policy in the corresponding relationship.
  • Step S212 further determining whether the routing response of the first query unit satisfies the user extension constraint. In this example, there is no user extension constraint, and the step is ignored.
  • the query strategy when constructing service recovery is generally the same as when the service is established, and the difference is only how to construct the first query unit and the second query unit of the query policy.
  • the first query unit queries the RC for the route, and carries the link protection type to the multiplex section link level, and strictly matches.
  • the second query unit determines whether the query is successful. If successful, return directly to the CC. Otherwise, the link protection type is changed to the unprotected link level and is strictly matched. If successful, return directly to cc. Otherwise, the link protection type is changed to the multiplex section link level and is not strictly matched. Return the query result to the CC, success or failure.
  • FIG. 3 is a schematic structural diagram of a route inquiring device according to an embodiment of the present invention.
  • the route querying apparatus includes: a query policy establishing module 32, configured to: when receiving a route query request that has not been received before, establish and not receive the query policy template according to the query policy template.
  • the routing query request corresponds to the query policy.
  • the query policy saving module 34 is configured to save a correspondence between the unreceived route query request and the query policy corresponding to the unreceived route query request.
  • the query policy execution module 36 is configured to search for and execute the query policy corresponding to the received route query request in the foregoing correspondence.
  • the foregoing query policy template may further include:
  • the first query unit sub-template is configured to generate a first query unit according to the unreceived route query request, where the first query unit is configured to parse the received route query request and send the route query Request the corresponding first query request.
  • the second query unit sub-template is configured to generate a second query unit according to the route query request that has not been received, where the second query unit is configured to determine whether the route response of the received first query request is satisfied.
  • the constraint of the received route query request if the constraint is met, the query is successful, otherwise it is determined whether the constraint can be changed. If the constraint can be changed, the constraint is changed, and then the second corresponding to the received route query request is sent. Query the request, otherwise the query fails.
  • the above query policy template is the basis for establishing a query policy.
  • the information included in the route query request that has never occurred is only required to use the above query policy template as a framework (mainly The information of various constraints is populated into the query policy template, and an executable query policy can be obtained, and the final route query result can be obtained by executing the strategy.
  • the foregoing first query request may include a request of at least one of the following: an actual route query request, a full network topology query request. In the specific implementation process, before the actual route query is performed, you can perform the topology query of the entire network to obtain the topology response of the entire network, and then perform the actual route query.
  • the foregoing second query unit may be further configured to: if the route response of the first query request satisfies the constraint of the received route query request, determine whether the route response of the first query request satisfies the user-defined extension at the same time. constraint.
  • the second query unit can serve as a carrier for the user extension function, so that the user can add constraints according to actual needs. Of course, it is also possible to establish another independent unit to carry this function.
  • the query policy execution module 36 may further include: a first execution unit 362, configured to search for a query policy corresponding to the received route query request in the correspondence relationship and trigger a first query unit of the query policy, and parse the receiving The route query request is sent and the first query request is sent.
  • the second executing unit 364 is configured to: trigger a second query unit that triggers a query policy corresponding to the received route query request, and determine whether the route response of the received first query request satisfies the constraint of the received route query request And/or a user-defined extended constraint, if the constraint is not satisfied, it is determined whether the constraint can be changed, and if the constraint can be changed, the constraint is changed and a second query request is sent.
  • the query policy execution module 36 actually corresponds to the query policy creation module 32, the first execution unit 362 is arranged to execute the first query unit, and the second execution unit 364 is arranged to execute the second query unit.
  • the second querying unit may further be configured to determine whether the routing response of the second query request satisfies the changed constraint, and if not, determine whether the constraint can be changed again until the query succeeds or the query cannot be changed again. failure.
  • the second query unit can perform the query action iteratively until the optimal route is queried, or the query fails.
  • the present invention fully utilizes the input and output interface of the routing controller RC and the CSPF module, which greatly improves the flexibility of the constraint routing calculation.
  • the present invention uses a scheme for establishing a query policy device corresponding to a routing query request, so that different routing query requests can establish different query policies, and a routing query request and a query policy are established between each other. — Corresponding relationship, when the user changes the query request, it only needs to reconstruct the query policy device, which does not affect the established query strategy and improves the scalability of the system.
  • modules or steps of the present invention can be implemented by a general-purpose computing device, which can be concentrated on a single computing device or distributed over a network composed of multiple computing devices. Alternatively, they may be executed by a computing device Implemented so that they can be stored in a storage device by a computing device, and in some cases, the steps shown or described can be performed in an order different from that herein, or separately
  • the integrated circuit modules are implemented by making a plurality of modules or steps of them into a single integrated circuit module.

Landscapes

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

Abstract

The invention provides an apparatus and a method for route inquiry, which is applied to the automatic switched optical network. The route inquiry apparatus includes: An inquiry policy establishment module, which is set for, when receiving a route inquiry request which has not been received before, establishing the inquiry policy corresponding to the route inquiry request which has not been received according to the inquiry policy template; an inquiry policy storage module, which is set for storing the correspondence between the route inquiry request which has not been received and the inquiry policy corresponding to the route inquiry request which has not been received; inquiry policy implementation module, which is set for finding and performing the inquiry policy corresponding to a received route inquiry request in the correspondence. By using the technical solution of the invention, the flexibility of constraint route calculation is improved, and then the diverse route inquiry request can be satisfied.

Description

路由查询装置及方法 技术领域 本发明涉及通信领域, 具体而言, 涉及一种路由查询装置及方法。 背景技术 随着信息领域相关技术的发展, 特别是 Internet对数据业务增长的强大推 动, 要求光网络能够实时、 动态地调整网络的逻辑拓朴结构, 实现资源的最佳 利用, 能够快速、 高质量地为用户提供各种带宽服务与应用, 并且具有更加完 善的保护和恢复功能, 更强的可操作性和扩展性等。 自动交换光网络 ( Automatically Switched Optical Network, 简称为 ASON ) 是从 IP、 光同步数 字传输网 ( Synchronous Optical Network/ Synchronous Digital Hierarchy, 简称为 SONET/SDH )、 密集型光波复用 (Dense Wavelength Division Multiplexing, 简 称为 DWDM ) 的环境中升华出来的, 将 IP的灵活和效率、 SONET/SDH的保 护能力以及 DWDM 的容量通过创新的分布式网络管理系统有机地结合在一 起, 赋予现有网络更多智能, 提高了网络资源的利用率, 使其发展成一个能够 完成自动交换功能的智能光网络, 代表智能光网络的主流方向。 路由技术是 ASON的核心技术之一,在实现连接的动态选路方面发挥了重 要作用。传统的 IP网络釆用的路由协议是开放最短路径优先( Open Shortest Pass First, 简称为 OSPF ) 协议, 能够实现路由的动态选路。 ASON 的路由需要更 多的特性和更高的灵活性, 一般釆用基于通用多协议标志交换 ( Generalized Multi Protocol Label Switching, 简称为 GMPLS )扩展的带流量工程的 OSPF ( OSPF-TE )路由协议。 为了适应 ASON路由体系的发展,国际电信联盟 ITU-T建议 G8080/Y.1304 给出了 ASON路由域层次和子网点组的关系。 G7715/Y.1706定义了一种与协 议无关的描述 ASON路由技术的方法, 包括 ASON的选路结构、 路径选择、 路由属性、 抽象信息和状态图转移的功能组成单元。 ASON的路由结构组件包 括路由控制器 ( Router Controller, 简称为 RC )、 路由信息数据库 ( Data Base, 简称为 DB )、 链路资源管理器(Link Resource Manager, 简称为 LRM )和协议 控制器 ( Protocol Controller, 简称为 PC )。 路由控制器 ( RC ) 负责响应连接控 制器( Connect Controller , 简称为 CC )为了建立连接而对路由信息的请求, 包 括与对等的 RC交换路由信息, 并在查询路由信息数据库以后对路由查询故出 回答, 同时也负责回送管理网络所需要的拓朴信息。 在 ASON的交换式光网络 中, 请求的端到端的光通道连接是有一定限制的, 对一个连接请求的通道选择 将釆用约束路由计算 ( Constraint Shortest Path First或简称 CSPF )。 CSPF大多 集成在 RC中, 负责约束路由计算。 路由查询的约束包括但并不局限于带宽、 链路保护类型是否严格匹配、 最 小跳数、 最小链路代价、 负载均衡、 抢占、 优先级、 指定部分明确路由等。 上 述所有约束都可以在某一次连接建立的路由查询中同时指定, 但有些约束(如 最小跳数、 最小链路代价)是互相矛盾的, 那么如何在众多的约束中挑选优先 满足的约束呢? 不同的用户有不同的需求。 如何根据用户多样化需求做出合理 的选择成为路由模块必须解决的问题。 相关技术中, 传统的做法多依赖于最短路径算法, 直接计算从查询路由的 首节点到尾节点之间的路径并与该路由的约束条件进行对比, 将满足路由约束 条件的一条或多条路径加入路由计算的结果集。 当用户改变约束的优先级时需 要修改最短路径算法, 影响了约束路由计算的灵活性。 发明内容 本发明的主要目的在于提供一种路由查询装置及方法, 以解决上述问题至 少之一。 根据本发明的一个方面, 提供了一种应用于自动交换光网络的路由查询装 置, 包括: 查询策略建立模块, 设置为在接收到之前未收到过的路由查询请求 时, 根据查询策略模板建立与该未收到过的路由查询请求对应的查询策略; 查 询策略保存模块, 设置为保存该未收到过的路由查询请求与对应于该未收到过 的路由查询请求的查询策略的对应关系; 查询策略执行模块, 设置为在对应关 系中查找与接收到的路由查询请求对应的查询策略并执行。 上述查询策略模板包括: 第一查询单元子模板, 设置为根据未收到过的路 由查询请求生成第一查询单元, 其中, 第一查询单元, 设置为解析接收到的路 由查询请求并发送第一查询请求; 第二查询单元子模板, 设置为根据未收到过 的路由查询请求生成第二查询单元, 其中, 第二查询单元, 设置为判断接收到 的第一查询请求的路由应答是否满足接收到的路由查询请求的约束, 如果不满 足约束则判断是否能够改变约束, 如果能够改变约束, 则改变约束发送第二查 询请求。 上述第一查询请求包括以下至少之一: 实际路由查询请求、 全网拓朴查询 请求。 上述第二查询单元, 还设置为在第一查询请求的路由应答满足接收到的路 由查询请求的约束的前提下, 判断第一查询请求的路由应答是否同时满足用户 自定义的扩展约束。 上述查询策略执行模块包括: 第一执行单元, 设置为在对应关系中查找与 接收到的路由查询请求对应的查询策略并触发该查询策略的第一查询单元, 解 析接收到的路由查询请求并发送第一查询请求; 第二执行单元, 设置为触发与 接收到的路由查询请求对应的查询策略的第二查询单元, 判断与接收到的第一 查询请求的路由应答是否满足接收到的路由查询请求的约束和 /或用户自定义 的扩展约束, 如果不满足约束则判断是否能够改变约束, 如果能够改变约束, 则改变约束并发送第二查询请求。 上述第二查询单元还设置为确定第二查询请求的路由应答是否满足改变 后的约束, 如果不满足则判断是否能够再次改变约束, 直至查询成功或者由于 不能再改变约束而查询失败。 根据本发明的另一方面, 提供了一种应用于自动交换光网络的路由查询方 法, 包括: 居查询策略模板建立与之前未收到过的路由查询请求对应的查询 策略; 保存该未收到过的路由查询请求与对应于该未收到过的路由查询请求的 查询策略的对应关系; 在对应关系中查找与接收到的路由查询请求对应的查询 策略并执行。 上述查询策略模板包括: 第一查询单元子模板, 设置为根据未收到过的路 由查询请求生成第一查询单元, 其中, 第一查询单元, 设置为解析接收到的路 由查询请求并发送与该路由查询请求对应的第一查询请求; 第二查询单元子模 板, 设置为才艮据未收到过的路由查询请求生成第二查询单元, 其中, 第二查询 单元, 设置为判断接收到的第一查询请求的路由应答是否满足接收到的路由查 询请求的约束, 如果满足约束则查询成功, 否则判断是否能够改变约束, 如果 能够改变约束, 则改变约束后发送与接收到的路由查询请求对应的第二查询请 求, 否则查询失败。 上述第一查询请求包括以下至少之一: 实际路由查询请求、 全网拓朴查询 请求。 上述第二查询单元在判断第一查询请求的路由应答满足接收到的路由查 询请求的约束之后, 继续判断路由应答是否同时满足用户自定义的扩展约束。 上述执行查询策略包括:触发第一查询单元,解析接收到的路由查询请求并 发送第一查询请求; 触发第二查询单元, 判断与接收到的第一查询请求的路由 应答是否满足接收到的路由查询请求的约束和 /或用户自定义的扩展约束,如果 满足则查询成功; 如果不满足则判断是否能够改变约束, 如果能够改变约束, 则改变约束并发送第二查询请求, 否则查询失败; 判断第二查询请求的路由应 答是否满足改变后的约束, 如果是则查询成功, 否则判断是否能够再次改变约 束, 直至查询成功或者由于不能再改变约束而查询失败。 通过本发明, 釆用以策略模板为基础才艮据不同的查询请求建立不同的查询 策略, 并保存查询请求与查询策略的对应关系供后续使用的方案, 解决了约束 路由计算的灵活性低的问题, 进而达到了满足多样化路由查询请求的效果。 附图说明 此处所说明的附图用来提供对本发明的进一步理解, 构成本申请的一部 分, 本发明的示意性实施例及其说明用于解释本发明, 并不构成对本发明的不 当限定。 在附图中: 图 1是根据本发明实施例的路由查询方法的流程图; 图 2是才艮据本发明实例的路由查询方法的流程图; 图 3是根据本发明实施例的路由查询装置的结构示意图; 图 4是根据本发明优选实施例的路由查询装置的结构示意图。 具体实施方式 下文中将参考附图并结合实施例来详细说明本发明。 需要说明的是, 在不 冲突的情况下, 本申请中的实施例及实施例中的特征可以相互组合。 图 1是根据本发明实施例的路由查询方法的流程图。 如图 1所示, 根据本 发明实施例的路由查询方法包括: 步骤 S 102,根据查询策略模板建立与之前未收到过的路由查询请求对应的 查询策略。 步骤 S 104,保存该未收到过的路由查询请求与对应于该未收到过的路由查 询请求的查询策略的对应关系。 步骤 S 106,在上述对应关系中查找与接收到的路由查询请求对应的查询策 略并执行。 通过上述方法, 即可方便快速的建立起与查询请求对应的查询策略, 查询 策略建立后^ 1该查询策略和对应的查询请求的对应关系保存起来, 在后续工作 过程中当出现与之相同的查询请求时即可直接调用与之对应的查询策略, 也就 是说只有当某个查询请求之前从未出现时才需要建立与之对应的查询策略, 当 该查询请求再次出现时直接从对应关系中调用与之对应的查询策略即可而不 需要重复的建立查询策略, 这种查询方法大大提高了查询效率。 同时, 由于查 询策略是根据预置的查询策略模板建立而成, 而不是在清除前一查询策略的基 础上建立后一查询策略, 这种查询策略的建立方法使不同的乃至相互矛盾的查 询策略可以同时存在, 避免由于查询请求的不同和矛盾反复的建立和清除查询 策略, 大大提高了路由查询的灵活性。 在上述方法中, 对于之前未出现过的查 询请求来说, 在建立相应查询策略并保存对应关系之后, 还是需要再从对应关 系中反引与之对应的查询策略并执行, 这一点与后续接收到的查询请求的执行 过程是相同的。 优选地, 步骤 S 102中提到的查询策略模板可以进一步包括: TECHNICAL FIELD The present invention relates to the field of communications, and in particular to a route query apparatus and method. BACKGROUND With the development of related technologies in the information field, especially the strong promotion of the data service by the Internet, the optical network is required to adjust the logical topology of the network in real time and dynamically, and realize the optimal utilization of resources, which can be fast and high quality. It provides users with various bandwidth services and applications, and has more comprehensive protection and recovery functions, greater operability and scalability. Automatically Switched Optical Network (ASON) is an IP, Synchronous Optical Network/Synchronous Digital Hierarchy (SONET/SDH), Dense Wavelength Division Multiplexing (Dense Wavelength Division Multiplexing). Sublimated in the environment of DWDM for short, the flexibility and efficiency of IP, the protection of SONET/SDH and the capacity of DWDM are organically combined through an innovative distributed network management system, giving the existing network more intelligence. The utilization of network resources is improved, and it is developed into an intelligent optical network capable of performing automatic switching functions, representing the mainstream direction of intelligent optical networks. Routing technology is one of the core technologies of ASON, and plays an important role in realizing the dynamic routing of connections. The routing protocol used in the traditional IP network is the Open Shortest Pass First (OSPF) protocol, which enables dynamic routing of routes. ASON routing requires more features and greater flexibility. Generally, OSPF (OSPF-TE) routing protocol with traffic engineering based on Generalized Multi Protocol Label Switching (GMPLS) extension is used. In order to adapt to the development of the ASON routing system, the International Telecommunication Union ITU-T Recommendation G8080/Y.1304 gives the relationship between the ASON routing domain hierarchy and the subnet point group. G7715/Y.1706 defines a protocol-independent method for describing ASON routing techniques, including the functional components of ASON routing structure, path selection, routing attributes, abstract information, and state diagram transitions. The routing structure component of ASON includes a routing controller (Router Controller, referred to as RC for short), a routing information database (Data Base, referred to as DB), a link resource manager (LRM for short), and a protocol controller (Protocol). Controller, referred to as PC). The Routing Controller (RC) is responsible for responding to the request for routing information by the Connect Controller (CC) for establishing a connection. It exchanges routing information with the peer RC, and answers the routing query after querying the routing information database. It is also responsible for returning the topology information needed for the management network. In ASON's switched optical network, the requested end-to-end optical channel connection is limited. The channel selection for a connection request will be Constraint Shortest Path First (CSPF). CSPF is mostly integrated in the RC and is responsible for constraining route calculations. The constraints of the route query include, but are not limited to, the bandwidth, the link protection type is strictly matched, the minimum hop count, the minimum link cost, the load balancing, the preemption, the priority, the specified partial explicit route, and the like. All of the above constraints can be specified in the routing query established by a connection, but some constraints (such as the minimum hop count and the minimum link cost) are contradictory. How to choose the priority constraint among the many constraints? Different users have different needs. How to make a reasonable choice according to the diversified needs of users becomes a problem that the routing module must solve. In the related art, the traditional method relies on the shortest path algorithm to directly calculate the path from the first node to the tail node of the query route and compare with the constraint of the route, and one or more paths satisfying the routing constraint condition. Join the result set of the route calculation. When the user changes the priority of the constraint, the shortest path algorithm needs to be modified, which affects the flexibility of the constraint routing calculation. SUMMARY OF THE INVENTION A primary object of the present invention is to provide a route query apparatus and method to solve at least one of the above problems. According to an aspect of the present invention, a route query apparatus for an automatic switched optical network is provided, including: a query policy establishment module, configured to establish a query policy template according to a query policy template when receiving a route query request that has not been received before a query policy corresponding to the route query request that has not been received; the query policy saving module is configured to save the correspondence between the route query request that has not been received and the query policy corresponding to the route query request that has not been received. The query policy execution module is configured to search for and execute the query policy corresponding to the received route query request in the corresponding relationship. The foregoing query policy template includes: a first query unit sub-template, configured to generate a first query unit according to the route query request that has not been received, where the first query unit is configured to parse the received route query request and send the first The second query unit sub-template is configured to generate a second query unit according to the route query request that has not been received, wherein the second query unit is configured to determine whether the received route response of the first query request satisfies receiving The constraint of the route query request to, if not satisfied The foot constraint determines whether the constraint can be changed. If the constraint can be changed, the change constraint sends a second query request. The foregoing first query request includes at least one of the following: an actual route query request, and a full network topology query request. The second query unit is further configured to determine whether the routing response of the first query request satisfies the user-defined extended constraint simultaneously on the premise that the routing response of the first query request satisfies the constraint of the received routing query request. The foregoing query policy execution module includes: a first execution unit, configured to search for a query policy corresponding to the received route query request in the corresponding relationship, and trigger a first query unit of the query policy, parse the received route query request, and send the a second query unit, configured to trigger a second query unit of the query policy corresponding to the received route query request, and determine whether the route response of the received first query request satisfies the received route query request Constraints and/or user-defined extended constraints, if the constraints are not met, determine whether the constraints can be changed, if the constraints can be changed, then change the constraints and send a second query request. The second query unit is further configured to determine whether the routing response of the second query request satisfies the changed constraint, and if not, determine whether the constraint can be changed again until the query succeeds or the query fails because the constraint cannot be changed. According to another aspect of the present invention, a route query method for an automatic switched optical network is provided, including: generating a query policy corresponding to a route query request that has not been received before; and saving the unreceived Corresponding relationship between the route query request and the query policy corresponding to the route query request that has not been received; searching for the query policy corresponding to the received route query request in the correspondence relationship and executing. The foregoing query policy template includes: a first query unit sub-template, configured to generate a first query unit according to a route query request that has not been received, where the first query unit is configured to parse the received route query request and send the same a first query request corresponding to the route query request; the second query unit sub-template is configured to generate a second query unit according to the route query request that has not been received, wherein the second query unit is configured to determine the received Whether the query response of the query request satisfies the constraint of the received route query request, if the constraint is satisfied, the query is successful, otherwise it is judged whether the constraint can be changed. If the constraint can be changed, the constraint is changed and the corresponding route query request is sent. The second query request, otherwise the query fails. The foregoing first query request includes at least one of the following: an actual route query request, and a full network topology query request. After determining that the routing response of the first query request satisfies the constraint of the received routing query request, the second query unit continues to determine whether the routing response satisfies the user-defined extended constraint. The executing the query policy includes: triggering the first query unit, parsing the received route query request, and sending the first query request; triggering the second query unit, determining whether the route response of the received first query request satisfies the received route Query the constraint of the request and/or the user-defined extended constraint. If it is satisfied, the query is successful; if it is not satisfied, it is judged whether the constraint can be changed. If the constraint can be changed, the constraint is changed and the second query request is sent, otherwise the query fails; Whether the routing response of the second query request satisfies the changed constraint, if yes, the query is successful, otherwise it is judged whether the constraint can be changed again until the query succeeds or the query fails because the constraint cannot be changed. Through the invention, based on the policy template, different query policies are established according to different query requests, and the corresponding relationship between the query request and the query policy is saved for subsequent use, and the flexibility of the constraint route calculation is solved. The problem, in turn, achieves the effect of satisfying diverse routing query requests. BRIEF DESCRIPTION OF THE DRAWINGS The accompanying drawings, which are set to illustrate,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,, 1 is a flowchart of a route query method according to an embodiment of the present invention; FIG. 2 is a flowchart of a route query method according to an example of the present invention; FIG. 3 is a route query device according to an embodiment of the present invention; FIG. 4 is a schematic structural diagram of a route inquiring device according to a preferred embodiment of the present invention. BEST MODE FOR CARRYING OUT THE INVENTION Hereinafter, the present invention will be described in detail with reference to the accompanying drawings. It should be noted that the embodiments in the present application and the features in the embodiments may be combined with each other without conflict. 1 is a flow chart of a route query method according to an embodiment of the present invention. As shown in FIG. 1, the route query method according to the embodiment of the present invention includes: Step S102: Establish a query policy corresponding to a route query request that has not been received before according to the query policy template. Step S104: The correspondence between the unreceived route query request and the query policy corresponding to the unreceived route query request is saved. Step S106: Search for a query policy corresponding to the received route query request in the foregoing correspondence and execute the query policy. By the above method, can be easily and quickly set up corresponding to the query request query strategy, the strategy for building a query strategy ^ 1 correspondence between the query corresponding to the saved queries, in a subsequent working with the same process occurs when the When querying a request, the corresponding query policy can be directly invoked, that is, only when a query request never appears before, the corresponding query policy needs to be established, and when the query request appears again, it directly from the corresponding relationship. Calling the corresponding query strategy can eliminate the need to repeatedly establish a query strategy. This query method greatly improves the query efficiency. At the same time, since the query strategy is established according to the preset query policy template, instead of establishing the latter query strategy based on clearing the previous query strategy, the method for establishing the query strategy makes different or even contradictory query strategies. It can exist at the same time, avoiding the establishment and clearing of query strategies due to different and contradictory query requests, which greatly improves the flexibility of route query. In the above method, for the query request that has not appeared before, after the corresponding query policy is established and the corresponding relationship is saved, the corresponding query policy needs to be reversed from the corresponding relationship and executed, which is followed by subsequent reception. The execution process of the query request is the same. Preferably, the query policy template mentioned in step S102 may further include:
( 1 ) 第一查询单元子模板, 设置为根据未收到过的路由查询请求生成第 一查询单元, 其中, 该第一查询单元设置为解析接收到的路由查询请求并发送 与该路由查询请求对应的第一查询请求。 (1) The first query unit sub-template is configured to generate a first query unit according to the unreceived route query request, where the first query unit is configured to parse the received route query request and send the route query request Corresponding first query request.
( 2 ) 第二查询单元子模板, 设置为根据未收到过的路由查询请求生成第 二查询单元, 其中, 该第二查询单元设置为判断接收到的第一查询请求的路由 应答是否满足上述接收到的路由查询请求的约束, 如果满足该约束则查询成 功, 否则判断是否能够改变该约束, 如果能够改变该约束, 则改变该约束后发 送与上述接收到的路由查询请求对应的第二查询请求, 否则查询失败。 上述查询策略模板是建立查询策略的基础, 在接收到从未出现过的路由查 询请求之后, 只需要以上述查询策略模板为框架, 将从未出现过的路由查询请 求中包含的信息 (主要为各种约束的信息) 填充到该查询策略模板中, 即可得 到一个可执行的查询策略, 执行该策略即可获得最终的路由查询结果。 优选地, 上述第一查询请求可以包括以下至少之一的请求: 实际路由查询 请求、 全网拓朴查询请求。 在具体实施过程中, 根据实际需要在进行实际路由查询之前, 还可以先进 行全网拓朴查询, 获取全网拓朴应答, 之后再进行实际路由查询。 优选地, 上述第二查询单元在判断第一查询请求路由应答满足接收到的路 由查询请求的约束之后, 还可以继续判断所述路由应答是否同时满足用户自定 义的扩展约束。 上述步骤实际上对应于一种用户扩展功能, 即用户可以在原路由查询请求 携带的约束信息的基础上, 根据自己的需要进一步添加约束, 这些约束在判断 第一查询请求的路由应答是否满足要求时也时要考虑的。 优选地, 步骤 S 106中执行上述查询策略可以进一步包括以下处理: (2) The second query unit sub-template is configured to generate a second query unit according to the route query request that has not been received, where the second query unit is configured to determine whether the route response of the received first query request satisfies the above The constraint of the received route query request, if the constraint is met, the query is successful, otherwise it is determined whether the constraint can be changed. If the constraint can be changed, the second query corresponding to the received route query request is sent after the constraint is changed. Request, otherwise the query fails. The above query policy template is the basis for establishing a query policy. After receiving a route query request that has never occurred, the information included in the route query request that has never occurred is only required to use the above query policy template as a framework (mainly The information of various constraints is populated into the query policy template, and an executable query policy can be obtained, and the final route query result can be obtained by executing the strategy. Preferably, the foregoing first query request may include a request of at least one of the following: an actual route query request, a full network topology query request. In the specific implementation process, before the actual route query is performed, you can perform the topology query of the entire network to obtain the topology response of the entire network, and then perform the actual route query. Preferably, after determining that the first query request routing response satisfies the constraint of the received routing query request, the foregoing second query unit may further determine whether the routing response meets the user-defined extended constraint at the same time. The above steps actually correspond to a user extension function, that is, the user can further add constraints according to the needs of the original routing query request, and the constraints are determined when the routing response of the first query request meets the requirements. Also have to be considered. Preferably, performing the foregoing query policy in step S106 may further include the following processing:
( 1 ) 触发第一查询单元, 解析接收到的路由查询请求并发送所述第一查 询请求。 (1) triggering the first query unit, parsing the received route query request and transmitting the first query request.
( 2 ) 触发第二查询单元, 判断与接收到的第一查询请求的路由应答是否 满足接收到的路由查询请求的约束和 /或用户自定义的扩展约束,如果满足则查 询成功。 (2) triggering the second query unit to determine whether the route response of the received first query request satisfies the constraint of the received route query request and/or the user-defined extended constraint, and if satisfied, the query succeeds.
( 3 )如果不满足则判断是否能够改变上述约束, 如果能够改变上述约束, 则改变上述约束并发送第二查询请求, 否则查询失败。 (3) If it is not satisfied, it is judged whether the above constraint can be changed. If the above constraint can be changed, the above constraint is changed and the second query request is sent, otherwise the query fails.
( 4 ) 判断上述第二查询请求的路由应答是否满足改变后的约束, 如果是 则查询成功, 否则判断是否能够再次改变该约束, 直至查询成功或者由于不能 再改变该约束而查询失败。 当从保存的对应关系中查找到与接收到的路由查询请求对应的查询策略 后, 只需要触发该查询策略即可得到最终的路由查询结果。 从上述查询策略的 建立过程来看, 在对应关系中保存的每个查询策略实际上都是具体的可执行 的, 其执行的过程与查询策略模板的结构是对应的。 值得注意的是, 当约束条 件可变时, 查询过程就可以循环的执行下去, 直至查询成功, 或约束条件不能 再改变为止。 图 2是根据本发明实例的路由查询方法的流程图。 下面结合图 2对上述优 选实施方式进行详细说明。 本实例用于实现用户如下查询请求约束: 建立某业务时必须严格走在复用 段等级的链路上, 当此业务故障进行动态恢复时优先走在复用段等级的链路 上, 但可以走在无保护类型的链路上。 RC 的约束路由计算一般都是与业务隔 离的, 因此建立业务、 恢复业务在 RC看来分别对应一条路由查询。 本实例的 RC对链路保护类型路由算法如下: 提供指定"链路保护等级"约束, 提供"是否 严格匹配,,约束。当用户未指定 "链路保护等级,,时,路由计算时则不考虑此约束, 即任何等级的链路都可作为备选路由。 当用户指定"链路保护等级,,时, 同时指 定"严格匹配,,, 则路由计算时仅考虑用户指定的链路, 排除任何其它等级的链 路。 当用户指定"链路保护等级 "时, 同时指定"非严格匹配,,, 则路由计算考虑 大于或者等于此等级的链路, 排除任何低于此等级的链路。 结合路由请求与 RC路由算法, 下面为业务建立、 业务恢复构造两个不同 的路由查询策略。 (4) determining whether the routing response of the second query request satisfies the changed constraint, and if yes, the query is successful, otherwise it is determined whether the constraint can be changed again until the query is successful or the query fails because the constraint cannot be changed. After the query policy corresponding to the received route query request is found from the saved correspondence, only the query policy needs to be triggered to obtain the final route query result. From the establishment process of the above query strategy, each query policy saved in the corresponding relationship is actually a specific executable The process of its execution corresponds to the structure of the query policy template. It is worth noting that when the constraints are variable, the query process can be executed cyclically until the query is successful, or the constraints cannot be changed. 2 is a flow chart of a route query method in accordance with an example of the present invention. The above preferred embodiments will be described in detail below with reference to FIG. This example is used to implement the following query request constraints: When establishing a service, it must strictly follow the link of the multiplex section level. When this service fault is dynamically restored, it is preferentially placed on the link of the multiplex section level, but Walk on the unprotected type of link. The RC's constrained route calculation is generally isolated from the service. Therefore, the establishment of the service and the recovery of the service are respectively corresponding to one route query in the RC. The RC-to-link protection type routing algorithm of this example is as follows: Provides the specified "link protection level" constraint, provides "whether it is strictly matched, and constrains. When the user does not specify the link protection level, the route calculation does not Consider this constraint, that is, any level of link can be used as an alternate route. When the user specifies "link protection level, when, at the same time, specify" strict match, then only the user-specified link is considered in the route calculation, and any other level of link is excluded. When the user specifies the "link protection level" and simultaneously specifies "non-strict matching," the route calculation considers a link greater than or equal to this level, excluding any links below this level. Combining routing requests with RC routing algorithms The following two different routing query strategies are constructed for service establishment and service recovery.
( 1 ) 构造业务建立时的路由查询策略, 如图 2所示, 包括: 步骤 S202, 构造查询策略, 即才艮据路由查询请求构造响应的查询策略, 该 查询策略包括: 第一查询单元, 此路由请求约束中仅包括严格匹配的链路等级, 不需要查 询全网拓朴, 因 jt匕在 jtb单元中构造路由查询消息给 RC。 在这个查询中指定了 复用段等级链路且严格匹配, 并且携带带宽、 抢占、 优先级等约束。 第二查询单元, 对 RC的查询结果进行判断, 若满足 CC请求, 则将此查 询结果传递给 CC, 否则判断是否可放宽查询约束, 若可以则放宽查询约束继 续向 RC发送路由查询。 此实例中, 不可放宽约束。 在存在用户扩展约束的前提下, 上述第二查询单元还需要在判断 RC的查 询结果是否满足 CC请求的同时, 判断是否满足用户的扩展约束, 此实例中没 有用户扩展约束, 不需要判断。 步骤 S204, 保存对应关系, 为查询策略分配存储空间, 存储空间地址, 具 体表现为函数指针。 建立查询请求与查询策略——对应关系, 此处查询请求可 具体表现为一组查询约束的集合。 此对应关系可预先设置也可动态注册。 步骤 S206, 查找查询策略, 即在上述对应关系反引该查询策略。 步 4聚 S208, 执行该查询策略的第一查询单元, 发送第一查询请求。 步骤 S210, 执行该查询策略的第二查询单元, 判断第一查询单元的路由应 答是否满足查询请求的约束。 步骤 S212, 进一步判断第一查询单元的路由应答是否满足用户扩展约束, 在本实例中不存在用户扩展约束, 忽略此步骤。 步 4聚 S214, 当第一查询单元的路由应答不满足上述任一约束时, 判断能否 改变约束, 能则继续发送第二查询请求, 否则查询失败。 此步骤可迭代执行, 直到查询到最佳路由, 或者查询失败。 步骤 S216, 当得到满足所有约束的路由时, 返回该路由, 查询成功。 (1) constructing a route query policy when the service is established, as shown in FIG. 2, the method includes the following steps: Step S202: Construct a query policy, that is, construct a query policy according to the route query request, where the query policy includes: a first query unit, This route request constraint includes only the strictly matched link level, and does not need to query the entire network topology, because jt匕 constructs a route query message to the RC in the jtb unit. The multiplex section level link is specified in this query and is strictly matched, and carries constraints such as bandwidth, preemption, and priority. The second query unit determines the query result of the RC. If the CC request is satisfied, the query result is transmitted to the CC. Otherwise, it is determined whether the query constraint can be relaxed. If the query constraint is relaxed, the route query is continued to be sent to the RC. In this example, the constraints cannot be relaxed. On the premise that there is a user extension constraint, the second query unit needs to determine whether the user's extended constraint is satisfied while determining whether the RC query result satisfies the CC request. There is no user extension constraint in this instance, and no judgment is needed. In step S204, the correspondence relationship is saved, and the storage space is allocated for the query policy, and the storage space address is specifically represented by a function pointer. Establish a query request and a query strategy-correspondence relationship, where the query request can be embodied as a set of query constraints. This correspondence can be set in advance or dynamically registered. Step S206, searching for a query policy, that is, inverting the query policy in the corresponding relationship. Step 4: S208, executing a first query unit of the query policy, and sending a first query request. Step S210: Perform a second query unit of the query policy, and determine whether the route response of the first query unit satisfies the constraint of the query request. Step S212, further determining whether the routing response of the first query unit satisfies the user extension constraint. In this example, there is no user extension constraint, and the step is ignored. Step 4: S214, when the routing response of the first query unit does not satisfy any of the above constraints, determine whether the constraint can be changed, and then continue to send the second query request, otherwise the query fails. This step can be iteratively executed until the best route is queried, or the query fails. Step S216: When a route that satisfies all constraints is obtained, the route is returned, and the query is successful.
( 2 ) 构造业务恢复时的查询策略 大体步 4聚与业务建立时相同, 区别仅仅在如何构造查询策略的第一查询单 元和第二查询单元。 第一查询单元, 向 RC查询路由, 携带链路保护类型为复用段链路等级, 且严格匹配。 第二查询单元, 判断查询是否成功。 若成功, 则直接返回给 CC。 否则, 改变链路保护类型为无保护链路等级, 且严格匹配。 若成功, 则直接返回给 cc。 否则, 改变链路保护类型为复用段链路等级, 且为非严格匹配。 将查询结 果返回给 CC, 成功或者失败。 图 3是根据本发明实施例的路由查询装置的结构示意图。 如图 3所示, 根 据本发明实施例的路由查询装置包括: 查询策略建立模块 32, 设置为在接收到之前未收到过的路由查询请求时, 根据查询策略模板建立与该未收到过的路由查询请求对应的查询策略。 查询策略保存模块 34,设置为保存该未收到过的路由查询请求与对应于该 未收到过的路由查询请求的查询策略的对应关系。 查询策略执行模块 36 ,设置为在上述对应关系中查找与接收到的路由查询 请求对应的查询策略并执行。 通过上述装置, 只需在某个查询请求之前从未出现时建立与之对应的查询 策略, 当该查询请求再次出现时直接从对应关系中调用与之对应的查询策略即 可而不需要重复的建立查询策略, 提高了查询效率。 同时, 上述装置支持不同 的乃至相互矛盾的查询策略同时存在, 解决了约束路由计算的灵活性低的问 题, 可以满足多样化的用户需求。 优选地, 上述查询策略模板可以进一步包括: (2) The query strategy when constructing service recovery is generally the same as when the service is established, and the difference is only how to construct the first query unit and the second query unit of the query policy. The first query unit queries the RC for the route, and carries the link protection type to the multiplex section link level, and strictly matches. The second query unit determines whether the query is successful. If successful, return directly to the CC. Otherwise, the link protection type is changed to the unprotected link level and is strictly matched. If successful, return directly to cc. Otherwise, the link protection type is changed to the multiplex section link level and is not strictly matched. Return the query result to the CC, success or failure. FIG. 3 is a schematic structural diagram of a route inquiring device according to an embodiment of the present invention. As shown in FIG. 3, the route querying apparatus according to the embodiment of the present invention includes: a query policy establishing module 32, configured to: when receiving a route query request that has not been received before, establish and not receive the query policy template according to the query policy template. The routing query request corresponds to the query policy. The query policy saving module 34 is configured to save a correspondence between the unreceived route query request and the query policy corresponding to the unreceived route query request. The query policy execution module 36 is configured to search for and execute the query policy corresponding to the received route query request in the foregoing correspondence. Through the above device, it is only necessary to establish a corresponding query policy when a query request never occurs, and when the query request occurs again, the corresponding query policy is directly called from the corresponding relationship without repeating Establish a query strategy to improve query efficiency. At the same time, the above devices support different or even contradictory query strategies at the same time, which solves the problem of low flexibility of constrained route calculation and can meet diverse user requirements. Preferably, the foregoing query policy template may further include:
( 1 ) 第一查询单元子模板, 设置为根据未收到过的路由查询请求生成第 一查询单元, 其中, 该第一查询单元, 设置为解析接收到的路由查询请求并发 送与该路由查询请求对应的第一查询请求。 (1) The first query unit sub-template is configured to generate a first query unit according to the unreceived route query request, where the first query unit is configured to parse the received route query request and send the route query Request the corresponding first query request.
( 2 ) 第二查询单元子模板, 设置为根据未收到过的路由查询请求生成第 二查询单元, 其中, 该第二查询单元, 设置为判断接收到的第一查询请求的路 由应答是否满足上述接收到的路由查询请求的约束, 如果满足该约束则查询成 功, 否则判断是否能够改变该约束, 如果能够改变该约束, 则改变该约束后发 送与上述接收到的路由查询请求对应的第二查询请求, 否则查询失败。 上述查询策略模板是建立查询策略的基础, 在接收到从未出现过的路由查 询请求之后, 只需要以上述查询策略模板为框架, 将从未出现过的路由查询请 求中包含的信息 (主要为各种约束的信息) 填充到该查询策略模板中, 即可得 到一个可执行的查询策略, 执行该策略即可获得最终的路由查询结果。 优选地, 上述第一查询请求可以包括以下至少之一的请求: 实际路由查询 请求、 全网拓朴查询请求。 在具体实施过程中, 根据实际需要在进行实际路由查询之前, 还可以先进 行全网拓朴查询, 获取全网拓朴应答, 之后再进行实际路由查询。 优选地, 上述第二查询单元, 还可以设置为在第一查询请求的路由应答满 足接收到的路由查询请求的约束的前提下, 判断第一查询请求的路由应答是否 同时满足用户自定义的扩展约束。 在具体实施过程中, 第二查询单元可以作为用户扩展功能的载体, 使用户 可以根据实际需要添加约束。 当然, 也可以建立另一独立的单元承载此功能。 优选地, 查询策略执行模块 36可以进一步包括: 第一执行单元 362 , 设置为在对应关系中查找与接收到的路由查询请求对 应的查询策略并触发该查询策略的第一查询单元, 解析该接收到的路由查询请 求并发送第一查询请求。 第二执行单元 364 , 设置为触发与该接收到的路由查询请求对应的查询策 略的第二查询单元, 判断与接收到的第一查询请求的路由应答是否满足该接收 到的路由查询请求的约束和 /或用户自定义的扩展约束,如果不满足该约束则判 断是否能够改变该约束, 如果能够改变该约束, 则改变该约束并发送第二查询 请求。 查询策略执行模块 36实际上对应于查询策略建立模块 32 , 第一执行单元 362设置为执行第一查询单元, 第二执行单元 364设置为执行第二查询单元。 优选地, 第二查询单元还可以设置为确定第二查询请求的路由应答是否满 足改变后的约束, 如果不满足则判断是否能够再次改变该约束, 直至查询成功 或者由于不能再改变该约束而查询失败。 在约束条件可变的前提下, 第二查询单元可以迭代的执行查询动作, 直到 查询到最佳路由, 或者查询失败。 从以上的描述中, 可以看出, 本发明充分利用了路由控制器 RC的输入输 出接口及 CSPF模块, 大大提高了约束路由计算的灵活性。 此外, 本发明釆用 了才艮据路由查询请求建立与之对应的查询策略装置的方案, 使不同的路由查询 请求可以建立不同的查询策略, 路由查询请求与查询策略之间建立了一种—— 对应的关系, 用户在改变查询请求时, 仅需要重新构造查询策略装置即可, 不 影响已经建立好的查询策略, 提高了系统的可扩展性。 与此同时, 当用户的路 由查询请求之前已经出现过时, 只需在对应关系中查找对应的查询策略即可, 而不需要重新建立查询策略, 提高了查询效率。 显然, 本领域的技术人员应该明白, 上述的本发明的各模块或各步骤可以 用通用的计算装置来实现, 它们可以集中在单个的计算装置上, 或者分布在多 个计算装置所组成的网络上, 可选地, 它们可以用计算装置可执行的程序代码 来实现, 从而, 可以将它们存储在存储装置中由计算装置来执行, 并且在某些 情况下, 可以以不同于此处的顺序执行所示出或描述的步骤, 或者将它们分别 制作成各个集成电路模块, 或者将它们中的多个模块或步骤制作成单个集成电 路模块来实现。 这样, 本发明不限制于任何特定的硬件和软件结合。 以上所述仅为本发明的优选实施例而已, 并不用于限制本发明, 对于本领 域的技术人员来说, 本发明可以有各种更改和变化。 凡在本发明的 ^"神和原则 之内, 所作的任何修改、 等同替换、 改进等, 均应包含在本发明的保护范围之 内。 (2) The second query unit sub-template is configured to generate a second query unit according to the route query request that has not been received, where the second query unit is configured to determine whether the route response of the received first query request is satisfied. The constraint of the received route query request, if the constraint is met, the query is successful, otherwise it is determined whether the constraint can be changed. If the constraint can be changed, the constraint is changed, and then the second corresponding to the received route query request is sent. Query the request, otherwise the query fails. The above query policy template is the basis for establishing a query policy. After receiving a route query request that has never occurred, the information included in the route query request that has never occurred is only required to use the above query policy template as a framework (mainly The information of various constraints is populated into the query policy template, and an executable query policy can be obtained, and the final route query result can be obtained by executing the strategy. Preferably, the foregoing first query request may include a request of at least one of the following: an actual route query request, a full network topology query request. In the specific implementation process, before the actual route query is performed, you can perform the topology query of the entire network to obtain the topology response of the entire network, and then perform the actual route query. Preferably, the foregoing second query unit may be further configured to: if the route response of the first query request satisfies the constraint of the received route query request, determine whether the route response of the first query request satisfies the user-defined extension at the same time. constraint. In a specific implementation process, the second query unit can serve as a carrier for the user extension function, so that the user can add constraints according to actual needs. Of course, it is also possible to establish another independent unit to carry this function. Preferably, the query policy execution module 36 may further include: a first execution unit 362, configured to search for a query policy corresponding to the received route query request in the correspondence relationship and trigger a first query unit of the query policy, and parse the receiving The route query request is sent and the first query request is sent. The second executing unit 364 is configured to: trigger a second query unit that triggers a query policy corresponding to the received route query request, and determine whether the route response of the received first query request satisfies the constraint of the received route query request And/or a user-defined extended constraint, if the constraint is not satisfied, it is determined whether the constraint can be changed, and if the constraint can be changed, the constraint is changed and a second query request is sent. The query policy execution module 36 actually corresponds to the query policy creation module 32, the first execution unit 362 is arranged to execute the first query unit, and the second execution unit 364 is arranged to execute the second query unit. Preferably, the second querying unit may further be configured to determine whether the routing response of the second query request satisfies the changed constraint, and if not, determine whether the constraint can be changed again until the query succeeds or the query cannot be changed again. failure. Under the premise that the constraints are variable, the second query unit can perform the query action iteratively until the optimal route is queried, or the query fails. From the above description, it can be seen that the present invention fully utilizes the input and output interface of the routing controller RC and the CSPF module, which greatly improves the flexibility of the constraint routing calculation. In addition, the present invention uses a scheme for establishing a query policy device corresponding to a routing query request, so that different routing query requests can establish different query policies, and a routing query request and a query policy are established between each other. — Corresponding relationship, when the user changes the query request, it only needs to reconstruct the query policy device, which does not affect the established query strategy and improves the scalability of the system. At the same time, when the user's route query request has expired, it is only necessary to find the corresponding query policy in the corresponding relationship, and it is not necessary to re-establish the query policy, thereby improving the query efficiency. Obviously, those skilled in the art should understand that the above modules or steps of the present invention can be implemented by a general-purpose computing device, which can be concentrated on a single computing device or distributed over a network composed of multiple computing devices. Alternatively, they may be executed by a computing device Implemented so that they can be stored in a storage device by a computing device, and in some cases, the steps shown or described can be performed in an order different from that herein, or separately The integrated circuit modules are implemented by making a plurality of modules or steps of them into a single integrated circuit module. Thus, the invention is not limited to any specific combination of hardware and software. The above is only the preferred embodiment of the present invention, and is not intended to limit the present invention, and various modifications and changes can be made to the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the scope of the present invention are intended to be included within the scope of the present invention.

Claims

权 利 要 求 书 Claim
1. 一种路由查询装置, 应用于自动交换光网络, 包括: A route query device, which is applied to an automatic switched optical network, and includes:
查询策略建立模块, 设置为在接收到之前未收到过的路由查询请求 时, 根据查询策略模板建立与所述未收到过的路由查询请求对应的查询 策略;  The query policy establishing module is configured to: when receiving a route query request that has not been received before, establish a query policy corresponding to the unreceived route query request according to the query policy template;
查询策略保存模块, 设置为保存所述未收到过的路由查询请求与对 应于所述未收到过的路由查询请求的所述查询策略的对应关系;  a query policy saving module, configured to save a correspondence between the unreceived route query request and the query policy corresponding to the unreceived route query request;
查询策略执行模块, 设置为在所述对应关系中查找与接收到的路由 查询请求对应的查询策略并执行。  The query policy execution module is configured to search for and execute the query policy corresponding to the received route query request in the corresponding relationship.
2. 根据权利要求 1所述的装置, 其中, 所述查询策略模板包括: 2. The device according to claim 1, wherein the query policy template comprises:
第一查询单元子模板, 设置为根据所述未收到过的路由查询请求生 成第一查询单元, 其中, 所述第一查询单元, 设置为解析所述接收到的 路由查询请求并发送第一查询请求;  a first query unit sub-template, configured to generate a first query unit according to the unreceived route query request, where the first query unit is configured to parse the received route query request and send the first Query request
第二查询单元子模板, 设置为根据所述未收到过的路由查询请求生 成第二查询单元, 其中, 所述第二查询单元, 设置为判断接收到的所述 第一查询请求的路由应答是否满足所述接收到的路由查询请求的约束, 如果不满足所述约束则判断是否能够改变所述约束, 如果能够改变所述 约束, 则改变所述约束发送第二查询请求。  a second query unit sub-template, configured to generate a second query unit according to the unreceived route query request, where the second query unit is configured to determine the received route response of the first query request Whether the constraint of the received route query request is satisfied, if the constraint is not satisfied, it is determined whether the constraint can be changed, and if the constraint can be changed, the constraint is changed to send a second query request.
3. 根据权利要求 2所述的装置, 其中, 所述第一查询请求包括以下至少之 一: 实际路由查询请求、 全网拓朴查询请求。 The device according to claim 2, wherein the first query request comprises at least one of the following: an actual route query request, a network-wide topology query request.
4. 根据权利要求 3所述的装置, 其中, 所述第二查询单元, 还设置为在所 述第一查询请求的路由应答满足所述接收到的路由查询请求的约束的前 提下, 判断所述第一查询请求的路由应答是否同时满足用户自定义的扩 展约束。 The device according to claim 3, wherein the second query unit is further configured to determine, under the premise that the routing response of the first query request satisfies the constraint of the received routing query request Whether the routing response of the first query request satisfies the user-defined extended constraint at the same time.
5. 根据权利要求 4所述的装置, 其中, 所述查询策略执行模块包括: 第一执行单元, 设置为在所述对应关系中查找与所述接收到的路由 查询请求对应的所述查询策略并触发该查询策略的第一查询单元, 解析 所述接收到的路由查询请求并发送所述第一查询请求; 第二执行单元, 设置为触发与所述接收到的路由查询请求对应的所 述查询策略的第二查询单元, 判断与接收到的所述第一查询请求的路由 应答是否满足所述接收到的路由查询请求的约束和 /或所述用户 自定义 的扩展约束, 如果不满足所述约束则判断是否能够改变所述约束, 如果 能够改变所述约束, 则改变所述约束并发送所述第二查询请求。 The device according to claim 4, wherein the query policy execution module comprises: a first execution unit, configured to search for the query policy corresponding to the received route query request in the correspondence relationship And triggering the first query unit of the query policy, parsing the received route query request, and sending the first query request; a second execution unit, configured to trigger a second query unit of the query policy corresponding to the received route query request, to determine whether the received route response of the first query request satisfies the received Routing the query request constraint and/or the user-defined extended constraint, if the constraint is not satisfied, determining whether the constraint can be changed, if the constraint can be changed, changing the constraint and transmitting the second Query request.
6. 根据权利要求 5所述的装置, 其中, 所述第二查询单元还设置为确定所 述第二查询请求的路由应答是否满足改变后的所述约束, 如果不满足则 判断是否能够再次改变所述约束, 直至查询成功或者由于不能再改变所 述约束而查询失败。 The device according to claim 5, wherein the second querying unit is further configured to determine whether the routing response of the second query request satisfies the changed constraint, and if not, determine whether it can be changed again. The constraint fails until the query is successful or because the constraint cannot be changed again.
7. —种路由查询方法, 应用于自动交换光网络, 包括: 7. A route query method, applied to an automatically switched optical network, comprising:
才艮据查询策略模板建立与之前未收到过的路由查询请求对应的查询 策略;  The query policy corresponding to the route query request that has not been received before is established according to the query policy template;
保存所述未收到过的路由查询请求与对应于所述未收到过的路由查 询请求的所述查询策略的对应关系;  And storing a correspondence between the unreceived route query request and the query policy corresponding to the unreceived route query request;
在所述对应关系中查找与接收到的路由查询请求对应的查询策略并 执行。  The query policy corresponding to the received route query request is searched for and executed in the corresponding relationship.
8. 根据权利要求 7所述的方法, 其中, 所述查询策略模板包括: 8. The method according to claim 7, wherein the query policy template comprises:
第一查询单元子模板, 设置为根据所述未收到过的路由查询请求生 成第一查询单元, 其中, 所述第一查询单元, 设置为解析所述接收到的 路由查询请求并发送与该路由查询请求对应的第一查询请求;  a first query unit sub-template, configured to generate a first query unit according to the unreceived route query request, where the first query unit is configured to parse the received route query request and send the The first query request corresponding to the route query request;
第二查询单元子模板, 设置为根据所述未收到过的路由查询请求生 成第二查询单元, 其中, 所述第二查询单元, 设置为判断接收到的所述 第一查询请求的路由应答是否满足所述接收到的路由查询请求的约束, 如果满足所述约束则查询成功, 否则判断是否能够改变所述约束, 如果 能够改变所述约束, 则改变所述约束后发送与所述接收到的路由查询请 求对应的第二查询请求, 否则查询失败。  a second query unit sub-template, configured to generate a second query unit according to the unreceived route query request, where the second query unit is configured to determine the received route response of the first query request Whether the constraint of the received route query request is satisfied, if the constraint is satisfied, the query is successful, otherwise it is determined whether the constraint can be changed, and if the constraint can be changed, the constraint is changed and then sent and the received The routing query request corresponds to the second query request, otherwise the query fails.
9 根据权利要求 8所述的方法, 其中, 所述第一查询请求包括以下至少之 一: 实际路由查询请求、 全网拓朴查询请求。 The method according to claim 8, wherein the first query request comprises at least one of the following: an actual route query request, a network-wide topology query request.
10. 居权利要求 9所述的方法, 其中, 所述第二查询单元在判断所述第一 查询请求的路由应答满足所述接收到的路由查询请求的约束之后, 继续 判断所述路由应答是否同时满足用户自定义的扩展约束。 The method of claim 9, wherein the second query unit continues to determine whether the route response is after determining that the route response of the first query request satisfies the constraint of the received route query request At the same time, user-defined extended constraints are met.
11. 根据权利要求 10所述的方法, 其中, 执行所述查询策略包括: 11. The method according to claim 10, wherein executing the query policy comprises:
触发所述第一查询单元, 解析所述接收到的路由查询请求并发送所 述第一查询请求;  Triggering the first query unit, parsing the received route query request, and transmitting the first query request;
触发所述第二查询单元, 判断与接收到的所述第一查询请求的路由 应答是否满足所述接收到的路由查询请求的约束和 /或所述用户 自定义 的扩展约束, 如果满足则查询成功;  Trimming the second query unit, determining whether the received routing response of the first query request satisfies the constraint of the received routing query request and/or the user-defined extended constraint, and if satisfied, queries Success
如果不满足则判断是否能够改变所述约束,如果能够改变所述约束, 则改变所述约束并发送所述第二查询请求, 否则查询失败;  If it is not satisfied, it is judged whether the constraint can be changed, if the constraint can be changed, the constraint is changed and the second query request is sent, otherwise the query fails;
判断所述第二查询请求的路由应答是否满足改变后的所述约束, 如 果是则查询成功, 否则判断是否能够再次改变所述约束, 直至查询成功 或者由于不能再改变所述约束而查询失败。  Determining whether the routing response of the second query request satisfies the changed constraint, if yes, the query is successful, otherwise it is determined whether the constraint can be changed again until the query is successful or the query fails because the constraint cannot be changed.
PCT/CN2011/073838 2010-11-12 2011-05-09 Apparatus and method for route inquiry WO2012062092A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201010543093.4A CN102469012B (en) 2010-11-12 2010-11-12 routing inquiring device and method
CN201010543093.4 2010-11-12

Publications (1)

Publication Number Publication Date
WO2012062092A1 true WO2012062092A1 (en) 2012-05-18

Family

ID=46050361

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2011/073838 WO2012062092A1 (en) 2010-11-12 2011-05-09 Apparatus and method for route inquiry

Country Status (2)

Country Link
CN (1) CN102469012B (en)
WO (1) WO2012062092A1 (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111404820B (en) * 2020-03-09 2022-04-29 深信服科技股份有限公司 Route query method, device, equipment and readable storage medium

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1825830A (en) * 2005-06-08 2006-08-30 华为技术有限公司 System and method for implementing route control
CN1997074A (en) * 2006-12-27 2007-07-11 华为技术有限公司 System, device and method for strategy-based routing mode
CN101156395A (en) * 2005-08-04 2008-04-02 华为技术有限公司 Cross-domain routing control method

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100438513C (en) * 2005-06-07 2008-11-26 华为技术有限公司 System and method for realizing route control
CN100536405C (en) * 2006-11-07 2009-09-02 中兴通讯股份有限公司 Method of obtaining protection path of effectively used network resource
EP2096801B1 (en) * 2006-11-28 2013-06-19 ZTE Corporation A united route query method in the automatic switched optical network

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1825830A (en) * 2005-06-08 2006-08-30 华为技术有限公司 System and method for implementing route control
CN101156395A (en) * 2005-08-04 2008-04-02 华为技术有限公司 Cross-domain routing control method
CN1997074A (en) * 2006-12-27 2007-07-11 华为技术有限公司 System, device and method for strategy-based routing mode

Also Published As

Publication number Publication date
CN102469012A (en) 2012-05-23
CN102469012B (en) 2016-03-30

Similar Documents

Publication Publication Date Title
US9634928B2 (en) Mesh network of simple nodes with centralized control
US9350661B2 (en) Aggregation network with centralized control
JP3830953B2 (en) Transmission system
Pasca et al. AMPS: Application aware multipath flow routing using machine learning in SDN
WO2006133633A1 (en) Node reachability identification method, link identification method, route calculation method and node address information diffusion method
EP2096802B1 (en) A hierarchical routing query method of automatic switched optical network
EP2476224A1 (en) Method and apparatus for path computation element and routing controller cooperation
JP2005252368A (en) Path calculation system and method, and communication node
Haque et al. Revive: A reliable software defined data plane failure recovery scheme
Liu et al. Performance and testbed study of topology reconfiguration in IP over optical networks
CN1330141C (en) Optical network route selecting method
WO2012062092A1 (en) Apparatus and method for route inquiry
WO2012159442A1 (en) Method and device for implementing internal link flooding
Muñoz et al. Control plane solutions for dynamic and adaptive flexi-grid optical networks
Bhumi Reddy et al. Connection provisioning for PCE-based GMPLS optical networks
JP2003258886A (en) Method for establishing optical path
WO2009086763A1 (en) Method, system and device for switching source
Zhong et al. Performance comparison of overlay and peer models in IP/MPLS over optical networks
Manolova et al. On the efficiency of BGP-TE extensions for GMPLS multi-domain routing
WO2017066923A1 (en) Method, network controller, and system for establishing service path
Zhao et al. Dual Routing Architecture in Multi-layer and Multi-domain GMPLS/ASON Networks
Zuliani et al. An implementation of an OSPF-TE to support GMPLS-controlled All-Optical WDM Networks
Xu et al. A heuristic method of logical topology reconfiguration in ip/wdm optical networks
JP2012054730A (en) Communication apparatus, network, and autonomous distributed routing control method and program for use with them
Jukan et al. Distributed provisioning of wavelength channels in multi-service WDM networks

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

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 11840450

Country of ref document: EP

Kind code of ref document: A1