WO2016078342A1 - Trill网络分发树计算方法和trill网络节点 - Google Patents

Trill网络分发树计算方法和trill网络节点 Download PDF

Info

Publication number
WO2016078342A1
WO2016078342A1 PCT/CN2015/077699 CN2015077699W WO2016078342A1 WO 2016078342 A1 WO2016078342 A1 WO 2016078342A1 CN 2015077699 W CN2015077699 W CN 2015077699W WO 2016078342 A1 WO2016078342 A1 WO 2016078342A1
Authority
WO
WIPO (PCT)
Prior art keywords
nickname
distribution tree
tree root
routing table
root
Prior art date
Application number
PCT/CN2015/077699
Other languages
English (en)
French (fr)
Inventor
吴强
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2016078342A1 publication Critical patent/WO2016078342A1/zh

Links

Images

Definitions

  • This paper relates to computer network technology, especially to a TRILL network distribution tree calculation method and a TRILL network node.
  • TRILL Transparent Interconnection of Lots of Links
  • Layer 3 routing technology is applied to Layer 2 transmission to implement large-scale Layer 2 clouds to meet the growing convergence network or super Large data centers require building an excellent and efficient Layer 2 broadcast domain.
  • the TRILL network uses the Intermediate System to Intermediate System Routing Protocol (ISIS) as its dynamic routing protocol to complete network topology and route calculation.
  • ISIS Intermediate System to Intermediate System Routing Protocol
  • TRILL-ISIS is a dynamic, link-state-based Interior Gateway Protocol (IGP). After the ISIS establishes a neighbor through hello packet negotiation, each routing bridge (RB) generates a link-state packet (LSP) to describe the link state information of the RB and sends it to the link state information of the RB. In the network, the LSPs sent by all the RBs in the network topology are also stored, and a link-state database (LSDB) is formed. ISIS uses the LSDB to calculate the best route to the destination address through the Shortest Path First (SPF) algorithm.
  • SPF Shortest Path First
  • the TRILL-ISIS multicast topology calculation is a nickname nickname negotiated from the TRILL network topology as the root of the tree.
  • the SPF is used to calculate a consistent distribution tree across the entire network.
  • a multicast distribution tree in a TRILL network can have multiple trees, and different nicknames are used as roots for load balancing of multicast and broadcast.
  • Nickname is the nickname of RB.
  • the nickname of each RB is different.
  • Each RB can be configured with multiple nicknames.
  • An LSP of an RB holds LSPs of all RBs in the network topology.
  • Each RB advertises the link status of the RB in the LSP, including the nickname and root priority of the RB and its neighboring RBs. The choice of the root nickname is determined by the nickname decision advertised in the LSP generated by each RB. If a remote RB's nickname distribution tree has the highest priority High, will be elected as the distribution tree root in the network topology. In the case of a network topology interruption, the local RB cannot be routed to the remote RB, but the LSP of the remote RB still exists in the database of the local RB, and the root nickname does not change until the LSP of the remote RB After the aging is deleted, the new root can be selected.
  • the local RB Before selecting a new root, the local RB always tries to calculate a distribution tree that can be routed to all RBs in the network topology with the nickname on the remote RB as the root of the tree, which is obviously unsuccessful.
  • the aging time of the LSP of the remote RB is 1200s by default. Therefore, the split network cannot calculate the correct distribution tree for a long time, resulting in no broadcast and multicast traffic, and low convergence performance.
  • the purpose of the embodiment of the present invention is to provide a TRILL network distribution tree calculation method, which solves the problem that the distribution tree root convergence performance is low after the TRILL network topology change as described above.
  • an embodiment of the present invention provides a TRILL network distribution tree calculation method, including:
  • the routing bridge RB selects the distribution tree root nickname nickname according to the unicast routing table, and the nickname not in the unicast routing table does not have the selected qualification;
  • the distribution tree is calculated using the selected distribution tree root nickname.
  • selecting a distribution tree root nickname according to the unicast routing table including:
  • a selection of the distribution tree root nickname is triggered.
  • obtaining a reachable candidate nickname according to the unicast routing table including:
  • the distribution tree root candidate nickname is obtained from the link state database, and the distribution tree root candidate nickname is determined to be reachable according to the unicast routing table.
  • the nickname with the highest root priority is used as the distribution root nickname.
  • the embodiment of the invention further provides a multi-link transparent transmission TRILL network node, including:
  • a distribution tree root selection unit configured to select a distribution tree root nickname nickname according to the unicast routing table, and the nickname not in the unicast routing table does not have the selected qualification
  • a distribution tree computing unit configured to calculate a distribution tree using the selected distribution tree root nickname.
  • the distribution tree root selection unit is configured to obtain a reachable distribution tree root candidate nickname according to the unicast routing table, and select a distribution tree from the reachable distribution tree root candidate nickname Tree root nickname.
  • the distribution tree root selection unit is further configured to: when a new nickname is added to the unicast routing table, or a nickname is deleted from the routing table, triggering selection of a distribution tree root nickname .
  • the distribution tree root selection unit is configured to obtain a distribution tree root candidate nickname from the link state database, and determine, according to the unicast routing table, whether the distribution tree root candidate nickname is reachable.
  • the distribution tree root selection unit is configured to use the nickname with the highest root priority as the distribution number root nickname.
  • the root of the tree is selected according to the unicast routing table, so that the selected roots are all reachable, the convergence of the root selection is improved, and the convergence performance of the broadcast and multicast routes is improved, thereby avoiding broadcast and multicast. Traffic has been unworked for a long time, and traffic is disrupted and other negative effects.
  • FIG. 1 is a flowchart of a method for calculating a distribution tree according to an embodiment of the present invention
  • FIG. 2 is a schematic structural diagram of a TRILL network node according to an embodiment of the present invention.
  • FIG. 3 is a schematic diagram of a network topology according to application example 1 of the present invention.
  • FIG. 4 is a schematic diagram of a network topology according to application example 2 of the present invention.
  • an embodiment of the present invention provides a TRILL network distribution tree calculation method, including:
  • Step 10 The RB selects a distribution tree root nickname nickname according to the unicast routing table, and the nickname not in the unicast routing table does not have the selected qualification;
  • the reachable distribution tree root candidate nickname can be obtained according to the unicast routing table, and the distribution tree root nickname is selected from the reachable distribution tree root candidate nickname.
  • a selection of the distribution tree root nickname is triggered.
  • the RB may obtain the distribution tree root candidate nickname from the link state database, and determine, according to the unicast routing table, whether the distribution tree root candidate nickname is reachable.
  • the nickname with the highest root priority is used as the distribution root nickname.
  • Step 11 Calculate the distribution tree using the selected distribution tree root nickname.
  • the first TRILL network node deletes the original distribution tree and its broadcast and multicast forwarding table, and calculates a new distribution tree according to the new distribution tree root.
  • the TRILL network node in the embodiment of the present invention includes:
  • a distribution tree root selection unit configured to select a distribution tree root nickname nickname according to the unicast routing table, and the nickname not in the unicast routing table does not have the selected qualification
  • a distribution tree computing unit configured to calculate a distribution tree using the selected distribution tree root nickname.
  • the distribution tree root selection unit is configured to obtain a reachable distribution tree root candidate nickname according to the unicast routing table, and select a distribution tree from the reachable distribution tree root candidate nickname Tree root nickname.
  • the distribution tree root selection unit is further configured to: when a new nickname is added to the unicast routing table, or a nickname is deleted from the routing table, triggering selection of a distribution tree root nickname .
  • the distribution tree root selection unit is configured to obtain a distribution tree root candidate nickname from the link state database, and determine, according to the unicast routing table, whether the distribution tree root candidate nickname is reachable.
  • the distribution tree root selection unit is configured to use the nickname with the highest root priority as the distribution number root nickname.
  • a computer readable storage medium stores program instructions, and when the program instructions are executed, the TRILL network distribution tree calculation method can be implemented.
  • nickname1, nickname2, nickname3, and nickname4 form a linear TRILL network
  • nickname1, nickname2, nickname3, and nickname4 respectively.
  • the distribution tree root priority of nickname1, nickname2, nickname3, and nickname4 is 1, 2 3, 4.
  • RB1, RB2, RB3, and RB4 carry their own nickname and their nickname root priority in the nickname subtype length value (TLV) field of the LSP for advertisement, and then flood and synchronize in the TRILL network, and finally RB1, RB2, and RB3.
  • RB4 will have a consistent LSDB. Any RB can obtain the nickname and nickname root priority of other RBs on the network.
  • the linear TRILL network consisting of RB1, RB2, RB3, and RB4 selects the nickname4 with the highest root priority as the distribution tree root of the network, and uses the nickname4 of RB4 as the root to perform SPF calculation to reach the entire network RB1, RB2.
  • the distribution tree of RB3 and RB4, and then the broadcast and multicast routing tables are calculated according to the distribution tree. Any RB can send a broadcast TRILL data packet to all other RBs on the network topology.
  • the SPF topology calculation performed by nickname4 of RB4 cannot calculate its own RB1, so all broadcasts and multicasts will be deleted on RB1. Routing table. At this time, even if the linear new TRILL network topology of RB1 and RB2 cannot directly send broadcast and multicast traffic to each other, the traffic that is originally reachable cannot pass. You can wait for the LSP of the RB4 to age out, re-elect the new nickname tree root, calculate the distribution tree that matches the new network topology, and the corresponding broadcast multicast routing table, and restore the broadcast multicast traffic between RB1 and RB2.
  • RB2 and RB3 are connected to the unicast routing table, and the nickname4 of the RB3 and the nickname4 of the RB4 are deleted from the unicast routing table.
  • Nickname3 of RB3, nickname4 of RB4 are unreachable, nickname 3 and nickname 4 will no longer be eligible, and the distribution tree root will be elected between nickname1 and nickname 2.
  • RB1 finally elects nickname2 of RB2 as the distribution tree root of the new topology, performs distribution tree calculation, and calculates a new broadcast and multicast routing table according to the distribution tree, ensuring smooth broadcast of RB1 and RB2 broadcast and multicast traffic. In this way, the convergence performance of the distribution tree root and its broadcast and multicast routes is improved, and the convergence calculation of the new topology is not required until the LSP of the RB4 is aged.
  • RB1 and RB2 form a linear TRILL network topology.
  • RB3 and RB4 form a linear TRILL network topology.
  • the nicknames of RB1, RB2, RB3, and RB4 are nickname1, nickname2, nickname3, and nickname4, respectively.
  • the distribution tree root priority of nickname1, nickname2, nickname3, and nickname4 is 1, 2, 3, and 4.
  • RB1 and RB2 form a straight-line TRILL network topology, and nickname2 of RB2 is used as the distribution tree root nickname of the topology.
  • RB3 and RB4 form a linear TRILL network topology, and nickname4 of RB4 is used as the distribution tree root nickname of the topology.
  • RB1, RB2, RB3, and RB4 form a new linear TRILL network topology.
  • the LSPs generated by RB1, RB2, RB3, and RB4 are flooded and synchronized on the new network topology.
  • RB1, RB2, RB3, and RB4 all have a consistent LSDB.
  • RB1 as an example, after receiving the LSP of RB4, it finds that it has nickname4 in the LSP. And its priority 4. This nickname4 will not immediately qualify for the election distribution tree root priority.
  • the unicast route calculation is performed on the nickname4.
  • the election of the RB1 to the distribution tree root will be triggered, and the nickname4 will also participate in the distribution tree.
  • the root's campaign in turn, recalculates the distribution tree that adapts to the new network topology and its broadcast routing table associated with the distribution tree.
  • All or part of the steps of the above embodiments may also be implemented using an integrated circuit. These steps may be separately fabricated into individual integrated circuit modules, or a plurality of modules or steps may be implemented as a single integrated circuit module. Thus, the invention is not limited to any specific combination of hardware and software.
  • the devices/function modules/functional units in the above embodiments may be implemented by a general-purpose computing device, which may be centralized on a single computing device or distributed over a network of multiple computing devices.
  • each device/function module/functional unit in the above embodiment When each device/function module/functional unit in the above embodiment is implemented in the form of a software function module and sold or used as a stand-alone product, it can be stored in a computer readable storage medium.
  • the above mentioned computer readable storage medium may be a read only memory, a magnetic disk or an optical disk or the like.
  • the root of the tree is selected according to the unicast routing table, so that the selected roots are all reachable, the convergence of the root selection is improved, and the convergence performance of the broadcast and multicast routes is improved, thereby avoiding broadcast and multicast. Traffic has been unworked for a long time, and traffic is disrupted and other negative effects.

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

