CN102316390A - Method for improving path calculation efficiency with virtual topology under constraint conditions and device - Google Patents

Method for improving path calculation efficiency with virtual topology under constraint conditions and device Download PDF

Info

Publication number
CN102316390A
CN102316390A CN 201110263390 CN201110263390A CN102316390A CN 102316390 A CN102316390 A CN 102316390A CN 201110263390 CN201110263390 CN 201110263390 CN 201110263390 A CN201110263390 A CN 201110263390A CN 102316390 A CN102316390 A CN 102316390A
Authority
CN
Grant status
Application
Patent type
Prior art keywords
wavelength
link
cost
possible
constraints
Prior art date
Application number
CN 201110263390
Other languages
Chinese (zh)
Other versions
CN102316390B (en )
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

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
    • H04L45/12Shortest path evaluation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/62Wavelength based

Abstract

The invention discloses a method for improving path calculation efficiency with a virtual topology under constraint conditions and a device The method comprises the steps that: a router virtual topology which is suitable for a router constraint condition is generated according to the router constraint condition; a router with the lowest link cost is selected from the router virtual topology; a wavelength distribution virtual topology of the selected router is generated according to a wavelength constraint condition; a wavelength sequence with the lowest wavelength communication cost is selected from the wavelength distribution virtual topology. According to the invention, the problems that the effectiveness of a router calculation result is quite low and the efficiency of a wavelength distribution process is not high are solved by generating the router virtual topology and the wavelength distribution virtual topology, so that the hit of router calculation and the efficiency of wavelength assignment are improved, and the fastness of path calculation is ensured.

Description

利用虚拟拓扑提高约束条件下路径计算效率的方法及装置 Using virtual topology to improve efficiency under the constraint path computation method and apparatus

技术领域 FIELD

[0001] 本发明涉及光通信领域,特别涉及一种利用虚拟拓扑提高约束条件下路径计算效率的方法及装置。 [0001] The present invention relates to a method and apparatus of an optical communication field, and particularly relates to an improved virtual topology path under the constraint of computational efficiency.

背景技术 Background technique

[0002] 目前,在ASON (Automatical Iy Switched Optical Network,自动交换光网络)系统中对路径计算的普遍做法是将整个路径计算分为:R(Routing,路由计算)、 WA (Wavelength Assignment,波长分配)。 [0002] Currently, in ASON (Automatical Iy Switched Optical Network, ASON) system, a common practice is to calculate the path of the entire path computation is divided into: R (Routing, route calculation), WA (Wavelength Assignment, wavelength assignment ). 其中路由计算是选择合适路由,波长分配则是为该路由分配可用波长。 Wherein the route calculation to select an appropriate routing, wavelength assignment is assigned an available wavelength for the route.

[0003] 路径计算时往往需要满足各种约束条件。 [0003] When the path calculation often need to meet various constraints. 现有技术中路由计算的约束条件主要有:经过某节点或链路;避开某节点或链路;共享风险链路组分离;与指定节点或链路分离(以上约束条件支持必须约束和尽量约束,其中必须约束指不满足即失败,尽量约束指不满足时可放弃约束保证计算成功);链路跳数优先、代价优先等。 Constraint route calculation in the prior art are: After a certain node or link; avoid a certain node or link; shared risk link group separation; the specified node or link separation (more constraints and constraints must be supported as much as possible constraints, which must refer to the constraint that is not satisfied with a failure, as far as possible constraint refers to abandon the constraints to ensure successful calculation) is not met; link hops priority, the price priority and so on. 波长分配的约束主要有:一定用或不用某一波长,尽量用或不用某一波长,复用某一波长,使用指定中继等。 Wavelength assignment constraints are: with or without a certain wavelength, as much as possible with or without a certain wavelength, a wavelength multiplexing, and the like using the specified relay.

[0004] 现有技术中,计算路由通常是计算出路径结果后再进行是否满足约束的判断和选择。 [0004] In the prior art, typically the route calculation results then calculates the path selection and the determination of whether to satisfy the constraints. 传统的尽量型约束使用逐渐放开约束方式处理,比如对于尽量经过指定节点或链路的约束条件,首先按照必须约束计算路由,如果计算失败再舍弃约束进行计算得到最终结果。 Possible to use a conventional-type confinement constraint gradually opening manner, for example through possible constraints specified node or link to be constrained first by the route calculation, and then discarded if the calculated failure constraints calculate the final result. 这种方式使得路由计算过程有很大的盲目性,而且对于多个尽量约束的情况,多次进行约束的放开尝试会导致路由计算过程的速度变得很慢。 Such a way that the route calculation is very blindness, but also for the case where a plurality of constraints as much as possible, many times will lead to trying constraint route calculation speed becomes very slow.

[0005] 在波长分配中,现有的处理往往是在计算出全部的可用波长后,根据具体的约束进行波长选择。 [0005] In the wavelength allocation, the conventional process often in the calculation of all of the available wavelengths, the wavelength selected according to the constraints. 这种波长计算和选择过程的分开处理在很大程度上影响了波长分配过程的效率。 This separate processing and calculation wavelength selection process largely affects the efficiency of wavelength allocation process.

发明内容 SUMMARY

[0006] 本发明的目的在于提供一种利用虚拟拓扑提高约束条件下路径计算效率的方法及装置,能更好地解决路由计算结果有效性较低和波长分配过程效率不高的问题。 [0006] The object of the present invention is to provide a method for improving the use of virtual topology and device path under the constraint of computational efficiency, better address the route calculation process less effective and less efficient wavelength assignment problem.

[0007] 根据本发明的一个方面,提供了一种利用虚拟拓扑提高约束条件下路径计算效率的方法,所述方法包括: [0007] In accordance with one aspect of the invention, there is provided a method of using a virtual topology to improve efficiency under the constraint of path computation, said method comprising:

[0008] 根据路由约束条件生成适合所述路由约束条件的路由虚拟拓扑; [0008] adapted to generate the routing constraint route based on the routing constraints virtual topology;

[0009] 在所述路由虚拟拓扑中选出链路代价最小的路由; [0009] The route with the lowest link cost is selected in the virtual routing topology;

[0010] 根据波长约束条件生成所选路由的波长分配虚拟拓扑; [0010] generating a route selected wavelength allocation virtual topology constraints according to the wavelength;

[0011] 从所述波长分配虚拟拓扑中选出波长连通代价最小的波长序列。 [0011] minimum cost communication wavelength selected wavelength from the wavelength allocation sequences virtual topology.

[0012]其中, [0012] wherein,

[0013] 所述路由约束条件包括必避约束、尽量包含约束、尽量排斥约束; [0013] The routing constraints include constraints must be avoided as much as possible include constraints as possible exclusion constraints;

[0014] 所述波长约束条件包括复用波长约束、一定用波长约束、一定不用波长约束、尽量用波长约束、尽量不用波长约束。 [0014] The wavelength of a wavelength multiplexing constraints include constraints, constraint certain wavelength, not necessarily bound by wavelength, wavelength constraints try to use, as far as possible without wavelength constraints.

4[0015] 其中,生成路由虚拟拓扑的步骤包括: 4 [0015] wherein the step of generating a virtual routing topology comprises:

