CN1529429A - Method for determining abstract topological link attribute for optical network hierarchical route - Google Patents

Method for determining abstract topological link attribute for optical network hierarchical route Download PDF

Info

Publication number
CN1529429A
CN1529429A CN 03134778 CN03134778A CN1529429A CN 1529429 A CN1529429 A CN 1529429A CN 03134778 CN03134778 CN 03134778 CN 03134778 A CN03134778 A CN 03134778A CN 1529429 A CN1529429 A CN 1529429A
Authority
CN
Grant status
Application
Patent type
Prior art keywords
link
abstract
node
topology
network
Prior art date
Application number
CN 03134778
Other languages
Chinese (zh)
Other versions
CN1272924C (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

Abstract

The method includes following steps: configuring route domain of network and determining boundary nodes and spokesman nodes of route domain; through 'flood' procedure in route protocol, all nodes in route domain obtain full topology information of the route domain; based on configuration information of boundary nodes and network topology information in the route domain, the spokesman nodes generate full connection conglomerate topology of this route domain, and obtain abstracting link of connection between conglomerate topology route and node; calculating available bandwidth attribute of abstracting link; spokesman nodes carries out 'flood' treatment for information of conglomerate topology and abstracting link in route domain in next higher layer. The invention can determine transmitting capacity effectively. Each node obtains transmitting capacity of any route domain in whole network by referring spokesman node of route domain in different layer.

Description

确定光网络层次式路由的抽象拓扑链路属性的方法 Abstract topological link attribute method of determining the optical routing network layer

技术领域 FIELD

本发明涉及光传输技术中确定链路属性的方法,特别涉及在光网络层次式路由中确定链路属性的方法。 The present invention relates to a method for determining link art optical transmission properties, more particularly to a method for determining link attribute of an optical network hierarchical routing.

背景技术 Background technique

自动交换光网络(ASON)技术是当前光网络的发展方向。 Automatically Switched Optical Network (ASON) technology was the direction of the optical network. ASON从逻辑上分为三个平面,即传送平面、控制平面和管理平面。 ASON logically divided into three planes, i.e., transport plane, control plane and management plane. 传送平面负责用户数据的端到端传送,可以基于SDH,也可以基于光传输网络(OTN)。 End plane is responsible for the transfer of user data transmission, may be based on SDH, it may be an optical transport network (OTN) based. 控制平面功能主要包括快速建立和拆除端到端连接,分布式修改和维护拓扑数据库以及分布式链路资源管理。 Control plane functions include quick end connection setup and teardown, modify and maintain the topology of distributed database and distributed link resource management. 管理平面提供对其他两个平面的管理。 The management plane provides management of the other two planes.

控制平面采用三种协议实现,即链路管理协议(LMP)、路由协议和信令协议。 The control plane protocol implemented using three, i.e., link management protocol (the LMP), routing protocol and signaling protocol. LMP用于发现光网络邻居,管理本地链路资源,并将光链路属性传递给光层路由协议用于全网络泛洪。 LMP optical network for discovering neighbor local link resource management, and passes to the optical properties of the optical link layer protocol for network-wide routing flooding. 路由协议泛洪光网络拓扑,用于条件约束路径计算。 Pan Guang routing protocol network topology, the constraint condition for path computation. ASON中的路由协议采用针对光传送网特征进行扩展的开放最短路径优先协议(OSPF)或者中间系统到中间系统协议(IS-IS)协议。 The ASON routing protocol employed for an extended Open Shortest Path First Protocol (OSPF) for optical transmission network feature or Intermediate System to Intermediate System (IS-IS) protocol. 信令协议根据路由计算的结果执行端到端连接建立过程。 End to end signaling protocol connection establishment procedure according to the result of the route calculation.

在传统的光网络中,业务的指配和连接的建立是基于“集中管理”模式进行的,即由全网统一的网络管理系统进行连接路由的计算和选择,网络管理系统知道全网的拓扑信息和链路属性信息,因此并不讨论拓扑聚合和链路抽象问题。 In a conventional optical network, traffic assignment and connection establishment is based on the "centralized management" mode, i.e., to calculate and select the connection route of a unified whole network network management system, the network management system knows the topology of the entire network attribute information and link information, and therefore does not discuss problems abstract topology and link polymerization.

在ASON网络技术出现后,ASON网络中分布式的连接建立取代了传统光网络中的集中式连接建立,在每一个节点均具有连接路由的计算和选择能力,这样,就要求使用路由协议来传播网络拓扑信息。 After ASON network technologies emerge, distributed ASON network connection establishment substituted centralized conventional optical network connection is established in each node has the ability to select and calculate the connection route, so that it requires the use of routing protocols to propagate network topology information. 为解决网络规模扩大后,路由域(Routing Area)内传播的网络拓扑信息急剧增加而严重影响网络性能的问题,提出了层次式路由的方案,也就是是将网络划分为不同层次的路由域,限制通过泛洪进行的路由信息交换的范围,这样,也就引出了拓扑聚合和链路抽象的问题。 To address the expansion of the network, dramatically increasing the network topology information dissemination within the routing domain (Routing Area) and the serious impact of network performance, proposed hierarchical routing scheme, that is, that the network is divided into different levels of routing domains, limit the scope of the routing information is exchanged by flooding, so that it leads to aggregation and link topology abstract problem.

目前,光互连论坛(OIF)提出了一个使用OSPF扩展的层次路由草案,该草案就层次路由的基本框架进行了说明。 At present, the Optical Internetworking Forum (OIF) proposed a hierarchical routing using OSPF expansion draft, and the draft has been described on the basic framework of hierarchical routing. 在自动交换光网络层次式路由技术中使用以下几个概念:边界节点(Border Node):一类特殊的控制域(RCD)内节点,它有一条或多条流量工程(TE)链路连接至在其它RCD中的节点。 The following concepts in the automatic switched optical network hierarchical routing: boundary node (Border Node): a special type of control field (RCD) within the node, which has one or more traffic engineering (TE) link connection to in other node in the RCD.

外部链路:两个端点分别在不同路由域(RA)的TE链路。 External links: two endpoints are in different routing domains TE links (RA) is.

内部链路:两个端点均在同一路由域(RA)的TE链路。 Internal Link: both endpoints in the same routing domain (RA) TE link.

代言者(Speaker):某一路由层次上指定RA中担当路由控制器(RC)的OSPF节点,除了和同域其它OSPF节点一样完成常规的路由协议任务以外,代言者节点也负责和上一路由层次上的RC通信。 Spokesman (Speaker): Specifies the OSPF routing node acts as the RA controller (RC) on a routing level, in addition to the same domain and other nodes as OSPF routing protocol to complete routine tasks, and is also responsible for the endorsement node on the way by the RC communication on the level.

目前,确定抽象链路的属性没有现存的方法可资利用。 Currently, to determine the properties of the link abstract no existing approach implemented.

发明内容 SUMMARY

:本发明的目的是提供确定自动交换光网络层次路由中抽象拓扑的链路属性的方法,也就是确定该抽象拓扑中两边界节点间网络承载能力的参数---可预留带宽。 : Object of the present invention to provide a method for determining the optical routing network abstraction level link attribute automatic topology exchange, i.e. determining parameters of the network carrying capacity between the two boundary node topology abstraction --- reservable bandwidth.

根据本发明提供一种对一个路由域进行拓扑聚合和确定抽象链路属性的方法。 According to the present invention there is provided a routing domain of a method for determining the topology abstraction polymerization and link attributes. 该方法包括步骤:网络配置路由域,并确定路由域的边界节点和代言者节点;经过路由协议的“泛洪”过程,路由域内的所有节点均获得该路由域的完整拓扑信息;代言者节点根据边界节点配置信息和本路由域内网络拓扑信息,生成本路由域的全连接聚合拓扑,得到聚合拓扑网路和节点之间连接的抽象链路;计算抽象链路的可预留带宽属性:代言者节点将聚合拓扑和抽象链路信息在上一层的路由域中进行“泛洪”处理。 The method comprising the steps of: a network routing domain, and determines the boundary node and endorsement node routing domain; through "flooding" process, all nodes in the routing domain routing protocols are complete topology information of the route domain; endorsement node this boundary node configuration information and network topology information according to a routing domain, the cost of raw routing domain fully connected topology of polymerization, the polymerization to obtain an abstract link connection between a network and the topology of the nodes; abstract calculation reservable bandwidth link properties: endorsement the polymerization node topology information and link abstract "flooding" of the process on a layer route domain.

根据本发明还提供由边界节点分别计算聚合拓扑和确定与之相连的抽象链路属性的方法。 According to the present invention further provides a method of boundary nodes are calculated by determining the polymerization abstract topology and link attributes of connected thereto. 该方法包括步骤: The method comprising the steps of:

网络配置路由域,并确定路由域的边界节点和代言者节点;经过路由协议的“泛洪”过程,路由域内的所有节点均获得该路由域的完整拓扑信息;边界节点各自根据边界节点配置信息和本路由域内网络拓扑信息,生成本路由域的全连接聚合拓扑,得到聚合拓扑网路和节点之间连接的抽象链路;计算边界节点相连的抽象链路的可预留带宽属性;边界节点计算完成后,将结果送到代言者节点;代言者节点接收到所有边界节点的结果后,汇总得到本路由域的聚合拓扑和抽象链路信息;代言者节点将聚合拓扑和抽象链路信息在上一层的路由域中进行“泛洪”处理。 Network routing domain, and determines the boundary node and endorsement node routing domain; through "flooding" process, all nodes in the routing domain routing protocols are complete topology information of the route domain; boundary node of each configuration information border node this domain routing and network topology information, the cost of raw routing domain fully connected topology of polymerization, the polymerization to obtain an abstract link connection between a network and the topology of the nodes; abstract calculation boundary node connected to the link reservable bandwidth attribute; boundary node Once calculated, the results speak to the node; speak after receiving the results of all node boundary node, the polymerization to obtain the topology summary and abstract routing domain link information; speak polymerization node topology information and link abstract a "flood" of dealing with one routing domain.

使用本发明的拓扑聚合和确定抽象链路属性方法能快速有效地确定一个路由域的业务传送能力,这样,在任意一个路由域中,每一个节点通过咨询其所属不同层次路由域的代言者节点,均能了解全网任意一个路由域的业务的传送能力。 Polymerization using the topology of the present invention and determined link attributes abstract method can quickly and efficiently determine the transmission capacity of a traffic routing domain, so that, in any routing domain, each node by consulting the node to which it belongs speak different hierarchical routing domains , any one can understand the business of the whole network routing domain transfer capabilities. 这也就解决了业务源节点在多层路由域体系环境中进行源路由计算的问题,为ASON的大规模组网建立了基础。 This also solves the problem of service source node source route calculation in the multilayer routing domain system environment, establish the foundation for large-scale network of ASON.

附图说明 BRIEF DESCRIPTION

图1是网络全连接拓扑抽象的方法。 The method of FIG. 1 is a fully connected network topology abstraction.

图2是一个实际网络进行拓扑聚合和确定抽象链路属性的例子。 FIG 2 is an example of a network topology aggregation and actual determination of the abstract link attributes.

具体实施方式 detailed description

拓扑聚合和链路抽象技术是层次路由中的核心技术之一。 Abstract topology and link aggregation technology is one of the core technologies of routing hierarchy. 通过拓扑聚合技术,本域内的拓扑被抽象,复杂的拓扑变得相对简单,然后域内的代言者节点将此拓扑在高层路由域中进行广播。 Polymerization techniques topology, the topology is abstracted domain, relatively simple complex topologies, then speak domain node at the top of this topology broadcast routing domain. 一般说来,RA的边界节点间从逻辑上讲均是可达的,因此拓扑聚合方法一般选择“全连接抽象”。 Generally, between boundary nodes of RA it is logically unreachable, and therefore the polymerization process is generally selected topology "fully connected abstract." 全连接抽象对网络限制和约束较少,也有利于上层网络路由的计算。 Fully connected network limitations and constraints of the abstract less, but also conducive to calculate the upper-layer network routing.

网络全连接拓扑抽象方法如图1所示。 Fully connected network topology abstraction method shown in Fig. 图中网络10为实际的网络拓扑,节点B101、节点C102、节点D103、节点E104为边界节点,代言者的节点A110,节点R121、节点S122、节点T123为网络内的一般节点。 FIG 10 is an actual network topology, node B101, C102 node, node D103, E104 node is a boundary node, the node's endorsement A110, R121 node, node S122, the node T123 is a node within the network in general. 网络中的链路200为实际物理链路。 Network link 200 is the actual physical link.

网络10经过全连接拓扑聚合过程后,得到聚合拓扑网路20。 After the network 10 fully connected topology polymerization process, the polymerization to obtain network topology 20. 在聚合后的网络20中,边界节点B101、节点C102、节点D103、节点E104仍然存在,它们之间连接的链路变为抽象链路210。 After polymerization in the network 20, border node B101, C102 node, node D103, E104 node still exists, the connection therebetween becomes abstract link 210 link.

抽象链路的属性在上层网络进行路由计算时是必须使用的信息,因此必须确定抽象链路的流量工程特性。 Abstract link attribute information used when route calculation is required in the upper layer network, it is necessary to determine the characteristics of the traffic engineering link abstract. 在进行路由计算的过程中,一般是先在高层确定路由的大致方向,再到低层进行较细致的路由计算。 Route calculation process, in general, is to determine the general direction of the route at the top, to the lower layer for a more detailed route calculation. 因此,被抽象的拓扑信息的作用在于,在路由计算中表明自己所代表的下一层的域中所能承载数据的能力。 Thus, the role of the abstract topology information that indicates the ability of the next level domain they represent can carry data in the route calculation.

在时分复用(TDM)系统中,与链路属性相关的能表示链路承载数据能力的指标有:最大带宽、最大可预留带宽以及可预留带宽。 Time division multiplexing (TDM) system, the link attribute associated with the index can be expressed capacity data link bearer are: maximum bandwidth, and the maximum reservable bandwidth reserved bandwidth. 其中最大带宽表示链路能提供的最大带宽。 Where the maximum bandwidth represents the maximum bandwidth of the link can provide. 最大可预留带宽表示链路能接受的带宽预留请求的总和,这是可配置的,在这里我们将其设为与最大带宽相同,并且在下面的讨论中不再考虑该指标。 Represents the sum of the maximum reservable bandwidth link bandwidth reservation request is acceptable, which is configurable, where we set it to the same maximum bandwidth, and the indicator no longer consider the following discussion. 可预留带宽表示该链路还能提供的带宽,它等于最大带宽减去已预留的带宽。 Reservable bandwidth represents the bandwidth of the link is also provided, which is equal to the maximum bandwidth minus the reserved bandwidth. 其中可预留带宽代表了链路当前能为一个连接提供的最大的带宽。 Wherein reservable bandwidth represents the maximum bandwidth for the current link can provide a connection. 由于拓扑抽象的作用在于表明自己所代表的整个区域所能承载数据的能力,因此在进行抽象的过程中被抽象后的链路最重要的属性应该是可预留带宽,以此来表明其能为一个连接提供的最大的带宽。 Since the abstract topology role is to show that they represent the entire region of the carrying capacity of data can, thus performing the abstraction of the most important properties of the abstracted link should be reserved bandwidth, in order to show that it can a maximum bandwidth connections provided.

在不同的路由层次间传递的路由信息是经过拓扑聚合后的精简信息,每个域的代言者节点的主要任务是对本域的拓扑进行抽象并在高一层进行广播。 Routing information between different levels of routing information through streamlining the polymerization topology, the main task Spokesman of each domain node topology of this domain is to be broadcast at Abstract and higher level.

图2是一个实际网络进行拓扑聚合和确定抽象链路属性的例子。 FIG 2 is an example of a network topology aggregation and actual determination of the abstract link attributes.

在图2中,网络10是实际网络,网络20是网络10经过全连接抽象后形成的网络。 In Figure 2, the network is a real network 10, network 20 is fully connected network after network formation 10 abstract. 图中的字母A~H代表节点名称,其中节点A、B、C和D为边界节点100,节点E、F、G、H为中间节点120。 FIG letters A ~ H name representative node, where nodes A, B, C and D is a boundary node 100, node E, F, G, H of the intermediate node 120. 节点间的链路均为双向链路,各链路上的数字代表此时该链路的可预留带宽(在这里不考虑其单位)的例子。 Links are bidirectional links between the nodes, at which time the figure represents an example of a link on a reservable bandwidth for each link (here, regardless of its units). 网络10拓扑聚合后形成的概念网络20中的链路称之为抽象链路,它们是在边界节点之间或边界节点和代言者之间虚构出来的TE链路。 Concept of network topology network 10 formed after polymerization of a link 20 link abstract referred to, they are between the boundary nodes and the boundary node or fictitious persons speak TE link. 我们需要抽象出的抽象链路210有AB、AC、AD、BC、BD、CD,共6条。 We need to abstract abstract link 210 has AB, AC, AD, BC, BD, CD, a total of six.

下面结合图2具体叙述根据本发明对一个路由域进行拓扑聚合和确定抽象链路属性的方法和过程。 Next, a routing domain, and topology polymerization determining link attribute of an abstract methods and processes according to the present invention is specifically described in conjunction with FIG 2.

首先配置网络10为一个路由域,该路由域包括A、B、C、D、E、F、G、H八个节点,确定该路由域的节点A100、B110、C100、D100为边界节点,确定节点B110为本路由域的代言者节点。 10 to first configure a network routing domain, the route domain comprises A, B, C, D, E, F, G, H eight nodes, the node determines the route domain A100, B110, C100, D100 is the boundary node, it is determined B110 endorsement node node-based routing domain. 节点B110配置为边界节点后,它可同时担当本路由域的代言者节点。 After the node B110 configured as a boundary node, it can act as both speak of the present node routing domain. 在本路由域的路由协议运行后,经过“泛洪”过程,所有节点均获得本路由域的完整拓扑信息。 After this routing domain routing protocol operation, after the "flood" process, all nodes have received complete information in this topology routing domain. 所谓“泛洪”是指邻接节点通过链路状态数据库的同步过程,最后全网所有节点链路状态数据库达到同步的过程。 The so-called "flood" refers to an adjacent node through the synchronization process link state database, and finally the whole network to reach all nodes in the link state database synchronization process. 本路由域代言者节点B110进行拓扑聚合处理,生成如网络20所示的本路由域的全连接聚合网络拓扑,包括边界节点A、B、C、D和代言者节点B,以及它们之间互连的抽象链路210。 This domain routing topology endorsement node B110 polymerization process, the polymerization to generate a fully connected network topology, including the boundary node A, B, C, D, and endorsement node B, and between them the cross-domain route of the present networks 20 as shown in even abstract link 210. 然后计算每一条抽象链路210的可预留带宽属性。 Each link is then calculated abstract 210 reservable bandwidth properties. 最后代言者节点B110将聚合拓扑和抽象链路信息在上一层的路由域中进行“泛洪”处理。 Finally, the polymerization B110 endorsement node topology information and link abstract "flooding" of the process on a layer route domain.

根据本发明的一个实施例,下面叙述计算抽象链路210的可预留带宽属性的方法。 According to an embodiment of the present invention, a method of calculating an abstract link 210 reservable bandwidth properties described below. 下面以AD抽象链路210为例叙述计算可预留带宽属性的步骤:a)确定一个边界节点A所连接的所有内部链路的可预留带宽的最大值α1,确定α1值为3。 In the following step of calculating AD Abstract reservable bandwidth link attributes described in Example 210: a) determining a maximum reservable bandwidth α1 all internal links a boundary node A is connected, to determine the value of α1 3.