一种多链路透明传输TRILL网络分发树计算方法和TRILL网节点，该方法包括：路由网桥RB根据单播路由表选择分发树树根昵称nickname，不在所述单播路由表中的nickname不具备被选资格；使用所选择的分发树树根nickname计算分发树。

Description

TRILL网络分发树计算方法和TRILL网络节点 技术领域
本文涉及计算机网络技术，尤其涉及一种TRILL网络分发树计算方法和TRILL网络节点。
背景技术
多链路透明传输(Transparent Interconnection of Lots of Links，TRILL)协议目前已经是国际标准的协议，将三层路由技术应用于二层传输，实现大规模二层云，满足日益增长的融合网络或超大型数据中心要求，构建一个优良而高效的二层广播域。TRILL网络使用中间系统到中间系统路由协议(Intermediate system to intermediate system routing protocol，ISIS)作为其动态路由协议完成网络的拓扑和路由计算。
TRILL-ISIS是一种动态的、基于链路状态的内部网关协议(Interior Gateway Protocol，IGP)。ISIS通过hello报文交互协商建立邻居后，每一个路由网桥(Routing Bridge，RB)都产生链路状态协议数据包(link-state packet，LSP)描述本RB的链路状态信息，并发送到网络中，并且也会存储网络拓扑上所有RB发送过来的LSP，形成链路状态数据库(link-state database，LSDB)。ISIS就是使用LSDB通过最短路径优先算法(Shortest Path First，SPF)计算出到达目的地址的最佳路由。
TRILL-ISIS的组播拓扑计算是从TRILL网络拓扑中统一协商的一个昵称nickname作为树根，执行SPF计算出全网一致的分发树。一个TRILL网络中组播的分发树可以有多棵，分别以不同的nickname作为树根，用于组播和广播的负载分担。Nickname是RB的昵称，每一个RB的nickname不相同，每一个RB可以配置多个nickname。
一个RB的LSDB中保存了网络拓扑上所有RB的LSP，每一个RB在LSP中通告本RB的链路状态，包括本RB及其邻接RB的nickname及树根优先级。树根nickname的选择就是通过每一个RB生成的LSP中通告的nickname决策而确定的。假如一个远端RB的nickname分发树树根优先级最 高，将会被选举为本网络拓扑中的分发树根。在网络拓扑中断的情况下，本地RB已经不能路由到远端RB了，但是远端RB的LSP仍然存在于本地RB的数据库中，树根nickname也不会有任何变化，直到远端RB的LSP老化删除后，才能选出新的树根。在选出新的树根之前，本地RB总是试图以这个远端RB上的nickname为树根计算一个可路由到网络拓扑中所有RB的分发树，显然是不能成功的。远端RB的LSP的老化时间默认是1200s，因此分裂后的网络很长时间不能计算出正确的分发树，导致广播和组播流量不通，收敛性能很低。
发明内容
本发明实施例的目的是提供一种TRILL网络分发树计算的方法，解决如上所述TRILL网络拓扑变化后分发树根收敛性能低的问题。
为了解决上述问题，本发明实施例提供了一种TRILL网络分发树计算方法，包括：
路由网桥RB根据单播路由表选择分发树树根昵称nickname，不在所述单播路由表中的nickname不具备被选资格；
使用所选择的分发树树根nickname计算分发树。
可选地，根据所述单播路由表选择分发树树根nickname，包括：
根据所述单播路由表获得可达的分发树树根候选nickname，从所述可达的分发树树根候选nickname中选择分发树树根nickname。
可选地，当有新的nickname被添加到所述单播路由表中，或有nickname从所述路由表删除，触发分发树树根nickname的选择。
可选地，根据所述单播路由表获得可达的候选nickname，包括：
从链路状态数据库中获取分发树树根候选nickname，根据所述单播路由表判断分发树树根候选nickname是否可达。
可选地，将树根优先级最高的nickname作为分发数树根nickname。
本发明实施例还提供一种多链路透明传输TRILL网络节点，包括：
分发树树根选择单元，设置为根据单播路由表选择分发树树根昵称nickname，不在所述单播路由表中的nickname不具备被选资格；以及
分发树计算单元，设置为使用所选择的分发树树根nickname计算分发树。
可选地，所述分发树树根选择单元是设置为，根据所述单播路由表获得可达的分发树树根候选nickname，从所述可达的分发树树根候选nickname中选择分发树树根nickname。
可选地，所述分发树树根选择单元还设置为，当有新的nickname被添加到所述单播路由表中，或有nickname从所述路由表删除，触发分发树树根nickname的选择。
可选地，所述分发树树根选择单元是设置为，从链路状态数据库中获取分发树树根候选nickname，根据所述单播路由表判断分发树树根候选nickname是否可达。
可选地，所述分发树树根选择单元是设置为，将树根优先级最高的nickname作为分发数树根nickname。
本发明实施例根据单播路由表选取树根，保证了选出的树根都是可达的，提高了树根选取收敛性能，进而提高广播和组播路由收敛性能，从而避免广播和组播流量很长时间不通，流量混乱等负面影响。
附图概述
图1为本发明实施例的分发树计算方法流程图；
图2为本发明实施例的TRILL网络节点结构示意图；
图3为本发明应用实例一的网络拓扑示意图；
图4为本发明应用实例二的网络拓扑示意图。
本发明的实施方式
下面将结合附图及实施例对本发明的技术方案进行更详细的说明。
需要说明的是，如果不冲突，本发明实施例以及实施例中的特征可以相 互结合，均在本发明实施例的保护范围之内。另外，虽然在流程图中示出了逻辑顺序，但是在一些情况下，可以以不同于此处的顺序执行所示出或描述的步骤。
如图1所示，本发明实施例提供一种TRILL网络分发树计算方法，包括：
步骤10，RB根据单播路由表选择分发树树根昵称nickname，不在所述单播路由表中的nickname不具备被选资格；
本步骤中，可以根据所述单播路由表获得可达的分发树树根候选nickname，从所述可达的分发树树根候选nickname中选择分发树树根nickname。
可选地，当有新的nickname被添加到所述单播路由表中，或有nickname从所述路由表删除，触发分发树树根nickname的选择。
RB可以从链路状态数据库中获取分发树树根候选nickname，根据所述单播路由表判断分发树树根候选nickname是否可达。
可选地，将树根优先级最高的nickname作为分发数树根nickname。
步骤11，使用选择的分发树树根nickname计算分发树。
其中，若分发树树根发生变化，所述第一TRILL网络节点删除原分发树及其广播和组播转发表，并依据新的分发树树根计算新的分发树。
如图2所示，本发明实施例的TRILL网络节点包括：
分发树树根选择单元，设置为根据单播路由表选择分发树树根昵称nickname，不在所述单播路由表中的nickname不具备被选资格；以及
分发树计算单元，设置为使用所选择的分发树树根nickname计算分发树。
可选地，所述分发树树根选择单元是设置为，根据所述单播路由表获得可达的分发树树根候选nickname，从所述可达的分发树树根候选nickname中选择分发树树根nickname。
可选地，所述分发树树根选择单元还设置为，当有新的nickname被添加到所述单播路由表中，或有nickname从所述路由表删除，触发分发树树根nickname的选择。
可选地，所述分发树树根选择单元是设置为，从链路状态数据库中获取分发树树根候选nickname，根据所述单播路由表判断分发树树根候选nickname是否可达。
可选地，所述分发树树根选择单元是设置为，将树根优先级最高的nickname作为分发数树根nickname。
本发明实施例的一种计算机可读存储介质，存储有程序指令，当该程序指令被执行时可实现上述TRILL网络分发树计算方法。
以下通过两个应用实例来说明本发明实施例的方案。
应用实例1：
如图3所示，RB1、RB2、RB3、RB4构成一个直线形的TRILL网络，nickname分别为nickname1、nickname2、nickname3、nickname4，假设nickname1、nickname2、nickname3、nickname4的分发树根优先级为1、2、3、4。
RB1、RB2、RB3、RB4将自己nickname及其nickname树根优先级携带在LSP的nickname子类型长度值(TLV)字段中进行通告，然后在TRILL网络中洪泛和同步，最终RB1、RB2、RB3、RB4都会拥有一致的LSDB，任何RB都可以获得网络上其他RB的nickname及其nickname树根优先级。本实例中，RB1、RB2、RB3、RB4构成的直线型TRILL网络选择树根优先级最高的nickname4作为本网络的分发树根，以RB4的nickname4为树根进行SPF计算到达全网RB1、RB2、RB3、RB4的分发树，进而依据分发树计算出广播和组播路由表。任何一个RB都能发送一个广播TRILL数据报文到达网络拓扑上所有的其他RB。
如果按照现有流程，若RB2和RB3发生了链路中断，原直线型TRILL网络分裂为RB1和RB2，RB3和RB4两个直线型TRILL网络。以RB1为例，此时，RB1仍然保存有RB2，RB3和RB4的LSP，因此RB1仍然保存了RB2，RB3和RB4的nickname和nickname的树根优先级。因此，这个链路中断并没有引起分发树树根nickname的变化，单从LSDB看，仍然是RB4的 nickname4为分发树树根。但是，由于RB2和RB3之间发生了链路中断，触发了分发树的计算，以RB4的nickname4执行SPF拓扑计算是计算不到自己RB1的，因此就会在RB1上删除所有的广播和组播路由表，这时，即使RB1和RB2这个直线型新TRILL网络拓扑直接也不能相互发送广播和组播流量，造成本来可达的流量也不能通。只能等待RB4的LSP老化掉，才能重新选举新的nickname树根，计算出符合新网络拓扑的分发树和相应的广播组播路由表，恢复RB1和RB2之间的广播组播流量。
采用本发明实施例的方案后，RB2和RB3发生了链路中断，触发单播拓扑和单播路由计算，RB3的nickname3、RB4的nickname4将会从单播路由表中删除，这时RB1会发现RB3的nickname3、RB4的nickname4不可达了，nickname 3和nickname 4将不再具备被选资格，分发树树根将会在nickname1和nickname 2之间选举。RB1最终选举RB2的nickname2为新拓扑的分发树树根，进行分发树计算，并依据分发树计算新的广播和组播路由表，保证了RB1和RB2广播和组播流量畅通。这样，就提高了分发树根及其广播和组播路由的收敛性能，不需要等待RB4的LSP老化后才进行适应新拓扑的收敛计算。
应用实例2：
如图4所示，RB1、RB2构成一个直线型的TRILL网络拓扑，RB3、RB4构成一个直线型的TRILL网络拓扑，RB1、RB2、RB3、RB4的nickname分别为nickname1、nickname2、nickname3、nickname4，假设nickname1、nickname2、nickname3、nickname4的分发树根优先级为1、2、3、4。
RB1、RB2构成一个直线型的TRILL网络拓扑，采用RB2的nickname2作为本拓扑的分发树树根nickname。RB3、RB4构成一个直线型的TRILL网络拓扑，采用RB4的nickname4作为本拓扑的分发树树根nickname。
当RB2和RB3建立的TRILL邻居关系后，RB1、RB2、RB3、RB4构成一个新的直线型的TRILL网络拓扑，RB1、RB2、RB3、RB4生成的LSP在新网络拓扑上洪泛和同步，最终RB1、RB2、RB3、RB4都会拥有一致的LSDB。以RB1为例，当收到RB4的LSP后，发现其在LSP中通告了nickname4 及其优先级4。这个nickname4不会立即具有选举分发树根优先级的资格。会对这个nickname4执行单播路由计算，如果这个RB4的nickname4可达，即经过单播路由计算后添加到了单播路由中，才会触发RB1对分发树根的竞选，这个nickname4也将参与分发树根的竞选中，进而重新计算出适应新网络拓扑的分发树以及其与分发树关联的广播路由表。
这样，保证了使用无效的nickname作为分发树根尝试进行分发树计算，浪费计算资源，也避免了无效计算过程中出现的流量混乱的问题。
本领域普通技术人员可以理解上述实施例的全部或部分步骤可以使用计算机程序流程来实现，所述计算机程序可以存储于一计算机可读存储介质中，所述计算机程序在相应的硬件平台上(如系统、设备、装置、器件等)执行，在执行时，包括方法实施例的步骤之一或其组合。
上述实施例的全部或部分步骤也可以使用集成电路来实现，这些步骤可以被分别制作成一个个集成电路模块，或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。这样，本发明不限制于任何特定的硬件和软件结合。
上述实施例中的各装置/功能模块/功能单元可以采用通用的计算装置来实现，它们可以集中在单个的计算装置上，也可以分布在多个计算装置所组成的网络上。
上述实施例中的各装置/功能模块/功能单元以软件功能模块的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。上述提到的计算机可读取存储介质可以是只读存储器，磁盘或光盘等。
工业实用性
本发明实施例根据单播路由表选取树根，保证了选出的树根都是可达的，提高了树根选取收敛性能，进而提高广播和组播路由收敛性能，从而避免广播和组播流量很长时间不通，流量混乱等负面影响。