[0016] 将所述必避约束条件中的必避节点和必避链路从所获取的网络拓扑中移除,其中,在移除所述必避节点时,同时移除与所述必避节点相连的链路。 [0016] The node will avoid the constraints must be avoided and must be avoided in the link is removed from the acquired network topology, wherein, upon removal of the node will be avoided, while removing the necessary avoidance link connected to the node.

[0017] 其中,生成路由虚拟拓扑的步骤还包括: [0017] wherein the step of generating a virtual routing topology further comprises:

[0018] 在移除了必避节点和必避链路的网络拓扑中,将所述尽量包含约束中的尽量包含链路的链路代价减小,将与所述尽量包含约束条件中的尽量包含节点相连链路的链路代价减小; [0018] In the removed node must be avoided and must be avoided network topology link, the link cost as much as possible as far as possible comprise constraints comprising link is reduced, and the possible constraint condition comprising as possible comprising a link connected to the node link cost is reduced;

[0019] 在移除了必避节点和必避链路的网络拓扑中,将所述尽量排斥约束中的尽量排斥链路的链路代价增大,将与所述尽量排斥约束中的尽量排斥节点相连链路的链路代价增大。 [0019] will be removed in the nodes and the network topology must be avoided to avoid link, the possible exclusion constraints possible rejection of the link cost of the link is increased, with the possible exclusion constraints to the possible exclusion node is connected to the link cost of the link is increased.

[0020] 其中,生成波长分配虚拟拓扑的步骤包括: [0020] wherein the step of generating virtual topology wavelength assignment comprises:

[0021] 在所选链路代价最小的路由中,将所述复用波长约束中的复用波长的状态置为可用; [0021] In the selected route with the smallest link cost in the wavelength multiplexing constraint multiplexed wavelength state is set as available;

[0022] 在所选链路代价最小的路由中,将所述一定用波长约束中的一定用波长以外的其余波长状态置为不可用; [0022] In the selected route with the smallest link cost in the state of a certain wavelength than the rest with a certain wavelength constraint set as unavailable;

[0023] 在所选链路代价最小的路由中,将所述一定不用波长约束中的一定不用波长的状态置为不可用。 [0023] In the selected route with the smallest link cost in the wavelength constraint must not without certain wavelength unavailable for use.

[0024] 其中,生成波长分配虚拟拓扑的步骤还包括: [0024] wherein the step of generating a virtual topology wavelength assignment further comprises:

[0025] 在所选链路代价最小的路由中,将与所述尽量用波长约束中的尽量用波长相关的波长连通代价减小; [0025] In the selected route with the smallest link cost, the cost of communication as much as possible to reduce the wavelength of a wavelength as possible constraints related to the wavelength;

[0026] 在所选链路代价最小的路由中,将与所述尽量不用波长约束中的尽量不用波长相关的波长连通代价增大。 [0026] In the selected route with the smallest link cost, a wavelength far as possible without the associated cost of communication as much as possible without wavelength constraint is increased.

[0027] 其中,确定波长序列的步骤包括: [0027] wherein the sequence is determined wavelength comprises the step of:

[0028] 在所述波长分配虚拟拓扑中,选择所述波长分配虚拟拓扑中各节点内的波长连通代价之和最小的各波长作为波长序列。 [0028] In the above wavelength allocation virtual topology, the selected wavelength of the wavelength allocation of virtual topologies cost of communication nodes within each respective wavelength and the minimum wavelength as the sequence.

[0029] 根据本发明的另一方面,提供了一种利用虚拟拓扑提高约束条件下路径计算效率的装置,所述装置包括: [0029] According to another aspect of the present invention, there is provided an apparatus for using a virtual topology improve computational efficiency under the constraint of the path, the apparatus comprising:

[0030] 路由虚拟拓扑生成模块,用于根据路由约束条件生成适合所述路由约束条件的路由虚拟拓扑; [0030] Routing virtual topology generation module for generating constraint conditions for the routing of routing according to the routing constraints virtual topology;

[0031] 路由确定模块,用于在所述路由虚拟拓扑中选出链路代价最小的路由; [0031] The route determining means for selecting a smallest link cost route in the virtual routing topology;

[0032] 波长分配虚拟拓扑生成模块,用于根据波长约束条件生成所选路由的波长分配虚拟拓扑; [0032] The wavelength allocated virtual topology generation module for generating a selected wavelength assignment routing constraints according to the wavelength virtual topology;

[0033] 波长序列确定模块,用于从所述波长分配虚拟拓扑中选出波长连通代价最小的波长序列。 [0033] Wavelength sequence determination means for selecting the wavelength of minimum cost communication wavelength from the wavelength allocation sequences virtual topology.

[0034] 其中,所述路由虚拟拓扑生成模块包括, [0034] wherein said route generation module includes a virtual topology,

[0035] 移除单元,用于将所述必避约束条件中的必避节点和必避链路从所获取的网络拓扑中移除,其中,在移除所述必避节点时,同时移除与所述必避节点相连的链路; [0035] The removal unit, will be avoided for the node constraints will be avoided and must be avoided in the link is removed from the acquired network topology, wherein, upon removal of the node will be avoided, while the shift in addition to the nodes connected to the link will avoid;

[0036] 减小链路代价单元,用于在移除了必避节点和必避链路的网络拓扑中将所述尽量包含约束中的尽量包含链路的链路代价减小,将与所述尽量包含约束条件中的尽量包含节点相连链路的链路代价减小; [0036] The link cost is reduced means for removal of the network topology in the node must be avoided as far as possible and must be avoided links comprising link cost possible constraints comprising link is reduced, and that the try to include as much as possible the cost of said link comprising a link connected to the node constraints are reduced;

[0037] 增大链路代价单元,用于在移除了必避节点和必避链路的网络拓扑中将所述尽量排斥约束中的尽量排斥链路的链路代价增大,将与所述尽量排斥约束中的尽量排斥节点相连链路的链路代价增大。 [0037] The link cost increase means for the possible exclusion of the network topology must be avoided in the removed node and link will avoid link cost constraint link exclusion is increased as much as possible, and that the said exclusion constraints possible rejection of possible link cost of the link connected nodes increases.

[0038] 其中,所述波长分配虚拟拓扑生成模块包括: [0038] wherein the wavelength assignment virtual topology generation module comprises:

[0039] 状态设置单元,用于在所选链路代价最小的路由中,将所述复用波长约束中的复用波长的状态置为可用,将所述一定用波长约束中的一定用波长以外的其余波长状态置为不可用,将所述一定不用波长约束中的一定不用波长的状态置为不可用; [0039] The state setting unit, the route selected for the smallest link cost in the wavelength multiplexing constraint wavelength multiplexing status to available, with the certain wavelength with a certain constraint state other than the remaining wavelengths is set as unavailable, the wavelength constraint must not without certain wavelength unavailable for use;

[0040] 减小波长代价单元,用于在所选链路代价最小的路由中将与所述尽量用波长约束中的尽量用波长相关的波长连通代价减小; [0040] The unit cost of reducing the wavelength, a wavelength constraints try to communicate with a wavelength as possible to the wavelength associated with the selected route in a minimum cost of the link cost is reduced;