b)确定另一个边界节点D所连接的所有内部链路的可预留带宽的最大值α2,确定α2值为6c)确定两个边界节点所连接的所有内部链路的可预留带宽的最小值β,确定β值为2;d)确定域内除边界节点连接的内部链路外的所有内部链路的可预留带宽的最小值γ,确定γ值为4;e)取最大值α1、α2中的较小值,记为λ=3;f)取最小值β和γ中的较小值,记为ε=2;g)在网络中寻找两个边界节点A到D间的可预留带宽为λ的路由,如果搜索到路由,则两个边界节点间的抽象链路的可预留带宽值为λ,同时记录路由,结束计算,在本例子中搜索的可预留带宽为λ的路由为AEGD,因此AD抽象链路210的可预留带宽为λ=3,结束计算;h)如果没有搜索到路由,则将λ减少一个单位带宽,重复步骤g);i)当λ减少到与ε值相等时,如果仍然没有搜索到路由,则两个边界节点间的抽象链路的可 b) determining all internal link to the other border node D is connected to the maximum reservable bandwidth α2, α2 is determined 6c) determining all border nodes of the two inner links connected reservable bandwidth minimum beta] value, determining the value beta] 2; d) reservable bandwidth minimum value γ is determined that all internal link within a link boundary nodes except internal connection, determining the value of γ 4; e) takes the maximum value alpha] l, the smaller value α2, referred to as λ = 3; f) takes a smaller value β, and γ is a minimum value, referred to as ε = 2; g) a find two boundary node in a network to a pre between D [lambda] left bandwidth of the route, if a route search, the abstract link between two border nodes reserved bandwidth value [lambda], while recording the route, the calculation is finished, the search in the present example [lambda] reservable bandwidth route for AEGD, so the link 210 AD abstract reservable bandwidth λ = 3, the calculation is finished; H) if no searched route, a unit bandwidth will reduce [lambda], repeating step g); i) when [lambda] reduction and ε is equal to the value, if there is still a route search, the abstract link between two boundary nodes may 留带宽值为0,结束计算。 Reservable bandwidth value is 0, the calculation is finished.

