OVERLAYING RECEIVE SCHEDULES FOR ENERGY-CONSTRAINED DEVICES IN CHANNEL-HOPPING NETWORKS
    181.
    发明申请
    OVERLAYING RECEIVE SCHEDULES FOR ENERGY-CONSTRAINED DEVICES IN CHANNEL-HOPPING NETWORKS 有权
    在通道网络中覆盖能量约束设备的覆盖时间表

    公开(公告)号:US20140376567A1

    公开(公告)日:2014-12-25

    申请号:US13921680

    申请日:2013-06-19

    Abstract: In one embodiment, a time at which a first device in a frequency-hopping communication network is expected to transmit a data message is determined. A first schedule is then generated based on the determined time, and the first schedule is overlaid on a frequency-hopping schedule for a second device in the network. The first schedule defines a first timeslot during which the second device listens for the data message, while the frequency-hopping schedule defines second timeslots during which the second device listens for data messages from other devices in the network. Notably, a duration of the first timeslot is greater than respective durations of the second timeslots.

    Abstract translation: 在一个实施例中,确定跳频通信网络中的第一设备期望发送数据消息的时间。 然后基于所确定的时间生成第一调度,并且第一调度被叠加在网络中的第二设备的跳频调度上。 第一调度定义了第二设备在其中侦听数据消息的第一时隙,而跳频调度定义了第二时隙,在第二时隙期间,第二设备监听来自网络中的其他设备的数据消息。 值得注意的是,第一时隙的持续时间大于第二时隙的相应持续时间。

    RELIABLE BULK DATA DISSEMINATION USING RATELESS CODES
    182.
    发明申请
    RELIABLE BULK DATA DISSEMINATION USING RATELESS CODES 有权
    可靠的大容量数据显示使用无痕码

    公开(公告)号:US20140372585A1

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

    申请号:US13920802

    申请日:2013-06-18

    CPC classification number: H04L49/20 H03M13/3761 H04L1/004 H04L1/0076

    Abstract: In one embodiment, an aggregating node receives feedback messages from one or more destination nodes in the network. The destination nodes are designated to receive data as packets from a source node using rateless coding. Further, the feedback messages indicate whether packets are needed at a corresponding destination node to complete the data. Then, the feedback messages are aggregated into a single aggregated message, and the aggregated message is transmitted toward the source node.

    Abstract translation: 在一个实施例中,聚合节点从网络中的一个或多个目的地节点接收反馈消息。 目的地节点被指定为使用无编码编码从源节点接收数据作为数据包。 此外,反馈消息指示在相应目的地节点处是否需要分组来完成数据。 然后,将反馈消息聚合成单个聚合消息,并将聚合消息发送到源节点。

    CONTROLLING ROUTING DURING SCHEDULED NODE DOWNTIME
    184.
    发明申请
    CONTROLLING ROUTING DURING SCHEDULED NODE DOWNTIME 有权
    在调度节点停止期间控制路由

    公开(公告)号:US20140314096A1

    公开(公告)日:2014-10-23

    申请号:US13868290

    申请日:2013-04-23

    CPC classification number: H04L45/22 H04L45/28

    Abstract: In one embodiment, a first node in a shared-media communication network may receive a message indicated a scheduled downtime of a second node located between the first node and a destination. The first node may determine whether to perform a search for an alternate route toward the destination. In response to determining to perform the search, the first node may perform the search for an alternate route toward the destination for use at least during the scheduled downtime.

    Abstract translation: 在一个实施例中,共享媒体通信网络中的第一节点可以接收指示位于第一节点和目的地之间的第二节点的预定停机时间的消息。 第一节点可以确定是否执行到目的地的替代路由的搜索。 响应于确定执行搜索,第一节点可以执行搜索到目的地的替代路由以至少在预定的停机期间使用。

    HIDDEN MARKOV MODEL BASED ARCHITECTURE TO MONITOR NETWORK NODE ACTIVITIES AND PREDICT RELEVANT PERIODS
    185.
    发明申请
    HIDDEN MARKOV MODEL BASED ARCHITECTURE TO MONITOR NETWORK NODE ACTIVITIES AND PREDICT RELEVANT PERIODS 审中-公开
    隐藏MARKOV模型建筑监测网络节点活动和预测相关周期

    公开(公告)号:US20140222997A1

    公开(公告)日:2014-08-07

    申请号:US13955648

    申请日:2013-07-31

    Abstract: In one embodiment, techniques are shown and described relating to a Hidden Markov Model based architecture to monitor network node activities and predict relevant periods. In particular, in one embodiment, a device determines a statistical model for each of one or more singular-node traffic profiles (e.g., based on one or more Hidden Markov Models (HMMs) each corresponding to a respective one of the one or more traffic profiles). By analyzing respective traffic from individual nodes in a computer network, and matching the respective traffic against the statistical model for the one or more traffic profiles, the device may detecting a matching traffic profile for the individual nodes in a computer network. In addition, the device may predict relevant periods of traffic for the individual nodes by extrapolating a most-likely future sequence based on prior respective traffic of the individual nodes and the corresponding matching traffic profile.

    Abstract translation: 在一个实施例中,显示和描述与基于隐马尔可夫模型的架构相关的技术来监视网络节点活动并预测相关周期。 特别地,在一个实施例中,设备确定一个或多个奇异节点业务简档中的每一个的统计模型(例如,基于一个或多个隐马尔可夫模型(HMM),每个隐马尔可夫模型(HMM)对应于一个或多个业务中的相应一个 档案)。 通过分析来自计算机网络中的各个节点的相应流量,并且将相应流量与针对一个或多个流量简档的统计模型相匹配,该设备可以检测计算机网络中各个节点的匹配流量简档。 此外,设备可以基于各个节点的先前相应业务和对应的匹配流量简档来推测出最可能的将来序列来预测各个节点的相关时段。

    TRAFFIC-BASED INFERENCE OF INFLUENCE DOMAINS IN A NETWORK BY USING LEARNING MACHINES
    186.
    发明申请
    TRAFFIC-BASED INFERENCE OF INFLUENCE DOMAINS IN A NETWORK BY USING LEARNING MACHINES 审中-公开
    通过使用学习机器在网络中影响流量领域的交通干扰

    公开(公告)号:US20140222748A1

    公开(公告)日:2014-08-07

    申请号:US13946386

    申请日:2013-07-19

    CPC classification number: G06N20/00 H04L41/142 H04L41/16 H04L43/0852

    Abstract: In one embodiment, techniques are shown and described relating to traffic-based inference of influence domains in a network by using learning machines. In particular, in one embodiment, a management device computes a time-based traffic matrix indicating traffic between pairs of transmitter and receiver nodes in a computer network, and also determines a time-based quality parameter for a particular node in the computer network. By correlating the time-based traffic matrix and time-based quality parameter for the particular node, the device may then determine an influence of particular traffic of the traffic matrix on the particular node.

    Abstract translation: 在一个实施例中,通过使用学习机器来显示和描述与网络中的影响域的基于业务的推理有关的技术。 特别地,在一个实施例中,管理设备计算指示计算机网络中的发射机和接收机节点对之间的业务的基于时间的业务矩阵,并且还确定计算机网络中特定节点的基于时间的质量参数。 通过将特定节点的基于时间的业务矩阵和基于时间的质量参数相关联,设备然后可以确定业务矩阵的特定业务对特定节点的影响。

    PRE-PROCESSING FRAMEWORK COMPONENT OF DISTRIBUTED INTELLIGENCE ARCHITECTURES
    187.
    发明申请
    PRE-PROCESSING FRAMEWORK COMPONENT OF DISTRIBUTED INTELLIGENCE ARCHITECTURES 有权
    分布式智能建筑的预处理框架组件

    公开(公告)号:US20140222729A1

    公开(公告)日:2014-08-07

    申请号:US13953113

    申请日:2013-07-29

    Abstract: In one embodiment, a state tracking engine (STE) defines one or more classes of elements that can be tracked in a network. A set of elements to track is determined from the one or more classes, and the set of elements is tracked in the network. Access to the tracked set of elements then provided via one or more corresponding application programming interfaces (APIs). In another embodiment, a metric computation engine (MCE) defines one or more network metrics to be tracked in the network. One or more tracked elements are received from the STE. The one or more network metrics are tracked in the network based on the received one or more tracked elements. Access to the tracked network metrics is then provided via one or more corresponding APIs.

    Abstract translation: 在一个实施例中,状态跟踪引擎(STE)定义可以在网络中跟踪的一个或多个类别的元件。 要从一个或多个类确定要跟踪的一组元素,并且在网络中跟踪元素集合。 然后通过一个或多个相应的应用程序编程接口(API)提供对跟踪的元素集的访问。 在另一个实施例中,度量计算引擎(MCE)定义了要在网络中跟踪的一个或多个网络度量。 从STE接收到一个或多个跟踪元素。 基于所接收的一个或多个被跟踪的元素,在网络中跟踪一个或多个网络度量。 然后通过一个或多个相应的API提供对跟踪网络度量的访问。

    BINARY SEARCH-BASED APPROACH IN ROUTING-METRIC AGNOSTIC TOPOLOGIES FOR NODE SELECTION TO ENABLE EFFECTIVE LEARNING MACHINE MECHANISMS
    188.
    发明申请
    BINARY SEARCH-BASED APPROACH IN ROUTING-METRIC AGNOSTIC TOPOLOGIES FOR NODE SELECTION TO ENABLE EFFECTIVE LEARNING MACHINE MECHANISMS 有权
    基于二进制搜索的路由选择方法,用于选择有效的学习机器机制

    公开(公告)号:US20140219078A1

    公开(公告)日:2014-08-07

    申请号:US13946268

    申请日:2013-07-19

    Abstract: In one embodiment, nodes are polled in a network for Quality of Service (QoS) measurements, and a QoS anomaly that affects a plurality of potentially faulty nodes is detected based on the QoS measurements. A path, which traverses the plurality of potentially faulty nodes, is then computed from a first endpoint to a second endpoint. Also, a median node that is located at a point along the path between the first endpoint and the second endpoint is computed. Time-stamped packets are received from the median node, and the first endpoint and the second endpoint of the path are updated based on the received time-stamped packets, such that an amount of potentially faulty nodes is reduced. Then, the faulty node is identified from a reduced amount of potentially faulty nodes.

    Abstract translation: 在一个实施例中,在用于服务质量(QoS)测量的网络中轮询节点,并且基于QoS测量来检测影响多个潜在故障节点的QoS异常。 然后,从第一端点到第二端点计算遍历多个潜在故障节点的路径。 此外,计算位于沿着第一端点和第二端点之间的路径的点处的中间节点。 从中间节点接收时间戳的分组,并且基于接收的时间戳分组来更新路径的第一端点和第二端点,使得可能故障节点的量减少。 然后,从减少量的潜在故障节点识别故障节点。

    PUSH-BASED SHORT-CUT REQUESTS WITHIN A DIRECTED ACYCLIC GRAPH
    189.
    发明申请
    PUSH-BASED SHORT-CUT REQUESTS WITHIN A DIRECTED ACYCLIC GRAPH 有权
    基于按键的短切割请求在方向图中

    公开(公告)号:US20140129734A1

    公开(公告)日:2014-05-08

    申请号:US13668744

    申请日:2012-11-05

    CPC classification number: H04L45/121 H04L45/14 H04L45/302 H04L45/42 H04L45/48

    Abstract: In one embodiment, a root of a directed acyclic graph (DAG) may determine transmission of critical traffic from a first device to a second device in a computer network using the DAG, and may also determine a maximum tolerable delay of the critical traffic. As such, the root may compute, based on a known topology of the computer network, a constrained shortest path first (CSPF) point-to-point (P2P) path from the first device to the second device to meet the maximum tolerable delay. The root may then inform the first device of the P2P path to the second device to cause the first device to use the P2P path for the critical traffic.

    Abstract translation: 在一个实施例中,有向非循环图(DAG)的根可以使用DAG来确定计算机网络中的第一设备到第二设备的关键业务的传输,并且还可以确定关键业务的最大容许延迟。 因此,根可以基于计算机网络的已知拓扑来计算从第一设备到第二设备的约束最短路径优先(CSPF)点到点(P2P)路径以满足最大可容忍延迟。 然后,根可以将第一设备通知到第二设备的P2P路径,以使第一设备将P2P路径用于关键业务。

    INTERFACING WITH LOW-POWER AND LOSSY NETWORKS
    190.
    发明申请
    INTERFACING WITH LOW-POWER AND LOSSY NETWORKS 审中-公开
    与低功耗和低成本的网络接口

    公开(公告)号:US20140126431A1

    公开(公告)日:2014-05-08

    申请号:US13669122

    申请日:2012-11-05

    Abstract: In one embodiment, a client device determines when it is coupled to an IoT/LLN device to establish and enable an IP link between a headset interface on the client device and a signal interface on the IoT/LLN device. Once the IP link is established, a duplex data signal is transmitted between the client device and the IoT/LLN device, via the IP link.

    Abstract translation: 在一个实施例中,客户端设备确定何时耦合到IoT / LLN设备以建立并启用客户端设备上的耳机接口与IoT / LLN设备上的信号接口之间的IP链路。 IP链路建立后,通过IP链路在客户端设备和IoT / LLN设备之间传输双工数据信号。

Patent Agency Ranking