[0041] 增大波长代价单元,用于在所选链路代价最小的路由中将与所述尽量不用波长约束中的尽量不用波长相关的波长连通代价增大。 [0041] The unit cost of increasing wavelength, for the selected route in the smallest possible link cost without the expense associated with the communication wavelength far as possible without wavelength constraint is increased.

[0042] 与现有技术相比较,本发明的有益效果在于:在路径计算中,可以快速有效地计算出满足预定约束条件的路由结果,提高了路由计算的命中率和波长指配的效率,确保了路径计算的快捷性。 [0042] Compared with the prior art, the beneficial effects of the present invention is that: in the path computation may be quickly and efficiently calculated route result satisfies a predetermined constraint condition, the route calculation improved hit rate and efficiency of the wavelength assignment, to ensure the efficient computation of the path.

附图说明 BRIEF DESCRIPTION

[0043] 图1是本发明实施例提供的一种利用虚拟拓扑提高约束条件下路径计算效率的方法的流程图; [0043] FIG. 1 is an embodiment provides a method using a virtual topology flowchart path computation to improve efficiency under the constraint of the present invention;

[0044] 图2是本发明实施例提供的路由虚拟拓扑生成过程的流程图; [0044] FIG 2 is a flowchart of the route provided in a virtual topology generation process embodiment of the present invention;

[0045] 图加是本发明实施例提供的原始的节点间链路拓扑示意图; [0045] FIG between the original node is added according to an embodiment of the present invention, the link topology diagram;

[0046] 图2b是本发明实施例提供的路由虚拟拓扑示意图; [0046] FIG 2b is a route according to an embodiment of the present invention, a virtual topology diagram;

[0047] 图3是本发明实施例提供的波长分配虚拟拓扑生成过程的流程图; [0047] FIG. 3 is a flowchart showing wavelength allocation provided in virtual topology generation process of the embodiment of the present invention;

[0048] 图3a是本发明实施例提供的原始的节点内波长连通性拓扑示意图; [0048] Figure 3a is a schematic view of communication wavelength within the original topological node according to an embodiment of the present invention;

[0049] 图北是本发明实施例提供的波长分配虚拟拓扑示意图; [0049] FIG North wavelength assignment is provided by the virtual topology schematic embodiment of the present invention;

[0050] 图4是本发明实施例提供的一种利用虚拟拓扑提高约束条件下路径计算效率的装置的结构示意图。 [0050] FIG. 4 is an embodiment to provide a virtual topology utilizing a schematic view of the path calculation device efficiency under the constraint of the present invention is improved.

具体实施方式 detailed description

[0051] 以下结合附图对本发明的优选实施例进行详细说明,应当理解,以下所说明的优选实施例仅用于说明和解释本发明,并不用于限定本发明。 [0051] The following embodiments in conjunction with the accompanying drawings of the preferred embodiments of the present invention will be described in detail, it should be understood that the preferred embodiments described below are only used to illustrate and explain the present invention and are not intended to limit the present invention.

[0052] 图1是本发明实施例提供的一种利用虚拟拓扑提高约束条件下路径计算效率的方法的流程图,如图1所示,所述方法包括以下步骤: [0052] FIG. 1 is a flowchart of a virtual topology utilizing improved efficiency under the constraint path computation method according to an embodiment of the present invention, shown in Figure 1, the method comprising the steps of:

[0053] 步骤S101,根据路由约束条件生成适合所述路由约束条件的路由虚拟拓扑; [0053] step S101, the generated constraint condition suitable for the routing according to the routing constraints route virtual topology;

[0054] 获取网络拓扑,利用给出的路由约束条件对整个网络拓扑进行裁剪和代价改造, 在改造后的拓扑上完成路由计算过程。 [0054] Gets the network topology, routing constraints given utilization of the entire network topology, and the cost of crop transformation, to complete the route calculation process on the topology after the transformation.

[0055] 步骤S102,在所述路由虚拟拓扑中选出链路代价最小的路由; [0055] step S102, the route with the lowest link cost is selected in the virtual routing topology;

[0056] 步骤S103,根据波长约束条件生成所选路由的波长分配虚拟拓扑; [0056] step S103, the assignment of the selected wavelength generated routing constraints according to the wavelength virtual topology;

[0057] 根据路由结果和波长约束生成针对本次波长分配过程的拓扑,从而仅通过波长计 [0057] The wavelengths for generating the topology of the distribution process according to the routing and wavelength constraints result, so that only by wavemeter

6算过程就能得到满足约束条件的结果。 6 count process result can be obtained satisfy the constraints.

[0058] 步骤S104,从所述波长分配虚拟拓扑中选出波长连通代价最小的波长序列。 [0058] Step S104, the minimum cost is selected wavelength communication wavelength from the wavelength allocation sequences virtual topology.

[0059] 波长分配原则为最小代价原则,其中最小代价是指所选路由节点内的波长连通代价之和最小。 [0059] minimum cost allocation principle is the principle of a wavelength, where the wavelength of minimum cost refers to the cost of communicating within the selected route nodes and the minimum. 其中波长分配虚拟拓扑仅包含路由虚拟拓扑中确定的链路代价最小的路由中节点的资源信息,通过改变拓扑中的波长状态和连通代价完成约束的应用。 Wherein the wavelength assigned virtual topology information comprises only the route with the smallest resource link cost determined virtual topology routing nodes complete utilization constraint by changing the wavelength of the communication status and the cost topology.

[0060] 图2是本发明实施例提供的路由虚拟拓扑生成过程的流程图,如图2所示,路由虚拟拓扑的生成流程如下: [0060] FIG. 2 is routed to an embodiment of the present invention, a flowchart of virtual topology generation process, shown in Figure 2, the routing of virtual topology generation process is as follows:

[0061] 步骤S201,检查约束条件中是否有冲突的约束; [0061] step S201, the checking whether a constraint violation of constraint conditions;

[0062] 路由计算的约束条件主要有经过某节点或链路、避开某节点或链路即必避约束、 共享风险链路组分离、与指定节点或链路分离、链路跳数优先、代价优先、尽量包含约束、尽量排斥约束等。 [0062] The constraint route calculation mainly through a node or link, to avoid a node or link will avoid the constraint i.e., shared risk link group separation, is separated from the designated node or a link, the link hops priority, the cost of priority, try to include constraints, as far as possible exclusion constraints.

[0063] 路由虚拟拓扑中的约束条件中可能存在冲突。 [0063] virtual routing topology constraints that may exist in conflict. 比如某个节点或链路同时设置为必须经过约束和必须避开约束。 For example, a node or link must be set to the same time constraints and must avoid constraints. 如果检查到约束条件中有冲突,则结束流程,否则执行步骤S202。 If the check to the constraints of a conflict, the process ends, otherwise step S202.

[0064] 比如,获取的网络拓扑如图加所示,假设以节点A为源节点,以节点C为目的节点。 [0064] For example, the acquired network topology shown in FIG addition, assumed that node A is the source node, destination node to node C. 假设预先设置的链路代价如下:,AB链路的代价是25、AD链路的代价是15,BC链路的代价是10,DC链路的代价是30,AE链路的代价是10,BE链路的代价是5,CE链路的代价是9,DE链路的代价是10。 Suppose link cost set in advance as follows: the expense AB link 25, the link cost of AD is 15, cost of link BC is 10, the cost of the DC link 30, the link cost of the AE 10, bE is the cost of the link 5, the link cost of CE is 9, the cost of the link is 10 DE. 假设设置的约束条件是:必须避开链路AD、尽量排斥节点E。 Setting constraints assumed that: link must avoid AD, possible rejection node E. 检查上述约束条件并不存在冲突,执行步骤S202。 Checking of the above constraints there is no conflict, perform step S202.