同样按上述方法进行计算可得到:AB抽象链路210:可预留带宽为3,路由为AEGHB;AC抽象链路210:可预留带宽为3,路由为AEFC;BC抽象链路210:可预留带宽为4,路由为BHGFC;BD抽象链路210:可预留带宽为4,路由为BHGD;CD抽象链路210:可预留带宽为5,路由为CFGD。 The same calculation can be obtained by the above method: AB link 210 Abstract: 3 reservable bandwidth, route for AEGHB; AC link 210 Abstract: 3 reservable bandwidth, route for AEFC; BC link 210 Abstract: available 4 is reserved bandwidth, route for BHGFC; BD abstract link 210: 4 reservable bandwidth, route for BHGD; CD link 210 abstract: reservable bandwidth is 5, the route of CFGD.

上述计算得到的各条抽象链路210的可预留带宽表示在相应的链路上,如图中所示。 Abstract pieces of link 210 reservable bandwidth calculated above is shown in the corresponding link, as shown in FIG.

根据本发明由边界节点分别计算聚合拓扑和确定与之相连的抽象链路属性的方法是充分利用边界节点的计算能力,由边界节点分别计算聚合拓扑和确定与之相连的抽象链路属性,最后将计算结果分别送到代言者节点,由代言者节点汇总记录。 The method of the present invention in the polymerization and the topology of the border nodes are abstracted determined link attributes associated therewith take advantage of the computing power is the boundary node, the boundary nodes are calculated and determined by the aggregation topology abstraction link attributes associated therewith, and finally the calculation results are sent to speak node by node endorsement summary record.

