CN103078796B - A route calculation method and apparatus - Google Patents

A route calculation method and apparatus Download PDF

Info

Publication number
CN103078796B
CN103078796B CN 201310035527 CN201310035527A CN103078796B CN 103078796 B CN103078796 B CN 103078796B CN 201310035527 CN201310035527 CN 201310035527 CN 201310035527 A CN201310035527 A CN 201310035527A CN 103078796 B CN103078796 B CN 103078796B
Authority
CN
Grant status
Grant
Patent type
Application number
CN 201310035527
Other languages
Chinese (zh)
Other versions
CN103078796A (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
Grant date

Links

Abstract

本发明提供了一种路由计算方法和设备,技术方案为:检测到SPB-ISIS网络拓扑变化时,计算本路由设备到SPB-ISIS网络中其它每个路由设备的所有路径的Cost和跳数,将本路由设备到该其它路由设备的Cost最小的路径中跳数最小的路径确定为该其它路由设备对应的最优路径;按照预设规则在SPB-ISIS网络中其它每个路由设备对应的最优路径中优选出该其它路由设备对应的在每种ECT算法下的转发路径,根据优选出的转发路径确定该其它路由设备对应的在该ECT算法下的出端口和下一跳。 The present invention provides a method and apparatus for route calculation, technical scheme: upon detecting a change in the network topology SPB-ISIS, route computing apparatus according to the SPB-ISIS Cost and other network hops all paths each routing device, Cost smallest minimum routing device according to the other routing device path hop count path determination for the optimum path corresponding to other routing devices; on a predetermined rule corresponding to each of the other devices in the routing network SPB-ISIS most preferably the preferred route forwarding path corresponding to the other routing devices in each ECT algorithm, determining a corresponding egress port of the other routing devices in the ECT algorithm and according to the next hop forwarding path preferably out. 本发明能够减少路由计算量。 Route calculation amount can be reduced according to the present invention.

Description

一种路由计算方法和设备 A route calculation method and apparatus

技术领域 FIELD

[0001] 本申请涉及通信技术领域,特别涉及一种路由计算方法和设备。 [0001] The present application relates to communication technologies, particularly to a method and apparatus for route calculation.

背景技术 Background technique

[0002] 迪杰斯特拉(Dijkstra)算法是一种单源最短路径算法,用于在有向加权图中计算最小生成树。 [0002] Dijkstra (the Dijkstra) algorithm is a single-source shortest path algorithm for calculating the minimum spanning tree with a directed weighted FIG. 在有向加权图中,每台设备就是一个节点(Node),设备之间的连接就是一条边(Link),用D(A,B)表示两台设备的距离,相邻设备间的距离就是接口的Cost值。 In the directed weighted graph, the connection between each device is a node device (the Node), is an edge (Link), represents the distance of the two devices by D (A, B), the distance between neighboring devices is Cost value of the interface. 参见图1所示简单组网,节点S分别通过节点A和B与节点D相连,假设该组网中任何一条边的Cost都是1,则S可以计算出到达A的出端口就是S连接到A的端口P1,距离为I ;到达B的出端口是S连接到B的端口P2,距离为I ;到达D有两条等价路径:SAD和SBD,其中,在路径SAD上的出端口是S连接到A的端口P1,距离为2,下一跳为A ;在路径SBD上的出端口是S连接到B的端口P2,距离为2,下一跳为B。 Simple network, node S as shown in FIG. 1 respectively refer to nodes A and B connected to node D, it is assumed that any one side Cost networking is 1, then S can be calculated to reach the port A is connected to the S port P1 a, the distance I; B reaches the outlet port is connected to the S port P2 of B, a distance I; D there are two arrival paths equivalent: SAD and the SBD, wherein the port is on the path SAD S is connected to the port P1 a at a distance of 2, the next hop is a; an SBD port on the path B is connected to the S port P2, a distance of 2, the next hop is B.

[0003] 中间系统到中间系统(ISIS)最早是ISO在OSI协议栈下设计的动态路由协议,采用TLV架构,易于扩展,被广泛应用于IP网络,是IPv4/IPv6双栈可共用的单播路由协议。 [0003] Intermediate System to Intermediate System (the ISIS) was first dynamic routing protocol in the ISO OSI protocol stack design, using TLV structure, easy to expand, it is widely used in IP networks are IPv4 / IPv6 dual stack may be common Unicast Routing Protocol. ISIS与其它单播路由协议如开放最短路径优先(OSPF) —样,采用Dijkstra算法计算路由设备之间的最短路径,从而算出路由的出端口和下一跳,当存在等价路径时,在等价路径上进行负载分担。 ISIS with other unicast routing protocols such as Open Shortest Path First (OSPF) - like, shortest path routing between devices Dijkstra algorithm to calculate the route and the next hop ports, when there are equal path, in other load balancing on the valence path.

[0004] 基于中间系统到中间系统的最短路径桥(SPB-1SIS)是IEEE802.1aq最新发布的最短路径桥接标准,应用ISIS协议来扩展多生成树协议(Multiple Spanning TreePr0t0C0l,MSTP),用于大二层网络核心层的转发路径的学习。 [0004] Based on the shortest path bridge Intermediate System to Intermediate System (SPB-1SIS) is IEEE802.1aq latest release of Shortest Path Bridging standard, ISIS protocol application to extend the Multiple Spanning Tree Protocol (Multiple Spanning TreePr0t0C0l, MSTP), for large learn forwarding path layer 2 network core layer. SPB-1SIS也采用Di jkstra算法计算转发路径,与传统路由协议的不同之处在于SPB-1SIS网络中没有等价路径,当两个路由设备之间存在多条cost相同的等价路径时,需要从中选出跳数最小的等价路径,如果存在多条Cost和跳数均相同且最小的等价路径,则还需要应用ECT算法进行优选,最终选择出一条作为转发路径。 SPB-1SIS be employed algorithm Di jkstra forwarding path, and conventional routing protocols except that the SPB-1SIS no equivalent network path, when there is the same equivalent cost multiple paths between two routing devices, the need to choose the smallest number of hops equal cost paths, if a plurality of Cost and hops are the same and the presence of minimal equal-cost paths, is also required ECT application algorithm preferably, a finally selected as the transfer path.

[0005] 由于SPB-1SIS网络中没有等价路径,如果需要进行负载分担,则需要网络管理员将VSI流量(Virtue Service Instance)配置到不同的VLAN内,然后为不同VLAN配置不同的ECT算法,在路径等价的情况下,应用不同ECT算法的流量将可能选择不同的路径。 [0005] Since the SPB-1SIS no equivalent network path, if the required load balancing, the network administrator needs to flow VSI (Virtue Service Instance) of the VLAN configuration to a different, and a different configuration is different from the VLAN ECT algorithms, in the case of equal-cost paths, the application of different algorithms ECT traffic will likely choose a different path. ECT算法的决策过程就是将路径上所有节点的桥ID(去不包括路径的头节点和尾节点)与ECT算法对应的掩码魔术字进行异或,然后进行字典序比较。 ECT decision process algorithm is to bridge all the nodes on the path ID (not including the head node to the path, and a tail node) corresponding to the ECT algorithm XOR mask magic word, then lexicographical comparison. 如图1所示的组网中,节点S到D有两条等价路径:径SAD和SBD,假设ECT算法I会优选出SAD为转发路径,ECT算法2会优选出SBD为转发路径,则可以将1-SID 100配置在Vlanl下并应用ECT算法1,将1-SID 200配置在Vlan2下并应用ECT算法2,这样1-SID 100的流量就在VLANl下走路径SAD, 1-SID 200的流量就在VLAN2下走路径SBD。 The network shown in Figure 1, node S has two equal-cost paths to D: diameter SBD and SAD, I will assume ECT algorithm is preferably a SAD transfer path, ECT algorithm 2 will preferably an SBD forwarding path, 1-SID 100 may be disposed in the ECT application and Vlanl algorithm 1, 1-SID 200 is arranged at Vlan2 and ECT application algorithm 2, so that the flow rate of 1-SID 100 in the path laid down VLANl SAD, 1-SID 200 VLAN2 laid down in the flow path SBD.

[0006] 在SPB-1SIS网络中,当网络拓扑发生变化时,各路由设备需要计算单播(自身桥到所有桥)的出端口,以及组播(以所有组播源为根)的指定端口,当网络中路由设备数量很多时,运行拓扑的工作量很大,而且当出现等价路径时还需要进行ECT决策,也会增加很多计算的工作量。 [0006] In the SPB-1SIS network, when the network topology changes, each computing device needs a unicast route (to bridge all the bridges themselves) output port, and multicast (in all rooted at the multicast source) is designated port , when the number of network routing devices a lot, a lot of work to run topology, and when equal cost paths appear also be required to perform ECT decisions, will increase the workload of many calculations.

[0007] 增量最短路径优先(ISPF)技术通过计算网络拓扑变化时受影响的部分网络路由,可以加快网络收敛速度和减少网络收敛时间,其根据拓扑变化执行以下决策: [0007] Incremental Shortest Path First (ISPF) techniques to calculate the network topology changes in the affected part of the network routing, the network can accelerate the convergence speed and reduce network convergence time, which performs the following decisions based topology:

[0008] (I)是否需要重算拓扑树,例如:不在树上的Link的Cost增大时,或不在树上的Node被删除时,无需重算拓扑树。 [0008] (I) the need for recalculating the topology tree, for example: the tree is not in the Link Cost increases, or when the tree Node is not deleted, without recalculating the topology tree. 以图1为例,假设D(A、D) = 3,其余各边Cost均为1,则计算最小生成树后,S到D的出接口是P2,下一跳是B,而不会走S->A->D这条路,也就是说Link(A,D)不在树上。 1 as an example, assume that D (A, D) = 3, the remaining sides are Cost 1, the minimum spanning tree is calculated, S is the outgoing interface to the D P2, the next hop be B, and will not go S-> A-> D road, i.e. Link (A, D) is not in the tree. 那么如果D(A,D)增大到4,或者断掉,都不会影响拓扑计算的结果,因此不需要重新计算拓扑。 Then if D (A, D) is increased to 4, or broken, will not affect the results of calculations topology, there is no need to re-calculate the topology.

[0009] (2)如果需要重算拓扑树,则尽可能缩小计算子树的范围; [0009] (2) if necessary tree topology recalculation is calculated as narrow subtree;

[0010] (3)最终拓扑发生变化,只增量计算受影响的路由。 [0010] (3) the final topology changes, only the affected routes increment calculation.

[0011] 采用ISPF技术可以一定程度上缓解SPB-1SIS的路由计算量,但判断网络拓扑变化是否影响最小生成树,进而确定是否需重算拓扑树,对单播(以自己为根)而言比较简单,但对组播(以组播源为根)而言则较为复杂,而且缩小计算子树范围的做法难以针对每颗组播树实现,有可能增加了冗余判定流程却起不到优化效果。 [0011] Route calculation ease SPB-1SIS, it is determined whether the network topology changes affect the minimum spanning tree using ISPF technology to a certain extent, and then determine whether it is necessary recalculation of the tree topology, a unicast (itself as the root) in terms is relatively simple, but a multicast (multicast source as the root) is more complex in terms of, and reduction calculation subtree practice range for each satellite is difficult to realize the multicast tree, it is possible to increase the redundancy determination process but would not achieve optimization results. 另外,对于SPB-1SIS协议中规定的ECT决策,ISPF无法起到优化作用,而SPB-1SIS协议本身的ECT决策算法如果不加以优化,计算量将恶化到天文数字。 In addition, the decision for ECT provisions of SPB-1SIS agreement, ISPF can not play the role of optimization, and SPB-1SIS protocol itself ECT decision algorithm if not optimized, the amount of computation will deteriorate to astronomical. 参见图2所示的由一百多台设备构成的组网,在图2所示组网中,以路由设备S为根节点,从S到目的路由设备D的路径数量达到333条,如果不对ECT算法进彳丁优化,则根本无法进彳丁ECT决策。 Network devices of more than one configuration shown in Figure 2, in the network shown in FIG. 2, the routing device to the root node S, S to the destination number from the routing device D 333 reaches the path, if not ECT Ding optimization algorithm into the left foot, then left foot can not enter the small ECT decisions.

发明内容 SUMMARY

[0012] 有鉴于此,本发明的目的在于提供一种应用于SPB-1SIS网络中的路由计算方法,该方法能够减小路由计算量。 [0012] In view of this, an object of the present invention is to provide a method for computing routing network SPB-1SIS applied, the method for routing calculation amount can be reduced.

[0013] 为实现上述目的,本发明提供的技术方案为: [0013] To achieve the above object, the present invention provides the technical solution as follows:

[0014] —种路由计算方法,应用于SPB-1SIS网络中的路由设备,包括: [0014] - Species route calculation method applied to SPB-1SIS network routing device, comprising:

[0015] 检测到SPB-1SIS网络拓扑变化时,如果判断确定需要重新计算单播路由,则计算本路由设备到SPB-1SIS网络中其它每个路由设备的所有路径的Cost和跳数,将本路由设备到该其它路由设备的Cost最小的所有路径中跳数最小的路径确定为该其它路由设备对应的最优路径; [0015] upon detecting a change in the network topology SPB-1SIS, if it is determined it determines that recalculation unicast route, the computing device to present the route SPB-1SIS Cost and other network hops all paths each routing device, the present minimum Cost of all the other routing device to the routing device in the minimum number of hops of the path is determined for the optimum path corresponding to the other routing devices;

[0016] 按照预设规则在SPB-1SIS网络中其它每个路由设备对应的最优路径中优选出该其它路由设备对应的在每种ECT算法下的转发路径,根据优选出的转发路径确定该其它路由设备对应的在该ECT算法下的出端口和下一跳。 [0016] In accordance with a preset rule SPB-1SIS other network devices corresponding to each optimal path route is preferred that forwarding path corresponding to the other routing devices in each ECT algorithm, which is determined according to the forwarding path of the preferred and a next hop ports in the ECT other routing algorithm corresponding to the device.

[0017] 一种路由设备,应用于SPB-1SIS网络,包括:检测单元、判断单元、计算单元、优选单元; [0017] A routing device, applied to SPB-1SIS network, comprising: a detecting unit, a determining unit, a calculating unit, preferably a unit;

[0018] 所述检测单元,用于检测SPB-1SIS网络是否发生拓扑变化; [0018] The detection means for detecting whether the SPB-1SIS topology change occurs in the network;

[0019] 所述判断单元,用于在检测单元检测到SPB-1SIS网络发生拓扑变化时,判断是否需要重新计算单播路由; [0019] The determination unit for detecting unit detects that the network topology changes SPB-1SIS occurs, determines whether to recalculate unicast route;

[0020] 所述计算单元,用于在判断单元判断确定需要重新计算单播路由时,计算本路由设备到SPB-1SIS网络中其它每个路由设备的所有路径的Cost和跳数,将本路由设备到该其它路由设备的Cost最小的所有路径中跳数最小的路径确定为该其它路由设备对应的最优路径; [0020] The calculating unit for determining the determination unit determines to be recalculated when a unicast route, this route computing devices and other hops Cost of all paths to each SPB-1SIS network routing device, the route of the present minimum Cost of all the paths to the other devices in the routing device determines the path of the minimum number of hops for an optimal path corresponding to other routing devices;

[0021] 所述优选单元,用于按照预设规则在SPB-1SIS网络中其它每个路由设备对应的最优路径中优选出该其它路由设备对应的在每种ECT算法下的转发路径,根据优选出的转发路径确定该其它路由设备对应的在该ECT算法下的出端口和下一跳。 [0021] The unit is preferably configured according to a preset rule SPB-1SIS other network devices corresponding to each optimal path route is preferred that forwarding path corresponding to the other routing devices in each ECT algorithm, in accordance with preferably the forwarding path to determine the corresponding output port other routing devices in the ECT and next hop algorithm.

[0022] 综上所述,本发明通过计算本路由设备到其它每个路由设备的Cost最小的所有路径中跳数最小的路径作为最优路径,从而剔除了Cost最小但跳数不是最小的路径;根据按照预设规则优选出该其它路由设备对应的转发路径,并根据优选的确定的出端口和下一跳。 [0022] In summary, the present invention by computing each of the other routing device to the routing device Cost of all paths in the smallest minimum hop paths as the optimal path, thereby excluding the smallest Cost but not the smallest hop path ; according to the other routing device corresponding to the transfer path in accordance with a preset rule preferred, and is preferably determined according to the next hop and the egress port. 本发明可以有效减小路由计算量。 The present invention can effectively reduce the amount of route calculation.

附图说明 BRIEF DESCRIPTION

[0023] 图1是现有技术的一个简单组网示意图; [0023] FIG. 1 is a prior art schematic diagram of a simple network;

[0024] 图2是现有技术由一百多台设备构成的组网示意图; [0024] FIG. 2 is a schematic of a prior art network composed of more than one devices;

[0025]图3是本发明实施例路由计算方法的流程示意图; [0025] FIG. 3 is a schematic diagram of a flow calculated route embodiment of the present invention;

[0026] 图4是应用本发明实施例的一个简单组网示意图; [0026] FIG. 4 is a simple schematic of an embodiment of the network according to the present invention is applied;

[0027]图5是本发明实施例路由设备的结构示意图。 [0027] FIG. 5 is a schematic structural diagram of a routing device of the embodiment of the present invention.

具体实施方式 detailed description

[0028] 为使本发明的目的、技术方案及优点更加清楚明白,以下参照附图并举实施例,对本发明所述方案作进一步地详细说明。 [0028] To make the objectives, technical solutions and advantages of the present invention will become more apparent, with reference to the accompanying drawings and the following embodiments, the embodiment of the present invention will be described in further detail.

[0029] 本发明实施例中,为了减少SPB-1SIS网络发生拓扑变化时的路由计算量,对Dijkstra算法进行优化,在运行Dijkstra算法计算以某一路由设备为根节点到其它路由设备的最优路径时,滤除Cost或跳数不是最小的路径,只保留Cost最小的路径中跳数最小的最优路径,然后基于最优路径确定每种ECT算法下所述其它路由设备的出接口和下一跳。 [0029] Example embodiments of the present invention, in order to reduce the amount of calculation of the route when the network topology changes occur SPB-1SIS, Dijkstra algorithm to optimize the operation of the Dijkstra algorithm to calculate a root node to the other routing device to the routing device optimal when the path, or hop filtered Cost is not the smallest number of paths, leaving only minimal Cost minimum number of hops in the path of the optimal path, and then it is determined that the interface device at the other routing algorithm each ECT optimal path hop.

[0030] 参见图3,图3是本发明实施例路由计算方法的流程示意图,该方法应用于SPB-1SIS网络中的路由设备,主要包括以下步骤: [0030] Referring to FIG. 3, FIG. 3 is a schematic flowchart of route calculation method of the present invention, the method is applied SPB-1SIS network routing device, mainly comprising the steps of:

[0031] 步骤301、检测到SPB-1SIS网络拓扑变化时,如果判断确定需要重新计算单播路由,则计算本路由设备到SPB-1SIS网络中其它每个路由设备的所有路径的Cost和跳数,将本路由设备到该其它路由设备的Cost最小的所有路径中跳数最小的路径确定为本路由设备到该其它路由设备的最优路径。 [0031] Step 301, upon detecting a change in the network topology SPB-1SIS, if it is determined determines that recalculation unicast route, the computing device to present the route SPB-1SIS network hops Cost and all other routing paths for each device , present other routing device to the routing device Cost all paths in the smallest minimum hop path to determine the optimal path routing device to present the other routing devices.

[0032] SPB-1SIS网络中的每个路由设备都需要以自身为根计算自身到其它路由设备的最短路径,计算最短路径方法一般是米用Dijkstra算法,在计算得到最短路径后,如果这些最短路径中存在多条Cost和跳数均相同且最小的等价路径,则还需要根据ECT算法在这些Cost和跳数均相同且最小等价路径中优选出一条作为转发路径。 [0032] SPB-1SIS each routing device in the network itself needs to be the root itself to calculate the shortest path other routing devices, the shortest path calculating method is generally used Dijkstra algorithm meters, after the shortest path is calculated, if the shortest Cost path and there are multiple hops are the same and a minimum equivalent path, also you need to ECT in these algorithms are the same and the smallest number of hops Cost and preferably an equivalent path as a forwarding path.

[0033] 根据SPB-1SIS网络中需要确定根节点到其它路由设备的唯一转发路径,且该唯一转发路径是根节点到该其他路由设备的Cost最小的所有路径中跳数最小的一条路径的特点,在本实施例中,通过对Dijkstra算法进行优化,在计算根节点到其他路由设备的最短路径的过程中,滤除Cost或跳数不是最小的路径,只保留Cost最小的路径中跳数最小的路径作为根节点到该其他路由设备的最优路径。 [0033] The root node is determined to other routing devices in accordance with the unique forwarding path SPB-1SIS network, and the forwarding path is the only root node to the other routing device Cost minimum number of hops of a route path of least all of the characteristics in the present embodiment, by Dijkstra algorithm to optimize the calculation of the shortest path to the root node of the other routing devices in the process, filtered or Cost is not the smallest number of hops path, leaving only minimal Cost minimum number of hops in the path path as the best path to the root node of the other routing device.

[0034] 本实施例中,可以采用现有技术的方法判断是否需要重新计算单播路由,例如采用ISPF技术进行判断。 [0034] In this embodiment, the prior art methods can be used whether it is necessary to recalculate a unicast route, for example using ISPF determination techniques.

[0035] 本步骤中,根据优化后的Dijkstra算法计算本路由设备到SPB-1SIS网络中其它每个路由设备的所有路径的Cost和跳数,将本路由设备到该其它路由设备的Cost最小的所有路径中跳数最小的路径确定为本路由设备到该其它路由设备的最优路径的方法为采用以下步骤: [0035] In this step, the route computing apparatus according to the present Dijkstra algorithm optimized to SPB-1SIS Cost and other network hops all paths each routing device, the routing device according to the other routing device minimal Cost determining the minimum number of hops of all paths in the path-oriented routing device to another method of the optimal path routing device employing the steps of:

[0036] A、将本路由设备的所有邻居路由设备加入候选列表,将本路由设备与每个邻居路由设备间的直连链路添加到该邻居路由设备的ParentLinkList并设置onTree标记,记录本路由设备到该邻居路由设备的跳数,将本路由设备记为该邻居路由设备的父节点; [0036] A, all the neighboring routing device according to the present routing device to join the candidate list, the add direct link between the local device and the routing device to route each neighbor ParentLinkList routing device and the neighbor set onTree flag, records this route device to the neighbor hops routing device, the routing device will remember that this parent device neighbor route;

[0037] B、判断候选列表是否为空,如果是,则确定本路由设备经过设置有onTree标记的链路到达SPB-1SIS网络中其它每个路由设备的路径为本路由设备到该其它路由设备的最优路径,并结束本流程,否则,执行步骤C ; [0037] B, determines whether the candidate list is empty, if yes, determining that the routing device is provided with a through onTree labeled links reach SPB-1SIS network routing path to every other device in the routing device to present the other routing devices the optimal path, and the end of the process, otherwise, step C;

[0038] C、从候选列表中取出距离本路由设备的Cost最小的路由设备作为当前路由设备(也即:当前已经计算得到的本路由设备到达候选列表中各路由设备的路径的Cost中,本路由设备到达当前路由设备的路径的Cost是最小的),判断当前路由设备是否有除父节点外的邻居路由设备,如果是,则执行步骤D,否则,返回步骤B执行; [0038] C, remove Cost from this routing device minimum routing device from the candidate list as the current routing device (i.e.: this has been calculated according to the present routing device obtained reaches Cost candidate list paths each routing device, the present Cost routing device reaches the current routing path to the device is minimal), the routing device determines whether the current neighbor routing devices have in addition to a parent node, if yes, procedure D, otherwise, execution returns to step B;

[0039] D、将当前路由设备的除父节点外的所有邻居路由设备加入候选列表,计算本路由设备经由当前路由设备到达新加入候选列表中的各路由设备的路径的cost和跳数,将当前路由设备记为新加入候选列表中的各路由设备的父节点,对于首次加入候选列表的每个路由设备,将该路由设备与当前路由设备间的直连链路添加到该路由设备的ParentLinkList并设置onTree标记;对于非首次加入候选列表的每个路由设备,如果本路由设备经由当前路由设备到达该路由设备的路径的Cost比原来计算的Cost小或与原来计算的Cost相等但跳数比原来小,则清空该路由设备的ParentLinkList,将该路由设备与当前路由设备间的直连链路添加到该路由设备的ParentLinkList并设置onTree标记;返回步骤B执行。 [0039] D, all the current neighbor routing devices outside the other parent node routing device added candidate list computing this routing device reaches the cost and hop newly added to the candidate list in each routing device path via the current routing device, the current routing device referred to as a newly added list of candidate parent nodes of each routing device, the routing device for each added first candidate list, the current routing device to add the direct link between the routing device to the routing device ParentLinkList and provided onTree marker; each routing device for the first time non-candidate list is added, than if the originally calculated Cost present a route to the routing device via a routing device current routing device or small Cost Cost originally calculated ratio of the number of hops equal but original small, empty ParentLinkList the routing device, added to the current of the direct link between the routing device, the routing device ParentLinkList and the routing device provided onTree marker; B returns to step performed.

[0040] 下面以图4所示组网为例进行说明,假设D(S,A) = 1,D(A,D) =8,D(S,B) =D(B,C) =D(C,D) =3。 [0040] In the following network shown in FIG. 4 as an example, assume that D (S, A) = 1, D (A, D) = 8, D (S, B) = D (B, C) = D (C, D) = 3. 则以路由设备S为根节点,根据优化后的Dijkstra算法计算确定路由设备S到其它路由设备的最优路径的过程如下: S is the root node places the routing device, the computing device determines the routing process to S optimal path according to other routing devices as Dijkstra algorithm optimized:

[0041] 首先,将S的邻居路由设备A和B加入到候选列表,将S与A之间的直连链路link_SA加入至丨JA的ParentLinkList,将S与B之间的直连链路link_SB加入至丨JB的ParentLinkList,A和B距离S的跳数均为I ;此时,候选列表中包括A和B,且S被记为A和B的父节点; [0041] First, the S neighbor routing devices A and B were added to the candidate list, the direct link between the S and A link_SA added to the Shu JA ParentLinkList, the direct link between the S and B link_SB Shu was added to the JB ParentLinkList, a and B are the number of hops from S, I; in this case, the candidate list comprising a and B, and S is referred to as a parent node a and B;

[0042] 接着,由于D(S,A) = 1,D(S,B) = 3,因此从候选列表中取出路由设备A作为当前路由设备,将路由设备A的除路由设备S外的邻居路由设备(路由设备D)加入到候选列表,计算路由设备S经由路由设备A到达D的路径(SAD)的Cost和跳数,计算得到SAD的Cost为9,跳数为2,A被记为D的父节点;由于路由设备D是首次加入候选列表,因此还需将A与D之间的直连链路link_AD加入到路由设备D的ParentLinkList并设置onTree标记;此时,候选列表中包括路由设备B和D ; [0042] Next, since the D (S, A) = 1, D (S, B) = 3, and therefore remove the routing device A from the candidate list as the current routing device neighbor outside the other routing device S routing device A the routing device (routing device D) is added to the candidate list, the route calculation device S arriving path of D (SAD) of Cost and hop via the routing device a, the calculated SAD is Cost is 9, the number of hops is 2, a is referred to as the parent node D; D since the routing device is added to the candidate list for the first time, therefore the need link_AD direct link between a and D added to the routing device D and ParentLinkList provided onTree flag; this case, the candidate list comprises routing devices B and D;

[0043] 再接着,由于D(S,B) =3,小于已经计算得到的S到D的路径(S_A_D)的Cost,因此取出路由设备B作为当前路由设备,将路由设备B的除路由设备S外的邻居路由设备(路由设备C)加入到候选列表,计算路由设备S经由路由设备B到达路由设备C的路径(SBC)的Cost和跳数,计算得到SBC的Cost为6,跳数为2,B被记为C的父节点;由于路由设备C是首次加入候选列表,因此还需要将B与C之间的直连链路link_BC加入到路由设备C的ParentLinkList并设置onTree标记;此时,候选列表中包括路由设备C和D ; [0043] Subsequently, since the D (S, B) = 3, is smaller than the resulting S to D path (S_A_D) of Cost has been calculated, and therefore remove the routing device B as the current routing device, in addition to the routing device routes apparatus B neighbor routing device outside S (routing device C) is added to the candidate list, the route calculation device S reaches the routing device C path (SBC) of Cost and hop via the routing device B, calculated by the SBC Cost is a number 6, hop 2, B is C is referred to as the parent node; C since the routing device is added to the candidate list for the first time, it is also necessary to link_BC direct link between B and C was added to the routing device C and ParentLinkList provided onTree flag; this time , the routing device comprising a candidate list C and D;

[0044] 再接着,由于SBC的Cost小于SAD的Cost,因此取出路由设备C作为当前路由设备,将路由设备C的除B外的邻居路由设备(路由设备D)加入到候选列表,计算路由设备S经由路由设备C到达路由设备D的路径(SBCD)的Cost和跳数,计算得到SBCD的Cost为9,跳数为3,C被记为D的父节点。 [0044] Subsequently, since the SBC Cost is less than the SAD Cost, and therefore remove the routing device C as the current routing device, the routing device C except B neighbor routing devices (routing device D) is added to the candidate list computing routing device S reaches the routing device D (SBCD) via a Cost and hop routing device C, the Cost is calculated SBCD 9, the number of hops to 3, C is referred to as the parent node of D. 由于路由设备D原来已经加入到候选列表且原来计算的D距离S (也即当前已经计算得到的S到D的路径:SAD)的Cost为9,跳数为2 ;由于原来计算的SAD的Cost为9,跳数为2,可以确定路由设备S经由路由设备C到达路由设备D的路径的Cost与原来相同但跳数比原来大,因此不需要将link_CD加入路由设备D的ParentLinkLi st,link_CD也不会被设置onTree标记。 (S to D path that is currently been calculated: SAD) since the routing device D had been added to the candidate list and originally calculated D distance S Cost is 9, the number of hops is 2; as a SAD Cost originally calculated 9, the hop count is 2, the routing device may determine a routing path Cost S reaches the same as the original device D but larger than the original number of hops, and therefore need not be added to the routing device D link_CD ParentLinkLi st via the routing device C, link_CD also It will not be set onTree mark.

[0045] 再接着,候选列表中只剩下路由设备D,因此取出路由设备D,由于路由设备A和C均是路由设备D的父节点,路由设备D不存在除A和C以外的邻居路由设备,因此路由设备D没有需要加入候选列表的邻居路由设备; [0045] Subsequently, only the candidate list D routing device, the routing device D thus taken out, since the routing device are A and C D is the parent node routing device, the routing device D neighbor route other than A and C do not exist equipment, the routing device D does not need to join the candidate list of neighbor routing equipment;

[0046] 最后,候选列表为空,计算路由设备S到其它路由设备(包括A、B、C、D)的最优路径的过程结束。 [0046] Finally, the candidate list is empty, the process of calculating the optimal path routing device S to other routing devices (including A, B, C, D) ends.

[0047] 经过上述的计算过程得到如下结果:A的ParentLinkList中均只包括Link_SA,B的ParentLinkList 中均只包括Link_SB,C 的ParentLinkList 包括路由设备link_BC,D 的ParentLinkList 中包括路由设备link_AD ;link_SA、link_SB、link_AD、link_BC 均被设置了onTree标记。 [0047] After the above calculations to obtain the following results: ParentLinkList A in each include only ParentLinkList Link_SA, B in each include only Link_SB, C of ParentLinkList comprises ParentLinkList routing device link_BC, D included in the routing device link_AD; link_SA, link_SB , link_AD, link_BC are set onTree mark. 因此,SA是S到A的最优路径,SAD是S到达D的最优路径,SB是S到B的最优路径,SBC是S到C的最优路径。 Thus, SA is the optimal path A to S, SAD is the optimal path S reaches D, SB S to B is the optimal path, SBC is the optimum path to C S.

[0048] 上述计算结果中,路由设备S到其它各路由设备均只有一条最优路径,如果存在多条最优路径,则还需要根据每种ECT算法优选出一条最优路径作为路由设备S到该其它路由设备的转发路径。 [0048] The above-described calculation result, the routing device S to the other routing device are each only one optimal path, if the presence of multiple optimal path is also required that an optimal routing path as the apparatus S according to the preferred algorithm each ECT the forwarding paths to other routing devices.

[0049] 步骤302、按照预设规则在SPB-1SIS网络中其它每个路由设备对应的最优路径中优选出该其它路由设备对应的在每种ECT算法下的转发路径,根据优选出的转发路径确定该其它路由设备对应的在该ECT算法下的出端口和下一跳。 [0049] Step 302, according to a preset rule SPB-1SIS other network devices corresponding to each optimal path route is preferred that forwarding path corresponding to the other routing devices in each ECT algorithm, according to the preferred forward out the other routing path determining device at the output port corresponding to the next hop and ECT algorithm.

[0050] 在实际应用中,可以推理得到如下结论(后续成为结论I):当有序集A大于B时,在A和B中加入相同的元素X后,A+x仍大于B+x,下面给出推理过程: [0050] In practical applications, the following conclusions can be inferred (subsequent conclusions becomes I): When the ordered set A is greater than B, the same element X is added in A and B, A + x is still greater than B + x, reasoning given below:

[0051] 首先做以下约定: [0051] First, do the following convention:

[0052] 约定一:有序集是指一组有序元素构成的集合,例如有序集A = {al,a2,…,an},其中,al>a2>…〉an,且al〜an均是实数。 [0052] a convention: ordered set is an ordered set of elements constituted, for example, an ordered set A = {al, a2, ..., an}, where, al> a2> ...> an, and al~an They are real numbers.

[0053] 约定二:在有序集A中再插入一个元素并排序,称新的集合为A+x. [0053] The two conventions: an insert element in the ordered set A and sorted, said new set of A + x.

[0054] 约定三:混合两个有序集A和B的所有元素并排序,称新的集合为A ® B. [0054] The three conventions: mixing two ordered sets A and B of all the elements and sorting the new set is called A ® B.

[0055] 约定四:比较两个都有η个元素的有序集的原则为:假设两个有序集分别为A和B,则按照i的取值从I到η的顺序依次比较A[i]和B[i]的大小,如果A[i]大于B[i],则确定A大于B,如果A [i]小于B [i],则A小于B,如果A [I]〜A [η]分别与B [I]〜B [η]分别相同,则A等于B。 [0055] convention IV: Comparison of two principles have η ordered set of elements is: Suppose two ordered sets, respectively A and B, then use the value from I to i order sequentially comparing η A [ i] and B [i] is the size, if a [i] is greater than B [i], it is determined that a is greater than B, if a [i] is less than B [i], the a less than B, if a [I] ~A [[eta]], respectively and B [I] ~B [η] are the same, then A is equal to B.

[0056] 根据约定四,按照将两个有序集A和B按元素对齐的方式,可以两个有序集分成相互对应的3个部分: [0056] By convention four, ordered in accordance with the two sets A and B are aligned in terms of elemental manner, two ordered sets divided into three parts corresponding to each other:

[0057] (I)序相同部分:A[1]〜A[i_l],B[l]〜B[i_l]; The same parts [0057] (I) Sequence: A [1] ~A [i_l], B [l] ~B [i_l];

[0058] (2)差异点:A[i]>B[i]; [0058] (2) point of difference: A [i]> B [i];

[0059] (3)无关部分:A[i+l]〜A[n],B[i+l]〜B[n]。 [0059] (3) independent portion: A [i + l] ~A [n], B [i + l] ~B [n].

[0060] 现假设存在两个有续集A和B,A>B且A和B的差异点是第i个元素,当再A和B中加入相同的元素X后,存在以下三种情况: [0060] It is assumed that there are two sequel A and B, A> B and a difference between points A and B is the i th element, when A and B are then added to the same elements X, the following three cases:

[0061] (I)若x>A[i]>B[i],则A+x和B+x的字典序相同部分各增加了一个X,差异点挪到第i+Ι个元素,仍是原A [i]和原B [i],显然,这种情况下A+x>B+x ; [0061] (I) when x> A [i]> B [i], and the A + x B + x lexicographically same portion of a respective increase X, moved to the first point of difference i + Ι elements, still original A [i] and the original B [i], obviously, in this case A + x> B + x;

[0062] (2)若A[i]>x>B[i],则有序集A+x中的第i个元素为A [i],有序集B+x中的第i个元素为X,由于A[i]>x,因此Α+χ>Β+χ.; [0062] (2) When A [i]> x> B [i], A + x is an ordered set of the i th element of A [i], an ordered set of B + x i-th element is X, since the A [i]> x, so Α + χ> Β + χ .;

[0063] (3)若A[i]>B[i]>x,则有序集A+x中的第i个元素为A [i],有序集B+x中的第i个元素为B [i],差异点仍为第i个元素,显然,这种情况下A+x>B+x。 [0063] (3) When A [i]> B [i]> x, then the ordered set of A + x i th element of A [i], an ordered set of B + x i-th element to B [i], is still the points of difference of the i-th element, obviously, A + x in this case> B + x.

[0064] 由此可以证明,如果有续集A大于B,则在A和B中加入相同的元素x后,A+x仍大于B+x。 [0064] It can be shown that if there is a sequel A is greater than B, then the addition of the same element x in the A and B, A + is still greater than x B + x.

[0065] 在SPB-1SIS网络中,ECT决策算法有如下特点: [0065] In the SPB-1SIS network, ECT decision algorithm has the following characteristics:

[0066] 假设已经按照优化后的Dijkstra算法计算出了根节点S到路由设备C的最优路径有m条,这m条最优路径如下: [0066] assumed to have been calculated according to the Dijkstra algorithm to optimize a root node S to the optimum routing device C has the m, m this optimal path is as follows:

[0067] Path I:S->pll->---->pln_>C,该路径上的路由设备{pll,…,pin}构成有序集 [0067] Path I: S-> pll -> ----> pln_> C, routing equipment on the path {pll, ..., pin} ordered set configuration

Pl ; Pl;

[0068] Path 2:S->p21->."->p2n->C,该路径上的路由设备{p21,…,p2n}构成有序集P2 ; . [0068] Path 2: S-> p21 -> "-> p2n-> C, routing equipment on the path {p21, ..., p2n} P2 constitute ordered set;

[0069] … [0069] ...

[0070] Path m:S->Pml_>---->Pmn->C,该路径上的路由设备{pml,…,pmn}构成有序集Pm。 [0070] Path m: S-> Pml _> ----> Pmn-> C, the routing device {pml, ..., pmn} on the path constituting the ordered set Pm.

[0071] 则根节点会按照ECT算法从有序集P1、P2、…、Pm中选择出最大者,将选出的最大者对应的路径作为该ECT算法下路由设备C对应的转发路径。 [0071] The root node will be set in accordance with the order ECT algorithm from P1, P2, ..., Pm selected in the largest of the maximum of the path corresponding to the selected routing device C as the ECT algorithm corresponding to the forwarding path.

[0072] 根据SPB-1SIS网络中ECT算法的特点,可将上述结论I应用于按照ECT算法确定根节点到其它路由设备的最优路径的过程中,遵循以下原则确定其它路由设备在该ECT算法下的最优路径:在以SPB-1SIS网络(也可以是其它网络)中的任一路由设备S为根的最小生成树中,如果已经决策出路由设备S到某个路由设备D的唯一父节点C的最优路径为:S->al_>---->an_>C,则可以确定路由设备S到路由设备D的最优路径为S->al_>..._>an_>C_>D0 [0072] The characteristics of SPB-1SIS ECT network algorithm may be applied to these conclusions I determined in accordance with the root node to the optimal path algorithm ECT other routing devices in the process of determining the other routing algorithms ECT device following principles under optimal path: in any one of the minimum spanning tree SPB-1SIS network (which may be another network) all the way to the root of the device S, if the parent has a unique way by the decision device S to a routing device D node C is the optimal path: S-> al _> ----> an_> C, it may be determined routing device to the routing device D S optimal path S-> al _> ..._> an_> C_ > D0

[0073] 因此,在步骤302中,按照预设规则在SPB-1SIS网络中其它每个路由设备对应的最优路径中优选出该其它路由设备对应的在每种ECT算法下的转发路径,根据优选出的转发路径确定该其它路由设备对应的在该ECT算法下的出端口和下一跳的方法包括: [0073] Thus, in step 302, according to a preset rule SPB-1SIS other network devices corresponding to each optimal path route is preferred that forwarding path corresponding to the other routing devices in each ECT algorithm, in accordance with and a next hop ports in the ECT method is preferably an algorithm to determine a forwarding path corresponding to the other routing device comprising:

[0074] 按照SPB-1SIS网络中其它每个路由设备对应的最优路径的Cost从小到大的顺序对所有路由设备进行排序,并按照以下步骤确定序列中各路由设备在每种ECT算法下的转发路径: [0074] network in accordance with the SPB-1SIS Cost optimal path corresponding to each of the other devices routed ascending order sort all routing devices, and determines the sequence of steps following each routing device each ECT Algorithm forwarding path:

[0075] 对于排序中的第一个路由设备,将本路由设备上直连该第一个路由设备的端口确定为该第一个路由设备对应的出端口,且该第一个路由设备对应的下一跳为该第一个路由设备; [0075] For ordering the first routing device, directly connected to the first routing device present on the first routing device determines the routing port corresponding to output ports of the device, and the routing device corresponding to a first a next hop for the first routing device;

[0076] 假设排序中的前K个路由设备的出端口和下一跳已经确定,则对于第K+1个路由设备,根据该第K+1个路由设备的ParentLinkList确定该第K+1个路由设备在该第K+1个路由设备对应的最优路径上的父节点数,如果确定该K+1个路由设备只有一个父节点,则该第K+1个路由设备继承该父节点的出端口和下一跳;如果该K+1个路由设备具有m个父节点,则确定本路由设备经由该第K+1个路由设备的m个父节点对应的转发路径到达该第K+1个路由设备的m条最优路径,按照该种ECT算法从所述m条最优路径中优选一条转发路径,该第K+1个路由设备继承该第K+1个路由设备在优选的转发路径上的父节点的出端口和下一跳;其中,m是大于I的自然数。 [0076] Suppose the first K output ports of the routing device and ordering the next hop has been determined for the first K + 1 routing devices, ParentLinkList K + 1 of the first routing device determines that according to the first K + 1 th parent nodes the routing device on the first K + 1 most superior routing device corresponding to, if it is determined that the K + 1 routing device has only one parent node, the first K + 1 routing devices inherited parent node next hop and the egress port; K + 1 if the routing apparatus has m parent node, determining that the first routing device K + 1 reaches the transfer path via the second parent node of m K + 1 corresponding to the routing device and m optimal path routing device, in accordance with the kind of the ECT algorithm from the m is preferably an optimal path forwarding path, the first routing device K + 1 K + inherit the second routing device forwards a preferred a parent port and the next hop on the path; where, m is a natural number greater than I.

[0077] 在上述确定SPB-1SIS网络中其它每个路由设备在以本路由设备为根的出端口和下一跳时,按照其它每个路由设备对应的最优路径的Cost从小到大排序,可以保证排在第一个的路由设备一定是与本路由设备直连的路由设备,且每个路由设备在该路由设备对应的最优路径上的父节点一定是排在该路由设备之前。 [0077] In the SPB-1SIS determining each of the other network routing device port and routing next hop to the present device is a root out according Cost optimal path routing device corresponding to each other from small to large, It ensures that the first row of the routing device must be a routing device directly connected to the routing device, and each parent node in the routing device on the optimum path corresponding to the routing device must be sorted before the routing device.

[0078] 由于排在第一个的路由设备是与本路由设备直连的路由设备,因此可以确定第一个路由设备的出端口为本路由设备上直连第一个路由设备的端口,而下一跳则就是该第一个路由设备。 [0078] Since the first row of the routing device is a routing device directly connected to the routing device, it can be determined that the first port of the routing device directly connected to a routing device on the first routing device port oriented, and it is the first next-hop routing equipment.

[0079] 由于每个路由设备在该路由设备对应的最优路径上的父节点一定是排在该路由设备之前,因此可以保证先确定该路由设备在最优路径上的父节点的出端口和下一跳,然后再确定该路由设备的出端口和下一跳,这使得在确定了该路由设备在某一ECT算法下的最优路径上的父节点之后,可以将已经确定出的该父节点的出端口和下一跳确为该路由设备的出端口和下一跳。 [0079] Since each routing device in the parent node of the optimal path corresponding to the routing device must be ahead of the routing device, which can ensure the parent node to determine the port of the routing device on the optimum path and the next hop, then the routing device determines the next hop and the egress port, which after determining that the routing device is the parent node on the optimum path algorithm at a certain ECT may be the parent has been determined the port and outlet port and a next hop node determined for the next-hop routing device. 在确定了该路由设备在某一ECT算法下的最优路径上的父节点之后,将已经确定出的该父节点的出端口和下一跳确为该路由设备的出端口和下一跳的方法可以避免图2所示的出现天文数字的等价路径时的ECT决策困难,这主要是因为:当该路由设备的m父节点对应的转发路径确定后,可确定出从根节点到该路由设备的m条路径,该路由设备对应的某一ECT算法下的转发路径一定是这m条路径中的一条,只需按照该ECT算法从这m条转发路径中优选出一条作为该路由设备对应的转发路径即可。 After determining the parent node of the routing device on the optimum path at a certain ECT algorithm, which has been determined that the parent node and an egress port for the next hop routing device determines a next hop ports and the method can avoid difficulty in decision ECT astronomical equivalent path shown in figure 2, mainly because: when the m of the parent routing device corresponding forwarding path determination, can be determined from the route to the root node m paths device, a transfer path in the routing algorithm ECT device corresponding to this m must be in a path, simply follow from the ECT m forwarding paths algorithm is preferably corresponding to the route shown as a device forwarding path.

[0080] 在实际应用中,根据上述的结论1,还可以推理得到如下结论(以下称为结论2):假设有序集A大于B,则如果在A和B中加入多个相同元素xl〜xm,则A θ X仍大于B © X,其中,X= {xl、x2、......xm} ο [0080] In practical applications, according to the conclusions 1, further following conclusions can be inferred (hereinafter, referred to conclusion 2): Assume an ordered set A is greater than B, if the addition of a plurality of identical elements A and B xl~ xm, A θ X is still greater than the B © X, where, X = {xl, x2, ...... xm} ο

[0081] 实际上,当有续集A大于B时,由于向A和B中同时加入一个相同元素xl,不会影响A和B的大小关系,可以按照数据归纳法确定当同时向A和B中同时加入多个相同元素时,仍然不会影响A和B的大小关系,也即A ® X仍大于B ® X0 [0081] In fact, when B is greater than A sequel, since one and the same element xl added simultaneously to A and B, it does not affect the size relationship between A and B can be determined when the data are summarized according to method A and B simultaneously was added simultaneously a plurality of identical elements, still will not affect the size relationship between a and B, i.e. a ® X is still greater than B ® X0

[0082] 根据SPB-1SIS网络中ECT算法的特点,可将上述结论2应用于按照ECT算法确定根节点到其它路由设备的最优路径的过程中,当SPB-1SIS网络中某一路由设备对应的最优路径有多条时,例如上述以路由设备S为根节点时,路由设备C对应有m条最优路径,分别为Path UPath 2、…、Path m,则可遵循以下原则确定路由设备C在该ECT算法下的出端口和下一跳: [0082] The characteristics of SPB-1SIS ECT network algorithm may be applied to these conclusions 2 to determine the optimal path to the other root node routing device according to ECT algorithmic process, when the SPB-1SIS network routing device corresponding to a a plurality of the optimum path, when the above-described example, S is the root node in the routing device, the routing device corresponding to C and m have the optimum path, respectively path UPath 2, ..., path m, the following guidelines can be determined routing device C a port in the ECT algorithm and the next hop:

[0083] 如果Path UPath 2、…、Path m具有共同的交点B,则根节点S根据该ECT算法决策出的路由设备C的转发路径一定是:S->…->Β->...-Χ:,因此,不需按照ECT算法计算路由设备C在该ECT算法下的转发路径,继而让路由设备C继承在该转发路径上的父节点的出端口和下一跳,而是直接继承路由设备B的出端口和下一跳; [0083] If the Path UPath 2, ..., Path m have a common intersection point B, the root node S ECT algorithm based on the decision of the forwarding path routing device must be C: S-> ... -> Β -> ... -Χ :, therefore, no routing algorithm according to ECT device C in the ECT forwarding path algorithm, then the routing device so that the C port and the inherited next hop parent node on the forwarding path, but directly inherited and the port B of the next-hop device;

[0084] 如果Path UPath 2、…、Path m不具有共同的交点,则按照ECT算法计算路由设备C在该ECT算法下的转发路径,继而让路由设备C继承在该转发路径上的父节点的出端口和下一跳。 [0084] If the Path UPath 2, ..., Path m does not have a common point of intersection, the route calculation device C forwarding path in the ECT algorithm according to ECT algorithm, and then allow the routing device C inherit the parent node on the forwarding path the port and next hop.

[0085] 为此,上述确定SPB-1SIS网络中其它每个路由设备在以本路由设备为根的出端口和下一跳的过程中,当确定排序中前K个路由设备的出端口和下一跳之后,根据该第K+1个路由设备的ParentLinkList确定该第K+1个路由设备在该第K+1个路由设备对应的最优路径上的父节点数之前,进一步包括:如果该第K+1个路由设备对应的所有最优路径之间存在除本路由设备以外的其它交点,则确定该第K+1个路由设备继承所有其它交点中任一交点的出端口和下一跳,否则,根据该第K+1个路由设备的ParentLinkLi St确定该第K+1个路由设备在该第K+1个路由设备对应的最优路径上的父节点数。 [0085] For this reason, the above-described SPB-1SIS determined every other network routing device according to the routing device is the root port and a next hop in the process, and when the port ordering the determined routing device of the first K after the jump, according to the first K + ParentLinkList 1 routing device determines that the K + 1 routing device before the parent nodes of the K + 1 on the optimum path corresponding to the routing device, further comprising: if the the intersection of the K + in addition to the presence of other routing devices present among all optimum path corresponding to a routing device, it is determined that the K + 1 inherit all other routing device of any one of intersection points of intersection and the next hop ports otherwise, ParentLinkLi St K + 1 of the first routing device is determined according to the parent nodes of the K + 1 first routing device on the first K + 1 most superior routing device corresponding.

[0086] 图3所示本发明实施例中,还可以在检测到网络拓扑变化时,判断网络拓扑变化是否影响SPB-1SIS网络中各组播树的拓扑,判断方法为:先确定引起拓扑变化的link,再判断该link是否在组播树上,如果该link在组播树上,则会影响该link所在组播树的拓扑,因此需要重新计算该link所在的组播树的拓扑;如果该link不在任何组播树上,则分为两种情况,一种情况是该link的Cost减小引起的拓扑变化,这种情况下,会影响到SPB-1SIS网络中所有组播树的拓扑,因此需要重新计算SPB-1SIS网络中所有组播树的拓扑,另一种情况是该link断开或Cost增大引起的拓扑变化,这种情况下,由于该link不在任何组播树上,不会影响任何组播树的拓扑,因此,无需对任何组播树的拓扑进行重新计笪并ο Embodiment [0086] As shown in FIG. 3 of the present invention, may also be detected when the network topology changes, it is determined whether the impact of topology change in the network topology SPB-1SIS each multicast tree, the method is determined: first determine the topology change caused by the link, and then determines whether the link in the multicast tree, if the link in the multicast tree, the topology of the multicast tree where the link will affect, it is necessary to recalculate the multicast tree where the link topology; if the link is not in any of the multicast tree, is divided into two cases, one case of the topology change due to link Cost is reduced, in this case, will affect all the multicast tree network topology SPB-1SIS , it is necessary to recalculate network topology SPB-1SIS all multicast trees, another case that the link is disconnected or Cost increases topology changes caused, in this case, since the link is not in any of the multicast tree, does not affect any multicast tree topology, therefore, no need for any re-count Da multicast tree topology and ο

[0087] 为了判断一条link是否在组播树上,在本发明实施例中,SPB-1SIS网络中的每个路由设备均预先记录SPB-1SIS网络中每条link所在的各组播树的根节点;这样,当确定引起拓扑变化的link后,就可以根据预先记录的该link所在组播树的根节点判断该link是否在组播树上以及在哪些组播树上。 [0087] In order to determine whether a link in the multicast tree, in the embodiment of the present invention, each routing device SPB-1SIS network are recorded in advance of each multicast tree SPB-1SIS each link in the network where the root node; Thus, when the link is determined due to a topology change, it is possible according to the root node of the multicast tree where the link prerecorded determines whether the link in the multicast tree and the multicast tree in which.

[0088] 上述预先记录SPB-1SIS网络中每条link所在的各组播树的根节点可以利用bitmap实现,可以为每条link建立一个bitmap,bitmap中的每一bit位对应SPB-1SIS网络中的一个路由设备,标示该条link是否在以该路由设备为根的组播树上,如果该bit位的是1,则表示该条link在以该路由设备为根的组播树上,如果是0,则表示该条link不在以该路由设备为根的组播树上。 [0088] The prerecorded SPB-1SIS root network of each link for each multicast tree where the bitmap can be used to achieve, can be established for each link a bitmap, each bit in the bitmap corresponds to bit SPB-1SIS network a routing device, whether the designated piece of link to the multicast tree routing device is a root, and if the bit is 1 bit, it indicates that the article to the multicasting tree link routing device is a root, and if is 0, it indicates that the article does not link to the routing device is a root of the multicast tree. 通过使用bitmap的方法,可以在确定引起拓扑变化的link后,根据link是否在组播树上,以及link断开、link的Cost增大或减小等具体情况确定是否需要重算组播树的拓扑,以及需要重算哪些组播树的拓扑。 By a method using a bitmap, determining the link may be due to topology changes, according to whether the multicast tree link, and disconnect the link, the link Cost increases or decreases the specific circumstances determine if recalculation of the multicast tree topology, and what needs to multicast tree topology recalculation.

[0089] 实际上,网络规模越大,则一条link在最小生成树上的几率就越小,link发生变化对网络拓扑影响的几率也就越小,因此,上述记录每条link所在组播树,在该link发生变化时重算该link所在组播树的拓扑的方法可以大大减少大型网络中组播路由计算的工作量,而且只需重算较少的拓扑数,可以大幅提高SPB-1SIS路由计算的收敛速度。 [0089] In fact, the larger the network, the one link in the less the minimum spanning tree, the smaller the chance of influencing link to network topology changes, and therefore, the recording location of each multicast tree link the method, when the link is changed recalculating the topology of the multicast tree where the link can greatly reduce the workload calculation multicast routing in large networks, but only a small number of recalculation topology, can significantly improve the SPB-1SIS convergence speed route calculation.

[0090] 以上对本发明实施例路由计算方法进行了详细说明,本发明具体实施例中基于同样的发明构思,还提出一种应用于SPB-1SIS网络的路由设备,下面结合图4进行说明。 Been described in detail in Example route calculation method according to [0090] of the above embodiment of the present invention, particular embodiments of the present invention based on the same inventive concept is also applicable to provide a SPB-1SIS network routing devices, will be described below in connection with FIG.

[0091] 参见图5,图5是本发明实施例路由设备的结构示意图,该路由设备包括:检测单元501、判断单元502、计算单元503、优选单元504 ;其中, [0091] Referring to FIG. 5, FIG. 5 is a schematic structural diagram of the embodiment of the present invention, the routing device, the routing device comprising: a detecting unit 501, determination unit 502, calculation unit 503, preferably 504 units; wherein,

[0092] 检测单元501,用于检测SPB-1SIS网络是否发生拓扑变化; [0092] The detecting unit 501 for detecting whether the SPB-1SIS topology change occurs in the network;

[0093] 判断单元502,用于在检测单元501检测到SPB-1SIS网络发生拓扑变化时,判断是否需要重新计算单播路由; [0093] determination unit 502, a detection unit 501 detects a topology change occurs SPB-1SIS network, determines whether to recalculate unicast route;

[0094] 计算单元503,用于在判断单元502判断确定需要重新计算单播路由时,计算本路由设备到SPB-1SIS网络中其它每个路由设备的所有路径的Cost和跳数,将本路由设备到该其它路由设备的Cost最小的所有路径中跳数最小的路径确定为该其它路由设备对应的最优路径; [0094] calculation unit 503, when judging unit 502 for determining determines that recalculation unicast routing, route computing apparatus according to the SPB-1SIS Cost and other network hops all paths each routing device, the route of the present minimum Cost of all the paths to the other devices in the routing device determines the path of the minimum number of hops for an optimal path corresponding to other routing devices;

[0095] 优选单元504,用于按照预设规则在SPB-1SIS网络中其它每个路由设备对应的最优路径中优选出该其它路由设备对应的在每种ECT算法下的转发路径,根据优选出的转发路径确定该其它路由设备对应的在该ECT算法下的出端口和下一跳。 [0095] Preferred unit 504, according to a preset rule for the SPB-1SIS other network devices corresponding to each optimal path route is preferred that forwarding path corresponding to the other routing devices in each ECT algorithm, according to a preferred determining a forwarding path corresponding to the other routing devices at the output ports of ECT and next hop algorithm.

[0096] 上述路由设备中, [0096] The routing device,

[0097] 所述计算单元503在计算本路由设备到SPB-1SIS网络中其它每个路由设备的所有路径的Cost和跳数,将本路由设备到该其它路由设备的Cost最小的所有路径中跳数最小的路径确定为该其它路由设备对应的最优路径时,采用以下步骤: [0097] In the calculation unit 503 calculates the present routing device and the number of hops to Cost of all paths other routing devices each SPB-1SIS network, the routing device to present all the other paths minimal Cost hop routing device when determining the minimum number of paths for the optimum path corresponding to the other routing device, the following steps:

[0098] A、将本路由设备的所有邻居路由设备加入候选列表,将本路由设备与每个邻居路由设备间的直连链路添加到该邻居路由设备的ParentLinkList并设置onTree标记,记录本路由设备到该邻居路由设备的跳数,将本路由设备记为该邻居路由设备的父节点; [0098] A, all the neighboring routing device according to the present routing device to join the candidate list, the add direct link between the local device and the routing device to route each neighbor ParentLinkList routing device and the neighbor set onTree flag, records this route device to the neighbor hops routing device, the routing device will remember that this parent device neighbor route;

[0099] B、判断候选列表是否为空,如果是,则确定本路由设备经过设置有onTree标记的链路到达SPB-1SIS网络中其它每个路由设备的路径为该其它路由设备对应的最优路径,并结束本流程,否则,执行步骤C ; [0099] B, determines whether the candidate list is empty, if yes, determining that the routing device is provided with a through onTree labeled links reach SPB-1SIS network routing path to each of the other devices for other devices corresponding to the optimal route path, and the process ends, otherwise, step C;

[0100] C、从候选列表中取出距离本路由设备的Cost最小的路由设备作为当前路由设备,判断当前路由设备是否有除父节点外的邻居路由设备,如果是,则执行步骤D,否则,返回步骤B执行; [0100] C, remove Cost from this routing device minimum routing device from the candidate list as the current routing device determines whether the current routing device whether a neighboring routing device other than a parent node, if yes, perform Procedure D, otherwise, execution returns to step B;

[0101] D、将当前路由设备的除父节点外的所有邻居路由设备加入候选列表,计算本路由设备经由当前路由设备到达新加入候选列表中的各路由设备的路径的cost和跳数,将当前路由设备记为新加入候选列表中的各路由设备的父节点,对于首次加入候选列表的每个路由设备,将该路由设备与当前路由设备间的直连链路添加到该路由设备的ParentLinkList并设置onTree标记;对于非首次加入候选列表的每个路由设备,如果本路由设备经由当前路由设备到达该路由设备的路径的Cost比原来计算的Cost小或与原来计算的Cost相等但跳数比原来小,则清空该路由设备的ParentLinkList,将该路由设备与当前路由设备间的直连链路添加到该路由设备的ParentLinkList并设置onTree标记;返回步骤B执行。 [0101] D, all the current neighbor routing devices outside the other parent node routing device added candidate list computing this routing device reaches the cost and hop newly added to the candidate list in each routing device path via the current routing device, the current routing device referred to as a newly added list of candidate parent nodes of each routing device, the routing device for each added first candidate list, the current routing device to add the direct link between the routing device to the routing device ParentLinkList and provided onTree marker; each routing device for the first time non-candidate list is added, than if the originally calculated Cost present a route to the routing device via a routing device current routing device or small Cost Cost originally calculated ratio of the number of hops equal but original small, empty ParentLinkList the routing device, added to the current of the direct link between the routing device, the routing device ParentLinkList and the routing device provided onTree marker; B returns to step performed.

[0102] 上述路由设备中, [0102] The routing device,

[0103] 所述优选单元504在按照预设规则在SPB-1SIS网络中其它每个路由设备的最优路径中优选出该其它路由设备对应的在每种ECT算法下的转发路径,根据优选出的转发路径确定该其它路由设备对应的在该ECT算法下的出端口和下一跳时,用于: [0103] Preferably the unit 504 according to a preset rule SPB-1SIS optimal path to every other network routing device is preferably a forwarding path corresponding to the other routing devices in each ECT algorithm, preferably in accordance with the It forwarding path determination when the next hop and the egress port of the routing device corresponding to the other at the ECT algorithm for:

[0104] 按照SPB-1SIS网络中其它每个路由设备对应的最优路径的Cost从小到大的顺序对所有路由设备进行排序,并按照以下步骤确定序列中各路由设备在每种ECT算法下的转发路径: [0104] network in accordance with the SPB-1SIS Cost optimal path corresponding to each of the other devices routed ascending order sort all routing devices, and determines the sequence of steps following each routing device each ECT Algorithm forwarding path:

[0105] 对于排序中的第一个路由设备,将本路由设备上直连该第一个路由设备的端口确定为该第一个路由设备对应的出端口,且该第一个路由设备对应的下一跳为该第一个路由设备; [0105] For ordering the first routing device, directly connected to the first routing device present on the first routing device determines the routing port corresponding to output ports of the device, and the routing device corresponding to a first a next hop for the first routing device;

[0106] 假设排序中的前K个路由设备的出端口和下一跳已经确定,则对于第K+1个路由设备,根据该第K+1个路由设备的ParentLinkList确定该第K+1个路由设备在该第K+1个路由设备对应的最优路径上的父节点数,如果确定该K+1个路由设备只有一个父节点,则该第K+1个路由设备继承该父节点的出端口和下一跳;如果该K+1个路由设备具有m个父节点,则确定本路由设备经由该第K+1个路由设备的m个父节点对应的转发路径到达该第K+1个路由设备的m条最优路径,按照该种ECT算法从所述m条最优路径中优选一条转发路径,,该第K+1个路由设备继承该第K+1个路由设备在优选的转发路径上的父节点的出端口和下一跳;其中,m是大于I的自然数。 [0106] Suppose the first K output ports of the routing device and ordering the next hop has been determined for the first K + 1 routing devices, ParentLinkList K + 1 of the first routing device determines that according to the first K + 1 th parent nodes the routing device on the first K + 1 most superior routing device corresponding to, if it is determined that the K + 1 routing device has only one parent node, the first K + 1 routing devices inherited parent node next hop and the egress port; K + 1 if the routing apparatus has m parent node, determining that the first routing device K + 1 reaches the transfer path via the second parent node of m K + 1 corresponding to the routing device and m optimal path routing device, in accordance with the kind of algorithm from the strip ECT m is preferably an optimal path in the first transfer path ,, K + 1 routing devices inherit the K + 1 first routing device in a preferred next hop and the egress port on the parent node of the forwarding path; wherein, m is a natural number greater than I.

[0107] 上述路由设备中, [0107] The routing device,

[0108] 所述优选单元504在确定排序中前K个路由设备的出端口和下一跳之后,根据该第K+1个路由设备的ParentLinkList确定该第K+1个路由设备在该第K+1个路由设备对应的最优路径上的父节点数之前,进一步用于:如果该第K+1个路由设备对应的所有最优路径之间存在除本路由设备以外的其它交点,则确定该第K+1个路由设备继承所有其它交点中任一交点的出端口和下一跳,否则,根据该第K+1个路由设备的ParentLinkList确定该第K+1个路由设备在该第K+1个路由设备对应的最优路径上的父节点数。 [0108] The unit 504 is preferably determined after ordering the first K output ports of the routing device and the next hop, the first K + ParentLinkList 1 routing device is determined based on the first K + 1 in the second routing device K +1 before the parent nodes on the optimal path corresponding to a routing device, is further configured to: if the intersection of the K + in addition to the presence of other routing devices present among all of the optimum path corresponding to a routing device, is determined the first K + 1 inherit all other routing devices to any port of the intersection and an intersection of the next hop, or the K + ParentLinkList 1 second routing device is determined based on the first K + 1 in the second routing device K parent nodes on the optimal path routing device corresponding to +1.

[0109] 该路由设备还包括存储单元505 ; [0109] The routing device further includes a storage unit 505;

[0110] 所述存储单元505,用于预先记录SPB-1SIS网络中每条I ink所在的各组播树的根节点; [0110] The storage unit 505 for each multicast tree prerecorded SPB-1SIS network where each I ink root node;

[0111] 所述检测单元501,在检测到SPB-1SIS网络拓扑变化时,确定引起所述拓扑变化的link ; [0111] The detecting unit 501, upon detecting a change in the network topology SPB-1SIS, determining the link causes a topology change;

[0112] 所述判断单元502,用于在检测单元501确定引起所述拓扑变化的link后,根据预先记录的SPB-1SIS网络中每条I ink所在的各组播树的根节点判断该弓I起拓扑变化的I ink是否在组播树上; [0112] The determination unit 502, the detecting unit 501 for determining the cause of the Link topology changes, according to the SPB-1SIS network prerecorded each root node of each of the multicast tree where I ink Analyzing the bow whether I play a topology change of I ink in the multicast tree;

[0113] 所述计算单元503,用于在判断单元502判断确定引起所述拓扑变化的link在组播树上时,重新计算该link所在的组播树的拓扑;在判断单元502判断确定引起所述拓扑变化的link不在任何组播树上时,则若该link的Cost减小,则重新计算SPB-1SIS网络中所有组播树的拓扑,若该link断开或Cost增大,则不对任何组播树的拓扑进行重新计算。 [0113] The calculation unit 503, the determination unit 502 determines to determine the cause of the link topology changes in multicast tree, the multicast tree is recalculated topology link is located; the determination unit 502 determines determination caused the link is not in any topology changes in the multicast tree, the Cost is reduced if the link, the topology is recalculated SPB-1SIS all network multicast tree, if the link is disconnected or Cost increases not to any multicast tree topology recalculation.

[0114] 以上所述,仅为本发明的较佳实施例而已,并非用于限定本发明的保护范围。 [0114] The above are only preferred embodiments of the present invention but are not intended to limit the scope of the present invention. 凡在本发明的精神和原则之内,所作的任何修改、等同替换、改进等,均应包含在本发明的保护范围之内。 Any modification within the spirit and principle of the present invention, made, equivalent substitutions, improvements, etc., should be included within the scope of the present invention.

Claims (8)

  1. 1.一种路由计算方法,应用于SPB-1SIS网络中的路由设备,其特征在于,该方法包括: 检测到SPB-1SIS网络拓扑变化时,如果判断确定需要重新计算单播路由,则计算本路由设备到SPB-1SIS网络中其它每个路由设备的所有路径的Cost和跳数,将本路由设备到该其它路由设备的Cost最小的所有路径中跳数最小的路径确定为该其它路由设备对应的最优路径; 按照预设规则在SPB-1SIS网络中其它每个路由设备对应的最优路径中优选出该其它路由设备对应的在每种ECT算法下的转发路径,根据优选出的转发路径确定该其它路由设备对应的在该ECT算法下的出端口和下一跳; 其中,所述计算本路由设备到SPB-1SIS网络中其它每个路由设备的所有路径的Cost和跳数,将本路由设备到该其它路由设备的Cost最小的所有路径中跳数最小的路径确定为该其它路由设备对应的最优路径的方法为 A route calculation method applied to SPB-1SIS network routing device, characterized in that, the method comprising: upon detecting a change in the network topology SPB-1SIS, if it is determined determines that the unicast route recalculation, this is calculated SPB-1SIS routing device to the network and the number of hops Cost all other paths each routing device, the routing device according to the other routing device to the minimum number of hops Cost path path of all determined for the minimum corresponding to other routing devices the optimal path; according to a preset rule SPB-1SIS other network devices corresponding to each optimal path route in the forwarding path preferably corresponds to the other routing devices in each ECT algorithm, according to the preferred forwarding path out determine the further routing device and the output port corresponding to the next hop in ECT algorithm; wherein the computing device to present routing network SPB-1SIS Cost and hop routing all paths each of the other devices, the present Cost of the other routing device to the routing device of the smallest minimum hop count path of all paths is determined for the optimum path corresponding to the other routing devices method 用以下步骤: A、将本路由设备的所有邻居路由设备加入候选列表,将本路由设备与每个邻居路由设备间的直连链路添加到该邻居路由设备的ParentLinkList并设置onTree标记,记录本路由设备到该邻居路由设备的跳数,将本路由设备记为该邻居路由设备的父节点; B、判断候选列表是否为空,如果是,则确定本路由设备经过设置有onTree标记的链路到达SPB-1SIS网络中其它每个路由设备的路径为该其它路由设备对应的最优路径,并结束本流程,否则,执行步骤C ; C、从候选列表中取出距离本路由设备的Cost最小的路由设备作为当前路由设备,判断当前路由设备是否有除父节点外的邻居路由设备,如果是,则执行步骤D,否则,返回步骤B执行; D、将当前路由设备的除父节点外的所有邻居路由设备加入候选列表,计算本路由设备经由当前路由设备到达新加入候选列 With the following steps: A, all the neighboring routing device according to the present routing device to join the candidate list, the add direct link between the local device and the routing device to route each neighbor ParentLinkList routing device and the neighbor set onTree mark, recording the present hops routing device to the neighbor routing device, the routing device will be referred to the parent node for this neighbor routing device; B, determines whether the candidate list is empty, if yes, determining that the link routing device is provided with a through-labeled onTree SPB-1SIS reach the other network routing paths for each device for the optimal path corresponding to other routing devices, and ends the present process, otherwise, step C; C, removed from the present minimum Cost routing device from the candidate list the routing device as the current routing device determines whether the current routing device whether a neighboring routing device other than a parent node, if yes, procedure D, returning to step B performed; D, all outside of the current inter parent node routing device Add neighboring routing device candidate list computing device reaches this route via the addition of new candidate column current routing device 中的各路由设备的路径的cost和跳数,将当前路由设备记为新加入候选列表中的各路由设备的父节点,对于首次加入候选列表的每个路由设备,将该路由设备与当前路由设备间的直连链路添加到该路由设备的ParentLinkList并设置onTree标记;对于非首次加入候选列表的每个路由设备,如果本路由设备经由当前路由设备到达该路由设备的路径的Cost比原来计算的Cost小或与原来计算的Cost相等但跳数比原来小,则清空该路由设备的ParentLinkList,将该路由设备与当前路由设备间的直连链路添加到该路由设备的ParentLinkList并设置onTree标记;返回步骤B执行。 path cost and hop count in each routing device, the routing device will be referred to as the current parent of each newly added routing device in the candidate list, for each of the first routing device is added to the candidate list, the routing device with the current route direct link between devices added to the routing device and ParentLinkList provided onTree marker; each routing device for the first time non-candidate list is added, than if the originally calculated Cost present a route to the routing device via a routing device current routing devices Cost is smaller or equal to the originally calculated Cost but smaller than the original hop count, the routing will be emptied ParentLinkList device, added to the current of the direct link between the routing device, the routing device ParentLinkList routing tag and setting a onTree ; B returns to step performed.
  2. 2.根据权利要求1所述的路由计算方法,其特征在于, 所述按照预设规则在SPB-1SIS网络中其它每个路由设备的最优路径中优选出该其它路由设备对应的在每种ECT算法下的转发路径,根据优选出的转发路径确定该其它路由设备对应的在该ECT算法下的出端口和下一跳包括: 按照SPB-1SIS网络中其它每个路由设备对应的最优路径的Cost从小到大的顺序对所有路由设备进行排序,并按照以下步骤确定序列中各路由设备在每种ECT算法下的转发路径: 对于排序中的第一个路由设备,将本路由设备上直连该第一个路由设备的端口确定为该第一个路由设备对应的出端口,且该第一个路由设备对应的下一跳为该第一个路由设备; 假设排序中的前K个路由设备的出端口和下一跳已经确定,则对于第K+1个路由设备,根据该第K+1个路由设备的ParentLinkList确定该第K+1个路由设备在该第K+1 The route calculation method according to claim 1, characterized in that, according to a preset rule in the SPB-1SIS optimal path to every other network routing device preferably corresponding to that of the other routing device in each ECT the forwarding path algorithm, according to the forwarding path to determine a preferred routing device corresponding to the other in the ECT algorithm next hop and the egress port comprising: SPB-1SIS optimal path according to a network routing device corresponding to each other Cost is ascending order sort all of the routing device, the routing device and determines the sequence of each transfer path in each ECT algorithm as follows: for the first ordering a routing device, the routing device directly on this a routing device connected to the first port of the first routing device determines that the corresponding egress port, and the first routing device corresponding to a next hop for a first routing device; K before routing the assumption ordering a device interface and next hop has been determined for the first K + 1 routing apparatus according to the first K + ParentLinkList 1 routing device determines that the first K + 1 routing devices in the first K + 1 路由设备对应的最优路径上的父节点数,如果确定该K+1个路由设备只有一个父节点,则该第K+1个路由设备继承该父节点的出端口和下一跳;如果该K+1个路由设备具有m个父节点,则确定本路由设备经由该第K+1个路由设备的m个父节点对应的转发路径到达该第K+1个路由设备的m条最优路径,按照该种ECT算法从所述m条最优路径中优选一条转发路径,该第K+1个路由设备继承该第K+1个路由设备在优选的转发路径上的父节点的出端口和下一跳;其中,m是大于I的自然数。 Parent nodes on the optimal path corresponding to a routing device, if it is determined that the K + 1 routing device has only one parent node, the first K + 1 port of the routing device inherit parent node and the next hop; if the K + 1 routing apparatus has m parent node, determining that the routing device reaches the optimal path of the m K + 1 of the routing device via the transfer path of the parent node of m K + 1 corresponding to the routing device according to the kind of the ECT algorithm from the m is preferably an optimal path forwarding path, the first routing device K + 1 K + inherit the second port of the parent node, a routing device in a preferred forward path and next hop; where, m is a natural number greater than I.
  3. 3.根据权利要求2所述的路由计算方法,其特征在于, 确定排序中前K个路由设备的出端口和下一跳之后,根据该第K+1个路由设备的ParentLinkList确定该第K+1个路由设备在该第K+1个路由设备对应的最优路径上的父节点数之前,进一步包括:如果该第K+1个路由设备对应的所有最优路径之间存在除本路由设备以外的其它交点,则确定该第K+1个路由设备继承所有其它交点中任一交点的出端口和下一跳,否则,根据该第K+1个路由设备的ParentLinkList确定该第K+1个路由设备在该第K+1个路由设备对应的最优路径上的父节点数。 3. After the route calculation method according to claim 2, wherein the port is determined that the ordering of the first K and a next-hop routing device, the first K + ParentLinkList 1 routing device based on the determination of the K + a routing device before the parent nodes on the optimal path of the first K + 1 corresponding to the routing device further comprising: if the K + is present among all of the optimum path corresponding to a routing device according to the other routing devices other than an intersection, it is determined that the K + 1 first routing device inherited next hop and the egress port of any one of all intersections other intersections, otherwise, the first K + ParentLinkList 1 determines that the routing device according to the first K + 1 routing apparatus parent nodes on the optimal path of the first K + 1 corresponding to the routing device.
  4. 4.根据权利要求1-3中任一权项所述的路由计算方法,其特征在于,该方法进一步包括: 预先记录SPB-1SIS网络中每条link所在的各组播树的根节点; 检测到SPB-1SIS网络拓扑变化时,进一步确定引起所述拓扑变化的link,根据预先记录的SPB-1SIS网络中每条link所在的各组播树的根节点判断该link是否在组播树上,如果该link在组播树上,则重新计算该link所在的组播树的拓扑;如果该link不在任何组播树上,则若该link的Cost减小,则重新计算SPB-1SIS网络中所有组播树的拓扑,若该link断开或Cost增大,则不对任何组播树的拓扑进行重新计算。 4. A route calculation method of any one of claims 1-3 according to claim, characterized in that, the method further comprising: a root node of the multicast tree for each SPB-1SIS network where each link recorded in advance; detecting when the SPB-1SIS network topology changes, a further determination of the link causes a topology change, for each root node of the multicast tree according to a prerecorded SPB-1SIS network where each link is determined whether the link in the multicast tree, If the link in the multicast tree, recalculating the topology of the multicast tree where the link; if the link is not in any of the multicast tree, the Cost is reduced if the link is re-calculated for all network SPB-1SIS multicast tree topology, if the link is disconnected or Cost increases not any multicast tree topology recalculation.
  5. 5.一种路由设备,应用于SPB-1SIS网络,其特征在于,该路由设备包括:检测单元、判断单元、计算单元、优选单元; 所述检测单元,用于检测SPB-1SIS网络是否发生拓扑变化; 所述判断单元,用于在检测单元检测到SPB-1SIS网络发生拓扑变化时,判断是否需要重新计算单播路由; 所述计算单元,用于在判断单元判断确定需要重新计算单播路由时,计算本路由设备到SPB-1SIS网络中其它每个路由设备的所有路径的Cost和跳数,将本路由设备到该其它路由设备的Cost最小的所有路径中跳数最小的路径确定为该其它路由设备对应的最优路径; 所述优选单元,用于按照预设规则在SPB-1SIS网络中其它每个路由设备对应的最优路径中优选出该其它路由设备对应的在每种ECT算法下的转发路径,根据优选出的转发路径确定该其它路由设备对应的在该ECT算法下的出端口和下一跳; A routing device, applied to SPB-1SIS network, wherein the routing apparatus comprising: a detecting unit, a determining unit, a calculating unit, preferably a unit; said detecting means, for detecting whether the network topology SPB-1SIS occurred changes; the determining unit, for detecting unit detects that the network topology changes SPB-1SIS occurs, determines whether to recalculate unicast route; the calculation unit, the determination unit for determining determines that a unicast route recalculation , the computing device to present the route SPB-1SIS Cost and other network hops all paths each routing device, the routing device according to the other routing devices Cost minimum number of paths for all of the minimum hop path determined for the optimum path corresponding to other routing devices; the unit is preferably configured according to a preset rule SPB-1SIS other network devices corresponding to each optimal path route is preferably an ECT algorithm in each of the other routing device corresponding to forwarding path, according to the forwarding path to determine a preferred route to the other output port corresponding to the device at the next hop and ECT algorithm; 其中,所述计算单元在计算本路由设备到SPB-1SIS网络中其它每个路由设备的所有路径的Cost和跳数,将本路由设备到该其它路由设备的Cost最小的所有路径中跳数最小的路径确定为该其它路由设备对应的最优路径时,采用以下步骤: A、将本路由设备的所有邻居路由设备加入候选列表,将本路由设备与每个邻居路由设备间的直连链路添加到该邻居路由设备的ParentLinkList并设置onTree标记,记录本路由设备到该邻居路由设备的跳数,将本路由设备记为该邻居路由设备的父节点; B、判断候选列表是否为空,如果是,则确定本路由设备经过设置有onTree标记的链路到达SPB-1SIS网络中其它每个路由设备的路径为该其它路由设备对应的最优路径,并结束本流程,否则,执行步骤C ; C、从候选列表中取出距离本路由设备的Cost最小的路由设备作为当前路由设备,判断当前 Wherein the calculation unit calculates the present SPB-1SIS routing device to the network and the number of hops of each other Cost of all the paths of the routing device, the routing device according to the other routing device Cost minimum number of hops in the path of least all determining when the path for the optimum path corresponding to the other routing device, the following steps: a, all the neighboring routing device according to the present routing device to join the candidate list, the direct link between the routing device according to the routing device and the each neighbor ParentLinkList added to the neighbor and routing device is provided onTree flag, the routing device records the number of hops to the present neighbor routing device, the routing device referred to this parent node for the routing neighbor device; B, determines whether the candidate list is empty, if that after determining that the routing device is provided with a link mark onTree each routing path to reach the other device in the network for the SPB-1SIS optimum path corresponding to other routing devices, and ends the present process, otherwise, step C; C, removed from the routing device of this minimal Cost routing device from the candidate list as the current routing device determines the current 由设备是否有除父节点外的邻居路由设备,如果是,则执行步骤D,否则,返回步骤B执行; D、将当前路由设备的除父节点外的所有邻居路由设备加入候选列表,计算本路由设备经由当前路由设备到达新加入候选列表中的各路由设备的路径的cost和跳数,将当前路由设备记为新加入候选列表中的各路由设备的父节点,对于首次加入候选列表的每个路由设备,将该路由设备与当前路由设备间的直连链路添加到该路由设备的ParentLinkList并设置onTree标记;对于非首次加入候选列表的每个路由设备,如果本路由设备经由当前路由设备到达该路由设备的路径的Cost比原来计算的Cost小或与原来计算的Cost相等但跳数比原来小,则清空该路由设备的ParentLinkList,将该路由设备与当前路由设备间的直连链路添加到该路由设备的ParentLinkList并设置onTree标记;返回步骤B执行。 The apparatus whether a neighboring routing device other than a parent node, if yes, procedure D, returning to step B performed; D, all the current neighbor routing devices outside the other parent node routing device added candidate list computing this routing equipment arrived via the current routing device newly added cost and hop path of each routing device candidate list, the current routing equipment recorded as new entrants to the candidate list of each routing device's parent, for each of the first to join the candidate list a routing device, the routing device is added to the current direct link between the routing device to the routing device and ParentLinkList provided onTree marker; each routing device for non-candidate list is added first, if the present current routing device via the routing device the path to the original route calculation device Cost Cost is less than or equal to the originally calculated Cost but smaller than the original hop count, the routing will be emptied ParentLinkList device, the routing device with the current direct link between the routing devices ParentLinkList added to the routing device and provided onTree marker; B returns to step performed.
  6. 6.根据权利要求5所述的路由设备,其特征在于, 所述优选单元在按照预设规则在SPB-1SIS网络中其它每个路由设备的最优路径中优选出该其它路由设备对应的在每种ECT算法下的转发路径,根据优选出的转发路径确定该其它路由设备对应的在该ECT算法下的出端口和下一跳时,用于: 按照SPB-1SIS网络中其它每个路由设备对应的最优路径的Cost从小到大的顺序对所有路由设备进行排序,并按照以下步骤确定序列中各路由设备在每种ECT算法下的转发路径: 对于排序中的第一个路由设备,将本路由设备上直连该第一个路由设备的端口确定为该第一个路由设备对应的出端口,且该第一个路由设备对应的下一跳为该第一个路由设备; 假设排序中的前K个路由设备的出端口和下一跳已经确定,则对于第K+1个路由设备,根据该第K+1个路由设备的ParentLinkList确定该第K+1个路由设 The routing apparatus according to claim 5, wherein, preferably said unit according to a preset rule SPB-1SIS optimal path to every other network routing devices shown in the other preferably corresponding to the routing device forwarding path algorithm each ECT, the port and the next hop corresponding to other routing devices in accordance with the ECT algorithm determines a forwarding path preferred for: SPB-1SIS according to each of the other network routing devices Cost optimal path corresponding to the ascending order sort all routing devices, and each of the forwarding path routing device determines the sequence in each ECT algorithm as follows: for the first ordering routing device, this direct routing device on the first routing device determines that the first port of the routing device corresponding to the egress port, and the first routing device corresponding to a next hop for a first routing device; assumption ordering first K output ports of the routing device and the next hop has been determined for the first K + 1 routing devices, ParentLinkList K + 1 of the first routing device determines that the first K + 1 routing provided in accordance with 在该第K+1个路由设备对应的最优路径上的父节点数,如果确定该K+1个路由设备只有一个父节点,则该第K+1个路由设备继承该父节点的出端口和下一跳;如果该K+1个路由设备具有m个父节点,则确定本路由设备经由该第K+1个路由设备的m个父节点对应的转发路径到达该第K+1个路由设备的m条最优路径,按照该种ECT算法从所述m条最优路径中优选一条转发路径,该第K+1个路由设备继承该第K+1个路由设备在优选的转发路径上的父节点的出端口和下一跳;其中,m是大于I的自然数。 Parent nodes on the optimal path of the first K + 1 corresponding to the routing device, if it is determined that the K + 1 routing device has only one parent node, the first K + 1 routing devices inherited parent node output port and the next hop; K + 1 if the routing apparatus has m parent node, determining that the first routing device reaches the routing K + 1 K + 1 through the first transfer path a parent node corresponding to the m-th routing device and m optimal path device, according to the kind of the ECT algorithm from the m is preferably an optimal path forwarding path, the first routing device K + 1 K + inherit the second forwarding path preferably on a routing device the next hop and the egress port of the parent node; wherein, m is a natural number greater than I.
  7. 7.根据权利要求6所述的路由设备,其特征在于, 所述优选单元在确定排序中前K个路由设备的出端口和下一跳之后,根据该第K+1个路由设备的ParentLinkList确定该第K+1个路由设备在该第K+1个路由设备对应的最优路径上的父节点数之前,进一步用于:如果该第K+1个路由设备对应的所有最优路径之间存在除本路由设备以外的其它交点,则确定该第K+1个路由设备继承所有其它交点中任一交点的出端口和下一跳,否则,根据该第K+1个路由设备的ParentLinkList确定该第K+1个路由设备在该第K+1个路由设备对应的最优路径上的父节点数。 The routing apparatus according to claim 6, wherein said determining means is preferably in the first K output ports of sorting and routing equipment after the next hop is determined in accordance with the first K + 1 ParentLinkList routing devices K + 1 the first routing device before the parent nodes of the K + 1 on the optimum path corresponding to the routing device, is further configured to: if the first between K + 1 corresponding to all of the optimum path routing device There are other intersections routing device other than the present, it is determined that the K + 1 first routing device inherited next hop and the egress port of any one of all intersections other intersections, otherwise, according to the first K + ParentLinkList 1 routing device determines K + 1 the first routing apparatus parent nodes on the first K + 1 most superior routing device corresponding.
  8. 8.根据权利要求5-7中任一权项所述的路由设备,其特征在于,该路由设备还包括存储单元; 所述存储单元,用于预先记录SPB-1SIS网络中每条link所在的各组播树的根节点; 所述检测单元,在检测到SPB-1SIS网络拓扑变化时,确定引起所述拓扑变化的link ; 所述判断单元,用于在检测单元确定引起所述拓扑变化的link后,根据预先记录的SPB-1SIS网络中每条I ink所在的各组播树的根节点判断该弓I起拓扑变化的I ink是否在组播树上; 所述计算单元,用于在判断单元判断确定引起所述拓扑变化的link在组播树上时,重新计算该link所在的组播树的拓扑;在判断单元判断确定引起所述拓扑变化的link不在任何组播树上时,则若该link的Cost减小,则重新计算SPB-1SIS网络中所有组播树的拓扑,若该link断开或Cost增大,则不对任何组播树的拓扑进行重新计算。 The routing apparatus of any one of claims claim 5-7, wherein the routing apparatus further comprises a storage unit; a storing unit for previously recorded SPB-1SIS network where each link each root node of the multicast tree; the detection unit, upon detecting a change in the network topology SPB-1SIS, determining topology change causes the Link; the determining unit, the detecting unit for determining a topology change causes the after Link, network according SPB-1SIS prerecorded each root node of each of the multicast tree where I Ink Analyzing the bow I I Ink topology change whether the multicast tree; the calculation unit configured to when not in any link in the multicast tree determination unit determines the topology is determined to cause change; determining unit determines that the link is determined to cause a change in the topology of the multicast tree, recalculating the topology of the multicast tree where the link Cost is reduced if the link is, the topology is recalculated SPB-1SIS all network multicast tree, if the link is disconnected or Cost increases not any multicast tree topology recalculation.
CN 201310035527 2013-01-28 2013-01-28 A route calculation method and apparatus CN103078796B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201310035527 CN103078796B (en) 2013-01-28 2013-01-28 A route calculation method and apparatus

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201310035527 CN103078796B (en) 2013-01-28 2013-01-28 A route calculation method and apparatus

Publications (2)

Publication Number Publication Date
CN103078796A true CN103078796A (en) 2013-05-01
CN103078796B true CN103078796B (en) 2016-03-30

Family

ID=48155205

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201310035527 CN103078796B (en) 2013-01-28 2013-01-28 A route calculation method and apparatus

Country Status (1)

Country Link
CN (1) CN103078796B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104580287A (en) * 2013-10-15 2015-04-29 北京大学 Data communication equipment and data communication method
CN105743789A (en) * 2014-12-08 2016-07-06 中国科学院声学研究所 Tree structure network autonomous management and node adding method
CN104767688B (en) * 2015-04-15 2018-02-09 新华三技术有限公司 Universal survival time security inspection method and apparatus
CN104796334A (en) * 2015-04-30 2015-07-22 无锡市崇安区科技创业服务中心 Data transmission path selection method

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102123088A (en) * 2011-02-21 2011-07-13 杭州华三通信技术有限公司 TE (Traffic Engineering) tunnel establishing method and equipment

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7911944B2 (en) * 2007-12-26 2011-03-22 Nortel Networks Limited Tie-breaking in shortest path determination

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102123088A (en) * 2011-02-21 2011-07-13 杭州华三通信技术有限公司 TE (Traffic Engineering) tunnel establishing method and equipment

Also Published As

Publication number Publication date Type
CN103078796A (en) 2013-05-01 application

Similar Documents

Publication Publication Date Title
US20130124707A1 (en) System and method for flow management in software-defined networks
US7093027B1 (en) Fast connection protection in a virtual local area network based stack environment
US20120320926A1 (en) Distributed Link Aggregation Group (LAG) for a Layer 2 Fabic
US20120027017A1 (en) Multi-destination forwarding in network clouds which include emulated switches
US7480258B1 (en) Cross stack rapid transition protocol
US20060215578A1 (en) Method for optimal assignment of customer edge (CE) routers to virtual private network route forwarding (VRF) tables
US20120294194A1 (en) Method and apparatus for preserving extensions in multi-vendor trill networks
US20060126496A1 (en) Fast reroute (FRR) protection at the edge of a RFC 2547 network
US20080025203A1 (en) Alternate spanning tree for faster indirect link failure recovery
US20090168768A1 (en) Tie-Breaking in Shortest Path Determination
US20100284413A1 (en) Dual homed e-spring protection for network domain interworking
US6711152B1 (en) Routing over large clouds
US8761022B2 (en) Tie-breaking in shortest path determination
US8295291B1 (en) Computation of next hops within layer two networks
US20090161584A1 (en) Method for a root path calculation in a shortest path bridge
US7123587B1 (en) System, device and method for limiting tunnel traffic in an information communication network
US20110273980A1 (en) Distributed Failure Recovery in a Routed Etherent Network
US7463597B1 (en) Spanning tree protocol synchronization within virtual private networks
US20080107018A1 (en) Method and apparatus for computing alternate multicast/broadcast paths in a routed network
US20110268118A1 (en) Method for routing data packets using vlans
US20030026209A1 (en) Avoiding overlapping segments in transparent lan services on ring-based networks
US20100284309A1 (en) Method and Apparatus for Multicast Implementation In a Routed Ethernet Mesh Network
US20110134803A1 (en) Configuring networks including spanning trees
US20080259784A1 (en) Failure notification in a network having serially connected nodes
US20080165705A1 (en) Node, Network, Correspondence Relationship Generation Method and Frame Transfer Program

Legal Events

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