Claims (11)

  1. 一种多链路透明传输TRILL网络分发树计算方法，包括：
    路由网桥RB根据单播路由表选择分发树树根昵称nickname，不在所述单播路由表中的nickname不具备被选资格；
    使用所选择的分发树树根nickname计算分发树。
  2. 如权利要求1所述的方法，其中，
    根据所述单播路由表选择分发树树根nickname，包括：
    根据所述单播路由表获得可达的分发树树根候选nickname，从所述可达的分发树树根候选nickname中选择分发树树根nickname。
  3. 如权利要求1所述的方法，其中，
    当有新的nickname被添加到所述单播路由表中，或有nickname从所述路由表删除，触发分发树树根nickname的选择。
  4. 如权利要求2所述的方法，其中，
    根据所述单播路由表获得可达的候选nickname，包括：
    从链路状态数据库中获取分发树树根候选nickname，根据所述单播路由表判断分发树树根候选nickname是否可达。
  5. 如权利要求1-4任一项所述的方法，其中，
    将树根优先级最高的nickname作为分发数树根nickname。
  6. 一种多链路透明传输TRILL网络节点，包括：
    分发树树根选择单元，设置为根据单播路由表选择分发树树根昵称nickname，不在所述单播路由表中的nickname不具备被选资格；以及
    分发树计算单元，设置为使用所选择的分发树树根nickname计算分发树。
  7. 如权利要求6所述的TRILL网络节点，其中，
    所述分发树树根选择单元是设置为，根据所述单播路由表获得可达的分发树树根候选nickname，从所述可达的分发树树根候选nickname中选择分发树树根nickname。
  8. 如权利要求6所述的TRILL网络节点，其中，
    所述分发树树根选择单元还设置为，当有新的nickname被添加到所述单播路由表中，或有nickname从所述路由表删除，触发分发树树根nickname的选择。
  9. 如权利要求7所述的TRILL网络节点，其中，
    所述分发树树根选择单元是设置为，从链路状态数据库中获取分发树树根候选nickname，根据所述单播路由表判断分发树树根候选nickname是否可达。
  10. 如权利要求6-9任一项所述的TRILL网络节点，其中，
    所述分发树树根选择单元是设置为，将树根优先级最高的nickname作为分发数树根nickname。
  11. 一种计算机可读存储介质，存储有程序指令，当该程序指令被执行时可实现权利要求1-5任一项所述的方法。