下面结合图2叙述按照这种方法进行拓扑聚合和确定抽象链路属性的过程和方法。 FIG 2 is described below in connection with the polymerization process and determining the topology abstraction link attributes and methods according to this method. 该方法的步骤如下:1)配置网络10为一个路由域,确定节点A100、B110、C100、D100为边界节点,确定节点B110为本路由域的代言者节点,节点B110配置为边界节点后,它可同时担当本路由域的代言者节点。 Steps of the method are as follows: 1) Configure the network 10 to a routing domain, determination node A100, B110, C100, D100 is the boundary node, it is determined speak node routing domain, the configured node B110 B110 oriented boundary node, it node can act as both speak of the present routing domain. ;2)本路由域的路由协议运行后,经过“泛洪”过程,路由域内的所有节点均获得本路由域的完整拓扑信息;3)本路由域的各个边界节点各自根据边界节点配置信息和本路由域内网络拓扑信息进行拓扑聚合处理,生成如网络20所示的本路由域的全连接聚合网络拓扑和节点之间连接的抽象链路;4)边界节点A100、节点B110、节点C100和节点D100分别计算各自相连的每一条抽象链路的可预留带宽属性,计算完成后,各节点分别将计算结果送至路由域代言者节点B110;5)代言者节点B110接收到所有边界节点的结果后,汇总得到本路由域的聚合拓扑和抽象链路信息;6)代言者节点B110将聚合拓扑和抽象链路信息在上一层的路由域中进行“泛洪”处理。 ; 2) After the routing domain routing protocol running over "flooding" process, all nodes in the routing domain are complete topology information of the routing domain; 3) each border node according to the routing domain of the respective configuration information border node and this domain routing topology information of the network topology aggregation processing, such as generating an abstract link between a fully connected topology and aggregation network node according to the routing domain of the network 20 shown connected; 4) boundary node A100, B110 node, the node and the node C100 abstract D100 are calculated each connected to a respective link reservable bandwidth properties, after completion of the calculation, the calculation result of each node to the respective domain routing node speak B110;. 5) endorsement node B110 receives the results of all boundary node after the polymerization to obtain the topology summary and abstract routing domain link information; 6) endorsement node B110 polymerization abstract topology and link information "flooding" of the process on a layer route domain.

