公开(公告)号：US20120069740A1

公开(公告)日：2012-03-22

申请号：US12983123

申请日：2010-12-31

Applicant: Wenhu Lu ,  Sriganesh Kini ,  Srikanth Narayanan

Inventor： Wenhu Lu ,  Sriganesh Kini ,  Srikanth Narayanan

IPC: H04L12/26

CPC classification number: H04L45/50 ,  H01L45/04 ,  H04L45/04 ,  H04L45/20 ,  H04L45/30 ,  H04L45/42

Abstract: Computing a constraint-based label switched path (LSP) that spans multiple areas is described. In one embodiment, a router in a first one of the multiple areas computes a path segment that meets a set of one or more constraints to at least one border router of the first area that lies in a path necessary to reach the destination. The router transmits a path computation request message to a path computation element (PCE) in a second one of the areas, which includes a set of one or more attributes for each computed path segment that are used by the PCE to compute one or more path segments towards the destination of the constraint-based LSP. The router receives a path computation reply message from the PCE that specifies a set of one or more computed path segments that meet the set of constraints and that were computed by one or more PCEs downstream from the router. The router stitches at least one of the set of computed path segments that are specified in the path computation reply message with the path segment computed by the router to form at least part of the constraint-based LSP.

Abstract translation: 描述跨越多个区域的基于约束的标签交换路径（LSP）的计算。 在一个实施例中，多个区域中的第一个中的路由器计算满足一组一个或多个约束的路径段，该路径段位于位于到达目的地所需的路径中的第一区域的至少一个边界路由器。 路由器将路径计算请求消息发送到第二区域中的路径计算元件（PCE），该第二区域包括由PCE用于计算一个或多个路径的每个计算的路径段的一个或多个属性集合 到达基于约束的LSP的目的地的段。 路由器从PCE接收路径计算应答消息，该消息指定满足该组约束并由路由器下游的一个或多个PCE计算的一组或多个计算的路径段的集合。 路由器将路径计算应答消息中指定的一组计算路径段中的至少一个与路由器计算的路径段进行拼接，以形成至少部分基于约束的LSP。

公开(公告)号：US20090046579A1

公开(公告)日：2009-02-19

申请号：US11894249

申请日：2007-08-16

Applicant: Wenhu Lu ,  Sriganesh Kini

Inventor： Wenhu Lu ,  Sriganesh Kini

IPC: G01R31/08

CPC classification number: H04L45/28 ,  H04L45/02 ,  H04L45/028

Abstract: A method and apparatus for processing link down events associated with links between adjacent nodes is described. A node receives link down events associated with a link fault protocol for a link between the node and a neighboring node. In response to receiving the link down event, the node removes a data structure associated with the neighboring node from a forwarding table associated with a routing protocol running on the node. The node reserves the data structure for speedy adjacency recovery. In addition, the node places the neighboring node in the initialize state of the routing protocol.

Abstract translation: 描述了一种用于处理与相邻节点之间的链路相关联的链路下发事件的方法和装置。 节点接收与节点和相邻节点之间的链路的链路故障协议相关联的链路断开事件。 响应于接收到链路断开事件，节点从与节点上运行的路由协议相关联的转发表中去除与相邻节点相关联的数据结构。 节点保留数据结构，实现快速的邻接恢复。 另外，节点将邻居节点置于路由协议的初始化状态。

公开(公告)号：US08837292B2

公开(公告)日：2014-09-16

申请号：US12983123

申请日：2010-12-31

Applicant: Wenhu Lu ,  Sriganesh Kini ,  Srikanth Narayanan

Inventor： Wenhu Lu ,  Sriganesh Kini ,  Srikanth Narayanan

IPC: H04W40/00 ,  H04L12/717 ,  H01L45/00 ,  H04L12/723 ,  H04L12/725

CPC classification number: H04L45/50 ,  H01L45/04 ,  H04L45/04 ,  H04L45/20 ,  H04L45/30 ,  H04L45/42

