AUTOMATIC CORRELATION OF DYNAMIC SYSTEM EVENTS WITHIN COMPUTING DEVICES
    31.
    发明申请
    AUTOMATIC CORRELATION OF DYNAMIC SYSTEM EVENTS WITHIN COMPUTING DEVICES 有权
    动态系统事件在计算设备中的自动关联

    公开(公告)号:US20160098419A1

    公开(公告)日:2016-04-07

    申请号:US14958134

    申请日:2015-12-03

    Abstract: Systems and methods are described herein for logging system events within an electronic machine using an event log structured as a collection of tree-like cause and effect graphs. An event to be logged may be received. A new event node may be created within the event log for the received event. One or more existing event nodes within the event log may be identified as having possibly caused the received event. One or more causal links may be created within the event log between the new event node and the one or more identified existing event nodes. The new event node may be stored as an unattached root node in response to not identifying an existing event node that may have caused the received event.

    Abstract translation: 本文描述了系统和方法,用于使用结构化为树状原因和效果图的集合的事件日志记录电子机器内的系统事件。 可能会收到要记录的事件。 可以在事件日志中为接收的事件创建一个新的事件节点。 事件日志中的一个或多个现有事件节点可能被识别为可能导致所接收的事件。 可以在新事件节点和一个或多个已识别的现有事件节点之间的事件日志内创建一个或多个因果链接。 响应于不识别可能已经导致接收到的事件的现有事件节点,新事件节点可以被存储为未附着的根节点。

    HETEROGENEOUS GRAPH LEARNING-BASED UNIFIED NETWORK REPRESENTATION

    公开(公告)号:US20240422069A1

    公开(公告)日:2024-12-19

    申请号:US18334735

    申请日:2023-06-14

    Abstract: A heterogeneous graph learning system generates and analyzes network implementations. The heterogeneous graph learning system includes obtaining information describing multiple network implementations including heterogeneous nodes. The heterogeneous graph learning system also includes generating a one-hop graph connecting a particular node of the heterogeneous nodes with a set of related nodes. The one-hop graph connects the particular node with the set of related nodes via corresponding edges. The heterogeneous graph learning system further includes transforming the one-hop graph into a weighted graph based on a Dynamic Meta Path Transformation (DMPT). In the DMPT, each of the corresponding edges connecting the particular node to a corresponding related node among the set of related nodes is associated with a corresponding weight.

    NETWORK OPTIMIZATION BY PREDICTING AND PROACTIVELY MANAGING HOT-PREFIXES

    公开(公告)号:US20240022496A1

    公开(公告)日:2024-01-18

    申请号:US17863710

    申请日:2022-07-13

    CPC classification number: H04L45/02 H04L43/0876

    Abstract: A method includes obtaining, from a plurality of first devices in a first time zone, data associated with hot-prefixes requested at one or more first devices of the plurality of first devices during a first time interval. The hot-prefixes are associated with network addresses that are frequently requested during the first time interval. The method further includes predicting, based on the data associated with the hot-prefixes, prefixes that will become hot-prefixes during a second time interval in a second time zone to determine predicted hot-prefixes, and transmitting an indication of the predicted hot-prefixes to a plurality of second devices configured to provide networking services in the second time zone prior to a start of the second time interval in the second time zone.

Patent Agency Ranking