根据本发明的实施例,计算各个边界节点相连的抽象链路的可预留带宽属性可按上述的步骤a)到i)进行。 According to an embodiment of the present invention, each link connected to the abstract computing boundary node attributes may reservable bandwidth above steps a) to i) is.

如果网络是双向链路组成的网络,则在这种方法中,代言者节点B110汇总边界节点计算的信息时需要剔除一半的重复计算结果。 Half of the repeated calculations need to remove the network if the network is composed of a bidirectional link, in this method the endorsement information of the boundary node B110 summary node calculation.

下面以节点A100为例说明计算各自相连的每一条抽象链路AB、AC和AD的可预留带宽属性的方法。 Below an example computing node A100 abstract each connected to a respective link AB, AC, and AD may be a method to reserve bandwidth properties.

计算AD抽象链路210的可预留带宽属性的步骤如下:a)确定边界节点A所连接的所有内部链路的可预留带宽的最大值α1为3;b)确定边界节点D所连接的所有内部链路的可预留带宽的最大值α2为6;c)确定两个边界节点A、D所连接的所有内部链路的可预留带宽的最小值β为2;d)确定域内除边界节点连接的内部链路外的所有内部链路的可预留带宽的最小值γ值为4;e)取最大值α1、α2中的较小值λ=3;f)取最小值β和γ中的较小值ε=2;g)在网络中寻找两个边界节点A到D间的可预留带宽为λ的路由,如果搜索到路由,则两个边界节点间的抽象链路的可预留带宽值为λ,同时记录路由,结束计算,在本例子中搜索的可预留带宽为λ的路由为AEGD,因此AD抽象链路210的可预留带宽为λ=3,结束计算。 Step reservable bandwidth attribute calculation abstract link 210 AD as follows: a) determining all internal link boundary node A is connected to a maximum reservable bandwidth α1 is 3; b) determining the boundary node connected D All the maximum reservable bandwidth for the internal links of α2 6; c) determining two boundary node a, all internal reservable bandwidth links connected D is the minimum value β 2; d) in addition to determining the art γ minimum reservable bandwidth of all links inside the outer boundary of the internal link is connected to the node 4; e) takes the maximum value α1, the smaller the value of λ α2 = 3; f) and the minimum value β smaller value of ε = 2 γ; G) a to find two boundary node in a network of reservable bandwidth λ routes between D, if the route search, the abstract link between two boundary node reservable bandwidth [lambda] value, while recording the route, the calculation is finished, the search can reserve bandwidth in this example is a route for AEGD [lambda], so the link 210 AD abstract reservable bandwidth λ = 3, the calculation is finished .

同样按上述方法计算可得到:AB抽象链路210:可预留带宽为3,路由为AEGHB;AC抽象链路210:可预留带宽为3,路由为AEFC。 The same calculation is obtained by the above method: AB link 210 Abstract: 3 reservable bandwidth, route for AEGHB; AC link 210 Abstract: reservable bandwidth is 3, the route of AEFC.

然后在节点B 100上计算BA、BC和BD的抽象链路的属性,得到:BA抽象链路210:可预留带宽为3,路由为BHGEA;BC抽象链路210:可预留带宽为4,路由为BHGFC;BD抽象链路210:可预留带宽为4,路由为BHGD;接着在节点C100上计算CA、CB和CD的抽象链路的属性,得到:CA抽象链路210:可预留带宽为3,路由为CFEA;CB抽象链路210:可预留带宽为4,路由为CFGHB;CD抽象链路210:可预留带宽为5,路由为CFGD。 Then calculated BA, BC and BD in the Node B 100 abstract link attribute, to give: Abstract link 210 BA: 3 reservable bandwidth, route for BHGEA; BC link 210 Abstract: reservable bandwidth is 4 , route for BHGFC; BD abstract link 210: 4 reservable bandwidth, route for BHGD; then calculates CA, CB and CD properties abstract C100 at the node of the link, obtain: CA abstract link 210: may be pre 3 left bandwidth, route for CFEA; CB abstract link 210: 4 reservable bandwidth, route for CFGHB; CD link 210 abstract: reservable bandwidth is 5, the route of CFGD.

在节点D100上计算DA、DB和DC的抽象链路属性,得到:DA抽象链路210:可预留带宽为3,路由为DGEA;DB抽象链路210:可预留带宽为4,路由为DGHB;DC抽象链路210:可预留带宽为5,路由为DGFC。 Computing DA, DB and DC link attributes in abstract node DlOO, to give: the DA link 210 Abstract: 3 reservable bandwidth, route for DGEA; DB link 210 Abstract: reservable bandwidth is 4, the route of DGHB; DC link 210 abstract: reservable bandwidth is 5, the route of DGFC.

由于这些抽象链路是双向链路,在剔除一半重复信息后,得到网络完整的抽象链路属性信息如下:AB抽象链路210:可预留带宽为3,路由为AEGHB;AC抽象链路210:可预留带宽为3,路由为AEFC;AD抽象链路210:可预留带宽为3,路由为AEGD;BC抽象链路210:可预留带宽为4,路由为BHGFC;BD抽象链路210:可预留带宽为4,路由为BHGD;CD抽象链路210:可预留带宽为5,路由为CFGD。 Since these links are bidirectional link abstract, abstract link attribute information after removing half the repetition information to obtain a complete network as follows: AB link 210 Abstract: 3 reservable bandwidth, route for AEGHB; AC abstract link 210 : 3 reservable bandwidth, route for AEFC; AD abstract link 210: 3 reservable bandwidth, route for AEGD; BC link 210 abstract: 4 reservable bandwidth, route for BHGFC; BD abstract link 210: 4 reservable bandwidth, route for BHGD; CD link 210 abstract: reservable bandwidth is 5, the route of CFGD.

当RA内的拓扑发生变化或链路的可预留带宽值发生变化时,聚合拓扑的抽象链路的可预留带宽值均应重新计算。 When the topology changes in the RA or the reservable bandwidth value changes, the value of reserved bandwidth aggregation topology abstraction link should be recalculated.

