Disjoint path computation algorithm
    1.
    发明授权
    Disjoint path computation algorithm 有权
    不相交路径计算算法

    公开(公告)号:US08681607B2

    公开(公告)日:2014-03-25

    申请号:US13457192

    申请日:2012-04-26

    IPC分类号: G01R31/08

    摘要: 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.

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

    Disjoint path computation algorithm
    2.
    发明授权
    Disjoint path computation algorithm 有权
    不相交路径计算算法

    公开(公告)号:US08233387B2

    公开(公告)日:2012-07-31

    申请号:US12614323

    申请日:2009-11-06

    IPC分类号: G01R31/08

    摘要: 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.

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

    Fast Flooding Based Fast Convergence Architecture
    3.
    发明申请
    Fast Flooding Based Fast Convergence Architecture 有权
    快速融合快速收敛架构

    公开(公告)号:US20120075986A1

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

    申请号:US12983126

    申请日:2010-12-31

    IPC分类号: H04L12/26

    摘要: Fast flooding based fast convergence to recover from a network failure. A router detects a network failure, and responsive to that failure, transmits a fast failure notification message to a set of one or more routers. The fast failure notification message includes information that identifies the network failure and also indicates that the fast failure notification message is to be flooded by the set of routers independently of convergence. The router updates a routing table to reflect the network failure. The transmission of the fast failure notification message is performed prior to completion of the routing table update to reflect the network failure.

    摘要翻译: 快速洪泛快速收敛,从网络故障中恢复。 路由器检测到网络故障,并响应于该故障,将快速故障通知消息发送到一个或多个路由器的集合。 快速故障通知消息包括识别网络故障的信息,并且还指示快速故障通知消息将被该组路由器独占于收敛而泛洪。 路由器更新路由表以反映网络故障。 在完成路由表更新之前执行快速故障通知消息的传输以反映网络故障。

    LDP IGP SYNCHRONIZATION FOR BROADCAST NETWORKS
    4.
    发明申请
    LDP IGP SYNCHRONIZATION FOR BROADCAST NETWORKS 有权
    用于广播网络的LDP IGP同步

    公开(公告)号:US20110044348A1

    公开(公告)日:2011-02-24

    申请号:US12546433

    申请日:2009-08-24

    IPC分类号: H04L12/56

    摘要: A method and apparatus for LDP-IGP synchronization for broadcast networks. In one embodiment of the invention, responsive to a network element bringing up an adjacency with a Designated Router of the broadcast network on a broadcast interface, that network element advertises in its Link State Advertisement (LSA) a peer-to-peer (P2P) adjacency to each member of the broadcast network that has bidirectional IGP communication with the network element instead of advertising a pseudo-node adjacency to the pseudo-node of the broadcast network. Each P2P adjacency includes a high cost to discourage use of those links for transit traffic. After LDP becomes operational with all neighbors on the broadcast interface, the network element advertises the pseudo-node adjacency instead of the P2P adjacencies. Accordingly, transit traffic is avoided through that network element until LDP is operational with all neighbors on the broadcast interface.

    摘要翻译: 用于广播网络的LDP-IGP同步的方法和装置。 在本发明的一个实施例中,响应于在广播接口上与广播网络的指定路由器相邻的网络元件,该网络单元在其链路状态通告(LSA)中通告对等(P2P) 与广播网络的与网络单元进行双向IGP通信的每个成员相邻,而不是向广播网络的伪节点广告伪节点邻接。 每个P2P邻接包括高昂的成本,以阻止使用这些链路进行过境业务。 LDP与广播接口上的所有邻居操作后,网元发布伪节点邻接而不是P2P邻接。 因此,通过该网络元件避免转接流量,直到LDP与广播接口上的所有邻居一起运行。

    LDP IGP synchronization for broadcast networks
    5.
    发明授权
    LDP IGP synchronization for broadcast networks 有权
    LDP IGP同步广播网络

    公开(公告)号:US08681823B2

    公开(公告)日:2014-03-25

    申请号:US13356517

    申请日:2012-01-23

    IPC分类号: H04J3/06 H04L12/56 H04L12/28

    摘要: 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.

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

    Fast flooding based fast convergence architecture
    6.
    发明授权
    Fast flooding based fast convergence architecture 有权
    快速洪泛快速融合架构

    公开(公告)号:US08630162B2

    公开(公告)日:2014-01-14

    申请号:US12983126

    申请日:2010-12-31

    IPC分类号: G01R31/08

    摘要: Fast flooding based fast convergence to recover from a network failure. A router detects a network failure, and responsive to that failure, transmits a fast failure notification message to a set of one or more routers. The fast failure notification message includes information that identifies the network failure and also indicates that the fast failure notification message is to be flooded by the set of routers independently of convergence. The router updates a routing table to reflect the network failure. The transmission of the fast failure notification message is performed prior to completion of the routing table update to reflect the network failure.

    摘要翻译: 快速洪泛快速收敛,从网络故障中恢复。 路由器检测到网络故障,并响应于该故障,将快速故障通知消息发送到一个或多个路由器的集合。 快速故障通知消息包括识别网络故障的信息,并且还指示快速故障通知消息将被该组路由器独占于收敛而泛洪。 路由器更新路由表以反映网络故障。 在完成路由表更新之前执行快速故障通知消息的传输以反映网络故障。

    LDP IGP synchronization for broadcast networks
    7.
    发明授权
    LDP IGP synchronization for broadcast networks 有权
    LDP IGP同步广播网络

    公开(公告)号:US08477795B2

    公开(公告)日:2013-07-02

    申请号:US12546433

    申请日:2009-08-24

    IPC分类号: H04L12/56 H04L29/02

    摘要: A method and apparatus for LDP-IGP synchronization for broadcast networks. In one embodiment of the invention, responsive to a network element bringing up an adjacency with a Designated Router of the broadcast network on a broadcast interface, that network element advertises in its Link State Advertisement (LSA) a peer-to-peer (P2P) adjacency to each member of the broadcast network that has bidirectional IGP communication with the network element instead of advertising a pseudo-node adjacency to the pseudo-node of the broadcast network. Each P2P adjacency includes a high cost to discourage use of those links for transit traffic. After LDP becomes operational with all neighbors on the broadcast interface, the network element advertises the pseudo-node adjacency instead of the P2P adjacencies. Accordingly, transit traffic is avoided through that network element until LDP is operational with all neighbors on the broadcast interface.

    摘要翻译: 用于广播网络的LDP-IGP同步的方法和装置。 在本发明的一个实施例中,响应于在广播接口上与广播网络的指定路由器相邻的网络元件,该网元在其链路状态通告(LSA)中通告对等(P2P) 与广播网络的与网络单元进行双向IGP通信的每个成员相邻,而不是向广播网络的伪节点广告伪节点邻接。 每个P2P邻接包括高昂的成本,以阻止使用这些链路进行过境业务。 LDP与广播接口上的所有邻居操作后,网元发布伪节点邻接而不是P2P邻接。 因此,通过该网络元件避免转接流量,直到LDP与广播接口上的所有邻居一起运行。

    LDP IGP synchronization for broadcast networks
    8.
    发明授权
    LDP IGP synchronization for broadcast networks 有权
    LDP IGP同步广播网络

    公开(公告)号:US08102883B2

    公开(公告)日:2012-01-24

    申请号:US12421443

    申请日:2009-04-09

    IPC分类号: H04J3/06

    摘要: 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.

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

    Lesser disruptive open shortest path first handling of bidirectional forwarding detection state changes
    9.
    发明授权
    Lesser disruptive open shortest path first handling of bidirectional forwarding detection state changes 有权
    较小的破坏性开放最短路径首先处理双向转发检测状态变化

    公开(公告)号:US07961601B2

    公开(公告)日:2011-06-14

    申请号:US11894249

    申请日:2007-08-16

    IPC分类号: H04L12/26

    摘要: 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.

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

    Disjoint Path Computation Algorithm
    10.
    发明申请
    Disjoint Path Computation Algorithm 有权
    不相交路径计算算法

    公开(公告)号:US20110110226A1

    公开(公告)日:2011-05-12

    申请号:US12614323

    申请日:2009-11-06

    IPC分类号: G06F11/00

    摘要: 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.

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