[0065] 步骤S202,将必避约束中的节点和链路从拓扑中过滤掉; [0065] step S202, the constraint will be avoided filtered nodes and links from the topology;

[0066] 将必避约束中的节点和链路从路由虚拟拓扑中移除,其中节点的移除包含与节点相连链路的移除。 [0066] will be avoided constraint nodes and links are removed from the virtual routing topology, wherein removing comprises removing nodes connected to the node of the link. 比如,在图加中,设置的约束条件中必须避开的链路是AD,因此将AD 链路从图加中移除,移除后的路由虚拟拓扑如图2b所示。 For example, in FIG addition, the constraint condition setting must be avoided in AD is a link, the link will therefore be removed from the AD in FIG addition, routing the removed virtual topology shown in FIG. 2b.

[0067] 步骤S203,减少尽量包含约束中相关链路的链路代价; [0067] step S203, the link cost reduction as far as possible comprising constraint associated link;

[0068] 在移除了必避节点和必避链路的网络拓扑中,将尽量包含链路的代价减小,将与尽量包含节点相连链路的代价减小。 [0068] will be removed in the nodes and the network topology must be avoided to avoid link, comprising the cost of the link is reduced as much as possible, as far as possible will reduce the cost of the link connected to the node comprising. 依据公式dnCT = dmin/N调整链路代价,其中,dMW为减小后的链路代价,dmin为当前拓扑中的最小链路代价,N为拓扑中的节点数。 According to the formula dnCT = dmin / N adjustment link cost, wherein, the DMW is the link cost is reduced, Dmin is the minimum cost of the current link topology, N is the number of nodes in the topology. 这样既保证了尽量包含的节点或者链路能够被优先选到,又能同时满足多个尽量包含约束。 This will ensure the links or nodes as many as possible is preferably selected to be, and can comprise as much as possible while satisfying a plurality of constraints.

[0069] 在图2b中,预设的约束条件中没有尽量包含约束,此处不做处理。 [0069] In Figure 2b, the preset constraints include constraints is not possible, not treated here.

[0070] 步骤S204,增大尽量排斥约束中相关链路的链路代价。 [0070] Step S204, the link cost is increased as much as possible exclusion constraints related links.

[0071] 在移除了必避节点和必避链路的网络拓扑中,将尽量排斥链路的代价增大,将与尽量排斥节点相连链路的代价增大。 [0071] will be removed in the nodes and the network topology must be avoided to avoid link, we will try to increase the cost of the link exclusion, as far as possible will increase the cost of the link connected to the node rejection. 依据公式= d。 According to the formula = d. ld+dmax*N进行代价调整,其中,dnew为增大后的链路代价,d。 ld + dmax * N be the price adjustment, wherein, after Dnew link cost is increased, d. ld为链路的初始代价,dmax为当前拓扑中的最大链路代价,N为拓扑中的节点数。 ld is the initial cost of the link, dmax is the maximum current topology, link costs, N is the number of nodes in the topology. 这样可以保证尽量排斥的节点或者链路总是最后被选到。 This ensures that try to exclude nodes or links are always the last to be selected.

[0072] 比如在图2b中,约束条件中尽量排斥的节点是E,因此将与节点E相连的链路AE、BE、CE、DE的代价按照公式cU = d。 [0072] For example, in Figure 2b, node exclusion constraints as much as possible is E, thus the cost of the link connected to the node E and AE, BE, CE, DE according to the formula cU = d. ld+dmax*N进行增大,其中N为5,dmax为30,d。 ld + dmax * N be increased, where N is 5, dmax to 30, d. ld 分别为10、5、10、9,计算出的dnew分别为160、155、160、159。 ld 10,5,10,9 respectively, were calculated dnew 160,155,160,159.

[0073] 此时,路由虚拟拓扑已经生成,如图2b所示。 [0073] In this case, the route has been generated virtual topology shown in Figure 2b. 下一步是在生成的路由虚拟拓扑上进行路径计算确定合适的路由,链路代价最小的就是满足约束的路由结果。 The next step in the routing path is generated virtual topology is calculated to determine the appropriate route, it is to meet the minimum link cost routing constraints result. 在图2b中,各个链路的代价如表1所示,链路代价最小的路由是ABC。 In Figure 2b, the cost of each link as shown in Table 1, the smallest link cost routing is ABC. [0074] [0074]

Figure CN102316390AD00081

[0075] [0075]

[0076] 表1 [0076] TABLE 1

[0077] 图3是本发明实施例提供的波长分配虚拟拓扑生成过程的流程图,如图3所示,所述流程包括以下步骤: [0077] FIG. 3 is a flowchart showing wavelength allocation provided in virtual topology generation process of the embodiment of the present invention, shown in Figure 3, the process comprising the steps of:

[0078] 步骤S301,检查约束条件中是否有冲突的约束。 [0078] step S301, the checking whether a constraint violation of constraint conditions.

[0079] 波长分配的约束条件主要有:复用波长约束、一定用波长约束、一定不用波长约束、尽量用波长约束、尽量不用波长约束。 [0079] The wavelength assignment constraints are: a wavelength multiplexing constraints, constraint certain wavelength, not necessarily bound by wavelength, wavelength constraints try to use, as far as possible without wavelength constraints. 波长约束条件有冲突时,直接结束流程,否则执行步骤S302。 When there is a conflict wavelength constraints, the process ends, otherwise step S302.

[0080] 比如,在图3a中,获取节点A、B、C的波长资源信息以及波长的约束条件。 [0080] For example, in Figure 3a, the acquisition node A, B, C, constraint information and the wavelength of the wavelength resources. 假设获取的波长资源信息包括A节点入方向的λ^ λ2、λ3、λ 4,A节点出方向的λ^ λ2、λ3,Β 节点入方向的λ^ λ3、λ4,Β节点出方向的λ^ λ2、λ3、λ 4,C节点入方向的XpX^Cf 点出方向的KW假设约束条件如下:源节点A入方向尽量使用波长λ 3、源节点A 出方向一定不用波长λ 4、目的节点C入方向一定不用波长λ 2、目的节点C出方向尽量使用波长λ1ί5检查波长约束条件没有发现冲突,执行步骤S302。 Suppose the acquired wavelength resource information includes the node A into the direction of the λ ^ λ2, λ3, λ 4, A node outbound λ ^ λ2, λ3, Β inbound node λ ^ λ3, λ4, Β node outbound λ ^ λ2, λ3, λ 4, C node inbound xpX ^ Cf point out the direction KW assumed constraints are as follows: the source node a in direction to make use of the wavelength λ 3, source node a outbound constant without wavelength λ 4, the destination node C not necessarily the direction of the wavelength λ 2, the direction of the destination node C checks to make use of wavelength λ1ί5 wavelength constraints found no conflict, perform step S302.

