发明名称 Method and system of shortest path bridging (SPB) enhanced resilience with loop mitigation
摘要 A method forward Ethernet frames at a node in a network supporting an implementation of shortest path bridging (SPB) protocol is disclosed. The method starts with a shortest path computation for the node (referred to as the computing node). The shortest path computation selects at least a shortest path to each destination node in the network, where a neighboring node on the shortest path to reach each node is recorded. Then it computes a downstream loop-free alternate (LFA) node for a destination node, where the LFA node is downstream of the computing node but not on the selected shortest path to the destination node from the computing node. Then when connectivity to the neighboring node on the computed shortest path is detected to be abnormal, the node forwards an Ethernet frame with a destination media access control (MAC) address corresponding to the destination node through the LFA node.
申请公布号 US9461909(B2) 申请公布日期 2016.10.04
申请号 US201514873525 申请日期 2015.10.02
申请人 Telefonaktiebolaget LM Ericsson (publ) 发明人 Allan David Ian;Saltsidis Panagiotis;Farkas János;Császár András;Tantsura Evgeny
分类号 H04L12/721;H04L12/761;H04L12/705;H04L12/703;H04L12/753;H04L12/751;H04L12/741 主分类号 H04L12/721
代理机构 NDWE LLP 代理人 NDWE LLP
主权项 1. A method to forward Ethernet frames at a node in a network supporting an implementation of shortest path bridging (SPB) protocol, wherein the node contains a filtering database (FDB) to guide Ethernet frame forwarding, wherein the FDB update is coordinated through a digest exchange between the node and one or more nodes of a plurality of neighboring nodes, the method comprising: starting a shortest path computation for the node, the shortest path computation selecting a shortest path from the node to a destination node in the network, wherein a neighboring node of the plurality of neighboring nodes that is on the shortest path is recorded; computing a loop-free alternate (LFA) node for an alternate path to reach the destination node, wherein the LFA node is one of the plurality of neighboring nodes and is closer to the destination node than the node, but not on the shortest path, and the node has an existing database digest agreement with the LFA node, wherein the LFA node has a set of permissible ports that link to an upstream node or nodes to receive unicast Ethernet frames, such that the set of permissible ports indicates that the Ethernet frame forwarding from the upstream node or nodes to the destination node through the LFA node is known not to cause a forwarding loop; and forwarding, from the node, a unicast Ethernet frame with a destination media access control (MAC) address corresponding to the destination node through the LFA node without computing another shortest path computation that removes the neighboring node, when connectivity to the neighboring node on the shortest path to the destination node is detected to be in an abnormal state for use in forwarding the unicast Ethernet frame, wherein the LFA node relaxes reverse path forwarding check (RPFC) and accepts the unicast Ethernet frame from the node, when the node is linked to the LTA node via one of the set of permissible ports.
地址 Stockholm SE
您可能感兴趣的专利