EP3067836A2 - Parallele datenverarbeitung durch mehrere semantische argumentationsmaschinen - Google Patents

Parallele datenverarbeitung durch mehrere semantische argumentationsmaschinen Download PDF

Info

Publication number
EP3067836A2
EP3067836A2 EP16154563.7A EP16154563A EP3067836A2 EP 3067836 A2 EP3067836 A2 EP 3067836A2 EP 16154563 A EP16154563 A EP 16154563A EP 3067836 A2 EP3067836 A2 EP 3067836A2
Authority
EP
European Patent Office
Prior art keywords
rule
rules
instance
reasoning
pair
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
EP16154563.7A
Other languages
English (en)
French (fr)
Other versions
EP3067836A3 (de
EP3067836B1 (de
Inventor
Samer Salam
Eric A. Voit
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Cisco Technology Inc
Original Assignee
Cisco Technology Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Cisco Technology Inc filed Critical Cisco Technology Inc
Publication of EP3067836A2 publication Critical patent/EP3067836A2/de
Publication of EP3067836A3 publication Critical patent/EP3067836A3/de
Application granted granted Critical
Publication of EP3067836B1 publication Critical patent/EP3067836B1/de
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computing arrangements using knowledge-based models
    • G06N5/02—Knowledge representation; Symbolic representation
    • G06N5/022—Knowledge engineering; Knowledge acquisition
    • G06N5/025—Extracting rules from data
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00—Handling natural language data
    • G06F40/30—Semantic analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computing arrangements using knowledge-based models
    • G06N5/04—Inference or reasoning models
    • G06N5/043—Distributed expert systems; Blackboards
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0866—Checking the configuration
    • H04L41/0873—Checking configuration conflicts between network elements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0893—Assignment of logical groups to network elements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0894—Policy-based network configuration management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/12—Discovery or management of network topologies
    • H04L41/122—Discovery or management of network topologies of virtualised topologies, e.g. software-defined networks [SDN] or network function virtualisation [NFV]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14—Network analysis or design
    • H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/40—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks using virtualisation of network functions or resources, e.g. SDN or NFV entities
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computing arrangements using knowledge-based models
    • G06N5/04—Inference or reasoning models
    • G06N5/046—Forward inferencing; Production systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0895—Configuration of virtualised networks or elements, e.g. virtualised network function or OpenFlow elements

Definitions

  • This disclosure relates in general to the field of communications and, more particularly, to data control and management using semantic reasoners.
  • Data centers are increasingly used by enterprises for effective collaboration and interaction and to store data and resources.
  • a typical data center network contains myriad network elements, including hosts, load balancers, routers, switches, etc.
  • the network connecting the network elements provides secure user access to data center services and an infrastructure for deployment, interconnection, and aggregation of shared resources as required, including applications, hosts, appliances, and storage. Improving operational efficiency and optimizing utilization of resources in such data centers are some of the challenges facing data center managers.
  • Data center managers want a resilient infrastructure that consistently supports diverse applications and services and protects the applications and services against disruptions.
  • a properly planned and operating data center network provides application and data integrity and optimizes application availability and performance.
  • An example computer-implemented method executed by a semantic reasoner e.g. a semantic reasoner in a network.
  • the method includes identifying, from a plurality of rules, one or more pairs of chained rules, and, from the one or more pairs of the identified chained rules, assigning all rules chained together to a respective rule-set of P rule-sets.
  • the method further includes identifying a plurality of individuals referenced by the plurality of rules, and, from a plurality of individuals referenced by the plurality of rules, assigning all individuals referenced by each respective rule-set of the P rule-sets to an individual-set (referred to herein as a "window pane") associated with the each respective rule-set (i.e., there is a one-to-one correspondence between rule-sets and individual-sets where each rule-set is associated with one and only one individual-set and vice versa).
  • a window pane associated with the each respective rule-set
  • the method also includes mapping the rules from the each respective rule-set and the individuals from the individual-set associated with the each respective rule-set into a respective knowledge base (KB) instance associated with the each respective rule-set (i.e., there is a one-to-one correspondence between rule-sets and KB instances where each rule-set is associated with one and only one KB instance and vice versa; similarly, there is one-to-one correspondence between individual-sets and KB instances).
  • KB knowledge base
  • window pane pre-processor a functional entity within a network element performing embodiments of the method described herein.
  • aspects of the present disclosure, in particular the functionality of the window pane pre-processor described herein, may be embodied as a system, a method or a computer program product.
  • aspects of the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a "circuit,” “module” or “system.”
  • Functions described in this disclosure may be implemented as an algorithm executed by a processor, e.g. a microprocessor, of a computer.
  • aspects of the present disclosure may take the form of a computer program product embodied in one or more computer readable medium(s), preferably non-transitory, having computer readable program code embodied, e.g., stored, thereon.
  • such a computer program may, for example, be downloaded (updated) to the existing devices and systems (e.g. to the existing network elements such as the existing routers, switches, various control nodes, etc.) or be stored upon manufacturing of these devices and systems.
  • the existing devices and systems e.g. to the existing network elements such as the existing routers, switches, various control nodes, etc.
  • FIGURE 1 is a simplified block diagram illustrating a communication system 10 for facilitating network data control and management using semantic reasoners in a network environment in accordance with one example embodiment. While embodiments described herein are explained with reference to network data, base network ontology, network knowledge base, etc., the functionality described herein, in particular the functionality of a window pane pre-processor, can be implemented to process any type of data, not necessarily network data, and is applicable to any environments, not necessarily a network environment. For example, embodiments described herein may be implemented with respect to machine reasoning over sensor data (e.g. sensor clouds of Semantic Sensor Networks, SSNs) or over web data (e.g. social network feeds).
  • sensor data e.g. sensor clouds of Semantic Sensor Networks, SSNs
  • web data e.g. social network feeds
  • FIGURE 1 illustrates a communication system 10 comprising a semantic reasoner 12 comprising a semantic mapper 14, a knowledge base (KB) 16, e.g. a network KB, and a reasoning engine 18.
  • Data 20, e.g. network data, from a system 21, e.g. network 21, may be fed into the semantic reasoner 12 in any suitable format, for example (without limitation), Structure of Management Information (SMI) 22, YANG 24, or Extensible Markup Language (XML) 26.
  • a parser sub-module 28 and a generator sub-module 30 in the semantic mapper 14 may cooperate with a window pane pre-processor 13 to dynamically and automatically populate the KB 16 with data extracted from the network data 20 e.g.
  • a memory element 36 and a processor 38 may facilitate the various operations performed by any elements of the semantic reasoner 12, in particular the operations performed by the window pane pre-processor 13.
  • the reasoning engine 18 may perform machine reasoning on content in the KB 16, for example, using policies and rules from a policies database 39, and generate action(s) or report(s) 40 appropriate for controlling and managing the network 21.
  • the action/report 40 may include any suitable action or report, including remedial action and reports, notification actions and informational reports.
  • an ontology formally represents knowledge as a hierarchy of concepts within a domain (e.g., a network), using a shared vocabulary to denote types, properties and interrelationships of the concepts.
  • a "base network ontology" (e.g., 34) of a network (e.g., 21) comprises an explicit representation of a shared conceptualization of the network, providing a formal structural framework for organizing knowledge related to the network as a hierarchy of interrelated concepts.
  • the shared conceptualizations include conceptual frameworks for modeling domain knowledge (e.g., knowledge related to the network, content specific protocols for communication among devices and applications within the network, etc.); and agreements about representation of particular domain theories.
  • the base network ontology 34 may be encoded in any suitable knowledge representation language, such as Web Ontology Language (OWL).
  • OWL Web Ontology Language
  • the term "manifest” refers to a list of bindings (e.g., mappings) between a data definition format (e.g., SMI version 2 (SMIv2), YANG, XML, etc.) and ontology components.
  • the manifest 32 may be relatively static in nature, and may be developed based on the associated base network ontology 34 and SMI/YANG/XML , etc. of the network data 20 being mapped. As the base network ontology 34 evolves (e.g., is updated), the manifest 32 may be updated accordingly (e.g., by a human operator).
  • IT Information Technology
  • operation involves managing and reasoning over large volumes of data that span at least the following broad categories: (1) business rules that dictate overall system behavior and outcomes; (2) policy definitions that govern connectivity patterns and control-plane operation; (3) device configurations that are subject to software and/or hardware capabilities and limitations; and (4) operational soft-state data including e.g. routing tables, statistics, etc. that can be used for Big Data analytics.
  • OAM administration and management
  • SDN Software defined networking
  • the reasoning can be mechanized using semantic technologies, including ontology languages (e.g., Web Ontology Language (OWL), OWL-Descriptions Logics (OWL-DL), resource description framework (RDF), Semantic Web Rule Language (SWRL), etc.); ontology editors (e.g., Protege); semantic frameworks (e.g., Sesame); and semantic reasoners (e.g., Pellet, HermIT, FaCT++, etc.).
  • ontology languages e.g., Web Ontology Language (OWL), OWL-Descriptions Logics (OWL-DL), resource description framework (RDF), Semantic Web Rule Language (SWRL), etc.
  • ontology editors e.g., Protege
  • semantic frameworks e.g., Sesame
  • semantic reasoners e.g., Pellet, HermIT, FaCT++, etc.
  • Stream Reasoning is an emerging area of academic research that has come into the limelight in the last few years, primarily motivated by the need to provide solutions that would enable machine reasoning over heterogeneous streaming data (sensors, social networks, etc.).
  • Window involves partitioning a stream into subsets of data observed at different snapshots of time. Data that drops out of the current Window is ignored from the knowledge base.
  • continuous processing involves having a semantic reasoner continuously running to evaluate goals against a constantly changing knowledge base.
  • Another approach defines a framework for Stream Reasoning that includes a KB cache to host the current window over which reasoning is performed, and a persistent KB to host historic knowledge. Furthermore, this approach defines windows in terms of the number of KB (OWL) individuals they refer to. This guarantees that all statements involving an OWL individual are kept in the current window range. An individual-based window decreases the degree of incompleteness, when compared with a resource description framework (RDF) statement based window, by dropping out groups of RDF statements that refer to the oldest individual in the KB.
  • RDF resource description framework
  • the KB 16 is logically divided into n individual KB instances 15-1 through 15-n (n could be any integer greater than 1) and the window pane pre-processor 13 in the semantic reasoner 12 may automatically (e.g., without human intervention) map the data 20 to the different KB instances 15, where the data 20 may be modeled according to the base ontology 34.
  • the KB instances 15 may be implemented as cache memories.
  • the reasoning engine 18 is logically divided into n individual reasoning engines instances 17-1 through 17-n, each reasoning engine instance 17 of the reasoning engines instances 17-1 through 17-n corresponding to one KB instance of the KB instances 15-1 through 15-n, and vice versa.
  • Each reasoning engine instance 17 is an individual representation of the reasoning engine 18 and, therefore, all of the discussions provided herein with respect to the reasoning engine 18 are applicable to each of the reasoning engine instances 17.
  • the window pane pre-processor 13 may ensure/control that the contents of each KB instance 15 is fed to a corresponding one of the reasoning engine instances 17, which may collectively control and manage the network 21 appropriately. In this manner, the window pane pre-processor 13 enables parallel processing of semantic data by multiple semantic reasoning engines, which, in turn, enables the semantic reasoner 12 to operate over fast-changing data.
  • the window pane pre-processor 13 is configured to carry out a new method that can ensure knowledge completeness and sound inference while allowing parallel semantic reasoning within a given stream window.
  • a new method may be referred to as a "window pane” algorithm or method.
  • the window pane method described herein may cut down on reasoner latency (which may grow exponentially with the size of a KB).
  • the window pane method described herein can apply to any type of streaming data, such as e.g. network data, sensor data, or data generated from social networks.
  • the window pane method described herein is based on special grouping of rules, therefore, first, a general description of rules is provided.
  • SWRL rules have the general form comprising a "Body” and a "Head” and are expressed as "Body -> Head.”
  • Each of the Body and the Head comprise one or more atoms, where an atom can be either a Class atom or a Property atom, an atom comprising a subject of the atom that references one or more Individuals (i.e. the Individuals may be viewed as subjects of the rules).
  • a Class atom tests or asserts that an Individual is a member of a particular Class.
  • a Class atom "Interface(?x)” may test or assert that an Individual "x” is a member of a Class “Interface” (i.e., that "x" is an interface).
  • a Property atom tests or asserts that an Individual is associated with a given property (i.e. relationship).
  • a Property atom "hasIPv4Address(?x, ?y)” may test or assert that Individual "x" has as its IPv4 address the Individual "y”.
  • a rule to detect IP address collision between two interfaces denoted as "x1" and "x2" may be expressed in SWRL as follows:
  • an existing semantic approach for policy based networking uses border gateway protocol (BGP) with semantic information (e.g., associated with routes) expressed in an Ontology Web Language (OWL).
  • BGP border gateway protocol
  • OWL Ontology Web Language
  • SWRL rules together with OWL express a BGP ontology defining the routing policy and semantic reasoners may act over the ontology and the rules to generate the router's BGP configuration (e.g. route import/export rules).
  • an "Individual” e.g. a "KB Individual” refers to an instance of an OWL Class defined in the ontology that specifies the semantic model of the Knowledge Base in question.
  • FIGURE 2A is a simplified flow diagram illustrating example operations that may be associated with embodiments of the communication system 10.
  • the operations shown in FIGURE 2A outline a computer-implemented window pane method 42 carried out by the window pane pre-processor 13. While method steps of the method 42 are explained with reference to the elements of the communication system 10 of FIGURE 1 , a person skilled in the art will recognize that any system or network element configured to perform these method steps, in any order, is within the scope of the present disclosure.
  • the method 42 may begin in step 44, where the window pane pre-processor 13 would examine a plurality of rules of a particular ontology (e.g. rules referenced in the base ontology 34). At that point the rules may be stored, undivided, in the KB 16, in the window pane pre-processor 13 itself or be stored in any other database/memory that the window pane pre-processor 13 may access.
  • the window pane pre-processor 13 accesses the rules to identify one or more pairs of chained rules.
  • a pair of rules from the plurality of rules are identified as chained when execution of one rule of the pair of rules affects or is affected by execution of another rule of the pair of rules.
  • one rule (a first rule) of the pair is affected by execution of another rule (a second rule) if the execution of the other rule (i.e., the second rule) impacts the Individuals of the first rule (i.e., the first rule).
  • whether two rules are chained is determined by evaluating body and/or head of the rules.
  • each rule of the pair of rules comprises a body and a head, each of the body and the head comprises one or more atoms, the one or more atoms comprise zero or more Class atoms and zero or more Property atoms, and each of the one more atoms referencing one or more Individuals.
  • a pair of rules from the plurality of rules are identified as chained when at least one Class atom comprised in a Head of one rule of the pair of rules is comprised in a Body of another rule of the pair of rules.
  • a pair of rules from the plurality of rules are identified as chained when at least one Property atom comprised in a Head of one rule of the pair of rules is a Property atom in a Body of another rule of the pair of rules and the subject of the Property atom comprised in the Head of one rule references at least one Individual that is also referenced by the subject of the Property atom in the Body of another rule.
  • a pair of rules from the plurality of rules are identified as chained when the subject of at least one Class atom comprised in a Head of one rule of the pair of rules references at least one Individual that is also referenced by the subject of at least one Property atom comprised in a Body of another rule of the pair of rules.
  • the conditions of such embodiments include inheritance intersections based on Classes or Properties (since OWL supports Class and Property hierarchies).
  • step 44 may of course involve that more than two rules are identified as “chained,” but those relations could always be broken down to the pairs of chained rules. Therefore, as used herein, the phrase "identifying one or more pairs of chained rules” refers to identifying two or more rules that are chained between one another. For example, if rule A is chained with rule B and rule B is chained with rule C, then rules A, B, and C would be identified as rules that are chained together (even though rule A may not be directly chained to rule C).
  • Two (or more) rules are related if their subjects reference or can reference one or more common KB Individuals. In various embodiments, such references may apply to the Head and/or the Body of the rules, and may include inheritance intersections based on Classes or Properties. By definition, if two rules are chained then they are also related, but two rules may be related and not chained.
  • rule example As an example, referred to in the following as a "10 rule example,” consider an ontology that includes, possibly among a plurality of other rules, ten rules (rules 1-10) that are related as follows:
  • the window pane method 42 involves the window pane pre-processor 13 partitioning the related rules into rule-sets, as follows: if two or more rules are chained, then they are assigned to the same rule-set.
  • FIGURE 3 illustrates an ontology 64 comprising the related rules 1-10 assigned to four rule-sets shown as rule-sets 66-1, 66-2, 66-3, and 66-4.
  • the ontology 64 may, of course, comprise further rules which may or may not be related between one another, in particular further clusters of rules related together, but in the interests of clarity the 10 rule example only focuses on a single set of related rules as described above.
  • the rule-set 66-1 includes rules 1, 2, and 3 because these are the rules of the 10 related rules 1-10 that are chained together (rules 1 and 2 are chained and rules 2 and 3 are chained).
  • the rule-set 66-2 includes rules 4 and 5 (because rules 4 and 5 are chained).
  • the rule-set 66-3 includes rules 6, 7, and 8 because these are the rules of the 10 related rules 1-10 that are chained together (rules 6 and 7 are chained and rules 6 and 8 are chained).
  • the rule-set 66-4 includes rules 9 and 10 (because rules 9 and 10 are chained).
  • FIGURE 3 illustrates an example with four rule-sets, of course teachings provided herein are applicable to any number of P rule-sets.
  • the window pane pre-processor 13 may identifying a plurality of individuals referenced by the plurality of rules.
  • step 48 may include the window pane pre-processor 13 defining physical Stream Windows to be used in the Stream Reasoning techniques, each Stream Window comprising all Individuals referenced by a set of related rules, such as e.g. the rules 1-10 of the 10 rule example.
  • a set of related rules such as e.g. the rules 1-10 of the 10 rule example.
  • Embodiments of the present disclosure are based on an insight that, in order to preserve completeness of knowledge in a KB, all individuals referenced in a set of related rules must be kept together in the same window of any of the Stream Reasoning techniques. This guarantees that inferences are based on a synchronized snapshot of a current system state.
  • the window pane pre-processor 13 is configured to examine the plurality of individuals referenced by the subjects of the plurality of rules (as identified in step 48) and assigning all individuals referenced by each respective rule-set of the P rule-sets to an individual-set (i.e., a window pane of a window) associated with the each respective rule-set.
  • an individual-set i.e., a window pane of a window
  • FIGURE 4 illustrates a window 66 comprising all of the individuals of a set of related rules 1-10, in the exemplary illustration of FIGURE 4 all of the individuals comprising 14 Individuals I1-14.
  • the exemplary set of related rules comprised rules assigned to four rule-sets and there is one-to-one correspondence between the rule-sets and the individual-sets
  • the individuals I1-14 are assigned to four individual-sets, shown in FIGURE 4 as individual-sets 70-1, 70-2, 70-3, and 70-4.
  • the individual-set 70-1 corresponds to the rule-set 66-1
  • the individual-set 70-2 corresponds to the rule-set 66-2
  • the individual-set 70-3 corresponds to the rule-set 66-3
  • the individual-set 70-4 corresponds to the rule-set 66-4.
  • FIGURE 4 only illustrates a single window (i.e., the window corresponding to the related rules 1-10).
  • the individual-set 70-1 includes Individuals I1, I3, I5, I2, and I4 because these are the Individuals referenced in the subjects of the rules of the rule-set 66-1.
  • the individual-set 70-2 includes Individuals I9, I5, and I11 because these are the Individuals referenced in the subjects of the rules of the rule-set 66-2.
  • the individual-set 70-3 includes Individuals I6, I7, and I8 because these are the Individuals referenced in the subjects of the rules of the rule-set 66-3.
  • the individual-set 70-4 includes Individuals 111, 112, 113, and I4 because these are the Individuals referenced in the subjects of the rules of the rule-set 66-4.
  • the membership of Individuals in window panes is not mutually exclusive (i.e. an Individual may be assigned, i.e. be a member of, more than one window pane).
  • at least Individuals shared among related rules, which are non-chained may be common across the corresponding window panes. This can be seen from the examination of FIGURE 4 , where Individual I5 is common to the window panes 70-1 and 70-2 (because rules 1 and 4 are related but not chained), and Individual I11 is common to the window panes 70-2 and 70-4 (because rules 5 and 10 are related but not chained).
  • an individual in order to preserve integrity of data during machine reasoning, an individual may be assigned to more than one individual-set as long as that individual cannot be changed in any of the individual-sets as a result of the respective reasoning engine instances performing machine reasoning in the individual-sets sharing an assignment of that individual.
  • the window pane pre-processor 13 is configured to construct individual KB instances 15.
  • the window pane pre-processor 13 is configured to, for each rule-set, map the rules from the rule-set and the individuals from the individual-set associated with that rule-set into a respective KB instance.
  • each KB instance is associated with a particular rule-set (i.e., there is a one-to-one correspondence between rule-sets and KB instances where each rule-set is associated with one and only one KB instance and vice versa. Because there is also one-to-one correspondence between the rule-sets and individual-sets, this can also be expressed as that each KB instance is associated with a particular individual-set where each individual-set is associated with one and only one KB instance and vice versa.
  • every rule-set is atomic from the standpoint of sound inference and every window pane has complete knowledge for its corresponding rule-set.
  • it is possible to construct multiple KB instances such that every rule-set is mapped to a KB instance and individuals within a window pane are mapped to the KB instance that hosts the rules associated with the corresponding rule-set.
  • FIGURE 5 illustrates rules from the rule-sets of the ontology 64 of FIGURE 3 and individual-sets from the window 68 of FIGURE 4 are shown to be mapped to respective different KB instances 72 (which could be KB instances 15 shown in FIGURE 1 ).
  • FIGURE 5 Since in the example of FIGURES 3 and 4 there are four rule-sets and four individual-sets, there are four different KB instances, shown in FIGURE 5 as KB instances 72-1 through 72-4, the content of which is populated as shown with the dotted arrow going from the ontology 64 and the window 68 (i.e., the KB instance 72-1 comprises rule-set 66-1 and individual-set 70-1, etc.).
  • the window pane method 42 may be viewed as providing means for segmenting the analysis of data so that only incremental differences may need to be calculated/determined rather than having to re-calculate/re-determine the entire space.
  • the reasoning engine instance associated with a corresponding KB instance is responsible for calculating the inferences associated with its own rule-set over its own individual-set, in isolation of other reasoning engine instances or KB instances. This yields better reasoning performance as opposed to reasoning over the entire rules of the ontology for all Individuals in the Window.
  • contents of the KB instances may include Web Ontology Language Description Logics (OWL-DL) ontology files.
  • OWL-DL Web Ontology Language Description Logics
  • Embodiments of the present disclosure are further based on an insight that, in order to guarantee sound inference over a KB, each group of chained rules must be operated on by one semantic reasoner instance (i.e., by the same reasoning engine instance 17). Otherwise, certain inferences will be missed by the semantic reasoner.
  • every KB instance 15 associated with a given Window can be reasoned over, independently, by a different Semantic Reasoner instance, such as a different reasoning engine instance 17.
  • the semantic reasoner 12 may be configured to create a thread-pool of size P, where P is the number of rule-sets in a particular Window being processed at that time, with one KB instance 15 and a corresponding reasoning engine instance 17 per thread.
  • all reasoning engine instances 17 may be configured to provide their inferences to a shared Inference cache (not shown in FIGURE 1 ), which could be e.g. implemented within the KB 16, which can be queried.
  • a shared Inference cache (not shown in FIGURE 1 )
  • the inferences in such an Inference cache will be sound and complete.
  • the different KB instances 15 may be configured to provide their data to a persistent Cache (not shown in FIGURE 1 ) configured to store historic knowledge of the different states (i.e., rule-sets) of the KB instances, preferably in association with the individual Windows.
  • a persistent Cache not shown in FIGURE 1
  • historic knowledge of the different states (i.e., rule-sets) of the KB instances preferably in association with the individual Windows.
  • FIGURE 2B outlines a computer-implemented method 54, which could be a continuation of the method 42 shown in FIGURE 2A , focusing this time on how machine reasoning may be performed once the individual KB instances are constructed according to the method 42.
  • method steps of the method 54 are explained with reference to the elements of the communication system 10 of FIGURE 1 , a person skilled in the art will recognize that any system or network element configured to perform these method steps, in any order, is within the scope of the present disclosure.
  • the method 54 may begin in step 56, where the window pane pre-processor 13 would identify data corresponding to each respective rule-set, which is analogous to identifying network data corresponding to each individual-set, since there is one-to-one correspondence between the rule-sets and the individual-sets.
  • step 58 for each rule-set, the window pane pre-processor 13 would automatically map the network data corresponding to this respective rule-set to a KB instance associated with this respective rule-set.
  • step 60 for each KB instance, the window pane pre-processor 13 would feed contents of the KB instance to a respective reasoning engine instance associated with the KB instance, thereby enabling, in step 62, each individual reasoning engine instance to perform machine reasoning over the data in the corresponding KB instance.
  • the individual KB instances are populated with the actual data on which the rules of each individual KB instances can be evaluated by respective reasoning engine instances.
  • the base ontology 34 can include a scope of the system 21, network elements in the system 21, and individual protocols and features that run on the network elements.
  • the base ontology 34 may specify concepts (e.g., classes), relationship between concepts (e.g., object properties), data properties (e.g., linking individuals to literals) and individuals (e.g., instances of classes).
  • the base ontology 34 can function as a dictionary for mapping the data 20 into a specific semantics model of the system 21.
  • the method 54 may further include steps of (not shown in FIGURES) a processor of the semantic reasoner 12, such as e.g.
  • the processor 38 generating a fully populated semantics model of the system 21 from the data according to a ontology.
  • the step of automatically mapping the data corresponding to the each respective rule-set to the KB instance associated with each rule-set would comprise automatically mapping a portion of the fully populated semantics model comprising the network data corresponding to each rule-set.
  • Such an embodiment could advantageously allow mapping portions of a fully populated semantics model onto the individual KB instances so that the portions could be processed separately.
  • generating the fully populated semantics model of a system may comprise the semantic reasoner 12 receiving the data 20 from the system 21, parsing the received data (e.g. using the parser 28), loading the parsed data into in-memory data structures, accessing a manifest specifying binding between a data definition format (which, in an embodiment, could be a selection from a group consisting of Structure of Management Information (SMI), YANG, and Extensible Markup Language (XML)) and ontology components of the ontology, identifying ontology components associated with the data based on the manifest, and populating the identified ontology components with individuals and properties from the corresponding data structures.
  • a data definition format which, in an embodiment, could be a selection from a group consisting of Structure of Management Information (SMI), YANG, and Extensible Markup Language (XML)
  • SMI Structure of Management Information
  • YANG YANG
  • XML Extensible Markup Language
  • a "semantics model” comprises a conceptual data model (e.g., description of objects represented by computer readable data including a map of concepts and their relationships) in which semantic information is included.
  • the semantics model describes the meaning of its instances, thereby allowing, without human intervention, expression of meaning in any information exchange based on the model.
  • the semantics model of a system such as e.g. the system 21, includes a knowledge representation of the system consisting of a framework of semantically related terms.
  • the knowledge representation may include, for example, a directed or undirected graph consisting of vertices (which represent concepts, such as various network elements) and edges (which represent the relations between the concepts).
  • the term "semantic reasoner” comprises a software and/or hardware (e.g., application specific integrated circuits, field programmable gate arrays, etc.) able to infer logical consequences from a set of asserted facts and/or axioms.
  • the base ontology 34 and manifest 32 may be generated manually (e.g., with programmer input), whereas semantic reasoner 12 may operate substantially automatically (e.g., without programmer input). In other embodiments, the base ontology 34 and manifest 32 may be generated semi-automatically, for example, with minimal human intervention, or completely automatically.
  • W3C Web Ontology Language Descriptive Logics OWL-DL
  • W3C Semantic Web Rules Language SWRL
  • ontologies e.g., base network ontology 34
  • policies and rules may be stored separately in policies database 39.
  • Intent specifications can be expressed in terms of SWRL rules, which use high-level concepts defined in a set of ontologies, thus making the intent specification generic, device-independent and extensible.
  • Meta-policies may be specified for guiding interactions among intents. For example, meta-policies may be used to prioritize intents when multiple intents are applicable in a context.
  • a meta-level vocabulary can define constructs for resolving conflicting overlapping intents.
  • the meta-level vocabulary can be used to create a default conflict resolution rule such that a prohibitive policy overrides permissive policy.
  • the meta-level vocabulary also allows for defining absolute and relative prioritization of intents, thus overriding the default rule.
  • the meta-policies define an automatic conflict resolution diagnosis to respond to situations when intents presented to a network impose conflicting conditions on the overall infrastructure or on one specific network element.
  • modeling network data 20 may involve receiving network data 20 at semantic mapper 14.
  • semantic mapper 14 may comprise a portion of an application (e.g., software tool or service) that aids in transformation of data elements from one namespace (e.g., SMI, YANG, or XML) into another namespace (e.g., OWL-DL).
  • Parser 28 in semantic mapper 14 may parse network data 20 and load the parsed network data 20 into in-memory data structures, which can include Java classes.
  • Generator 30 may access manifest 32 specifying binding between network data types and base network ontology 34.
  • Generator 30 may generate a fully populated semantics model from the data structures using manifest 32 and network data values.
  • communication system 10 can facilitate developing a semantic model of network 21. Network data 20 available within network 21 may be projected onto the semantic models.
  • the fully populated semantics model may comprise an OWL-DL file(s), which may be saved into NKB 16.
  • NKB 16 may comprise mined network data 20 that has been projected against base network ontology 34 (which may be defined by various authorities, such as a plurality of organizations, persons, domains, departments, etc.).
  • base network ontology 34 which may be defined by various authorities, such as a plurality of organizations, persons, domains, departments, etc.
  • NKB 16 may be written using OWL-DL and SWRL.
  • NKB 16 can be configured as any suitable database, table, array, data structure, etc. that allows reasoning engine 18 to access NKB 16 and perform reasoning operations thereon.
  • NKB 16 comprises an OWL-DL ontology with classes, subclasses, properties and instances representing network 21.
  • NKB 16 can act as a centralized database of information in some embodiments, permitting search queries to be run on the contents therein.
  • NKB 16 comprises a machine readable tangible non-transitory medium for storing information in any suitable format.
  • NKB 16 can comprise a dynamic storehouse of information, capable of learning and updating network related information associated with network 21.
  • reasoning engine 18 may perform machine reasoning over network data 20 in network knowledge base 16 and make inferences suitable for controlling and managing network 21.
  • the machine reasoning may be according to pre-configured rules and policies, for example, in policies database 39.
  • At least some rules, policies and meta-policies in policies database 39 may be external to base network ontology 34 and accordingly not part of the semantics model in NFB 16.
  • the external rules, policies and meta-policies may be input by a user, administrator, etc.
  • Some of the rules, policies and meta-policies may be particular (e.g., proprietary) to a provider of network 21 in some embodiments; some of the rules, policies and meta-policies may be common among all network providers in other embodiments.
  • reasoning engine 18 comprises an artificial intelligence (Al) engine that uses network data 20 and user defined policies for the management and control of network 21.
  • reasoning engine 18 may operate over NKB 16 and provide basic reasoning functions available with Descriptive Logics (DL), such as consistency checking, inference and concept coverage (e.g., satisfiability verifications). The reasoning can be used to control and manage network 21 appropriately.
  • reasoning engine 18 may trigger generation of action(s) and/or report(s) 40 that can cause changes in network configuration, alert human operators, and otherwise facilitate controlling and managing network 21.
  • reasoning engine 18 can detect if any of network data 20 is inconsistent based on rules specified in base network ontology 34, and trigger a suitable action.
  • policies database 39 indicates a rule from base network ontology 34 that interfaces on distinct routers are distinct in their virtual routing and forwarding instance (VRF) and IP address combination across the network. Assume that network 21 includes two interfaces, on distinct routers, where interfaces are the same.
  • Reasoning engine 18 may instantiate the rule with the data about the interface instances and flags that an inconsistency is found.
  • reasoning engine can automatically detect that two interfaces configured on two distinct routers with the same virtual routing and forwarding instance (VRF) and same IP address, and trigger corrective action based on preset rules (such as pick the next available IP address in the subnet) in policies database 39.
  • VRF virtual routing and forwarding instance
  • Reasoning engine 18 can also infer logical consequences based on a set of asserted facts and/or axioms. For example, reasoning engine 18 may detect that a particular router's control plane is being subjected to a denial of service attack from a given source IP, based on examining traffic statistics and central processing unit (CPU)/memory utilization and trigger, for instance, installation of an access control list (ACL) to filter traffic from that malicious source.
  • CPU central processing unit
  • ACL access control list
  • reasoning engine 18 can solve a concept coverage problem (CCoP), for example, for service composition and resource identification. For example, reasoning engine 18 can identify paths available from source A to destination B that do not traverse a specific autonomous system. In another example, reasoning engine 18 can determine whether a specific route to a destination prefix leaves political borders of Canada, etc. Reasoning engine 18 can trigger a report back of a degree of deviation between a request and current state of the network. In an example embodiment, reasoning engine 18 can determine whether an application's intent is satisfiable in an SDN context given the current state of the network, and if not, can trigger a report back of the 'semantic distance' (e.g., degree of divergence) between the intent and the current state.
  • CoP concept coverage problem
  • reasoning engine 18, running on a central server or embedded in one or more network elements within or outside network 21, can use meta-information to automatically merge intents from multiple controllers and generate a target configuration that meets the combined requirements.
  • the term 'network element' is meant to encompass computers, network appliances, servers, routers, switches, gateways, bridges, load balancers, firewalls, processors, modules, or any other suitable device, component, element, or object operable to exchange information in a network environment.
  • the network elements may include any suitable hardware, software, components, modules, interfaces, or objects that facilitate the operations thereof. This may be inclusive of appropriate algorithms and communication protocols that allow for the effective exchange of data or information.
  • reasoning engine 18 may be embodied in one or more instances executing on one or more network elements within or outside network 21.
  • the one or more reasoning engine 18 instances may follow the semantics defined by the policy language. Consequently, the steps in merging policies can be formally verified using a logical model.
  • the semantic language can depend on open-world assumption reasoning (e.g., in an open-world assumption reasoning, "positive" assertions may be made; absence of an assertion does not mean the absent assertion is false).
  • open-world assumption reasoning NKB 16 may be incrementally developed, and is not required to be complete to be useful.
  • communication system 10 may cause rules to be evaluated by the knowledge contained within NKB 16. For example, such restrictions can allow reasoning engine 18 to yield a solution in a finite time.
  • Any suitable tool may be used to drive the ontology specification of base network ontology 34, reasoning engine 18, etc. to build and deploy embodiments of communication system 10 on a large scale.
  • complexity of the policy specification mechanism can be relevant to ease of its acceptance.
  • a declarative policy language that enables each authority to draft abstract policies in a high-level language can be a good candidate for policy specification.
  • Each authority can define only those objectives and constraints that are relevant to its needs.
  • the information expressed by the policy language can be defined in a manner that is as hardware, software, and protocol independent as possible. Therefore, according to embodiments of communication system 10, authorities need not focus on writing procedures for configuring a specific network infrastructure; instead they can focus on describing a generic infrastructure and its features without needing to master and understand the various device/protocol/system specific mechanisms.
  • the semantic reasoning elements of semantic reasoner 12 can convert substantially any specified policy into device specific configurations.
  • Embodiments of communication system 10 can provide a method and apparatus for building semantic NKB 16 using semantic mapper 14, which takes as input user-defined base network ontology 34, a set of SMI/YANG/XML comprising network data 20, and generates a fully populated OWL-DL ontology represented as a semantic model that can be acted upon by reasoning engine 18, to achieve at least the following: - consistency checking of network and device operation and configuration (e.g., detecting and remedying overlapping IP address assignment); inference of states or consequences based on a set of facts (e.g., detecting denial of service attacks and isolating the malicious source); verifying the satisfiability of a concept (e.g. in SDN context, verifying whether an application's intent is satisfiable given the state of the network).
  • semantic mapper 14 takes as input user-defined base network ontology 34, a set of SMI/YANG/XML comprising network data 20, and generates a fully populated OWL-DL ont
  • Embodiments of communication system 10 can enable embedding artificial intelligence in network 21, through semantic reasoner 18, either on the network elements themselves or on an SDN controller.
  • One of the advantages that can be realized with embodiments of communication system 10 may include automatic generation of NKB 16 from network data 20 (e.g., in form of SMI/YANG modules/XML files) using as input base network ontology 34, which can describe basic rules and principles of networking, and formally describe business rules and advanced policies of the network.
  • embodiments of communication system 10 can be applied across substantially all network technologies and protocols (e.g., Layer 2, Layer 3, etc.).
  • Embodiments of communication system 10 may also provide a mechanism for performing machine reasoning over network Big Data.
  • the network topology of network 21 can include any number of servers, hardware accelerators, virtual machines, switches (including distributed virtual switches), routers, and other nodes inter-connected to form a large and complex network.
  • a node may be any electronic device, client, server, peer, service, application, or other object capable of sending, receiving, or forwarding information over communications channels in a network.
  • Elements of FIGURE 1 may be coupled to one another through one or more interfaces employing any suitable connection (wired or wireless), which provides a viable pathway for electronic communications. Additionally, any one or more of these elements may be combined or removed from the architecture based on particular configuration needs.
  • Communication system 10 may include a configuration capable of TCP/IP communications for the electronic transmission or reception of data packets in a network. Communication system 10 may also operate in conjunction with a User Datagram Protocol/Internet Protocol (UDP/IP) or any other suitable protocol, where appropriate and based on particular needs. In addition, gateways, routers, switches, and any other suitable nodes (physical or virtual) may be used to facilitate electronic communication between various nodes in the network.
  • UDP/IP User Datagram Protocol/Internet Protocol
  • gateways, routers, switches, and any other suitable nodes may be used to facilitate electronic communication between various nodes in the network.
  • the example network environment may be configured over a physical infrastructure that may include one or more networks and, further, may be configured in any form including, but not limited to, local area networks (LANs), wireless local area networks (WLANs), VLANs, metropolitan area networks (MANs), VPNs, Intranet, Extranet, any other appropriate architecture or system, or any combination thereof that facilitates communications in a network.
  • LANs local area networks
  • WLANs wireless local area networks
  • MANs metropolitan area networks
  • VPNs Intranet, Extranet, any other appropriate architecture or system, or any combination thereof that facilitates communications in a network.
  • a communication link may represent any electronic link supporting a LAN environment such as, for example, cable, Ethernet, wireless technologies (e.g., IEEE 802.11x), ATM, fiber optics, etc. or any suitable combination thereof.
  • communication links may represent a remote connection through any appropriate medium (e.g., digital subscriber lines (DSL), telephone lines, T1 lines, T3 lines, wireless, satellite, fiber optics, cable, Ethernet, etc. or any combination thereof) and/or through any additional networks such as a wide area networks (e.g., the Internet).
  • DSL digital subscriber lines
  • T1 lines T1 lines
  • T3 lines wireless, satellite, fiber optics, cable, Ethernet, etc. or any combination thereof
  • any additional networks such as a wide area networks (e.g., the Internet).
  • semantic reasoner 12 can comprise a software application executing using processor 38 and memory element 36.
  • semantic reasoner 12 may be instantiated on a server comprising memory element 36 and processor 38.
  • semantic reasoner 12 may be instantiated on another network element comprising memory element 36 and processor 38.
  • semantic reasoner 12 may comprise a stand-alone appliance including memory element 36 and processor 38, connected to the network, and operable to execute various operations as described herein.
  • semantic reasoner 12 may comprise a distributed application, with different elements (e.g., semantic mapper 14, NKB 16, reasoning engine 18) instantiated on separate physical or virtual machines.
  • references to various features e.g., elements, structures, modules, components, steps, operations, characteristics, etc.
  • references to various features e.g., elements, structures, modules, components, steps, operations, characteristics, etc.
  • references to various features e.g., elements, structures, modules, components, steps, operations, characteristics, etc.
  • references to various features are intended to mean that any such features are included in one or more embodiments of the present disclosure, but may or may not necessarily be combined in the same embodiments.
  • an 'application' as used herein this Specification can be inclusive of an executable file comprising instructions that can be understood and processed on a computer, and may further include library modules loaded during execution, object files, system files, hardware logic, software logic, or any other executable modules.
  • optically efficient refers to improvements in speed and/or efficiency of a specified outcome and do not purport to indicate that a process for achieving the specified outcome has achieved, or is capable of achieving, an "optimal” or perfectly speedy/perfectly efficient state.
  • At least some portions of the activities outlined herein may be implemented in software in, for example, semantic reasoner 12, in particular window pane pre-processor 13.
  • one or more of these features may be implemented in hardware, provided external to these elements, or consolidated in any appropriate manner to achieve the intended functionality.
  • the various network elements e.g., semantic reasoner 12, in particular window pane pre-processor 13
  • these elements may include any suitable algorithms, hardware, software, components, modules, interfaces, or objects that facilitate the operations thereof.
  • semantic reasoner 12 in particular window pane pre-processor 13, described and shown herein (and/or their associated structures) may also include suitable interfaces for receiving, transmitting, and/or otherwise communicating data or information in a network environment.
  • some of the processors and memory elements associated with the various nodes may be removed, or otherwise consolidated such that a single processor and a single memory element are responsible for certain activities.
  • the arrangements depicted in the FIGURES may be more logical in their representations, whereas a physical architecture may include various permutations, combinations, and/or hybrids of these elements. It is imperative to note that countless possible design configurations can be used to achieve the operational objectives outlined here. Accordingly, the associated infrastructure has a myriad of substitute arrangements, design choices, device possibilities, hardware configurations, software implementations, equipment options, etc.
  • one or more memory elements can store data used for the operations described herein. This includes the memory element being able to store instructions (e.g., software, logic, code, etc.) in non-transitory computer-readable storage media, such that the instructions are executed to carry out the activities described in this Specification.
  • a processor can execute any type of instructions associated with the data to achieve the operations detailed herein in this Specification.
  • processors e.g., processor 38 or window pane pre-processor 13
  • the activities outlined herein may be implemented with fixed logic or programmable logic (e.g., software/computer instructions executed by a processor) and the elements identified herein could be some type of a programmable processor, programmable digital logic (e.g., a field programmable gate array (FPGA), an erasable programmable read only memory (EPROM), an electrically erasable programmable read only memory (EEPROM)), an ASIC that includes digital logic, software, code, electronic instructions, flash memory, optical disks, CD-ROMs, DVD ROMs, magnetic or optical cards, other types of machine-readable mediums suitable for storing electronic instructions, or any suitable combination thereof.
  • FPGA field programmable gate array
  • EPROM erasable programmable read only memory
  • EEPROM electrically erasable programmable read only memory
  • ASIC that includes digital logic, software, code, electronic instructions, flash memory, optical disks, CD-ROMs, DVD ROMs, magnetic or optical cards, other types of machine-readable mediums suitable for
  • These devices may further keep information in any suitable type of non-transitory storage medium (e.g., random access memory (RAM), read only memory (ROM), field programmable gate array (FPGA), erasable programmable read only memory (EPROM), electrically erasable programmable ROM (EEPROM), etc.), software, hardware, or in any other suitable component, device, element, or object where appropriate and based on particular needs.
  • RAM random access memory
  • ROM read only memory
  • FPGA field programmable gate array
  • EPROM erasable programmable read only memory
  • EEPROM electrically erasable programmable ROM
  • communication system 10 may be applicable to other exchanges or routing protocols.
  • communication system 10 has been illustrated with reference to particular elements and operations that facilitate the communication process, these elements, and operations may be replaced by any suitable architecture or process that achieves the intended functionality of communication system 10.
  • An example method executed by a semantic reasoner 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.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • General Engineering & Computer Science (AREA)
  • Artificial Intelligence (AREA)
  • Computational Linguistics (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Data Mining & Analysis (AREA)
  • Evolutionary Computation (AREA)
  • Computing Systems (AREA)
  • Software Systems (AREA)
  • General Health & Medical Sciences (AREA)
  • Audiology, Speech & Language Pathology (AREA)
  • Health & Medical Sciences (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Stored Programmes (AREA)
  • Information Transfer Between Computers (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Devices For Executing Special Programs (AREA)
EP16154563.7A 2015-03-13 2016-02-05 Parallele datenverarbeitung durch mehrere semantische argumentationsmaschinen Active EP3067836B1 (de)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US14/657,930 US10504025B2 (en) 2015-03-13 2015-03-13 Parallel processing of data by multiple semantic reasoning engines

Publications (3)

Publication Number Publication Date
EP3067836A2 true EP3067836A2 (de) 2016-09-14
EP3067836A3 EP3067836A3 (de) 2017-02-01
EP3067836B1 EP3067836B1 (de) 2021-04-07

Family

ID=55357871

Family Applications (1)

Application Number Title Priority Date Filing Date
EP16154563.7A Active EP3067836B1 (de) 2015-03-13 2016-02-05 Parallele datenverarbeitung durch mehrere semantische argumentationsmaschinen

Country Status (3)

Country Link
US (1) US10504025B2 (de)
EP (1) EP3067836B1 (de)
CN (1) CN105976031B (de)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018222485A1 (en) * 2017-05-31 2018-12-06 Cisco Technology, Inc. Intent specification checks for inconsistencies
CN110046195A (zh) * 2019-04-08 2019-07-23 青海省科学技术信息研究所有限公司 一种基于农业大数据知识库管理系统及其工作方法
CN110785965A (zh) * 2017-06-19 2020-02-11 思科技术公司 网络中使用虚拟路由转发容器的第3层的验证

Families Citing this family (72)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9781004B2 (en) 2014-10-16 2017-10-03 Cisco Technology, Inc. Discovering and grouping application endpoints in a network environment
US10547565B2 (en) 2015-04-02 2020-01-28 Cisco Technology, Inc. Automatic determination and just-in-time acquisition of data for semantic reasoning
US11630866B2 (en) * 2016-10-31 2023-04-18 Schneider Electric USA, Inc. Semantic search and rule methods for a distributed data system
US10826788B2 (en) 2017-04-20 2020-11-03 Cisco Technology, Inc. Assurance of quality-of-service configurations in a network
US10560328B2 (en) 2017-04-20 2020-02-11 Cisco Technology, Inc. Static network policy analysis for networks
US10623264B2 (en) 2017-04-20 2020-04-14 Cisco Technology, Inc. Policy assurance for service chaining
US10505816B2 (en) 2017-05-31 2019-12-10 Cisco Technology, Inc. Semantic analysis to detect shadowing of rules in a model of network intents
US10581694B2 (en) 2017-05-31 2020-03-03 Cisco Technology, Inc. Generation of counter examples for network intent formal equivalence failures
US10554483B2 (en) 2017-05-31 2020-02-04 Cisco Technology, Inc. Network policy analysis for networks
US10812318B2 (en) 2017-05-31 2020-10-20 Cisco Technology, Inc. Associating network policy objects with specific faults corresponding to fault localizations in large-scale network deployment
US10439875B2 (en) 2017-05-31 2019-10-08 Cisco Technology, Inc. Identification of conflict rules in a network intent formal equivalence failure
US20180351788A1 (en) 2017-05-31 2018-12-06 Cisco Technology, Inc. Fault localization in large-scale network policy deployment
US10693738B2 (en) 2017-05-31 2020-06-23 Cisco Technology, Inc. Generating device-level logical models for a network
US10623271B2 (en) 2017-05-31 2020-04-14 Cisco Technology, Inc. Intra-priority class ordering of rules corresponding to a model of network intents
US11469986B2 (en) 2017-06-16 2022-10-11 Cisco Technology, Inc. Controlled micro fault injection on a distributed appliance
US10574513B2 (en) 2017-06-16 2020-02-25 Cisco Technology, Inc. Handling controller and node failure scenarios during data collection
US10686669B2 (en) 2017-06-16 2020-06-16 Cisco Technology, Inc. Collecting network models and node information from a network
US10904101B2 (en) 2017-06-16 2021-01-26 Cisco Technology, Inc. Shim layer for extracting and prioritizing underlying rules for modeling network intents
US11150973B2 (en) 2017-06-16 2021-10-19 Cisco Technology, Inc. Self diagnosing distributed appliance
US10498608B2 (en) 2017-06-16 2019-12-03 Cisco Technology, Inc. Topology explorer
US10547715B2 (en) 2017-06-16 2020-01-28 Cisco Technology, Inc. Event generation in response to network intent formal equivalence failures
US11645131B2 (en) 2017-06-16 2023-05-09 Cisco Technology, Inc. Distributed fault code aggregation across application centric dimensions
US10587621B2 (en) 2017-06-16 2020-03-10 Cisco Technology, Inc. System and method for migrating to and maintaining a white-list network security model
US10528444B2 (en) 2017-06-19 2020-01-07 Cisco Technology, Inc. Event generation in response to validation between logical level and hardware level
US10812336B2 (en) 2017-06-19 2020-10-20 Cisco Technology, Inc. Validation of bridge domain-L3out association for communication outside a network
US10644946B2 (en) 2017-06-19 2020-05-05 Cisco Technology, Inc. Detection of overlapping subnets in a network
US10554493B2 (en) 2017-06-19 2020-02-04 Cisco Technology, Inc. Identifying mismatches between a logical model and node implementation
US10218572B2 (en) 2017-06-19 2019-02-26 Cisco Technology, Inc. Multiprotocol border gateway protocol routing validation
US10505817B2 (en) 2017-06-19 2019-12-10 Cisco Technology, Inc. Automatically determining an optimal amount of time for analyzing a distributed network environment
US10567228B2 (en) 2017-06-19 2020-02-18 Cisco Technology, Inc. Validation of cross logical groups in a network
US10341184B2 (en) 2017-06-19 2019-07-02 Cisco Technology, Inc. Validation of layer 3 bridge domain subnets in in a network
US10805160B2 (en) 2017-06-19 2020-10-13 Cisco Technology, Inc. Endpoint bridge domain subnet validation
US10432467B2 (en) 2017-06-19 2019-10-01 Cisco Technology, Inc. Network validation between the logical level and the hardware level of a network
US10411996B2 (en) 2017-06-19 2019-09-10 Cisco Technology, Inc. Validation of routing information in a network fabric
US10536337B2 (en) 2017-06-19 2020-01-14 Cisco Technology, Inc. Validation of layer 2 interface and VLAN in a networked environment
US11343150B2 (en) 2017-06-19 2022-05-24 Cisco Technology, Inc. Validation of learned routes in a network
US10652102B2 (en) 2017-06-19 2020-05-12 Cisco Technology, Inc. Network node memory utilization analysis
US11283680B2 (en) 2017-06-19 2022-03-22 Cisco Technology, Inc. Identifying components for removal in a network configuration
US10333787B2 (en) 2017-06-19 2019-06-25 Cisco Technology, Inc. Validation of L3OUT configuration for communications outside a network
US10700933B2 (en) 2017-06-19 2020-06-30 Cisco Technology, Inc. Validating tunnel endpoint addresses in a network fabric
US10348564B2 (en) 2017-06-19 2019-07-09 Cisco Technology, Inc. Validation of routing information base-forwarding information base equivalence in a network
US10560355B2 (en) 2017-06-19 2020-02-11 Cisco Technology, Inc. Static endpoint validation
US10567229B2 (en) 2017-06-19 2020-02-18 Cisco Technology, Inc. Validating endpoint configurations between nodes
US10437641B2 (en) 2017-06-19 2019-10-08 Cisco Technology, Inc. On-demand processing pipeline interleaved with temporal processing pipeline
US10623259B2 (en) 2017-06-19 2020-04-14 Cisco Technology, Inc. Validation of layer 1 interface in a network
US10547509B2 (en) 2017-06-19 2020-01-28 Cisco Technology, Inc. Validation of a virtual port channel (VPC) endpoint in the network fabric
US10812329B2 (en) 2017-08-01 2020-10-20 At&T Intellectual Property I, L.P. Systems and methods to control operation of virtualized networks
US10587456B2 (en) 2017-09-12 2020-03-10 Cisco Technology, Inc. Event clustering for a network assurance platform
US10587484B2 (en) 2017-09-12 2020-03-10 Cisco Technology, Inc. Anomaly detection and reporting in a network assurance appliance
US10554477B2 (en) 2017-09-13 2020-02-04 Cisco Technology, Inc. Network assurance event aggregator
US10333833B2 (en) 2017-09-25 2019-06-25 Cisco Technology, Inc. Endpoint path assurance
CN107798387B (zh) * 2017-11-01 2020-07-28 西安交通大学 一种适用于高端装备全生命周期的知识服务系统及方法
US11102053B2 (en) 2017-12-05 2021-08-24 Cisco Technology, Inc. Cross-domain assurance
US10873509B2 (en) 2018-01-17 2020-12-22 Cisco Technology, Inc. Check-pointing ACI network state and re-execution from a check-pointed state
US10572495B2 (en) 2018-02-06 2020-02-25 Cisco Technology Inc. Network assurance database version compatibility
WO2019168912A1 (en) * 2018-02-27 2019-09-06 Convida Wireless, Llc Semantic operations and reasoning support over distributed semantic data
CN108829666B (zh) * 2018-05-24 2021-11-26 中山大学 一种基于语义解析和smt求解的阅读理解题求解方法
US10812315B2 (en) 2018-06-07 2020-10-20 Cisco Technology, Inc. Cross-domain network assurance
US10911495B2 (en) 2018-06-27 2021-02-02 Cisco Technology, Inc. Assurance of security rules in a network
US11218508B2 (en) 2018-06-27 2022-01-04 Cisco Technology, Inc. Assurance of security rules in a network
US11019027B2 (en) 2018-06-27 2021-05-25 Cisco Technology, Inc. Address translation for external network appliance
US11044273B2 (en) 2018-06-27 2021-06-22 Cisco Technology, Inc. Assurance of security rules in a network
US10659298B1 (en) 2018-06-27 2020-05-19 Cisco Technology, Inc. Epoch comparison for network events
US10904070B2 (en) 2018-07-11 2021-01-26 Cisco Technology, Inc. Techniques and interfaces for troubleshooting datacenter networks
US10826770B2 (en) 2018-07-26 2020-11-03 Cisco Technology, Inc. Synthesis of models for networks using automated boolean learning
US10616072B1 (en) 2018-07-27 2020-04-07 Cisco Technology, Inc. Epoch data interface
CN109684485B (zh) * 2018-12-25 2021-09-28 福州大学 一种基于swrl的任意规则推理引擎设计方法
US20230252321A1 (en) 2020-07-08 2023-08-10 Nec Corporation Inference device, inference method, and recording medium
US11394604B2 (en) 2020-09-10 2022-07-19 Cisco Technology, Inc. Closed-loop automation of a managed network
CN112231422B (zh) * 2020-12-16 2021-02-26 中国人民解放军国防科技大学 一种图数据合成方法、装置、计算机设备和存储介质
CN113191498B (zh) * 2021-04-30 2022-08-05 重庆交通大学 一种基于规则的Spark分布式弹性语义流推理方法
CN114550499B (zh) * 2022-02-14 2024-06-18 武汉理工大学 融合COLREGs场景知识的船舶智能避碰方法及装置

Family Cites Families (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8443074B2 (en) 2007-03-06 2013-05-14 Microsoft Corporation Constructing an inference graph for a network
CN101996208B (zh) 2009-08-31 2014-04-02 国际商业机器公司 用于数据库语义查询回答的方法及系统
US8527443B2 (en) 2009-10-08 2013-09-03 Oracle International Corporation Techniques for processing ontologies
US8423501B2 (en) 2009-11-20 2013-04-16 Oracle International Corporation Data source for parallel inference using a source table that is partitioned on triple predicate
US9400778B2 (en) 2011-02-01 2016-07-26 Accenture Global Services Limited System for identifying textual relationships
US20120278788A1 (en) 2011-04-29 2012-11-01 General Electric Company Methods for code generation from semantic models and rules
US9015080B2 (en) 2012-03-16 2015-04-21 Orbis Technologies, Inc. Systems and methods for semantic inference and reasoning
US9448304B2 (en) 2013-03-15 2016-09-20 Src, Inc. Ground moving target indicator (GMTI) radar that converts radar tracks to directed graphs (DG), and creates weighted DGs aligned with superimposed with digital maps
CN103645948B (zh) 2013-11-27 2017-05-17 南京师范大学 一种面向数据密集型及依赖关系的并行计算方法
US9628553B2 (en) 2014-10-24 2017-04-18 The Boeing Company Mapping network service dependencies
US10547565B2 (en) 2015-04-02 2020-01-28 Cisco Technology, Inc. Automatic determination and just-in-time acquisition of data for semantic reasoning
US20160292581A1 (en) 2015-04-02 2016-10-06 Cisco Technology, Inc. Minimized processing of streaming changes into a semantic reasoner

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
None

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018222485A1 (en) * 2017-05-31 2018-12-06 Cisco Technology, Inc. Intent specification checks for inconsistencies
CN110612702A (zh) * 2017-05-31 2019-12-24 思科技术公司 针对不一致的意图规范检查
CN110612702B (zh) * 2017-05-31 2022-08-02 思科技术公司 针对不一致的意图规范检查
CN110785965A (zh) * 2017-06-19 2020-02-11 思科技术公司 网络中使用虚拟路由转发容器的第3层的验证
CN110785965B (zh) * 2017-06-19 2022-10-28 思科技术公司 对结构中配置的正确部署执行网络保证检查的系统和方法
CN110046195A (zh) * 2019-04-08 2019-07-23 青海省科学技术信息研究所有限公司 一种基于农业大数据知识库管理系统及其工作方法

Also Published As

Publication number Publication date
CN105976031B (zh) 2020-01-24
EP3067836A3 (de) 2017-02-01
EP3067836B1 (de) 2021-04-07
US20160267384A1 (en) 2016-09-15
CN105976031A (zh) 2016-09-28
US10504025B2 (en) 2019-12-10

Similar Documents

Publication Publication Date Title
EP3067836B1 (de) Parallele datenverarbeitung durch mehrere semantische argumentationsmaschinen
US10050842B2 (en) Network control and management using semantic reasoners in a network environment
CN110612702B (zh) 针对不一致的意图规范检查
US10341296B2 (en) Firewall configured with dynamic collaboration from network services in a virtual network environment
US10873505B2 (en) Validation of layer 2 interface and VLAN in a networked environment
US10862752B2 (en) Network validation between the logical level and the hardware level of a network
US20200186425A1 (en) Validation of cross logical groups in a network
CN110785963B (zh) 从网络收集网络模型和节点信息
EP3643010B1 (de) Validierung einer layer-1-schnittstelle in einem netzwerk
US20230171157A1 (en) Detection of overlapping subnets in a network
WO2018236717A1 (en) LAYER 3 VALIDATION USING VIRTUAL ROUTING CONTAINERS IN A NETWORK
US10333787B2 (en) Validation of L3OUT configuration for communications outside a network
US10528444B2 (en) Event generation in response to validation between logical level and hardware level
WO2018236794A1 (en) VALIDATION OF LAYER BRIDGE DOMAIN SUB-NETWORKS 3 IN A NETWORK
US11343150B2 (en) Validation of learned routes in a network
CN110800259B (zh) 跨以应用为中心的维度的分布式故障代码聚合
US10623271B2 (en) Intra-priority class ordering of rules corresponding to a model of network intents
US20200004742A1 (en) Epoch comparison for network policy differences
Zhang et al. A conflict resolution scheme in intent-driven network
Agbariah Common policy language for Policy Compliance and Change Detection System in managed service in data networks

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

PUAL Search report despatched

Free format text: ORIGINAL CODE: 0009013

AK Designated contracting states

Kind code of ref document: A3

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

RIC1 Information provided on ipc code assigned before grant

Ipc: G06N 5/02 20060101AFI20161223BHEP

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20170801

RBV Designated contracting states (corrected)

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: EXAMINATION IS IN PROGRESS

17Q First examination report despatched

Effective date: 20180306

RIC1 Information provided on ipc code assigned before grant

Ipc: G06N 5/02 20060101AFI20200701BHEP

Ipc: H04L 12/24 20060101ALI20200701BHEP

RIC1 Information provided on ipc code assigned before grant

Ipc: G06N 5/04 20060101ALI20200803BHEP

Ipc: H04L 12/24 20060101ALI20200803BHEP

Ipc: G06N 5/02 20060101AFI20200803BHEP

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

INTG Intention to grant announced

Effective date: 20200924

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 1380663

Country of ref document: AT

Kind code of ref document: T

Effective date: 20210415

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602016055506

Country of ref document: DE

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG9D

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20210407

Ref country code: AT

Ref legal event code: MK05

Ref document number: 1380663

Country of ref document: AT

Kind code of ref document: T

Effective date: 20210407

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210407

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210707

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210407

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210407

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210407

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210407

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210708

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210407

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210807

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210407

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210707

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210407

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210809

Ref country code: RS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210407

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210407

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602016055506

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210407

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210407

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210407

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210407

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210407

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210407

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20220110

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20220224

Year of fee payment: 7

Ref country code: DE

Payment date: 20220218

Year of fee payment: 7

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210807

Ref country code: AL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210407

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20220224

Year of fee payment: 7

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210407

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210407

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20220228

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220205

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220228

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220205

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220228

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220228

P01 Opt-out of the competence of the unified patent court (upc) registered

Effective date: 20230525

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 602016055506

Country of ref document: DE

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20230205

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20230205

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20230205

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20230228

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20230901

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO

Effective date: 20160205

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210407

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20210407