Abstract: Computing a constraint-based label switched path (LSP) that spans multiple areas is described. In one embodiment, a router in a first one of the multiple areas computes a path segment that meets a set of one or more constraints to at least one border router of the first area that lies in a path necessary to reach the destination. The router transmits a path computation request message to a path computation element (PCE) in a second one of the areas, which includes a set of one or more attributes for each computed path segment that are used by the PCE to compute one or more path segments towards the destination of the constraint-based LSP. The router receives a path computation reply message from the PCE that specifies a set of one or more computed path segments that meet the set of constraints and that were computed by one or more PCEs downstream from the router. The router stitches at least one of the set of computed path segments that are specified in the path computation reply message with the path segment computed by the router to form at least part of the constraint-based LSP.

Abstract translation: 描述跨越多个区域的基于约束的标签交换路径（LSP）的计算。 在一个实施例中，多个区域中的第一个中的路由器计算满足一组一个或多个约束的路径段，该路径段位于位于到达目的地所需的路径中的第一区域的至少一个边界路由器。 路由器将路径计算请求消息发送到第二区域中的路径计算元件（PCE），该第二区域包括由PCE用于计算一个或多个路径的每个计算的路径段的一个或多个属性集合 到达基于约束的LSP的目的地的段。 路由器从PCE接收路径计算应答消息，该消息指定满足该组约束并由路由器下游的一个或多个PCE计算的一组或多个计算的路径段的集合。 路由器将路径计算应答消息中指定的一组计算路径段中的至少一个与路由器计算的路径段进行拼接，以形成至少部分基于约束的LSP。

公开(公告)号：US20120213063A1

公开(公告)日：2012-08-23

申请号：US13457192

申请日：2012-04-26

Applicant: Wenhu Lu ,  Sriganesh Kini

Inventor： Wenhu Lu ,  Sriganesh Kini

IPC: H04L12/24

CPC classification number: H04L45/42 ,  H04L45/00 ,  H04L45/02 ,  H04L45/123 ,  H04L45/1283 ,  H04L45/28 ,  H04L45/50

Abstract: A network element implementing Multiprotocol Label Switching to automatically create an optimal deterministic back-up Label Switch Path (LSP) that is maximally disjointed from a primary LSP to provide a reliable back up to the primary LSP. The network element receives a request for a generation of an LSP, determines that the request for the generation of the LSP is for the back-up LSP, locates each link of the primary LSP in a traffic engineering database, modifies each link of the primary LSP to have a link cost significantly greater than an actual link cost to discourage use of each link of the primary LSP in the back-up LSP, executes a Constrained Shortest Path First algorithm to obtain the back-up LSP, wherein the back-up LSP has a maximum disjointedness from the primary LSP due to a modified cost of each link of the primary LSP, and returns the back-up LSP.

Abstract translation: 实现多协议标签交换的网元，自动创建一个最佳的确定性备份标签交换路径（LSP），最大限度地脱离主LSP，以提供可靠的备份到主LSP。 网元接收到生成LSP的请求，确定生成LSP的请求是用于备份LSP，将主LSP的每个链路定位在流量工程数据库中，修改主链路的每个链路 LSP具有明显大于实际链路成本的链路成本，以阻止在备用LSP中使用主LSP的每个链路，执行约束最短路径优先算法以获得备份LSP，其中备份LSP 由于主LSP的每个链路的修改成本，LSP与主LSP的最大不相容性，并返回备用LSP。

公开(公告)号：US20100226382A1

公开(公告)日：2010-09-09

申请号：US12421443

申请日：2009-04-09

Applicant: Sriganesh Kini ,  Wenhu Lu

Inventor： Sriganesh Kini ,  Wenhu Lu

IPC: H04L12/56 ,  H04J3/06

CPC classification number: H04L45/507 ,  H04J3/0635 ,  H04L45/02 ,  H04L45/023 ,  H04L45/16 ,  H04L45/22 ,  H04L45/28 ,  H04L45/50

Abstract: A network element that has a broadcast interface to a broadcast network becoming operational determines whether at least one alternate path exists to the broadcast network. The broadcast interface is to carry traffic on a label switched path. If an alternate path exists, the broadcast interface will not be advertised to the broadcast network until label distribution protocol (LDP) is operational with all neighbors on the broadcast interface.

