-
公开(公告)号：US20100082838A1
公开(公告)日：2010-04-01
申请号：US12242913
申请日：2008-09-30
申请人： Jiajun Wang , Cheng Huang , Sudipta Sengupta , Jin Li
发明人： Jiajun Wang , Cheng Huang , Sudipta Sengupta , Jin Li
IPC分类号： G06F15/16
CPC分类号： H04L47/19 , H04L47/10 , H04L47/12 , H04L47/25 , H04L67/104
摘要： An ISP-friendly rate allocation system and method that reduces network traffic across ISP boundaries in a peer-to-peer (P2P) network, Embodiments of the system and method continuously solve a global optimization problem and dictate accordingly how much bandwidth is allocated on each connection. Embodiments of the system and method minimize load on a server in communication with the P2P network, minimize ISP-unfriendly traffic while keeping the minimum server load unaffected, and maximize peer prefetching. Two different techniques are used to compute rate allocation, including a utility function optimization technique and a minimum cost flow formulation technique. The utility function optimization technique constructs a utility function and optimizes that utility function. The minimum cost flow formulation technique generates a minimum cost flow formulation using a bipartite graph have a vertices set and an edges set. A distributed minimum cost flow formulation is solved using Lagrangian multipliers.
摘要翻译： 一种ISP友好的速率分配系统和方法，可减少对等（P2P）网络中ISP边界的网络流量，系统和方法的实施方案不断解决全局优化问题，并据此规定每个网络上分配多少带宽 连接。 系统和方法的实施例最小化与P2P网络通信的服务器上的负载，从而最小化ISP不友好的业务，同时保持最小服务器负载不受影响，并最大化对等体预取。 使用两种不同的技术来计算速率分配，包括效用函数优化技术和最低成本流量制定技术。 效用函数优化技术构建效用函数并优化该效用函数。 最小成本流量制定技术使用具有顶点集合和边集合的二分图生成最小成本流程公式。 使用拉格朗日乘数解决分布式最小成本流公式。
-
公开(公告)号：US08082358B2
公开(公告)日：2011-12-20
申请号：US12242913
申请日：2008-09-30
申请人： Jiajun Wang , Cheng Huang , Sudipta Sengupta , Jin Li
发明人： Jiajun Wang , Cheng Huang , Sudipta Sengupta , Jin Li
IPC分类号： G06F15/16
CPC分类号： H04L47/19 , H04L47/10 , H04L47/12 , H04L47/25 , H04L67/104
摘要： An ISP-friendly rate allocation system and method that reduces network traffic across ISP boundaries in a peer-to-peer (P2P) network, Embodiments of the system and method continuously solve a global optimization problem and dictate accordingly how much bandwidth is allocated on each connection. Embodiments of the system and method minimize load on a server in communication with the P2P network, minimize ISP-unfriendly traffic while keeping the minimum server load unaffected, and maximize peer prefetching. Two different techniques are used to compute rate allocation, including a utility function optimization technique and a minimum cost flow formulation technique. The utility function optimization technique constructs a utility function and optimizes that utility function. The minimum cost flow formulation technique generates a minimum cost flow formulation using a bipartite graph have a vertices set and an edges set. A distributed minimum cost flow formulation is solved using Lagrangian multipliers.
摘要翻译： 一种ISP友好的速率分配系统和方法，可减少对等（P2P）网络中ISP边界的网络流量，系统和方法的实施方案不断解决全局优化问题，并据此规定每个网络上分配多少带宽 连接。 系统和方法的实施例最小化与P2P网络通信的服务器上的负载，从而最小化ISP不友好的业务，同时保持最小服务器负载不受影响，并最大化对等体预取。 使用两种不同的技术来计算速率分配，包括效用函数优化技术和最低成本流量制定技术。 效用函数优化技术构建效用函数并优化该效用函数。 最小成本流量制定技术使用具有顶点集合和边集合的二分图生成最小成本流程公式。 使用拉格朗日乘数解决分布式最小成本流公式。
-
公开(公告)号：US20130346672A1
公开(公告)日：2013-12-26
申请号：US13531455
申请日：2012-06-22
CPC分类号： G06F12/0871 , G06F12/0897 , G06F12/12
摘要： The subject disclosure is directed towards a multi-tiered cache having cache tiers with different access properties. Objects are written to a selected a tier of the cache based upon object-related properties and/or cache-related properties. In one aspect, objects are stored in an active log among a plurality of logs. The active log is sealed upon reaching a target size, with a new active log opened. Garbage collecting is performed on a sealed log, such as the sealed log with the most garbage therein.
摘要翻译： 主题公开针对具有不同访问属性的高速缓存层的多层缓存。 基于对象相关属性和/或缓存相关属性，将对象写入高速缓存的选定层。 在一个方面，对象被存储在多个日志中的活动日志中。 活动日志在达到目标大小时被打开，新的活动日志打开。 垃圾收集是在密封的日志上进行的，例如其中垃圾最多的密封日志。
-
公开(公告)号：US20130263151A1
公开(公告)日：2013-10-03
申请号：US13438465
申请日：2012-04-03
IPC分类号： G06F9/46
CPC分类号： G06F9/5083
摘要： Described is a technology by which a consistent hashing table of bins maintains values representing nodes of a distributed system. An assignment stage uses a consistent hashing function and a selection algorithm to assign values that represent the nodes to the bins. In an independent mapping stage, a mapping mechanism deterministically maps an object identifier/key to one of the bins as a mapped-to bin.
摘要翻译： 描述了一种技术，通过该技术，一致的散列表的哈希表保持代表分布式系统的节点的值。 分配阶段使用一致的散列函数和选择算法来将表示节点的值分配给分组。 在独立的映射阶段，映射机制确定性地将对象标识符/密钥映射到一个存储区，作为映射到bin。
-
公开(公告)号：US09298604B2
公开(公告)日：2016-03-29
申请号：US13919738
申请日：2013-06-17
申请人： Sudipta Sengupta , Biplob Kumar Debnath , Jin Li
发明人： Sudipta Sengupta , Biplob Kumar Debnath , Jin Li
CPC分类号： G06F12/0246 , G06F12/0866 , G06F12/0897 , G06F12/123 , G06F2212/222 , G11C7/1072
摘要： Described is using flash memory, RAM-based data structures and mechanisms to provide a flash store for caching data items (e.g., key-value pairs) in flash pages. A RAM-based index maps data items to flash pages, and a RAM-based write buffer maintains data items to be written to the flash store, e.g., when a full page can be written. A recycle mechanism makes used pages in the flash store available by destaging a data item to a hard disk or reinserting it into the write buffer, based on its access pattern. The flash store may be used in a data deduplication system, in which the data items comprise chunk-identifier, metadata pairs, in which each chunk-identifier corresponds to a hash of a chunk of data that indicates. The RAM and flash are accessed with the chunk-identifier (e.g., as a key) to determine whether a chunk is a new chunk or a duplicate.
-
公开(公告)号：US09053032B2
公开(公告)日：2015-06-09
申请号：US12979644
申请日：2010-12-28
CPC分类号： G06F12/0862 , G06F12/0866 , G06F17/30159
摘要： The subject disclosure is directed towards a data deduplication technology in which a hash index service's index maintains a hash index in a secondary storage device such as a hard drive, along with a compact index table and look-ahead cache in RAM that operate to reduce the I/O to access the secondary storage device during deduplication operations. Also described is a session cache for maintaining data during a deduplication session, and encoding of a read-only compact index table for efficiency.
-
公开(公告)号：US08935487B2
公开(公告)日：2015-01-13
申请号：US12979669
申请日：2010-12-28
CPC分类号： G06F12/0862 , G06F12/0866 , G06F12/0897 , G06F17/30097 , G06F17/30159 , G06F2212/1024 , G06F2212/463 , G06F2212/466
摘要： The subject disclosure is directed towards a data deduplication technology in which a hash index service's index maintains a hash index in a secondary storage device such as a hard drive, along with a compact index table and look-ahead cache in RAM that operate to reduce the I/O to access the secondary storage device during deduplication operations. Also described is a session cache for maintaining data during a deduplication session, and encoding of a read-only compact index table for efficiency.
摘要翻译： 主题公开涉及一种数据重复数据删除技术，其中散列索引服务的索引在诸如硬盘驱动器的辅助存储设备中维护散列索引，以及RAM中的紧凑索引表和预先高速缓存，其操作以减少 I / O在重复数据消除操作期间访问辅助存储设备。 还描述了用于在重复数据删除会话期间维护数据的会话高速缓存，以及用于效率的只读压缩索引表的编码。
-
8.发明申请公开(公告)号：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).
摘要翻译： 本发明涉及使用滑动窗口将文件分成满足块大小限制的块，例如最大和最小块大小。 对于块大小限制内的文件位置，将窗口指纹的签名代表与目标模式进行比较，如果匹配则识别出块边界候选。 然后检查其他签名和模式以确定与该块块边界候选者相关联的最高排名签名（对应于最小编号的规则），或者如果最高排名签名匹配则设置实际边界。 如果没有匹配最高排名的签名达到最大块大小，则分块机制基于具有下一个最高排名的签名的候选者（如果没有候选，边界被设置为最大）而退化以设置边界。 还描述了基于模式检测（例如，零的运行）设置块边界。
-
公开(公告)号：US08073978B2
公开(公告)日：2011-12-06
申请号：US12490811
申请日：2009-06-24
申请人： Sudipta Sengupta , Jin Li , Vijay Vasudevan
发明人： Sudipta Sengupta , Jin Li , Vijay Vasudevan
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的位置级别的级别，其中节点对应于位置域。 对等体以邻近指导的方式搜索给定的内容，并且在具有内容的最早的位置域（在层次结构中）终止。 基于它们的邻近度，地域被组织成分级集群。
-
公开(公告)号：US20110276781A1
公开(公告)日：2011-11-10
申请号：US12979669
申请日：2010-12-28
IPC分类号： G06F12/08
CPC分类号： G06F12/0862 , G06F12/0866 , G06F12/0897 , G06F17/30097 , G06F17/30159 , G06F2212/1024 , G06F2212/463 , G06F2212/466
摘要： The subject disclosure is directed towards a data deduplication technology in which a hash index service's index maintains a hash index in a secondary storage device such as a hard drive, along with a compact index table and look-ahead cache in RAM that operate to reduce the I/O to access the secondary storage device during deduplication operations. Also described is a session cache for maintaining data during a deduplication session, and encoding of a read-only compact index table for efficiency.
摘要翻译： 主题公开涉及一种数据重复数据删除技术，其中散列索引服务的索引在诸如硬盘驱动器的辅助存储设备中维护散列索引，以及RAM中的紧凑索引表和预先高速缓存，其操作以减少 I / O在重复数据消除操作期间访问辅助存储设备。 还描述了用于在重复数据删除会话期间维护数据的会话高速缓存，以及用于效率的只读压缩索引表的编码。
-
-
-
-
-
-
-
-
-
搜索结果
413 条记录 (耗时 0.033 秒)