[0081] 步骤S302,将复用波长约束的状态置为可用。 [0081] Step S302, the wavelength of the multiplexed constrained status to available.

[0082] 复用是指将本来处于不可用状态的波长改为可用。 [0082] refers to the wavelength multiplexing have been changed in the unavailable state is available. 会出现这种情况的具体场景为:当一条连接出现故障的时候会对其进行恢复,在恢复成功前,连接所占用的波长资源不会释放,也就是不可用,所以在进行恢复连接的路径计算时,为了避免由于没有可用波长而导致路径计算失败,需要将这些波长资源的状态置为可用状态。 This occurs in specific scenarios as follows: When a connection failure will be restored, before the recovery is successful, the connection occupied by the wavelength resources are not released, is not available, so during the recovery path connected the calculation, in order to avoid because there is no available path computation failure caused by wavelength, a wavelength in the status of these resources is set as available.

[0083] 图3a中没有复用波长,此处不用设置。 [0083] FIG 3a is not multiplexed wavelength not set here.

[0084] 步骤S303,将一定用波长约束以外的其余波长置为不可用。 [0084] step S303, the counter will always use the remaining wavelengths other than the wavelength constraints as unavailable.

[0085] 将一定用波长约束以外的其他所有波长的约束状态设置为不可用。 Status of all wavelengths other constraints [0085] The constraint other than the certain wavelength is set as unavailable.

[0086] 图3a中没有一定用波长,此处不用设置。 [0086] FIG 3a is not certain wavelength, not provided here.

[0087] 步骤S304,将一定不用波长的状态置为不可用。 [0087] step S304, the status of a certain wavelength is not set as unavailable.

[0088] 比如,在图3a中,约束条件是源节点A出方向一定不用波长λ 4、目的节点C入方向一定不用波长λ 2,因此将源节点A出方向的波长入4置为不可用,目的节点C入方向的波长λ 2置为不可用。 [0088] For example, in Figure 3a, the constraint that the source node A outbound constant without wavelength [lambda] 4, destination node C in direction must not have a wavelength λ 2, and therefore the wavelength A the direction of the source node into 4 set as unavailable the wavelength λ into the direction of the destination node C 2 is set as unavailable.

[0089] 步骤S305,构造波长分配虚拟拓扑并进行连通代价的初始化。 [0089] step S305, the configuration of the wavelength assignment and the virtual topology initialize communication cost.

[0090] 根据当前资源状态构造节点内的波长分配虚拟拓扑,并初始化波长分配虚拟拓扑中的波长连通代价。 [0090] The virtual topology wavelength allocation in the current state of the resource node configuration, and initialize the virtual connection cost wavelength distribution topology. 其中,波长变换的连通代价大于波长直通的代价。 Wherein, the communication cost of the wavelength conversion through a wavelength greater than the cost.

[0091] 比如,在图3a中,根据当前资源状态构造节点A、B、C内部的波长分配虚拟拓扑,并初始化波长直通的连通代价为3,波长变换的连通代价为4。 [0091] For example, in Figure 3a, the node configuration A, B, C inside the wavelength assignment virtual topology according to the current state of the resource, and initiates communication through consideration of a wavelength 3, the communication cost of the wavelength conversion is 4. 其中,资源状态即波长的状态, 比如波长可用或不可用等。 Wherein the wavelength resource state i.e. the state, such as the wavelength and the like can be used or unavailable.

[0092] 步骤S306,将节点内尽量用波长的连通代价减小。 [0092] step S306, the communication will minimize the cost of using a wavelength in the node.

[0093] 将与尽量用波长相关的连通代价减小。 [0093] Consideration will be reduced as much as possible with the communication wavelength dependent. 依据公式= dmin/N来进行波长连通代价调整,其中为减小后的波长连通代价,dmin为拓扑中最小的波长连通性代价,N为波长分配虚拟拓扑中的路由节点数。 According to the formula = dmin / N to the cost of the communication wavelength adjustment, wherein the wavelength of the reduced cost of communication, Dmin is the minimum wavelength connectivity topology of the cost, N virtual routing nodes for the wavelength assignment topology.