PCT/CN2015/077699 2014-11-21 2015-04-28 Trill网络分发树计算方法和trill网络节点 WO2016078342A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201410679751.0 2014-11-21
CN201410679751.0A CN105681204A (zh) 2014-11-21 2014-11-21 Trill网络分发树计算方法和trill网络节点

Publications (1)

Publication Number Publication Date
WO2016078342A1 true WO2016078342A1 (zh) 2016-05-26

Family

ID=56013200

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2015/077699 WO2016078342A1 (zh) 2014-11-21 2015-04-28 Trill网络分发树计算方法和trill网络节点

Country Status (2)

Country Link
CN (1) CN105681204A (zh)
WO (1) WO2016078342A1 (zh)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102123091A (zh) * 2011-02-25 2011-07-13 福建星网锐捷网络有限公司 多链接透明传输互连转发表生成方法、装置及网络设备
CN102761493A (zh) * 2012-07-26 2012-10-31 杭州华三通信技术有限公司 一种多链接透明互联网络中组播路由表项更新方法和装置
CN102780623A (zh) * 2012-07-26 2012-11-14 杭州华三通信技术有限公司 一种多链接透明互联网络中组播路由表项更新方法和装置
CN103428088A (zh) * 2012-05-14 2013-12-04 中兴通讯股份有限公司 一种树根分配、报文处理的方法及路由网桥

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102123091A (zh) * 2011-02-25 2011-07-13 福建星网锐捷网络有限公司 多链接透明传输互连转发表生成方法、装置及网络设备
CN103428088A (zh) * 2012-05-14 2013-12-04 中兴通讯股份有限公司 一种树根分配、报文处理的方法及路由网桥
CN102761493A (zh) * 2012-07-26 2012-10-31 杭州华三通信技术有限公司 一种多链接透明互联网络中组播路由表项更新方法和装置
CN102780623A (zh) * 2012-07-26 2012-11-14 杭州华三通信技术有限公司 一种多链接透明互联网络中组播路由表项更新方法和装置

