知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

197 records (took 0.028 seconds)

    Optimizing throughput of data frames in orthogonal frequency division multiplexing (OFDM) communication networks
    114.
    发明授权
    Optimizing throughput of data frames in orthogonal frequency division multiplexing (OFDM) communication networks 有权
    在正交频分复用（OFDM）通信网络中优化数据帧的吞吐量

    公开(公告)号：US09590790B2

    公开(公告)日：2017-03-07

    申请号：US14867845

    申请日：2015-09-28

    Applicant: Cisco Technology, Inc.

    Inventor： Jonathan W. Hui ,  Jean-Philippe Vasseur ,  Wei Hong

    IPC: H04K1/10 ,  H04L5/00 ,  H04B3/54 ,  H04L27/00 ,  H04J11/00 ,  H04L27/26 ,  H04W72/04

    CPC classification number: H04L5/0064 ,  H04B3/54 ,  H04B2203/5416 ,  H04J11/00 ,  H04L5/0007 ,  H04L5/003 ,  H04L5/0032 ,  H04L5/0033 ,  H04L5/0037 ,  H04L5/0044 ,  H04L5/0094 ,  H04L27/0006 ,  H04L27/2601 ,  H04W72/0453

    Abstract: In one embodiment, a device maintains a predetermined number of high-priority subcarriers for use in communicating high-priority data frames and a predetermined number of low-priority subcarriers for use in communicating low-priority data frames. A data frame is received and a data frame priority is determined for the data frame. If the data frame is determined to be a low-priority data frame, a minimum number of subcarriers, from the low-priority subcarriers, required for communication of the data frame is determined and the data frame is communicated using the minimum number of subcarriers. If the data frame is determined to be a high-priority data frame, a maximum number of subcarriers available, including the high-priority subcarriers and the low-priority subcarriers, is determined and the data frame is communicated using the maximum number of subcarriers.

    Abstract translation: 在一个实施例中，设备维护预定数量的高优先级子载波，用于传送高优先级数据帧和预定数量的低优先级子载波，以用于传送低优先级数据帧。 接收数据帧，并为数据帧确定数据帧优先级。 如果数据帧被确定为低优先级数据帧，则确定从数据帧通信所需的低优先级子载波的最小子载波数目，并且使用最小数目的副载波来传送数据帧。 如果数据帧被确定为高优先级数据帧，则确定包括高优先级子载波和低优先级子载波的最大子载波数目，并且使用最大数目的副载波来传送数据帧。

    Eliminating IPV6 neighbor solicitations in constrained computer networks
    115.
    发明授权
    Eliminating IPV6 neighbor solicitations in constrained computer networks 有权
    消除受限计算机网络中的IPV6邻居请求

    公开(公告)号：US09577914B2

    公开(公告)日：2017-02-21

    申请号：US13652887

    申请日：2012-10-16

    Applicant: Cisco Technology, Inc.

    Inventor： Jonathan W. Hui ,  Wei Hong ,  Jean-Philippe Vasseur

    IPC: H04L12/52 ,  H04L12/751 ,  H04L12/733 ,  H04L12/721 ,  H04L12/741

    CPC classification number: H04L45/02 ,  H04L45/20 ,  H04L45/72 ,  H04L45/74 ,  H04L2212/00

    Abstract: In one embodiment, the techniques herein provide that a node may receive a packet from a neighboring node in a low power and lossy network (LLN). The node may then extract, from the packet, a link-layer source address from a link layer header and an internet protocol (IP) source address from an IP header. The node may then determine whether the neighboring node originated the packet and, based on that determination, the node may correlate the link-layer source address with the IP source address to provide neighbor discovery.

    Abstract translation: 在一个实施例中，这里的技术提供节点可以在低功率和有损网络（LLN）中从相邻节点接收分组。 然后，节点可以从分组中提取来自IP报头的链路层报头和因特网协议（IP）源地址的链路层源地址。 节点然后可以确定相邻节点是否发起分组，并且基于该确定，节点可以将链路层源地址与IP源地址相关联，以提供邻居发现。

    Binary search-based approach in routing-metric agnostic topologies for node selection to enable effective learning machine mechanisms
    116.
    发明授权
    Binary search-based approach in routing-metric agnostic topologies for node selection to enable effective learning machine mechanisms 有权
    用于节点选择的路由 - 度量不可知拓扑中的基于二进制搜索的方法，以实现有效的学习机制

    公开(公告)号：US09544220B2

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

    申请号：US13946268

    申请日：2013-07-19

    Applicant: Cisco Technology, Inc.

    Inventor： Sukrit Dasgupta ,  Jean-Philippe Vasseur ,  Grégory Mermoud ,  Jonathan W. Hui

    IPC: H04L12/751 ,  H04L12/24 ,  H04L12/26 ,  H04L12/703

    CPC classification number: H04L45/08 ,  H04L41/0677 ,  H04L41/5009 ,  H04L43/106 ,  H04L45/28

    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异常。 然后，从第一端点到第二端点计算遍历多个潜在故障节点的路径。 此外，计算位于沿着第一端点和第二端点之间的路径的点处的中间节点。 从中间节点接收时间戳的分组，并且基于接收的时间戳分组来更新路径的第一端点和第二端点，使得可能故障节点的量减少。 然后，从减少量的潜在故障节点识别故障节点。

    Efficient use of dynamic host configuration protocol in low power and lossy networks
    117.
    发明授权
    Efficient use of dynamic host configuration protocol in low power and lossy networks 有权
    在低功耗和有损网络中有效利用动态主机配置协议

    公开(公告)号：US09515874B2

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

    申请号：US14333074

    申请日：2014-07-16

    Applicant: Cisco Technology, Inc.

    Inventor： Jonathan W. Hui ,  Lik Chuen Alec Woo ,  Wei Hong

    IPC: G06F15/177 ,  H04L12/24 ,  H04L12/721 ,  H04L29/12

    CPC classification number: H04L41/0803 ,  H04L45/14 ,  H04L61/2015 ,  H04L61/6059

    Abstract: In one embodiment, each of a plurality of devices in a computer network is configured to i) transmit a unicasted dynamic host configuration protocol (DHCP) solicit message to a neighbor device having a route to a border router as an assumed DHCP relay without regard to location of a DHCP server, and ii) operate as a DHCP relay to receive unicasted DHCP solicit messages and relay the solicit message to the border router of the network without regard to location of the DHCP server, and to relay a DHCP reply to a corresponding requestor device.

    Abstract translation: 在一个实施例中，计算机网络中的多个设备中的每一个被配置为i）向具有到边界路由器的路由器的邻居设备传输单播动态主机配置协议（DHCP）请求消息作为假定的DHCP中继，而不考虑 DHCP服务器的位置，以及ii）作为DHCP中继来接收单播的DHCP请求消息，并将请求消息中继到网络的边界路由器，而不考虑DHCP服务器的位置，并将DHCP应答中继到相应的 请求者设备

    Dynamic traffic shaping based on path self-interference
    118.
    发明授权
    Dynamic traffic shaping based on path self-interference 有权
    基于路径自干扰的动态流量整形

    公开(公告)号：US09473412B2

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

    申请号：US14284500

    申请日：2014-05-22

    Applicant: Cisco Technology, Inc.

    Inventor： Jonathan W. Hui ,  Jean-Philippe Vasseur ,  Wei Hong

    IPC: H04L12/815 ,  H04L12/64 ,  H04B3/32 ,  H04B3/54 ,  H04L12/54 ,  H04J3/10

    CPC classification number: H04L47/22 ,  H04B3/32 ,  H04B3/54 ,  H04B3/542 ,  H04B2203/5425 ,  H04J3/10 ,  H04L12/6418

    Abstract: In one embodiment, a method is disclosed in which a device in a network receives self-interference information from one or more nodes in the network. A degree of self-interference along a communication path in the network is determined based on the received self-interference information. A packet to be sent along the communication path is also identified and traffic shaping is performed on the communication path based on the degree of self-interference along the path.

    Abstract translation: 在一个实施例中，公开了一种网络中的设备从网络中的一个或多个节点接收自身干扰信息的方法。 基于所接收的自干扰信息来确定沿着网络中的通信路径的自干扰度。 还将识别沿着通信路径发送的分组，并且基于沿着路径的自干扰程度在通信路径上执行流量整形。

Patent Agency Ranking