公开(公告)号：US10050842B2

公开(公告)日：2018-08-14

申请号：US14339312

申请日：2014-07-23

Applicant: CISCO TECHNOLOGY, INC.

Inventor： Samer Salam ,  Eric A. Voit ,  Ludwig Alexander Clemm ,  Edward Albert Warnicke

IPC: G06F17/30 ,  H04L12/24

Abstract: An example method for facilitating network control and management using semantic reasoners in a network environment is provided and includes generating a fully populated semantics model of the network from network data according to a base network ontology of the network, mapping the fully populated semantics model to a network knowledge base, feeding contents of the network knowledge base to a semantic reasoner, and controlling and managing the network using the semantic reasoner. In specific embodiments, generating the model includes receiving the network data from the network, parsing the network data, loading the parsed network data into in-memory data structures, accessing a manifest specifying binding between a network data definition format and ontology components of the base network ontology, identifying ontology components associated with the network data based on the manifest, and populating the identified ontology components with individuals and properties from the corresponding data structures.

公开(公告)号：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.

公开(公告)号：US20170310598A1

公开(公告)日：2017-10-26

申请号：US15647479

申请日：2017-07-12

Applicant: Cisco Technology, Inc.

Inventor： Sami Boutros ,  Ali Sajassi ,  Samer Salam

IPC: H04L12/813 ,  H04L12/24 ,  H04L12/801 ,  H04L12/823 ,  H04L12/715 ,  H04L12/46 ,  H04L12/18 ,  H04L12/741 ,  H04L12/753 ,  H04L12/721

CPC classification number: H04L47/20 ,  H04L12/1886 ,  H04L12/462 ,  H04L41/12 ,  H04L45/04 ,  H04L45/48 ,  H04L45/54 ,  H04L45/66 ,  H04L47/16 ,  H04L47/32 ,  H04L47/33

Abstract: In one embodiment, when an ingress provider edge (PE) device of a computer network domain receives a frame at the ingress PE device destined to a destination media access control (MAC) address, it can determine whether the frame was received on a root or leaf Ethernet ingress segment, and also whether the destination MAC address is located via a root or leaf Ethernet segment. Accordingly, the ingress PE device may either drop or forward the frame based on the ingress Ethernet segment and destination MAC address Ethernet segment being either a root or a leaf, respectively.

公开(公告)号：US20160292574A1

公开(公告)日：2016-10-06

申请号：US14677750

申请日：2015-04-02

Applicant: CISCO TECHNOLOGY, INC.

Inventor： Samer Salam ,  Eric A. Voit

IPC: G06N5/02 ,  H04L12/911

Abstract: An aspect of the present disclosure aims to reduce problems associated with data acquisition of a rule set. Systems and methods enabling a semantic reasoner to stage acquisition of data objects necessary to bring each of the rules stored in the knowledge base to a conclusion are disclosed. To that end, a dependency chain is constructed, identifying whether and how each rule depends on other rules. Based on the dependency chain, the rules are assigned to difference epochs and reasoning engine is configured to perform machine reasoning over rules of each epoch sequentially. Moreover, when processing rules of each epoch, data objects referenced by the rules assigned to a currently processed epoch are acquired according to a certain order established based on criteria such as e.g. cost of acquisition of data objects. Such an approach provides automatic determination and just-in-time acquisition of data objects required for semantic reasoning.

Abstract translation: 本公开的一个方面旨在减少与规则集的数据获取相关联的问题。 公开了使得语义推理器能够对存储在知识库中的每个规则进行必要的阶段获取的结果的系统和方法。 为此，构建依赖关系链，确定每个规则是否以及如何依赖于其他规则。 基于依赖关系链，将规则分配给差异时期，推理引擎被配置为依次执行每个历元的规则的机器推理。 此外，当处理每个纪元的规则时，根据分配给当前处理的纪元的规则所参考的数据对象是根据诸如例如， 数据对象的获取成本。 这种方法提供语义推理所需的数据对象的自动确定和即时获取。