Also Published As

Publication number Publication date
CN105681204A (zh) 2016-06-15

Similar Documents

Publication Publication Date Title
EP2614618B1 (en) Automated traffic engineering for multi-protocol label switching (mpls) with link utilization as feedback into the tie-breaking mechanism
US10015073B2 (en) Automatic optimal route reflector root address assignment to route reflector clients and fast failover in a network environment
EP3200402B1 (en) Segment routing information obtainment method and segment routing network establishment method
EP2614615B1 (en) Automated traffic engineering for 802.1aq based upon the use of link utilization as feedback into the tie-breaking mechanism
US9647959B2 (en) Method, device, and system for creating bidirectional multicast distribution tree based on interior gateway protocol
US9749214B2 (en) Software defined networking (SDN) specific topology information discovery
CN104378296B (zh) 一种报文转发方法及设备
EP2597830B1 (en) Method, router bridge, and system for trill network protection
Vetriselvan et al. Survey on the RIP, OSPF, EIGRP routing protocols
US20150016242A1 (en) Method and Apparatus for Optimized LFA Computations by Pruning Neighbor Shortest Path Trees
CN102761493B (zh) 一种多链接透明互联网络中组播路由表项更新方法和装置
JP2015518345A (ja) ８０２．１ａｑのための３段折り返しｃｌｏｓの最適化
WO2016086713A1 (zh) 一种等价多路径的出接口更新方法及装置
WO2017084448A1 (zh) 一种网络系统及网络运行方法
WO2016082580A1 (zh) 负载分担的方法和路由设备
CN101909004B (zh) 基于边缘roadm环结构的多域光网络路由方法
WO2015117412A1 (zh) 基于isis的洪泛方法及装置
WO2016123904A1 (zh) 路由收敛方法、装置及虚拟专用网vpn系统
WO2015154427A1 (zh) Trill isis的路由计算方法及装置
CN104506374A (zh) 一种isis协议指定路由管理距离的方法
WO2016184022A1 (zh) Ip可达性信息通告方法、路由确定方法及装置
WO2016078342A1 (zh) Trill网络分发树计算方法和trill网络节点
CN105591940B (zh) 一种trill网络分发树选择方法和trill网络节点
CN111245716A (zh) 域间路由方法、设备和系统
CN103188096A (zh) 一种trill网络中路径保护的方法及装置

Legal Events

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

Ref document number: 15861170

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 15861170

Country of ref document: EP

Kind code of ref document: A1