METHOD AND SYSTEM TO CALCULATE MULTIPLE SHORTEST PATH FIRST TREES
    1.
    发明申请
    METHOD AND SYSTEM TO CALCULATE MULTIPLE SHORTEST PATH FIRST TREES 有权
    计算多个最短路径第一条的方法和系统

    公开(公告)号:US20150092609A1

    公开(公告)日:2015-04-02

    申请号:US14042347

    申请日:2013-09-30

    CPC classification number: H04L41/12 H04L45/122 H04L45/16 H04L45/48

    Abstract: An example method is provided in accordance with one embodiment and includes identifying distances for a sub-tree of a leaf node of a plurality of leaf nodes in a network. The method can also include applying the distances for the sub-tree of the leaf node to a plurality of root nodes connected to the leaf node. Additionally, the method can include establishing a plurality of shortest path distances for the plurality of root nodes using the distances for the sub-tree.

    Abstract translation: 提供了根据一个实施例的示例性方法,并且包括识别网络中多个叶节点的叶节点的子树的距离。 该方法还可以包括将叶节点的子树的距离应用于连接到叶节点的多个根节点。 另外,该方法可以包括使用子树的距离为多个根节点建立多个最短路径距离。

    Method and system to calculate multiple shortest path first trees
    2.
    发明授权
    Method and system to calculate multiple shortest path first trees 有权
    计算多个最短路径第一树的方法和系统

    公开(公告)号:US09264312B2

    公开(公告)日:2016-02-16

    申请号:US14042347

    申请日:2013-09-30

    CPC classification number: H04L41/12 H04L45/122 H04L45/16 H04L45/48

    Abstract: An example method is provided in accordance with one embodiment and includes identifying distances for a sub-tree of a leaf node of a plurality of leaf nodes in a network. The method can also include applying the distances for the sub-tree of the leaf node to a plurality of root nodes connected to the leaf node. Additionally, the method can include establishing a plurality of shortest path distances for the plurality of root nodes using the distances for the sub-tree.

    Abstract translation: 提供了根据一个实施例的示例性方法,并且包括识别网络中多个叶节点的叶节点的子树的距离。 该方法还可以包括将叶节点的子树的距离应用于连接到叶节点的多个根节点。 另外,该方法可以包括使用子树的距离为多个根节点建立多个最短路径距离。

    Technique to minimize traffic loss on a router reload/restart
    3.
    发明授权
    Technique to minimize traffic loss on a router reload/restart 有权
    减少路由器重新载入/重启的流量丢失的技术

    公开(公告)号:US09338078B2

    公开(公告)日:2016-05-10

    申请号:US13800419

    申请日:2013-03-13

    CPC classification number: H04L45/02 H04L45/28 H04L45/58

    Abstract: A link state information correction scheme is implemented by the present disclosure. In one embodiment, the correction scheme is implemented by a reload logic module that cooperates with link state protocol logic configured on a reload routing element (or routing element that has reloaded or hard restarted). The reload logic module is configured to receive a database descriptor message at a reload routing element, where the database descriptor message is received from a neighbor routing element during an adjacency formation. The reload logic module is also configured to determine whether the database descriptor message identifies a stale version of a link state advertisement (LSA), where the LSA is self-originated by the reload routing element. The reload logic module is also configured to generate a new version of the LSA during the adjacency formation.

    Abstract translation: 通过本公开实现链路状态信息校正方案。 在一个实施例中,校正方案由重载逻辑模块实现,该重载逻辑模块与在重载路由元件(或重新加载或重新启动的路由元件)上配置的链路状态协议逻辑协同工作。 重载逻辑模块被配置为在重新加载路由元件处接收数据库描述符消息,其中在邻接形成期间从邻居路由元件接收数据库描述符消息。 重新加载逻辑模块还被配置为确定数据库描述符消息是否识别链路状态通告(LSA)的陈旧版本,其中LSA由重新加载路由元件自发。 重载逻辑模块还被配置为在邻接形成期间生成LSA的新版本。

    Technique to Minimize Traffic Loss on a Router Reload/Restart
    4.
    发明申请
    Technique to Minimize Traffic Loss on a Router Reload/Restart 有权
    降低路由器流量丢失的技术重新加载/重启

    公开(公告)号:US20140269407A1

    公开(公告)日:2014-09-18

    申请号:US13800419

    申请日:2013-03-13

    CPC classification number: H04L45/02 H04L45/28 H04L45/58

    Abstract: A link state information correction scheme is implemented by the present disclosure. In one embodiment, the correction scheme is implemented by a reload logic module that cooperates with link state protocol logic configured on a reload routing element (or routing element that has reloaded or hard restarted). The reload logic module is configured to receive a database descriptor message at a reload routing element, where the database descriptor message is received from a neighbor routing element during an adjacency formation. The reload logic module is also configured to determine whether the database descriptor message identifies a stale version of a link state advertisement (LSA), where the LSA is self-originated by the reload routing element. The reload logic module is also configured to generate a new version of the LSA during the adjacency formation.

    Abstract translation: 通过本公开实现链路状态信息校正方案。 在一个实施例中,校正方案由重载逻辑模块实现,该重载逻辑模块与在重载路由元件(或重新加载或重新启动的路由元件)上配置的链路状态协议逻辑协同工作。 重载逻辑模块被配置为在重新加载路由元件处接收数据库描述符消息,其中在邻接形成期间从邻居路由元件接收数据库描述符消息。 重新加载逻辑模块还被配置为确定数据库描述符消息是否识别链路状态通告(LSA)的陈旧版本,其中LSA由重新加载路由元件自发。 重载逻辑模块还被配置为在邻接形成期间生成LSA的新版本。

Patent Agency Ranking