公开(公告)号：US20160267384A1

公开(公告)日：2016-09-15

申请号：US14657930

申请日：2015-03-13

Applicant: CISCO TECHNOLOGY, INC.

Inventor： Samer Salam ,  Eric A. Voit

IPC: G06N5/02

CPC classification number: G06N5/025 ,  H04L41/0873 ,  H04L41/0893 ,  H04L41/145

Abstract: An example method executed by a semantic reasoner is disclosed. The method includes identifying, from a plurality of rules, one or more pairs of chained rules, and, from the one or more pairs of chained rules, assigning rules chained together to a respective rule-set of P rule-sets. The method also includes assigning individuals, from a plurality of individuals referenced by the plurality of rules, referenced by each rule-set of the P rule-sets to an individual-set associated with the each rule-set and mapping the rules from the each rule-set and the individuals from the individual-set associated with the each rule-set into a respective knowledge base instance associated with the each rule-set. Such a method ensures knowledge completeness and sound inference while allowing parallel semantic reasoning within a given stream window.

Abstract translation: 公开了由语义推理器执行的示例性方法。 该方法包括从多个规则中识别一对或多对链接规则，并且从一个或多个链接规则对中分配链接在一起的规则规则集合的P个规则集。 该方法还包括将由P规则集合的每个规则集引用的多个规则引用的多个个体分配给与每个规则集相关联的个体集合，并将每个规则集 规则集和来自与每个规则集相关联的个体集合的个体到与每个规则集相关联的相应知识库实例中。 这种方法可以确保知识的完整性和声音推理，同时允许给定流窗口内的并行语义推理。

公开(公告)号：US09392526B2

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

申请号：US13903767

申请日：2013-05-28

Applicant: CISCO TECHNOLOGY, INC.

Inventor： Pravin K. Gohite ,  Samer Salam

IPC: H04W28/02 ,  H04W40/34 ,  H04W40/12

CPC classification number: H04W40/34 ,  H04L45/125 ,  H04L45/22 ,  H04W40/12

Abstract: A method provided in one example embodiment includes detecting a first current bandwidth of a first link in a network ring, where the first current bandwidth indicates a signal degradation on the first link. The method also includes determining whether the first current bandwidth has degraded more than a second current bandwidth of a second link in the network ring, where the second current bandwidth indicates a signal degradation on the second link. The method further includes routing one or more network flows away from the first link if the first current bandwidth has degraded more than the second current bandwidth.

Abstract translation: 在一个示例实施例中提供的方法包括检测网络环中的第一链路的第一当前带宽，其中第一当前带宽指示第一链路上的信号劣化。 所述方法还包括确定所述第一当前带宽是否已经比所述网络环中的第二链路的第二当前带宽降级，其中所述第二当前带宽指示所述第二链路上的信号劣化。 该方法还包括如果第一当前带宽已经比第二当前带宽降级，则将一个或多个网络流远离第一链路路由。

公开(公告)号：US20160149760A1

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

申请号：US14549328

申请日：2014-11-20

Applicant: CISCO TECHNOLOGY, INC.

Inventor： Eric A. Voit ,  Edward Albert Warnicke ,  Ludwig Alexander Clemm ,  Samer Salam

IPC: H04L12/24 ,  G06F17/30

CPC classification number: H04L41/0813 ,  H04L41/0873 ,  H04L41/0893

Abstract: An example method for facilitating multi-stage convergence and intent revocation in a network environment is provided and includes sending an intent support request for an intent to a plurality of targets in a network, receiving intent pre-commits from a portion of the plurality of targets and intent pre-aborts from a remaining portion of the plurality of targets, each intent pre-commit indicative of ability to support the intent, and each intent pre-abort indicative of inability to support the intent, determining whether the intent is to be added to the domain in view of potentially impacted intents, and instructing the plurality of targets to commit to the intent if the intent is to be added to the domain.