Abstract translation: 具有到广播网络的广播接口变得可操作的网络元件确定是否存在至少一个替代路径到广播网络。 广播接口是在标签交换路径上携带流量。 如果存在备用路径，广播接口将不会广播到广播网络，直到标签分发协议（LDP）与广播接口上的所有邻居一起运行。

公开(公告)号：US20130343175A1

公开(公告)日：2013-12-26

申请号：US13531252

申请日：2012-06-22

Applicant: Sriganesh Kini ,  Hector Avalos

Inventor： Sriganesh Kini ,  Hector Avalos

IPC: H04L12/26 ,  H04L12/56

CPC classification number: H04L41/0668 ,  H04L12/4641 ,  H04L45/04 ,  H04L45/50 ,  H04L45/74 ,  H04L61/2061

Abstract: IP addresses are efficiently assigned and advertised across the boundary of two network domains. The two network domains include an access network that implements MPLS-TP and a core network that implements IP, MPLS, or a combination of both. A primary BN at the domain boundary receives an assignment of an IP prefix for a VPN that connects a set of CEs to one or more SNs. The IP prefix represents a pool of IP addresses. The primary BN assigns only one IP address to both itself and a standby BN for the VPN to minimize the use of assigned IP addresses. The primary BN assigns the other IP addresses to the CEs in the VPN. The primary BN then advertises the IP prefix into the core network to enable routing of network data traffic across the network domain boundary.

Abstract translation: IP地址被有效地分配并通过两个网络域的边界通告。 两个网络域包括实现MPLS-TP的接入网络和实现IP，MPLS或两者的组合的核心网络。 域边界上的主要BN接收将一组CE连接到一个或多个SN的VPN的IP前缀的分配。 IP前缀表示IP地址池。 主要BN为本身分配一个IP地址，为该VPN分配一个备用BN，以最小化分配的IP地址的使用。 主要BN将其他IP地址分配给VPN中的CE。 然后，主要BN将IP前缀公布到核心网络中，以实现网络边界上的网络数据流量路由。

公开(公告)号：US20120218884A1

公开(公告)日：2012-08-30

申请号：US13113007

申请日：2011-05-20

Applicant: Sriganesh Kini ,  Srikanth Narayanan

Inventor： Sriganesh Kini ,  Srikanth Narayanan

IPC: H04L12/24 ,  H04L12/56

CPC classification number: H04L45/507 ,  H04L45/22 ,  H04L45/28

Abstract: MPLS (Multiprotocol Label Switching) fast re-routing using LDP (Label Distribution Protocol) is described. A first network element in a MPLS network receives a first label advertised from a second network element in the MPLS network. The first network element computes a shortest path tree (SPT) to reach a destination network element under a potential failure condition. The second network element is a nexthop of the first network element in the computed SPT and is not upstream from the potential failure condition. The first network element advertises a second label to one or more third network elements for a backup LDP LSP (Label Switched Path) that will serve as a backup when the potential failure condition is realized. The third network element(s) are upstream neighbors on the computed SPT with respect to the first network element. The first network element installs a swap action from the second label to the first label.

Abstract translation: 描述了使用LDP（标签分发协议）的MPLS（多协议标签交换）快速重路由。 MPLS网络中的第一网元接收从MPLS网络中的第二网元发布的第一标签。 第一个网元计算一个最短路径树（SPT），以在潜在的故障条件下到达目标网元。 第二个网元是计算出的SPT中第一个网元的下一跳，不在潜在故障条件的上游。 第一个网络单元向一个或多个第三个网元发布第二个标签，用于备份LDP LSP（标签交换路径），当实现潜在的故障条件时，备用LDP LSP（标签交换路径）将用作备份。 第三网络元件是相对于第一网络元件的计算的SPT上的上游邻居。 第一个网络元素将第二个标签的交换动作安装到第一个标签。

公开(公告)号：US20120076145A1

公开(公告)日：2012-03-29

申请号：US12982734

申请日：2010-12-30

Applicant: Sriganesh Kini

Inventor： Sriganesh Kini

IPC: H04L12/56

