公开(公告)号：WO2016042505A3

公开(公告)日：2016-05-12

申请号：PCT/IB2015057139

申请日：2015-09-16

Applicant: ERICSSON TELEFON AB L M

Inventor： PRZYGIENDA ANTONI ,  TANTSURA EVGENY

IPC: H04L12/741 ,  H04L12/761

CPC classification number: H04L45/16 ,  H04L45/24 ,  H04L45/60 ,  H04L45/74 ,  H04L45/741

Abstract: Exemplary methods include a first network device participating in an election process to determine a designated bit forwarding router (D-BFR). The methods include in response to determining the first network device is elected to be the D-BFR, performing D-BFR operations comprising determining an elected bitmask (BM) length of a BM based on maximum local BM lengths advertised by other BFRs in the network, wherein each bit of the BM will correspond to a bit forwarding egress router (BFER), and advertising the determined elected BM length to other BFRs. The methods may further include one or more of determining an elected tree type based on supported tree types advertised by other BFRs in the network, assigning one or more BM positions (BMPs) to one or more BFERs, and advertising the elected determined tree type and/or the assigned one or more BMPs.

Abstract translation: 示例性方法包括参与选举过程以确定指定比特转发路由器（D-BFR）的第一网络设备。 所述方法包括：响应于确定第一网络设备被选择为D-BFR，执行D-BFR操作，包括基于由网络中的其他BFR所通告的最大本地BM长度来确定BM的选择的位掩码（BM）长度 ，其中，BM的每个比特对应于比特转发出口路由器（BFER），并且将所确定的选定BM长度通告给其他BFR。 所述方法可以进一步包括以下一个或多个：基于由网络中的其他BFR所通告的支持的树类型来确定选择的树类型，将一个或多个BM位置（BMP）分配给一个或多个BFER，以及将选择的所确定的树类型和 /或分配的一个或多个BMP。

公开(公告)号：WO2015140724A3

公开(公告)日：2015-12-17

申请号：PCT/IB2015051967

申请日：2015-03-18

Applicant: ERICSSON TELEFON AB L M

Inventor： CHUNDURI UMA S ,  PATIL VASANT S ,  LU WENHU ,  TANTSURA EVGENY

IPC: H04L12/705 ,  H04L12/703 ,  H04L12/707 ,  H04L12/721 ,  H04L12/751

CPC classification number: H04L45/127 ,  H04L45/02 ,  H04L45/12 ,  H04L45/18 ,  H04L45/22 ,  H04L45/24 ,  H04L45/28 ,  H04L47/17

Abstract: A method is executed by a network device to calculate loop free alternative (LFA) for each node in an intermediate system - intermediate system (IS-IS) area or IS-IS domain where the network device is connected with other nodes via multiple parallel links. The method includes a shortest path first (SPF) computation of the primary paths for the network device that tracks directly connected links from each node in the IS-IS area or IS-IS domain to the network device which is a source node for the SPF. These tracked links can then be utilized in subsequent LFA computations to avoid unnecessary calculations.

Abstract translation: 网络设备执行一种方法，为中间系统 - 中间系统（IS-IS）区域或IS-IS域中的每个节点计算无循环替代（LFA），其中网络设备通过多个并行链路与其他节点连接 。 该方法包括：对于作为SPF的源节点的网络设备的网络设备的主路径的最短路径优先（SPF）计算，跟踪从IS-IS区域或IS-IS域中的每个节点直接连接的链路 。 这些跟踪链接随后可用于后续的LFA计算，以避免不必要的计算。

公开(公告)号：WO2014118718A3

公开(公告)日：2014-11-06

申请号：PCT/IB2014058644

申请日：2014-01-29

Applicant: ERICSSON TELEFON AB L M

Inventor： ALLAN DAVID IAN ,  SALTSIDIS PANAGIOTIS ,  FARKAS JÁNOS ,  CSÁSZÁR ANDRÁS ,  TANTSURA EVGENY

IPC: H04L12/721 ,  H04L12/703 ,  H04L12/705 ,  H04L12/753

CPC classification number: H04L45/12 ,  H04L45/02 ,  H04L45/16 ,  H04L45/18 ,  H04L45/28 ,  H04L45/48 ,  H04L45/66 ,  H04L45/745

Abstract: 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.

Abstract translation: 公开了支持最短路径桥接（SPB）协议的实现的网络中的节点处转发以太网帧的方法。 该方法从节点（称为计算节点）的最短路径计算开始。 最短路径计算至少选择到网络中每个目的地节点的最短路径，其中记录到达每个节点的最短路径上的相邻节点。 然后，它为目的地节点计算下游无环交替（LFA）节点，其中LFA节点在计算节点的下游，但不在从计算节点到目标节点的选定的最短路径上。 然后，当检测到计算出的最短路径上的相邻节点的连接异常时，节点通过LFA节点转发具有与目的地节点对应的目的地媒体访问控制（MAC）地址的以太网帧。