Abstract translation: 提供了一种用于促进网络环境中的多阶段收敛和意图撤销的示例性方法，包括向网络中的多个目标发送意图的意图支持请求，从多个目标的一部分接收意图预提交 并且意图从多个目标的剩余部分预先中止，每个意图预先表示支持意图的能力，以及每个意图预先中止，指示不能支持意图，确定是否添加意图 考虑到可能受影响的意图的域，并且如果意图被添加到域，则指示多个目标提交意图。

公开(公告)号：US20160026631A1

公开(公告)日：2016-01-28

申请号：US14339312

申请日：2014-07-23

Applicant: CISCO TECHNOLOGY, INC.

Inventor： Samer Salam ,  Eric A. Voit ,  Ludwig Alexander Clemm ,  Edward Albert Warnicke

IPC: G06F17/30

CPC classification number: H04L41/145 ,  H04L41/0803 ,  H04L41/16

Abstract: An example method for facilitating network control and management using semantic reasoners in a network environment is provided and includes generating a fully populated semantics model of the network from network data according to a base network ontology of the network, mapping the fully populated semantics model to a network knowledge base, feeding contents of the network knowledge base to a semantic reasoner, and controlling and managing the network using the semantic reasoner. In specific embodiments, generating the model includes receiving the network data from the network, parsing the network data, loading the parsed network data into in-memory data structures, accessing a manifest specifying binding between a network data definition format and ontology components of the base network ontology, identifying ontology components associated with the network data based on the manifest, and populating the identified ontology components with individuals and properties from the corresponding data structures.

Abstract translation: 提供了一种用于在网络环境中使用语义推理器来促进网络控制和管理的示例性方法，并且包括根据网络的基本网络本体从网络数据生成完全填充的网络语义模型，将完全填充的语义模型映射到 网络知识库，将网络知识库的内容提供给语义推理器，并使用语义推理器来控制和管理网络。 在具体实施例中，生成模型包括从网络接收网络数据，解析网络数据，将解析的网络数据加载到存储器内数据结构中，访问指定网络数据定义格式与基础本体组件之间的绑定的清单 网络本体，基于清单识别与网络数据相关联的本体组件，以及从相应的数据结构用个人和属性填充所识别的本体组件。

公开(公告)号：US09161259B2

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

申请号：US13847904

申请日：2013-03-20

Applicant: CISCO TECHNOLOGY, INC.

Inventor： Shwetha Subray Bhandari ,  Samer Salam ,  Kannan Jayaraman ,  Arvind Saproo

IPC: H04W28/02 ,  H04W24/02

CPC classification number: H04W28/0236 ,  H04L45/02 ,  H04W24/02 ,  H04W40/12

Abstract: A method is provided in one example and includes receiving a current bandwidth characteristic for a link, where the current bandwidth characteristic is determined under fading conditions associated with signal propagation on the link. The method can also include calculating a new cost for the link that is different from a nominal cost associated with a nominal bandwidth of the link without the fading conditions. The method could also include routing at least a portion of a plurality of flows that are to traverse the link away from the link based, at least in part, on the new cost. Another example method includes receiving the current bandwidth characteristic for the link, comparing the current bandwidth characteristic with a preconfigured low watermark corresponding to a class-specific MTR topology associated with a class of traffic traversing the link, and removing the link from the MTR topology based on the current bandwidth characteristic.

Abstract translation: 在一个示例中提供了一种方法，并且包括接收用于链路的当前带宽特性，其中在与链路上的信号传播相关联的衰落条件下确定当前带宽特性。 该方法还可以包括计算不同于没有衰落条件的与链路的标称带宽相关联的名义成本的链路的新成本。 该方法还可以包括至少部分地基于新成本路由将要从链路横越链路的多个流的至少一部分路由。 另一示例性方法包括：接收当前带宽特性，将当前带宽特性与对应于与通过链路的一类流量相关联的类特定MTR拓扑相对应的预配置低水印，以及从基于MTR拓扑的链路中移除链路 关于当前的带宽特性。