利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

413 条记录 (耗时 0.036 秒)

    Proximity guided data discovery
    1.
    发明授权
    Proximity guided data discovery 有权
    接近指导数据发现

    公开(公告)号：US08073978B2

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

    申请号：US12490811

    申请日：2009-06-24

    申请人： Sudipta Sengupta ,  Jin Li ,  Vijay Vasudevan

    发明人： Sudipta Sengupta ,  Jin Li ,  Vijay Vasudevan

    IPC分类号： G06F15/16 ,  H04L12/28

    CPC分类号： G06F17/30864

    摘要： Techniques are described for sharing content among peers. Locality domains are treated as first order network units. Content is located at the level of a locality domain using a hierarchical DHT in which nodes correspond to locality domains. A peer searches for a given piece of content in a proximity guided manner and terminates at the earliest locality domain (in the hierarchy) which has the content. Locality domains are organized into hierarchical clusters based on their proximity.

    摘要翻译： 描述了在对等体之间共享内容的技术。 地点域被视为一级网络单位。 内容位于使用层级DHT的位置级别的级别，其中节点对应于位置域。 对等体以邻近指导的方式搜索给定的内容，并且在具有内容的最早的位置域（在层次结构中）终止。 基于它们的邻近度，地域被组织成分级集群。

    Content Aware Chunking for Achieving an Improved Chunk Size Distribution
    5.
    发明申请
    Content Aware Chunking for Achieving an Improved Chunk Size Distribution 有权
    用于实现改进的块大小分布的内容意识分块

    公开(公告)号：US20130054544A1

    公开(公告)日：2013-02-28

    申请号：US13222198

    申请日：2011-08-31

    申请人： Jin Li ,  Sudipta Sengupta ,  Sanjeev Mehrotra ,  Ran Kalach ,  Paul Adrian Oltean

    发明人： Jin Li ,  Sudipta Sengupta ,  Sanjeev Mehrotra ,  Ran Kalach ,  Paul Adrian Oltean

    IPC分类号： G06F7/00

    CPC分类号： G06F7/00 ,  G06F3/0608 ,  G06F3/0641 ,  G06F3/0674 ,  G06F11/1004 ,  G06F17/30159

    摘要： The subject disclosure is directed towards partitioning a file into chunks that satisfy a chunk size restriction, such as maximum and minimum chunk sizes, using a sliding window. For file positions within the chunk size restriction, a signature representative of a window fingerprint is compared with a target pattern, with a chunk boundary candidate identified if matched. Other signatures and patterns are then checked to determine a highest ranking signature (corresponding to a lowest numbered Rule) to associate with that chunk boundary candidate, or set an actual boundary if the highest ranked signature is matched. If the maximum chunk size is reached without matching the highest ranked signature, the chunking mechanism regresses to set the boundary based on the candidate with the next highest ranked signature (if no candidates, the boundary is set at the maximum). Also described is setting chunk boundaries based upon pattern detection (e.g., runs of zeros).

    摘要翻译： 本发明涉及使用滑动窗口将文件分成满足块大小限制的块，例如最大和最小块大小。 对于块大小限制内的文件位置，将窗口指纹的签名代表与目标模式进行比较，如果匹配则识别出块边界候选。 然后检查其他签名和模式以确定与该块块边界候选者相关联的最高排名签名（对应于最小编号的规则），或者如果最高排名签名匹配则设置实际边界。 如果没有匹配最高排名的签名达到最大块大小，则分块机制基于具有下一个最高排名的签名的候选者（如果没有候选，边界被设置为最大）而退化以设置边界。 还描述了基于模式检测（例如，零的运行）设置块边界。

    CONGESTION CONTROL FOR DELAY SENSITIVE APPLICATIONS
    7.
    发明申请
    CONGESTION CONTROL FOR DELAY SENSITIVE APPLICATIONS 有权
    延迟敏感应用的约束控制

    公开(公告)号：US20110216648A1

    公开(公告)日：2011-09-08

    申请号：US12762016

    申请日：2010-04-16

    申请人： Sanjeev Mehrotra ,  Tong L. Wynn ,  Jin Li ,  Sudipta Sengupta

    发明人： Sanjeev Mehrotra ,  Tong L. Wynn ,  Jin Li ,  Sudipta Sengupta

    IPC分类号： H04L12/56 ,  H04L12/26

    CPC分类号： H04L47/25 ,  H04L47/22 ,  H04L47/2416 ,  H04L47/29 ,  H04L47/30

    摘要： In various embodiments, methods and systems are disclosed for a hybrid rate plus window based congestion protocol that controls the rate of packet transmission into the network and provides low queuing delay, practically zero packet loss, fair allocation of network resources amongst multiple flows, and full link utilization. In one embodiment, a congestion window may be used to control the maximum number of outstanding bits, a transmission rate may be used to control the rate of packets entering the network (packet pacing), a queuing delay based rate update may be used to control queuing delay within tolerated bounds and minimize packet loss, and aggressive ramp-up/graceful back-off may be used to fully utilize the link capacity and additive-increase, multiplicative-decrease (AIMD) rate control may be used to provide fairness amongst multiple flows.

    摘要翻译： 在各种实施例中，公开了用于混合速率加上基于窗口的拥塞协议的方法和系统，其控制到网络的分组传输速率并提供低排队延迟，实际上零分组丢失，多个流之间的网络资源的公平分配以及全部 链接利用率。 在一个实施例中，可以使用拥塞窗口来控制未完成比特的最大数量，可以使用传输速率来控制进入网络的分组的速率（分组起搏），基于排队延迟的速率更新可以用于控制 可以利用容忍范围内的排队延迟并尽可能减少分组丢失，并且可以使用积极的提升/优雅退避来充分利用链路容量，并且可以使用加法增加乘法减少（AIMD）速率控制来提供多个 流动。

    Rate-controllable peer-to-peer data stream routing
    8.
    发明授权
    Rate-controllable peer-to-peer data stream routing 有权
    速率可控的对等数据流路由

    公开(公告)号：US07636789B2

    公开(公告)日：2009-12-22

    申请号：US11945306

    申请日：2007-11-27

    申请人： Jin Li ,  Sudipta Sengupta ,  Miroslav Ponec ,  Minghua Chen ,  Philip A. Chou

    发明人： Jin Li ,  Sudipta Sengupta ,  Miroslav Ponec ,  Minghua Chen ,  Philip A. Chou

    IPC分类号： G06F15/173 ,  G06F15/16

    CPC分类号： H04L67/104 ,  H04L65/80 ,  H04L67/1085

    摘要： Difficulties associated with choosing advantageous network routes between server and clients are mitigated by a routing system that is devised to use many routing path sets, where respective sets comprise a number of routing paths covering all of the clients, including through other clients. A server may then apportion a data stream among all of the routing path sets. The server may also detect the performance of the computer network while sending the data stream between clients, and may adjust the apportionment of the routing path sets including the route. The clients may also be configured to operate as servers of other data streams, such as in a videoconferencing session, for example, and may be configured to send detected route performance information along with the portions of the various data streams.

    摘要翻译： 通过设计为使用许多路由路径集的路由系统来减轻与服务器和客户端之间选择有利的网络路由相关联的困难，其中相应的集合包括覆盖所有客户端的多个路由路径，包括通过其他客户端。 然后，服务器可以在所有路由路径集之间分配数据流。 服务器还可以在客户端之间发送数据流时检测计算机网络的性能，并且可以调整包括路由的路由路径集合的分配。 客户端还可以被配置为例如在视频会议会话中作为其他数据流的服务器操作，并且可以被配置为发送检测到的路由性能信息以及各种数据流的部分。

    MULTIMODAL OBJECT DE-DUPLICATION
    9.
    发明申请
    MULTIMODAL OBJECT DE-DUPLICATION 审中-公开
    多目标对象去重复

    公开(公告)号：US20090204636A1

    公开(公告)日：2009-08-13

    申请号：US12028840

    申请日：2008-02-11

    申请人： Jin Li ,  Li-wei He ,  Sudipta Sengupta ,  Amitanand Aiyer

    发明人： Jin Li ,  Li-wei He ,  Sudipta Sengupta ,  Amitanand Aiyer

    IPC分类号： G06F17/30

    CPC分类号： G06F16/174 ,  G06F16/137

    摘要： Various object de-duplication techniques may be applied to object systems (such as to files in a file store) to identify similar or identical objects or portions thereof, so that duplicate objects or object portions may be associated with one copy, and the duplicate copies may be removed. However, an object de-duplication technique that is suitable for de-duplicating one type of object may be inefficient for de-duplicating another type of object; e.g., a de-duplication method that significantly condenses sets of small objects may achieve very little condensation among sets of large objects, and vice versa. A multimodal approach to object de-duplication may be devised that analyzes an object to be stored and chooses a de-duplication technique that is likely to be effective for storing the object. The object index may be configured to support several de-duplication schemes for indexing and storing many types of objects in a space-economizing manner.

    摘要翻译： 各种对象重复数据删除技术可以应用于对象系统（诸如文件存储中的文件）以识别类似或相同的对象或其部分，使得重复对象或对象部分可以与一个副本相关联，并且副本 可能被删除。 然而，适合于重复一种类型的对象的对象重复数据删除技术可能对于重复另一类型的对象而言是低效的; 例如，重复数字删除方法，显着地凝缩小物体的集合可以在大对象的集合之间实现非常少的冷凝，反之亦然。 可以设计用于对象重复数据删除的多模式方法，其分析要存储的对象，并且选择可能对存储对象有效的重复数据删除技术。 对象索引可以被配置为支持几种重复数据删除方案，用于以空间节省的方式索引和存储许多类型的对象。

    Adaptive index for data deduplication
    10.
    发明授权
    Adaptive index for data deduplication 有权

    公开(公告)号：US09639543B2

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

    申请号：US12979681

    申请日：2010-12-28

    申请人： Jin Li ,  Sudipta Sengupta

    发明人： Jin Li ,  Sudipta Sengupta

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30097 ,  G06F17/3007 ,  G06F17/30159

    摘要： The subject disclosure is directed towards a data deduplication technology in which a hash index service's index and/or indexing operations are adaptable to balance deduplication performance savings, throughput and resource consumption. The indexing service may employ hierarchical chunking using different levels of granularity corresponding to chunk size, a sampled compact index table that contains compact signatures for less than all of the hash index's (or subspace's) hash values, and/or selective subspace indexing based on similarity of a subspace's data to another subspace's data and/or to incoming data chunks.