[0094] 比如,在图3a中,约束条件是源节点A入方向尽量使用波长λ 3、目的节点C出方向尽量使用波长λ1ί5将与源节点A入方向波长λ 3相关连通代价和与目的节点C出方向入工相关连通代价按照公式dMW = dmin/N进行减小。 [0094] For example, in Figure 3a, the constraint that the source node A in direction to make use of the wavelength λ 3, the destination node C a direction to make use of wavelength λ1ί5 wavelength source node A into the direction of the λ 3 related communication costs and the destination node C into a working direction for reducing the cost of related communication according to the formula dMW = dmin / N. 其中,源节点A入方向波长λ3的相关连通代价是A入方向波长入3至六出方向波长λ 3,目的节点C出方向波长X1的相关连通代价是C入方向波长X1至(:出方向波长λ1()根据公式计算出的减小后的波长连通代价分别是1,其中,(1_为3^为3。 Wherein the source node A into the direction of the wavelength λ3 is the cost associated communication wavelength in direction A into 3-6 direction of the wavelength λ 3, related to the cost of the communication destination node C is the C direction of the wavelength X1 X1 to the direction of the wavelength (: the direction wavelength lambda () according to the wavelength communicating the reduced cost of the formula 1 respectively, wherein (1_ 3 ^ 3.

[0095] 步骤S307,将节点内尽量不用波长的连通代价增大。 [0095] step S307, the communication cost of the node as far as possible without wavelength increases.

[0096] 将与尽量不用波长相关的连通代价增大。 [0096] The communication wavelength far as possible without the cost associated with the increase. 依据公式Clnew = d。 According to the formula Clnew = d. ld+dmax*N进行调整波长连通代价,其中dMW为增大后的波长连通代价,d。 ld + dmax * N wavelength adjusting the connection cost, wherein the cost of the communication wavelength dMW increased, d. ld为波长的初始连通性代价,dmax为波长分配虚拟拓扑中最大的波长连通性代价,N为波长分配虚拟拓扑中的路由节点数。 ld is the initial cost of wavelength connectivity, dmax virtual topology of the communication wavelength maximum price for wavelength assignment, N virtual routing nodes for the wavelength assignment topology.

[0097] 在图北中,没有尽量不用波长,则不必增大其连通代价。 [0097] In FIG North, no far as possible without wavelength, it is not necessary to increase the cost of communication.

[0098] 至此,波长分配虚拟拓扑已经生成,如图北所示。 [0098] Thus, the wavelength assignment virtual topology has been generated, as shown in FIG. North. 在图北拓扑上计算可用波长序列,结果如表2所示。 Calculate the available sequence in FIG North wavelength topology, the results shown in Table 2. 其中连通代价最小的就是满足约束条件的波长分配结果,即 Wherein the communication cost is to meet the constraints of the minimum wavelength allocation result, i.e.,

λ 3_λ 3_λ 1_λ 1° λ 3_λ 3_λ 1_λ 1 °

[0099] [0099]

Figure CN102316390AD00091

[0100] [0100]

[0101]表 2 [0101] TABLE 2

[0102] 图4是本发明实施例提供的一种利用虚拟拓扑提高约束条件下路径计算效率的装置,所述装置包括:路由虚拟拓扑生成模块、路由确定模块、波长分配虚拟拓扑生成模块、波长序列确定模块。 [0102] FIG. 4 is an embodiment to provide an apparatus using a virtual topology of computational efficiency under the constraint paths improve, the present invention comprises: a virtual topology generation routing module, the routing module determines the wavelength allocated virtual topology generation module, wavelength sequence determination module. 其中,路由虚拟拓扑生成模块包括移除单元、减小链路代价单元、增大链路代价单元;所述波长分配虚拟拓扑生成模块包括:状态设置单元、减小波长代价单元、 增大波长代价单元。 Wherein, the virtual routing topology generation module comprises removal unit, reducing the unit cost of the link, link cost is increased unit; the wavelength assignment virtual topology generation module comprises: a state setting unit, to reduce the unit cost of the wavelength, wavelength increases the cost of unit.

[0103] 路由虚拟拓扑生成模块用于根据路由约束条件生成适合所述路由约束条件的路由虚拟拓扑。 [0103] Routing virtual topology generation means for generating a constraint condition for the route according to the route in the routing constraints virtual topology. 其中,移除单元,用于将所述必避约束条件中的必避节点和必避链路从所获取的网络拓扑中移除,在移除所述必避节点时,同时移除与所述必避节点相连的链路;减小链路代价单元,用于在移除了必避节点和必避链路的网络拓扑中将所述尽量包含约束中的尽量包含链路的链路代价减小,将与所述尽量包含约束条件中的尽量包含节点相连链路的链路代价减小;增大链路代价单元,用于在移除了必避节点和必避链路的网络拓扑中将所述尽量排斥约束中的尽量排斥链路的链路代价增大,将与所述尽量排斥约束中的尽量排斥节点相连链路的链路代价增大。 Wherein the removal unit, must be avoided for the node constraints will be avoided and must be avoided in the link is removed from the acquired network topology, will be avoided when removing the node, and while removing the will avoid said link connecting nodes; reduce the cost of the link means will be avoided for the removal of the nodes in the network topology and the link will be avoided as far as possible the cost of possible link comprises a constraint link comprises reduce the cost of the possible link comprising the link connecting node comprising as possible constraints is reduced; link cost increase means for removing nodes and the network topology must be avoided link will avoid the rejection will try to link cost constraint link exclusion is increased as much as possible, with the possible exclusion constraints to the possible exclusion of the link connected to the node link cost is increased.

[0104] 路由确定模块,用于在所述路由虚拟拓扑中选出链路代价最小的路由。 [0104] route determining means for selecting a smallest link cost route in the virtual routing topology.

[0105] 波长分配虚拟拓扑生成模块用于根据波长约束条件生成所选路由的波长分配虚拟拓扑。 [0105] Wavelength Assignment virtual topology generation means for generating a selected wavelength assignment routing constraints according to the wavelength of the virtual topology. 其中,状态设置单元,用于在所选链路代价最小的路由中,将所述复用波长约束中的复用波长的状态置为可用,将所述一定用波长约束中的一定用波长以外的其余波长状态置为不可用,将所述一定不用波长约束中的一定不用波长的状态置为不可用;减小波长代价单元,用于在所选链路代价最小的路由中将与所述尽量用波长约束中的尽量用波长相关的波长连通代价减小;增大波长代价单元,用于在所选链路代价最小的路由中将与所述尽量不用波长约束中的尽量不用波长相关的波长连通代价增大。 Wherein the state setting unit, the route selected for the smallest link cost in the wavelength multiplexing constraint multiplexed wavelength state is set to usable, with a certain constant with the wavelength constraint other than the remaining wavelengths unavailable for use, the wavelength constraint must not without certain wavelength unavailable for use; wavelength decreases the cost unit for the selected route in the minimum link cost from the wavelength constraints try to communicate with a wavelength as possible to reduce the costs associated with the wavelength; wavelength increases the cost of unit, not possible for a wavelength selected in the route with the smallest possible link cost without the constraints associated wavelength It increases the cost of the communication wavelength.

[0106] 波长序列确定模块用于从所述波长分配虚拟拓扑中选出波长连通代价最小的波长序列。 [0106] Wavelength sequence determination means for communicating the selected wavelength minimum cost sequence of a wavelength from the wavelength allocation of virtual topologies.

[0107] 综上所述,本发明通过生成路由虚拟拓扑确定链路代价最小的路由,并在所确定的路由上生成波长分配虚拟拓扑并从中确定波长连通代价最小的波长路径,使得在路径计算中,可以快速有效地计算出满足预定约束条件的路由结果,而不是计算出结果后再进行是否满足约束的判断和选择,解决了路由计算结果有效性较低和波长分配过程效率不高的问题,提高了路由计算的命中率和波长指配的效率,确保了路径计算的快捷性。 [0107] In summary, the present invention is determined by generating a virtual topology routing route with the smallest link cost, and generates a wavelength assignment on the determined virtual topology and to determine routes communication wavelength wavelength minimum cost path, so the path computation can be quickly and efficiently calculated route result satisfies a predetermined constraint condition, instead of calculating the result and then determines whether or not to satisfy constraints and choice, the solution less effective route calculation and wavelength assignment process efficiency is not high improved route calculation hit rate and wavelength assignment of efficiency, to ensure the efficient computation of the path.

[0108] 尽管上文对本发明进行了详细说明,但是本发明不限于此,本技术领域技术人员可以根据本发明的原理进行各种修改。 [0108] Although the invention has hereinabove been described in detail, but the present invention is not limited thereto, those skilled in the art that various modifications may be made in accordance with principles of the present invention. 因此,凡按照本发明原理所作的修改,都应当理解为落入本发明的保护范围。 Accordingly, all modifications in accordance with principles of the present invention is made, it should be understood to fall within the scope of the present invention.

Claims (10)

  1. 1. 一种利用虚拟拓扑提高约束条件下路径计算效率的方法,其特征在于,所述方法包括:根据路由约束条件生成适合所述路由约束条件的路由虚拟拓扑; 在所述路由虚拟拓扑中选出链路代价最小的路由; 根据波长约束条件生成所选路由的波长分配虚拟拓扑; 从所述波长分配虚拟拓扑中选出波长连通代价最小的波长序列。 A use of virtual topology to improve computational efficiency under the constraint condition of the path, characterized in that, the method comprising: generating constraint conditions for the routing according to the routing constraint route in the virtual topology; virtual topology of the selected route the route with the smallest link cost; generating a selected wavelength assignment routing constraints according to the wavelength virtual topology; communication wavelength selected minimum cost sequence of a wavelength from the wavelength allocation of virtual topologies.
  2. 2.根据权利要求1所述的方法,其特征在于,所述路由约束条件包括必避约束、尽量包含约束、尽量排斥约束; 所述波长约束条件包括复用波长约束、一定用波长约束、一定不用波长约束、尽量用波长约束、尽量不用波长约束。 2. The method according to claim 1, wherein the routing constraints include constraints must be avoided as much as possible include constraints as possible exclusion constraints; the wavelength of a wavelength multiplexing constraints include constraints, with a certain wavelength constraints, certain wavelength without constraint, try to use wavelength constraints, do not try to wavelength constraints.
  3. 3.根据权利要求2所述的方法,其特征在于,生成路由虚拟拓扑的步骤包括:将所述必避约束条件中的必避节点和必避链路从所获取的网络拓扑中移除,其中,在移除所述必避节点时,同时移除与所述必避节点相连的链路。 3. The method according to claim 2, wherein the step of generating a virtual routing topology comprising: a node will avoid the constraint conditions must be avoided and removed from the network link will avoid the acquired topology, wherein, upon removal of the node will be avoided, while removing a link will avoid the nodes connected.
  4. 4.根据权利要求3所述的方法,其特征在于,生成路由虚拟拓扑的步骤还包括: 在移除了必避节点和必避链路的网络拓扑中,将所述尽量包含约束中的尽量包含链路的链路代价减小,将与所述尽量包含约束条件中的尽量包含节点相连链路的链路代价减在移除了必避节点和必避链路的网络拓扑中,将所述尽量排斥约束中的尽量排斥链路的链路代价增大,将与所述尽量排斥约束中的尽量排斥节点相连链路的链路代价增大。 4. The method according to claim 3, wherein the step of generating a virtual routing topology further comprises: removing a node and the network topology must be avoided will be avoided in the link, the constraints as much as possible as far as possible comprising contains link cost of the link is reduced, the cost of the possible constraints comprising link node containing the possible reduction in the removal of the link connected to the node and the network topology must be avoided in the link will be avoided, the said exclusion constraints possible rejection of possible link cost of the link is increased, with the possible exclusion constraints to the possible exclusion of the link connected to the node link cost is increased.
  5. 5.根据权利要求2-4任一项所述的方法,其特征在于,生成波长分配虚拟拓扑的步骤包括:在所选链路代价最小的路由中,将所述复用波长约束中的复用波长的状态置为可用; 在所选链路代价最小的路由中,将所述一定用波长约束中的一定用波长以外的其余波长状态置为不可用;在所选链路代价最小的路由中,将所述一定不用波长约束中的一定不用波长的状态置为不可用。 The method of any of claims 2-4, wherein the step of generating a virtual topology wavelength assignment comprising: routing a selected minimum link cost in the multiplexed wavelength multiplexing constraint a state set wavelength is available; the remaining wavelengths selected state in the smallest link cost in the route, other than the certain wavelength with a certain constraint is unavailable for use; in the selected route with the smallest link cost in the wavelength constraint must not without certain wavelength unavailable for use.
  6. 6.根据权利要求5所述的方法,其特征在于,生成波长分配虚拟拓扑的步骤还包括: 在所选链路代价最小的路由中,将与所述尽量用波长约束中的尽量用波长相关的波长连通代价减小;在所选链路代价最小的路由中,将与所述尽量不用波长约束中的尽量不用波长相关的波长连通代价增大。 6. The method as claimed in claim 5, wherein the step of generating a virtual topology wavelength assignment further comprises: routing a selected minimum link cost, the possible wavelength constraint related to the possible wavelength reduced cost of communication wavelength; selected minimum link cost routing, the wavelength of the communication as much as possible without consideration as possible without constraints associated wavelength increases.
  7. 7.根据权利要求6所述的方法,其特征在于,确定波长序列的步骤包括:在所述波长分配虚拟拓扑中,选择所述波长分配虚拟拓扑中各节点内的波长连通代价之和最小的各波长作为波长序列。 7. The method according to claim 6, wherein the step of determining the wavelength of the sequence comprising: said wavelength assignment in virtual topology, each node of a selected wavelength in the wavelength assignment virtual topology communication minimum sum Consideration each wavelength as the wavelength sequence.
  8. 8. 一种利用虚拟拓扑提高约束条件下路径计算效率的装置,其特征在于,所述装置包括:路由虚拟拓扑生成模块,用于根据路由约束条件生成适合所述路由约束条件的路由虚拟拓扑;路由确定模块,用于在所述路由虚拟拓扑中选出链路代价最小的路由;波长分配虚拟拓扑生成模块,用于根据波长约束条件生成所选路由的波长分配虚拟拓扑;波长序列确定模块,用于从所述波长分配虚拟拓扑中选出波长连通代价最小的波长序列。 A device using a virtual topology path under the constraint to improve computational efficiency, characterized in that said apparatus comprises: a virtual routing topology generation module for generating constraint conditions for the routing of routing according to the routing constraints virtual topology; route determining means for selecting a smallest link cost route in the virtual routing topology; wavelength assignment virtual topology generation module for generating a selected wavelength assignment routing constraints according to the wavelength virtual topology; wavelength sequence determination module, minimum cost for selecting the wavelength of the communication sequence of a wavelength from the wavelength allocation of virtual topologies.
  9. 9.根据权利要求8所述的装置,其特征在于,所述路由虚拟拓扑生成模块包括,移除单元,用于将所述必避约束条件中的必避节点和必避链路从所获取的网络拓扑中移除,其中,在移除所述必避节点时,同时移除与所述必避节点相连的链路;减小链路代价单元,用于在移除了必避节点和必避链路的网络拓扑中将所述尽量包含约束中的尽量包含链路的链路代价减小,将与所述尽量包含约束条件中的尽量包含节点相连链路的链路代价减小;增大链路代价单元,用于在移除了必避节点和必避链路的网络拓扑中将所述尽量排斥约束中的尽量排斥链路的链路代价增大,将与所述尽量排斥约束中的尽量排斥节点相连链路的链路代价增大。 9. The node will avoid the constraints will be avoided and the link must be avoided from the acquired device according to claim 8, wherein said route generation module includes a virtual topology, removal unit, for removing network topology, wherein, when removing the node will be avoided, while removing the link connected to the node will avoided; link cost reducing unit for removing a node and will avoid link in the network topology must be avoided as far as possible the cost of possible link comprises constraints comprising link is reduced, the cost of the possible link comprising the link connecting node comprising as possible constraints is reduced; increasing the link cost means of removal must be avoided for the nodes in the network topology and the link will be avoided as much as possible the possible exclusion exclusion constraints link cost of the link is increased, the possible exclusion of the possible rejection constraint node attached to the link cost of the link is increased.
  10. 10.根据权利要求9所述的装置,其特征在于,所述波长分配虚拟拓扑生成模块包括: 状态设置单元,用于在所选链路代价最小的路由中,将所述复用波长约束中的复用波长的状态置为可用,将所述一定用波长约束中的一定用波长以外的其余波长状态置为不可用,将所述一定不用波长约束中的一定不用波长的状态置为不可用;减小波长代价单元,用于在所选链路代价最小的路由中将与所述尽量用波长约束中的尽量用波长相关的波长连通代价减小;增大波长代价单元,用于在所选链路代价最小的路由中将与所述尽量不用波长约束中的尽量不用波长相关的波长连通代价增大。 The state setting unit, the route selected for the smallest link cost in the multiplexed wavelength constraints: 10. The device according to claim 9, wherein the wavelength assigned virtual topology generation module comprises state opposite the state remaining wavelengths multiplexed wavelength is available, other than the certain wavelength with a certain constraint is set as unavailable, the wavelength constraint must not without certain wavelength unavailable for use ; wavelength decreases the cost unit for the smallest in the link cost route with the selected wavelength to minimize possible wavelength constraint associated cost of communication wavelength; wavelength increases the cost unit for the routing in the smallest possible link cost without the expense associated with the communication wavelength far as possible without wavelength constraint is increased.
CN 201110263390 2011-09-07 2011-09-07 Using virtual topology to improve efficiency under the constraint path computation method and apparatus CN102316390B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201110263390 CN102316390B (en) 2011-09-07 2011-09-07 Using virtual topology to improve efficiency under the constraint path computation method and apparatus

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN 201110263390 CN102316390B (en) 2011-09-07 2011-09-07 Using virtual topology to improve efficiency under the constraint path computation method and apparatus
PCT/CN2012/073733 WO2012155720A1 (en) 2011-09-07 2012-04-10 Method and device for enhancing path computation efficiency under constraint using virtual topology

Publications (2)

Publication Number Publication Date
CN102316390A true true CN102316390A (en) 2012-01-11
CN102316390B CN102316390B (en) 2018-03-02

Family

ID=45429148

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201110263390 CN102316390B (en) 2011-09-07 2011-09-07 Using virtual topology to improve efficiency under the constraint path computation method and apparatus

Country Status (2)

Country Link
CN (1) CN102316390B (en)
WO (1) WO2012155720A1 (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012155720A1 (en) * 2011-09-07 2012-11-22 中兴通讯股份有限公司 Method and device for enhancing path computation efficiency under constraint using virtual topology
CN102893563A (en) * 2012-07-02 2013-01-23 华为技术有限公司 Business route determining method and related device
WO2015014196A1 (en) * 2013-07-31 2015-02-05 华为技术有限公司 Method, device and system for determining content acquisition path and processing request
WO2015070460A1 (en) * 2013-11-18 2015-05-21 华为技术有限公司 Path calculation method and apparatus for ason

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1303160A2 (en) * 2001-07-19 2003-04-16 Innovance Inc. Wavelength routing and switching mechanism for a photonic transport network
CN1863135A (en) * 2005-05-12 2006-11-15 中兴通讯股份有限公司 Path selecting method of regulating link cost
CN101640817A (en) * 2009-09-02 2010-02-03 中兴通讯股份有限公司 Method and device for route finding and wavelength assignment in optical network
CN101998187A (en) * 2009-08-18 2011-03-30 株式会社日立制作所 Information communication device and information communication method
CN102158417A (en) * 2011-05-19 2011-08-17 北京邮电大学 Method and device for optimizing multi-constraint quality of service (QoS) routing selection

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100472996C (en) * 2003-03-07 2009-03-25 中兴通讯股份有限公司 Dynamic channel power equalizing control device and method in optical network node
EP2247013A4 (en) * 2008-02-04 2012-10-24 Zte Corp A method and apparatus for realizing source routing in the blocked cross network
CN102316390B (en) * 2011-09-07 2018-03-02 中兴通讯股份有限公司 Using virtual topology to improve efficiency under the constraint path computation method and apparatus

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1303160A2 (en) * 2001-07-19 2003-04-16 Innovance Inc. Wavelength routing and switching mechanism for a photonic transport network
CN1863135A (en) * 2005-05-12 2006-11-15 中兴通讯股份有限公司 Path selecting method of regulating link cost
CN101998187A (en) * 2009-08-18 2011-03-30 株式会社日立制作所 Information communication device and information communication method
CN101640817A (en) * 2009-09-02 2010-02-03 中兴通讯股份有限公司 Method and device for route finding and wavelength assignment in optical network
CN102158417A (en) * 2011-05-19 2011-08-17 北京邮电大学 Method and device for optimizing multi-constraint quality of service (QoS) routing selection

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012155720A1 (en) * 2011-09-07 2012-11-22 中兴通讯股份有限公司 Method and device for enhancing path computation efficiency under constraint using virtual topology
CN102893563A (en) * 2012-07-02 2013-01-23 华为技术有限公司 Business route determining method and related device
WO2014005264A1 (en) * 2012-07-02 2014-01-09 华为技术有限公司 Service route determination method and relevant apparatus
CN102893563B (en) * 2012-07-02 2014-12-24 华为技术有限公司 Business route determining method and related device
WO2015014196A1 (en) * 2013-07-31 2015-02-05 华为技术有限公司 Method, device and system for determining content acquisition path and processing request
US10103986B2 (en) 2013-07-31 2018-10-16 Huawei Technologies Co., Ltd. Method, apparatus and system for determining content acquisition path and processing request
WO2015070460A1 (en) * 2013-11-18 2015-05-21 华为技术有限公司 Path calculation method and apparatus for ason
CN103858441B (en) * 2013-11-18 2017-07-28 华为技术有限公司 A method and apparatus for computing a network path ason

Also Published As

Publication number Publication date Type
WO2012155720A1 (en) 2012-11-22 application
CN102316390B (en) 2018-03-02 grant

Similar Documents

Publication Publication Date Title
US7324453B2 (en) Constraint-based shortest path first method for dynamically switched optical transport networks
US20020191545A1 (en) Methods and apparatus for selecting multiple paths taking into account shared risk
US20040042473A1 (en) Method for providing QoS (quality of service) - guaranteeing multi-path and method for providing disjoint path using the same
US20040120705A1 (en) Differentiated resilience in optical networks
Wen et al. Routing, wavelength and time-slot-assignment algorithms for wavelength-routed optical WDM/TDM networks
US20050237950A1 (en) System, method and apparatus for dynamic path protection in networks
JP2003229889A (en) Method for setting path and communication network and node device using the method
Martínez et al. Experimental translucent-oriented routing for dynamic lightpath provisioning in GMPLS-enabled wavelength switched optical networks
Ruan et al. Survivable multipath routing and spectrum allocation in OFDM-based flexible optical networks
US20120070148A1 (en) K-alternate Channel Selection for the Routing, Wavelength Assignment and Spectrum Allocation in Flexible Optical WDM Networks
US7352703B2 (en) Protection scheme for a communications network under multiple failures
Casellas et al. Enhanced backwards recursive path computation for multi-area wavelength switched optical networks under wavelength continuity constraint
CN103688497A (en) Method and device for establishing cross-domain paths
CN1674527A (en) Method for enhancing survivability of automatic exchange optical network
US20140341572A1 (en) Routing and Bandwidth Assignment for Flexible Grid Wavelength Switched Optical Networks
CN101155064A (en) Processing method for periodic line resource information of traffic engineering
JP2008054233A (en) Route calculation method, route calculation program, and route calculation apparatus
WO2013091688A1 (en) Multilayer topology representation for network
CN102185650A (en) Disjoint path-based ASON (Automatic Switched Optical Network) multiple fault protection method
Ye et al. Survivable virtual infrastructure mapping with dedicated protection in transport software-defined networks
Puype et al. Benefits of GMPLS for multilayer recovery
US20120127875A1 (en) Method and device for calculating k-shortest paths
JP2003273904A (en) Route control method and route controller
CN103117925A (en) Processing method and processing device for data message forward
CN101192883A (en) Multicast protection method in WDM optical network

Legal Events

Date Code Title Description
C06 Publication
C10 Entry into substantive examination
GR01