上述链路既可以是单向链路,也可是双向链路。 It said link may be either a unidirectional link, but also a two-way link. 实际网络链路是单向链路,抽象得到的抽象链路也是单向链路;实际网络链路是双向链路,抽象得到的抽象链路也是双向链路。 Actual network link is a unidirectional link, the link is abstract abstract obtain unidirectional link; actual network link is a bidirectional link, the link abstract abstract bidirectional link is obtained.

Claims (7)

  1. 1.一种对一个路由域进行拓扑聚合和确定抽象链路属性的方法,该方法包括步骤:网络配置路由域,并确定路由域的边界节点和代言者节点;经过路由协议的“泛洪”过程,路由域内的所有节点均获得该路由域的完整拓扑信息;代言者节点根据边界节点配置信息和本路由域内网络拓扑信息,生成本路由域的全连接聚合拓扑,得到聚合拓扑网路和节点之间连接的抽象链路;计算抽象链路的可预留带宽属性:代言者节点将聚合拓扑和抽象链路信息在上一层的路由域中进行“泛洪”处理。 1. A method for a domain routing topology and determine the polymerization abstract link attribute, the method comprising the steps of: a network routing domain, and determines the boundary node and endorsement node routing domain; through routing protocols "flooding" procedure, all nodes have received the complete routing domain routing topology information of the domain; endorsement node configuration information and network topology information according to the present routing domain based on the boundary nodes, the cost of raw whole link aggregation topology routing domain, the polymerization to obtain network topology and the node link connection between the abstract; abstract calculation reservable bandwidth link properties: endorsement polymerization node topology information and link abstract "flooding" of the process on a layer route domain.
  2. 2.根据权利要求1的对一个路由域进行拓扑聚合和确定抽象链路属性的方法,其中所述计算抽象链路的可预留带宽属性的步骤包括:确定一个边界节点所连接的所有内部链路的可预留带宽的最大值α1;确定另一个边界节点所连接的所有内部链路的可预留带宽的最大值α2;确定两个边界节点所连接的所有内部链路的可预留带宽的最小值β;确定域内除边界节点连接的内部链路外的所有内部链路的可预留带宽的最小值γ;取最大值α1、α2中的较小值,记为λ;取最小值β和γ中的较小值,记为ε;在网络中寻找两个边界节点间带宽为λ的路由,如果搜索到路由,则两个边界节点间的抽象链路的可预留带宽值为λ,同时记录路由,结束计算;如果没有搜索到路由,则将λ减少一个单位带宽,并重复在网络中寻找两个边界节点间带宽为λ的路由的步骤;当λ减少到与 2. A method for a domain routing topology and determining the polymerization properties of the abstract link according to claim 1, wherein said step of calculating an abstract link may reservable bandwidth attributes comprises: determining a chain all internal boundary node connected maximum reservable bandwidth channel alpha] l; determining the maximum value of all internal link to the other border node connected reservable bandwidth alpha] 2; determining all internal links two boundary node connected reservable bandwidth minimum beta]; the minimum value γ reservable bandwidth for all internal link within the determined boundary nodes except internal link connection; maximum value α1, α2 the smaller value, denoted [lambda]; minimum value β and γ are relatively small values, denoted by [epsilon]; λ to find a route between two boundary node bandwidth network, if the route search, the value of the reserved bandwidth of the link between two abstract nodes boundary [lambda], while recording the route, the calculation is finished; if no searched route, will reduce [lambda] a unit bandwidth, and iteratively tries bandwidth between two boundary node [lambda] step route in the network; and if [lambda] is reduced to ε值相等时,如果仍然没有搜索到路由,则两个边界节点间的抽象链路的可预留带宽值为0,结束计算。 Ε equal value, if still not searched route, the reserved bandwidth value 0 abstract link between two boundary nodes, the calculation is finished.
  3. 3.根据权利要求1或2的对一个路由域进行拓扑聚合和确定抽象链路属性的方法,其中生成本路由域的全连接聚合拓扑,得到聚合拓扑网路和节点之间连接的抽象链路的步骤包括从实际网络的单向链路抽象得到抽象的单向链路或从实际网络的双向链路抽象得到抽象的双向链路的步骤。 The routing of a domain 1 or 2, and the polymerization method for determining the topology abstract link attribute, wherein the polymerization fully connected topology routing domain of health costs, the polymerization to obtain an abstract link connection between the network topology and the node as claimed in claim the abstract comprises a unidirectional link obtained from a unidirectional link or network abstractions of the actual steps abstract bidirectional link obtained from the two-way link abstractions of the actual network.
  4. 4.由边界节点分别计算聚合拓扑和确定与之相连的抽象链路属性的方法,该方法包括步骤:网络配置路由域,并确定路由域的边界节点和代言者节点;经过路由协议的“泛洪”过程,路由域内的所有节点均获得该路由域的完整拓扑信息;边界节点各自根据边界节点配置信息和本路由域内网络拓扑信息,生成本路由域的全连接聚合拓扑,得到聚合拓扑网路和节点之间连接的抽象链路;计算边界节点相连的抽象链路的可预留带宽属性;边界节点计算抽象链路的可预留带宽属性完成后,将结果送到代言者节点;代言者节点接收到所有边界节点的结果后,汇总得到本路由域的聚合拓扑和抽象链路信息;代言者节点将聚合拓扑和抽象链路信息在上一层的路由域中进行“泛洪”处理。 4. The method of polymerization is calculated by the boundary node topology determination are abstract and link attributes associated therewith, the method comprising the steps of: a network routing domain, and determining the routing domain boundary node and endorsement node; routing through the "Pan Hung "process, all the nodes have received the complete routing domain topology of the routing information field; each boundary node configuration information and network topology information according to the present routing domain based on the boundary nodes, the cost of raw whole link aggregation topology routing domain, the polymerization to obtain network topology abstract links and connections between the nodes; reservable bandwidth calculated abstract properties of the boundary node connected to the link; the calculated abstract border node link reservable bandwidth attribute was complete, the results speak to the node; endorsement after the node receives the results of all the boundary node, the polymerization to obtain the topology summary and abstract routing domain link information; speak polymerization node topology information and link abstract "flooding" of the process on a layer route domain.
  5. 5.根据权利要求4的由边界节点分别计算聚合拓扑和确定与之相连的抽象链路属性的方法,其中所述计算抽象链路的可预留带宽属性的步骤包括:确定一个边界节点所连接的所有内部链路的可预留带宽的最大值α1;确定另一个边界节点所连接的所有内部链路的可预留带宽的最大值α2;确定两个边界节点所连接的所有内部链路的可预留带宽的最小值β;确定域内除边界节点连接的内部链路外的所有内部链路的可预留带宽的最小值γ;取最大值α1、α2中的较小值,记为λ;取最小值β和γ中的较小值,记为ε;在网络中寻找两个边界节点间带宽为λ的路由,如果搜索到路由,则两个边界节点间的抽象链路的可预留带宽值为λ,同时记录路由,结束计算;如果没有搜索到路由,则将λ减少一个单位带宽,并重复在网络中寻找两个边界节点间带宽为λ的路由的步骤 5. The computing node 4 by the boundary are determined and the abstract topology polymerization method link attributes associated therewith, wherein the step of calculating the link reservable bandwidth abstract attributes comprises: determining a boundary node connected all internal links maximum reservable bandwidth alpha] l; determining all internal link to the other border node connected to the maximum reservable bandwidth alpha] 2; determining all border nodes of the two inner links connected reservable bandwidth minimum beta]; the minimum value γ reservable bandwidth for all internal link within the determined boundary nodes except internal link connection; alpha] l takes the maximum value, the smaller value α2, referred to as λ ; minimum value β and γ the smaller the value, referred to as [epsilon]; Looking between two boundary node bandwidth λ routing in the network, if the route search, the abstract link between two boundary node may be pre- [lambda] is the bandwidth left, while recording the route, the calculation is finished; if no searched route, will reduce [lambda] a unit bandwidth, and iteratively tries bandwidth between two boundary node routing step [lambda] in the network 当λ减少到与ε值相等时,如果仍然没有搜索到路由,则两个边界节点间的抽象链路的可预留带宽值为0,结束计算。 When λ reduced to the value equal to ε, if still not searched route, the abstract link between two border nodes reserved bandwidth value is 0, the calculation is finished.
  6. 6.根据权利要求4或5的由边界节点分别计算聚合拓扑和确定与之相连的抽象链路属性的方法,其中所述生成本路由域的全连接聚合拓扑,得到聚合拓扑网路和节点之间连接的抽象链路的步骤包括从实际网络的单向链路抽象得到抽象的单向链路或从实际网络的双向链路抽象得到抽象的双向链路的步骤。 The method according to 4 or 5, calculated by the boundary nodes is determined separately polymerized abstract topology and link attributes associated therewith, and wherein the fully-connected topology of the polymerization raw cost routing domain, the polymerization to obtain network topology and the node of claim abstract step comprises a link connected between the obtained unidirectional link abstract unidirectional link from the network abstractions of the actual or steps abstract bidirectional link obtained from the two-way link abstractions of the actual network.
  7. 7.根据权利要求4或5的由边界节点分别计算聚合拓扑和确定与之相连的抽象链路属性的方法,其中在所述抽象链路是双向链路时,所述汇总得到本路由域的聚合拓扑和抽象链路信息的步骤包括剔除一半的重复计算结果的步骤。 The method according to 4 or 5, calculated by the boundary nodes is determined separately polymerized abstract topology and link attribute associated therewith, wherein the link is a bidirectional link abstract when the aggregated routing domain to present claims abstract topology and the polymerization step comprises a link information remove half of results of calculation steps repeated.
