公开(公告)号：US20160337169A1

公开(公告)日：2016-11-17

申请号：US14711035

申请日：2015-05-13

Applicant: Cisco Technology, Inc.

Inventor： Gaurav Chhabra ,  Ather Sayeed Kanak ,  Shashi Kumar Bansal ,  Michael H. Behringer

IPC: H04L12/24 ,  H04L12/707

CPC classification number: H04L41/0672 ,  H04L41/082 ,  H04L45/28

Abstract: In one embodiment, a device in a network receives update recovery data from a neighbor of the device in the network. The device monitors the neighbor during installation of a software update by the neighbor. The device detects an installation failure of the software update by the neighbor. The device causes recovery of the neighbor using the update recovery data, in response to detecting the installation failure of the software update by the neighbor.

Abstract translation: 在一个实施例中，网络中的设备从网络中的设备的邻居接收更新恢复数据。 设备在邻居安装软件更新期间监控邻居。 设备检测到邻居软件更新的安装失败。 响应于检测到邻居的软件更新的安装故障，设备使用更新恢复数据使得邻居恢复。

公开(公告)号：US10142167B2

公开(公告)日：2018-11-27

申请号：US14711035

申请日：2015-05-13

Applicant: Cisco Technology, Inc.

Inventor： Gaurav Chhabra ,  Ather Sayeed Kanak ,  Shashi Kumar Bansal ,  Michael H. Behringer

IPC: H04L12/24 ,  H04L12/707

Abstract: In one embodiment, a device in a network receives update recovery data from a neighbor of the device in the network. The device monitors the neighbor during installation of a software update by the neighbor. The device detects an installation failure of the software update by the neighbor. The device causes recovery of the neighbor using the update recovery data, in response to detecting the installation failure of the software update by the neighbor.

公开(公告)号：US09910642B2

公开(公告)日：2018-03-06

申请号：US15165369

申请日：2016-05-26

Applicant: Cisco Technology, Inc.

Inventor： Samer Salam ,  Shashi Kumar Bansal ,  Swaroop Shastri

IPC: G06F9/44

CPC classification number: G06F8/33 ,  G06F8/311

Abstract: In one embodiment, a computing system identifies one or more terminal nodes in a digraph, and then back-walks primitives up the digraph from each terminal node to a corresponding parent terminal node or a root of the digraph, whichever is first. The system then identifies chains of back-walked primitives for each of the one or more terminal nodes (e.g., where each chain consists of a respective terminal node and any primitives either a) up to but not including a corresponding parent terminal node or else b) up to and including the root of the digraph when the back-walking reaches the root). Based on this, the system can then merge each set of any two or more chains of the identified chains that intersect on a decision operation into a corresponding new single chain, and maps each of the chains to a respective rule.

公开(公告)号：US20170344346A1

公开(公告)日：2017-11-30

申请号：US15165369

申请日：2016-05-26

Applicant: Cisco Technology, Inc.

Inventor： Samer Salam ,  Shashi Kumar Bansal ,  Swaroop Shastri

IPC: G06F9/44

CPC classification number: G06F8/33 ,  G06F8/311

Abstract: In one embodiment, a computing system identifies one or more terminal nodes in a digraph, and then back-walks primitives up the digraph from each terminal node to a corresponding parent terminal node or a root of the digraph, whichever is first. The system then identifies chains of back-walked primitives for each of the one or more terminal nodes (e.g., where each chain consists of a respective terminal node and any primitives either a) up to but not including a corresponding parent terminal node or else b) up to and including the root of the digraph when the back-walking reaches the root). Based on this, the system can then merge each set of any two or more chains of the identified chains that intersect on a decision operation into a corresponding new single chain, and maps each of the chains to a respective rule.