Distributed Tag-Based Correlation Engine
    1.
    发明申请
    Distributed Tag-Based Correlation Engine 审中-公开
    分布式标签相关引擎

    公开(公告)号:US20110270841A1

    公开(公告)日:2011-11-03

    申请号:US12769217

    申请日:2010-04-28

    IPC分类号: G06F17/30

    CPC分类号: G06Q30/0631 G06F16/24575

    摘要: Systems may use explicit ratings from users to construct user to user correlations. This technique may reduce the user-content correlation to a single dimension, i.e., the content that a plurality of users may rate similarly. Embodiments of the present invention may use DHT as an underlying distributed signaling mechanism, but may also make the rating implicit. Furthermore, embodiments of the present invention may construct the user to content correlation based on multi-dimensional metadata related to the content.

    摘要翻译: 系统可以使用用户的明确评级来将用户与用户相关联。 该技术可以将用户内容相关性降低到单个维度,即,多个用户可以类似地评估的内容。 本发明的实施例可以使用DHT作为底层分布式信令机制,但是也可以使得评级被隐含。 此外,本发明的实施例可以基于与内容相关的多维元数据来构建用户到内容相关性。

    LIMITING STORAGE MESSAGES IN PEER TO PEER NETWORK
    2.
    发明申请
    LIMITING STORAGE MESSAGES IN PEER TO PEER NETWORK 审中-公开
    限制存储在同行对等网络中的消息

    公开(公告)号:US20100293223A1

    公开(公告)日:2010-11-18

    申请号:US12467849

    申请日:2009-05-18

    IPC分类号: G06F15/16 G06F15/173

    摘要: In system of DHT rings that are not filly meshed with each other, flooding of PUT and GET messages is limited by PUTting a content key indicating an actual storage location of content from a content provider only to root DHTs associated with the content provider, and PUTting a secondary key indicating a subset of DHT rings at which content from the content provider might be stored only to DHT rings for which the content provider desires the content to be available. When a DHT receives a GET it first determines from the content key whether it can provide the content and if not, the DHT obtains the subset of DHT rings from the secondary key and forwards the GET of the content key to the corresponding root DHTs.

    摘要翻译: 在没有彼此互相关联的DHT环的系统中,通过将指示来自内容提供商的内容的实际存储位置的内容密钥与内容提供商相关联的根DHT进行PUT和PUTting的限制来限制PUT和GET消息的泛滥 指示DHT环的子集的次要密钥,来自内容提供者的内容可以仅存储在内容提供者希望内容可用的DHT环上。 当DHT接收到GET时,首先从内容密钥确定是否可以提供内容,如果不是,DHT将从辅助密钥获取DHT环的子集,并将内容密钥的GET转发到相应的根DHT。

    Method and apparatus for routing requests for service using BGP community attributes
    3.
    发明授权
    Method and apparatus for routing requests for service using BGP community attributes 有权
    使用BGP社区属性路由请求服务的方法和装置

    公开(公告)号:US08880729B2

    公开(公告)日:2014-11-04

    申请号:US13109461

    申请日:2011-05-17

    IPC分类号: G06F15/173 H04L12/66

    CPC分类号: H04L12/66

    摘要: According to one embodiment, an apparatus that makes improved routing decisions is provided that includes a receiver, a retriever, a proximity engine, and a transmitter. The receiver may be configured to receive a request from a source. The retriever may be configured to retrieve a plurality of providers capable of servicing the request. The proximity engine may be configured to rank the plurality of providers based on weights indicative of a network distance. The weights may correspond to a first Border Gateway Protocol (BGP) community attribute associated with the source and at least a second BGP community attribute associated with at least one of the providers in the plurality of providers. The transmitter may be configured to transmit the request to the provider in the plurality of providers with the highest ranking.

    摘要翻译: 根据一个实施例,提供了一种提供改进的路由决定的装置,其包括接收机,猎犬,邻近引擎和发射机。 接收机可以被配置为从源接收请求。 检索者可以被配置为检索能够服务该请求的多个提供者。 邻近引擎可以被配置为基于指示网络距离的权重来对多个提供者进行排名。 所述权重可以对应于与所述源相关联的第一边界网关协议(BGP)团体属性以及与所述多个提供者中的至少一个提供者相关联的至少第二BGP社区属性。 发射机可以被配置为以最高排名将请求发送到多个提供商中的提供商。

    Distributed content popularity tracking for use in memory eviction
    4.
    发明申请
    Distributed content popularity tracking for use in memory eviction 审中-公开
    分布式内容流行度跟踪用于内存驱逐

    公开(公告)号:US20120221708A1

    公开(公告)日:2012-08-30

    申请号:US12932429

    申请日:2011-02-25

    IPC分类号: G06F15/173

    摘要: In one embodiment, a method includes storing at a node in a distributed network of nodes, an object associated with an object descriptor comprising popularity information for the object, each of the nodes storing a plurality of the objects and object descriptors, the node in communication with a server storing objects that are less popular than the objects stored at the nodes, and transmitting from the node to the server, one of the objects identified as less popular than one of the objects stored at the server. One of the nodes receives and stores the object from the server. An apparatus is also disclosed.

    摘要翻译: 在一个实施例中,一种方法包括在节点的分布式网络中的节点处存储与对象描述符相关联的对象,该对象描述符包括对象的流行度信息,每个节点存储多个对象和对象描述符,通信节点 存储存储比存储在节点上的对象不太流行的对象的服务器,并且从节点向服务器发送被识别为比存储在服务器中的对象之一更不流行的对象中的一个。 其中一个节点从服务器接收并存储对象。 还公开了一种装置。

    Service-aware distributed hash table routing
    5.
    发明授权
    Service-aware distributed hash table routing 有权
    服务感知分布式哈希表路由

    公开(公告)号:US09069761B2

    公开(公告)日:2015-06-30

    申请号:US13480647

    申请日:2012-05-25

    摘要: In one embodiment, a node in a computer network joins a global ring associated with a distributed hash table (DHT), and maintains a DHT routing table and DHT database for the global ring. In addition, the node may determine a particular service class for which the node is configured, and may join a particular service-based sub-ring according to the particular service class, where all nodes of the particular service-based sub-ring are within the global ring. As such, a service-based DHT routing table and service-based DHT database may be maintained for the particular service-based sub-ring, such that DHT operations identified by the particular service class are routed to the particular service-based sub-ring (e.g., by a portal node).

    摘要翻译: 在一个实施例中,计算机网络中的节点加入与分布式哈希表(DHT)相关联的全局环,并且维护用于全局环的DHT路由表和DHT数据库。 另外,节点可以确定节点被配置的特定服务类别,并且可以根据特定服务类加入特定的基于服务的子环,其中特定的基于服务的子环的所有节点都在其中 全球戒指 因此,可以为特定的基于服务的子环维护基于服务的DHT路由表和基于服务的DHT数据库,使得由特定服务类标识的DHT操作被路由到特定的基于服务的子环 (例如,由门户节点)。

    Detecting and eliminating spurious energy in communications systems via multi-channel processing
    6.
    发明授权
    Detecting and eliminating spurious energy in communications systems via multi-channel processing 有权
    通过多通道处理检测和消除通信系统中的杂散能量

    公开(公告)号:US07835701B2

    公开(公告)日:2010-11-16

    申请号:US11093031

    申请日:2005-03-29

    IPC分类号: H04B17/00

    CPC分类号: H04B1/109 H04B1/1027

    摘要: The present invention allows multi-channel communications equipment to detect and eliminate a false interpretation of interference as a valid signal. The solution is based on the observation that the simultaneous arrival of energy on two independent channels is an impossible event. So, when such an event happens, it is a reliable signature of confusing out-of-band energy for a valid signal.

    摘要翻译: 本发明允许多信道通信设备检测和消除作为有效信号的干扰的错误解释。 该解决方案基于观察到能量同时到达两个独立通道是不可能的事件。 所以,当这样的事件发生时,这是有效信号的带外能量混乱的可靠签名。

    Method and system for dynamically reducing length of a delay chain
    7.
    发明授权
    Method and system for dynamically reducing length of a delay chain 有权
    用于动态缩短延迟链长度的方法和系统

    公开(公告)号:US07733764B2

    公开(公告)日:2010-06-08

    申请号:US10731730

    申请日:2003-12-09

    IPC分类号: H04J11/00

    CPC分类号: H04L25/05

    摘要: Upon a triggering event, a delay chain shifts data out at a higher rate than incoming packets and a processor controls bypassing circuitry to reduce the latency of hardware implementations of, for example, 802.11a OFDM receivers, with long delay chains. The signal processing algorithms used to recover symbol timing need a large number of samples stored in a delay chain, often consisting of pipelined registers. Such a delay chain introduces a large lag between the time samples have been acquired by the data converters and the time they are processed. This delay makes it difficult for higher level network layer implementations to meet the deadlines of 802.11a WLAN protocol. The proposed scheme implements dynamic reduction in the depth of the delay chain once timing recovery has been performed. A multi-step scheme achieves exponential reduction in the number of elements in the delay chain in every step.

    摘要翻译: 在触发事件时,延迟链以比输入分组更高的速率移出数据,并且处理器控制旁路电路以减少具有长延迟链的例如802.11a OFDM接收机的硬件实现的等待时间。 用于恢复符号定时的信号处理算法需要存储在延迟链中的大量采样,通常由流水线寄存器组成。 这样的延迟链在由数据转换器获取的时间样本和它们被处理的时间之间引入了大的滞后。 这种延迟使得较高级别的网络层实现难以满足802.11a WLAN协议的最后期限。 一旦定时恢复被执行,所提出的方案实现延迟链的深度的动态降低。 多步骤方案实现了每个步骤中延迟链中元素数量的指数减少。

    Method and system for fast timing recovery for preamble based transmission systems
    8.
    发明授权
    Method and system for fast timing recovery for preamble based transmission systems 有权
    用于基于前导码的传输系统的快速定时恢复的方法和系统

    公开(公告)号:US07415059B2

    公开(公告)日:2008-08-19

    申请号:US10712800

    申请日:2003-11-13

    IPC分类号: H03D1/00 H04L27/06

    摘要: Using a combination of auto-correlation and cross-correlation techniques provides a symbol timing recovery in a Wireless Local Area Network (WLAN) environment that is extremely robust to wireless channel impairments such as noise, multi-path and carrier frequency offset. An auto-correlator provides an estimate for a symbol boundary, and a cross-correlator is subsequently used to more precisely identify the symbol boundary. Peak processing of the cross-correlation results provides further refinement in symbol boundary detection. In receiving a packet conforming to the IEEE 802.11a standard, the method requires a minimum of only three short symbols of the 802.11a short preamble to determine timing, and guarantees timing lock within the duration of the 802.11a short preamble. This method and system can be easily applied to any other preamble based system such as 802.11g and High Performance Radio LAN/2 (HIPERLAN/2).

    摘要翻译: 使用自相关和互相关技术的组合在无线局域网(WLAN)环境中提供对诸如噪声,多径和载波频率偏移之类的无线信道损伤非常鲁棒的符号定时恢复。 自相关器提供符号边界的估计,随后使用互相关器更精确地识别符号边界。 互相关结果的峰值处理提供了符号边界检测的进一步细化。 在接收符合IEEE 802.11a标准的数据包时,该方法只需要802.11a短前导码中只有三个短符号,以确定定时,并保证802.11a短前导码持续时间内的定时锁定。 该方法和系统可以容易地应用于诸如802.11g和高性能无线LAN / 2(HIPERLAN / 2)的任何其它基于前导码的系统。

    Prefix and predictive search in a distributed hash table
    10.
    发明授权
    Prefix and predictive search in a distributed hash table 有权
    在分布式哈希表中的前缀和预测搜索

    公开(公告)号:US09060001B2

    公开(公告)日:2015-06-16

    申请号:US13281125

    申请日:2011-10-25

    IPC分类号: G06F7/00 G06F17/30 H04L29/08

    CPC分类号: H04L67/1065 G06F17/3033

    摘要: In one embodiment, a method comprises identifying prefix groups for searchable character symbols, each prefix group having a corresponding searchable character symbol comprising at least one searchable character; assigning at least one prefix group to each of a plurality of distributed hash table nodes in a network, each distributed hash table node containing at least one of the prefix groups, each distributed hash table node assigned a corresponding prescribed keyspace range of a prescribed keyspace, each distributed hash table node configured for storing data records having respective primary data record keys within the corresponding prescribed keyspace range; and assigning secondary indexes that start with one of the searchable character symbols to the corresponding prefix group in the associated distributed hash table node, enabling any prefix search starting with the one searchable character symbol to be directed to the corresponding prefix group in the associated distributed hash table node.

    摘要翻译: 在一个实施例中,一种方法包括识别可搜索的字符符号的前缀组,每个前缀组具有包括至少一个可搜索字符的对应的可搜索字符符号; 将至少一个前缀组分配给网络中的多个分布式哈希表节点中的每一个,每个分布式哈希表节点包含至少一个前缀组,每个分配的哈希表节点分配了规定密钥空间的对应的规定密钥空间范围, 每个分布式哈希表节点被配置用于存储具有相应的规定密钥空间范围内的各个主数据记录密钥的数据记录; 并且将从可搜索的字符符号中的一个开始的辅助索引分配给相关联的分布式散列表节点中的对应的前缀组,使得能够将所述一个可搜索的字符符号开始的任何前缀搜索定向到相关联的分散哈希中的对应的前缀组 表节点。