CPC classification number: H04L12/4641 ,  H04L43/10 ,  H04L45/304 ,  H04L45/68

Abstract: A method implemented by a first provider equipment (PE) device to enable operations, administration and management (OAM) functionality over a pseudo-wire (PW) between the first PE device and a second PE device, wherein the PW traverses a packet switched network and carries control channel messages and a flow of data packets, and where the packet switched network includes nodes that use information outside a pseudo-wire label stack of the data packets for determining multi-path routing, the method including receiving a control channel message at the first PE to be forwarded over the pseudo-wire to the second PE, and prefixing the control channel message with a pseudo-flow header to ensure that the control channel message is forwarded over a same route by the nodes of the packet switched network as the data packets of the flow, thereby enabling OAM functionality to be accurately performed for the pseudo-wire.

Abstract translation: 一种由第一提供商设备（PE）设备实现的方法，用于通过第一PE设备和第二PE设备之间的伪线（PW）实现操作，管理和管理（OAM）功能，其中PW穿过分组交换网络 并携带控制信道消息和数据分组流，其中分组交换网络包括使用用于确定多路径路由的数据分组的伪线标签堆栈外的信息的节点，该方法包括：接收控制信道消息 将第一个PE通过伪线转发到第二个PE，并在控制信道消息前面加上一个伪流头，以确保控制信道消息由分组交换网络的节点通过相同的路由转发为 流的数据包，从而使得能够准确地执行伪线的OAM功能。

公开(公告)号：US20110249677A1

公开(公告)日：2011-10-13

申请号：US13164760

申请日：2011-06-20

Applicant: Sriganesh Kini ,  Attila Zoltan Takacs

Inventor： Sriganesh Kini ,  Attila Zoltan Takacs

IPC: H04L12/56

CPC classification number: H04L12/462 ,  H04L12/4641 ,  H04L45/586 ,  H04L49/45 ,  H04L49/602 ,  H04L49/604

Abstract: A method and apparatus that operates two bridging protocols in a hybrid bridging node is described. The operation of the two bridging protocols in the hybrid node allows for an incremental transition of a provider bridging network from operating a legacy bridging protocol that shares MAC addresses to a bridging network that operates VPLS and/or PBB bridging protocols. The hybrid bridging node selectively broadcasts unicast packets with unknown MAC addresses from the nodes operating VPLS and/or PBB to nodes operating a legacy bridging protocol.

Abstract translation: 描述了在混合桥接节点中操作两个桥接协议的方法和装置。 混合节点中的两个桥接协议的操作允许供应商桥接网络从运行共享MAC地址的传统桥接协议到运行VPLS和/或PBB桥接协议的桥接网络的增量转换。 混合桥接节点从运行VPLS和/或PBB的节点选择性地广播具有未知MAC地址的单播分组到运行传统桥接协议的节点。

公开(公告)号：US07965711B2

公开(公告)日：2011-06-21

申请号：US12463365

申请日：2009-05-08

Applicant: Sriganesh Kini ,  Attila Takács

Inventor： Sriganesh Kini ,  Attila Takács

IPC: H04L12/28 ,  H04L12/56

CPC classification number: H04L12/462 ,  H04L12/4641 ,  H04L45/586 ,  H04L49/45 ,  H04L49/602 ,  H04L49/604

Abstract: A method and apparatus that operates two bridging protocols in a hybrid bridging node is described. The operation of the two bridging protocols in the hybrid node allows for an incremental transition of a provider bridging network from operating a legacy bridging protocol that shares MAC addresses to a bridging network that operates VPLS and/or PBB bridging protocols. The hybrid bridging node selectively broadcasts unicast packets with unknown MAC addresses from the nodes operating VPLS and/or PBB to nodes operating a legacy bridging protocol.

Abstract translation: 描述了在混合桥接节点中操作两个桥接协议的方法和装置。 混合节点中的两个桥接协议的操作允许供应商桥接网络从运行共享MAC地址的传统桥接协议到运行VPLS和/或PBB桥接协议的桥接网络的增量转换。 混合桥接节点从运行VPLS和/或PBB的节点选择性地广播具有未知MAC地址的单播分组到运行传统桥接协议的节点。