CN 03134778 2003-09-30 2003-09-30 Method for determining abstract topological link attribute of optical network hierarchical route CN1272924C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 03134778 CN1272924C (en) 2003-09-30 2003-09-30 Method for determining abstract topological link attribute of optical network hierarchical route

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 03134778 CN1272924C (en) 2003-09-30 2003-09-30 Method for determining abstract topological link attribute of optical network hierarchical route

Publications (2)

Publication Number Publication Date
CN1529429A true true CN1529429A (en) 2004-09-15
CN1272924C CN1272924C (en) 2006-08-30

Family

ID=34286189

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 03134778 CN1272924C (en) 2003-09-30 2003-09-30 Method for determining abstract topological link attribute of optical network hierarchical route

Country Status (1)

Country Link
CN (1) CN1272924C (en)

Cited By (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2006053498A1 (en) * 2004-11-19 2006-05-26 Huawei Technologies Co., Ltd. Identification methods of domain-to-domain link based on automatically switched optical network
WO2006133633A1 (en) * 2005-06-15 2006-12-21 Huawei Technologies Co., Ltd. Node reachability identification method, link identification method, route calculation method and node address information diffusion method
WO2007012223A1 (en) * 2005-07-28 2007-02-01 Zte Corporation A method for automatically switched optical network hierarchy routing calculating and connection establishing
CN1299451C (en) * 2004-10-15 2007-02-07 清华大学 Distributing topopology polymerization method of wave wavelength route optical network
WO2008080251A1 (en) * 2006-12-01 2008-07-10 Zte Corporation A hierarchical routing query method of automatic switched optical network
CN100461689C (en) 2005-01-19 2009-02-11 华为技术有限公司 Method of protection of agent nodes in multi-layered automatic switching optical network
WO2009036671A1 (en) * 2007-09-19 2009-03-26 Fiberhome Telecommunication Technologies Co., Ltd. Method and device for validating a link attribute in the nodes of ason
CN100531445C (en) 2004-10-19 2009-08-19 北京邮电大学 Controlling method for realizing automatic discovery of resource information based on automatic switched optical network
WO2009129669A1 (en) * 2008-04-22 2009-10-29 Hong Kong Applied Science & Technology Research Institute Co., Ltd. Method and device for data routing and bandwidth reservation in small scale distributed networks
CN101026891B (en) 2006-02-21 2010-05-12 中兴通讯股份有限公司 Domain automatic generating method for automatic exchange optical network
CN101192963B (en) 2006-11-24 2010-12-08 中兴通讯股份有限公司 Naming and parsing method for sub-network point pool in automatic switch optical network
CN101361306B (en) 2005-11-29 2011-01-19 意大利电信股份公司 Optimized dynamic routing in optical network
CN101141404B (en) 2007-10-16 2011-03-16 中兴通讯股份有限公司 Stack system topological management method and topological alteration notifying method
CN101436980B (en) 2007-11-12 2012-11-14 中国科学院计算机网络信息中心 Generation of data packet forwarding table by flooding method
CN103384972A (en) * 2012-12-17 2013-11-06 华为技术有限公司 Signalling establishment method at the moment of placing electric relay in electric network elements, optical network elements and electric network elements
RU2615498C2 (en) * 2010-01-08 2017-04-05 Сан Пэтент Траст Ofdm transmitter, ofdm transmission method, ofdm receiver and ofdm reception method

Cited By (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1299451C (en) * 2004-10-15 2007-02-07 清华大学 Distributing topopology polymerization method of wave wavelength route optical network
CN100531445C (en) 2004-10-19 2009-08-19 北京邮电大学 Controlling method for realizing automatic discovery of resource information based on automatic switched optical network
US8589588B2 (en) 2004-11-19 2013-11-19 Huawei Technologies Co., Ltd. Method of identifying domain-to-domain link based on automatically switched optical network
WO2006053498A1 (en) * 2004-11-19 2006-05-26 Huawei Technologies Co., Ltd. Identification methods of domain-to-domain link based on automatically switched optical network
CN100461689C (en) 2005-01-19 2009-02-11 华为技术有限公司 Method of protection of agent nodes in multi-layered automatic switching optical network
WO2006133633A1 (en) * 2005-06-15 2006-12-21 Huawei Technologies Co., Ltd. Node reachability identification method, link identification method, route calculation method and node address information diffusion method
CN101147348B (en) 2005-07-28 2011-05-18 中兴通讯股份有限公司 Automatic exchange optical network layered route calculation and connection establishing method
WO2007012223A1 (en) * 2005-07-28 2007-02-01 Zte Corporation A method for automatically switched optical network hierarchy routing calculating and connection establishing
CN101361306B (en) 2005-11-29 2011-01-19 意大利电信股份公司 Optimized dynamic routing in optical network
CN101026891B (en) 2006-02-21 2010-05-12 中兴通讯股份有限公司 Domain automatic generating method for automatic exchange optical network
CN101192963B (en) 2006-11-24 2010-12-08 中兴通讯股份有限公司 Naming and parsing method for sub-network point pool in automatic switch optical network
US8139938B2 (en) 2006-12-01 2012-03-20 Zte Corporation Hierarchical routing query method of automatic switched optical network
WO2008080251A1 (en) * 2006-12-01 2008-07-10 Zte Corporation A hierarchical routing query method of automatic switched optical network
WO2009036671A1 (en) * 2007-09-19 2009-03-26 Fiberhome Telecommunication Technologies Co., Ltd. Method and device for validating a link attribute in the nodes of ason
CN101394677B (en) 2007-09-19 2012-10-03 烽火通信科技股份有限公司 Method and device for verifying link attribute in node of ASON
CN101141404B (en) 2007-10-16 2011-03-16 中兴通讯股份有限公司 Stack system topological management method and topological alteration notifying method
CN101436980B (en) 2007-11-12 2012-11-14 中国科学院计算机网络信息中心 Generation of data packet forwarding table by flooding method
CN101657997B (en) 2008-04-22 2012-04-18 香港应用科技研究院有限公司 Method and device for data routing and bandwidth reservation in small scale distributed networks
WO2009129669A1 (en) * 2008-04-22 2009-10-29 Hong Kong Applied Science & Technology Research Institute Co., Ltd. Method and device for data routing and bandwidth reservation in small scale distributed networks
RU2615498C2 (en) * 2010-01-08 2017-04-05 Сан Пэтент Траст Ofdm transmitter, ofdm transmission method, ofdm receiver and ofdm reception method
CN103384972A (en) * 2012-12-17 2013-11-06 华为技术有限公司 Signalling establishment method at the moment of placing electric relay in electric network elements, optical network elements and electric network elements
WO2014094209A1 (en) * 2012-12-17 2014-06-26 华为技术有限公司 Optical network element, electric network element and signaling establishment method when electric relay is in electric network element
CN103384972B (en) * 2012-12-17 2016-11-16 华为技术有限公司 An electrical relay in the grid element signaling to establish a method and an optical network element, the grid element
RU2606397C1 (en) * 2012-12-17 2017-01-10 Хуавей Текнолоджиз Ко., Лтд. Method of signalling establishing when electric regenerator is located on electric network element, optical network element and electric network element

Also Published As

Publication number Publication date Type
CN1272924C (en) 2006-08-30 grant

Similar Documents

Publication Publication Date Title
Rajagopalan et al. IP over optical networks: Architectural aspects
US6882627B2 (en) Methods and apparatus for selecting multiple paths taking into account shared risk
US6047331A (en) Method and apparatus for automatic protection switching
US6711152B1 (en) Routing over large clouds
Farrel et al. GMPLS: architecture and applications
US6564258B1 (en) Detection of network topology changes affecting trail routing consistency
US20040004938A1 (en) Routing bandwidth guaranteed paths with local restoration in label switched networks
US7099286B1 (en) Method and system for finding shared risk diverse paths
US7457233B1 (en) Method and apparatus for fast reroute in a connection-oriented network
US7168044B1 (en) Apparatus and method for automatic network connection provisioning
US20030137937A1 (en) Capacity variable link apparatus and capacity variable link setting method
US6728205B1 (en) Method and apparatus for automatic protection switching
US20020131424A1 (en) Communication network, path setting method and recording medium having path setting program recorded thereon
US7414985B1 (en) Link aggregation
Dutta et al. Traffic grooming for optical networks: foundations, techniques and frontiers
US7457277B1 (en) System and method for network layer protocol routing in a peer model integrated optical network
US20040246973A1 (en) Quality of service based optical network topology databases
US20030193901A1 (en) Communication network control system, control method, node and program
Andersen et al. On disjoint path pairs with wavelength continuity constraint in WDM networks
CN101083548A (en) A multi-domain route computation method and system
Datta et al. Efficient channel reservation for backup paths in optical mesh networks
Toh Crossover switch discovery for wireless ATM LANs
Yang et al. Inter-domain dynamic routing in multi-layer optical transport networks
CN1901503A (en) Method for obtaining intelligent light network restraining route
US20040024908A1 (en) Topology database synchronization

Legal Events

Date Code Title Description
C06 Publication
C10 Entry into substantive examination
C14 Grant of patent or utility model
EXPY Termination of patent right or utility model