公开(公告)号：US08645799B2

公开(公告)日：2014-02-04

申请号：US12983225

申请日：2010-12-31

Applicant: Jin Li ,  Viveck Cadambe ,  Cheng Huang

Inventor： Jin Li ,  Viveck Cadambe ,  Cheng Huang

IPC: G11C29/00

CPC classification number: G06F11/1076

Abstract: A random permutation code is described which provides efficient repair of data nodes. A specific implementation of a permutation code is also described, followed by description of a MISER-Permutation code. Finally, an optimal repair strategy is explained that involves an iterative process of downloading the most effective available parity data, updating costs of remaining parity data, and repeating until the data is recovered.

Abstract translation: 描述了提供数据节点的有效修复的随机置换代码。 还描述了置换代码的具体实现，随后描述了MISER置换代码。 最后，解释了最佳修复策略，其涉及下载最有效的可用奇偶校验数据，更新剩余奇偶校验数据的成本并重复直到数据恢复的迭代过程。

公开(公告)号：US20120173932A1

公开(公告)日：2012-07-05

申请号：US12983225

申请日：2010-12-31

Applicant: Jin Li ,  Viveck Cadambe ,  Cheng Huang

Inventor： Jin Li ,  Viveck Cadambe ,  Cheng Huang

IPC: G06F11/34

CPC classification number: G06F11/1076

Abstract: A random permutation code is described which provides efficient repair of data nodes. A specific implementation of a permutation code is also described, followed by description of a MISER-Permutation code. Finally, an optimal repair strategy is explained that involves an iterative process of downloading the most effective available parity data, updating costs of remaining parity data, and repeating until the data is recovered.

Abstract translation: 描述了提供数据节点的有效修复的随机置换代码。 还描述了置换代码的具体实现，随后描述了MISER置换代码。 最后，解释了最佳修复策略，其涉及下载最有效的可用奇偶校验数据，更新剩余奇偶校验数据的成本并重复直到数据恢复的迭代过程。

公开(公告)号：US09237105B2

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

申请号：US12632834

申请日：2009-12-08

Applicant: Cheng Huang ,  Manish Jain ,  Jin Li ,  Amit Kumar Mondal ,  Aleksandar Kuzmanovic

Inventor： Cheng Huang ,  Manish Jain ,  Jin Li ,  Amit Kumar Mondal ,  Aleksandar Kuzmanovic

IPC: H04L12/801 ,  H04L1/00 ,  H04L1/08 ,  H04L12/853 ,  H04L12/825 ,  H04L12/811

CPC classification number: H04L47/14 ,  H04L1/0009 ,  H04L1/0018 ,  H04L1/0057 ,  H04L1/08 ,  H04L47/2416 ,  H04L47/26 ,  H04L47/38 ,  H04L2001/0097

Abstract: Described is a technology by which a relay is coupled (e.g., by a wire) to a network and (e.g., by a wireless link) to an endpoint. Incoming data packets directed towards the endpoint are processed by the relay according to an error correction scheme, such as one that replicates packets. The reprocessed packets, which in general are more robust against packet loss, are then sent to the endpoint. For outgoing data packets received from the endpoint, the relay reprocesses the outgoing packets based upon the error correction scheme, such as to remove redundant packets before transmitting them to the network over the wire. Also described are various error correction schemes, and various types of computing devices that may be used as relays. The relay may be built into the network infrastructure, and/or a directory service may be employed to automatically find a suitable relay node for an endpoint device.

Abstract translation: 描述了一种技术，通过该技术将中继器（例如，通过有线）耦合到网络，并且（例如，通过无线链路）耦合到端点。 根据诸如复制分组的错误校正方案，继电器处理针对端点的进入数据分组。 然后将再处理的数据包（通常对数据包丢失更加鲁棒）发送到端点。 对于从端点接收到的输出数据分组，中继器基于纠错方案重新处理输出分组，例如在通过线路将其发送到网络之前去除冗余分组。 还描述了各种错误校正方案以及可以用作中继的各种类型的计算设备。 可以将中继器内置到网络基础设施中，和/或可以采用目录服务来自动地为端点设备找到合适的中继节点。

公开(公告)号：US08898292B2

公开(公告)日：2014-11-25

申请号：US13219581

申请日：2011-08-26

Applicant: Cheng Huang ,  David A. Maltz ,  Jin Li ,  Ming Zhang ,  Chao Zhang ,  Keith W. Ross

Inventor： Cheng Huang ,  David A. Maltz ,  Jin Li ,  Ming Zhang ,  Chao Zhang ,  Keith W. Ross

IPC: G06F15/173 ,  H04L29/06 ,  H04L29/12

CPC classification number: H04L61/1511 ,  H04L63/12 ,  H04L63/1408 ,  H04L2463/146

Abstract: A plurality of network addresses from a distributed client is obtained, at least a first portion of the obtained network addresses including resolved network address responses to distributed client requests for resolved network addresses corresponding to one or more network location indicators associated with a first web service. Test content is obtained, based on one or more of the network addresses included in the first portion. It is determined whether the obtained test content includes unauthorized content.

Abstract translation: 获得来自分布式客户端的多个网络地址，所获得的网络地址的至少第一部分包括对分配的客户端请求的分辨的网络地址响应，所述解析的网络地址对应于与第一web服务相关联的一个或多个网络位置指示符。 基于包括在第一部分中的一个或多个网络地址获得测试内容。 确定所获得的测试内容是否包括未授权的内容。

公开(公告)号：US20130263151A1

公开(公告)日：2013-10-03

申请号：US13438465

申请日：2012-04-03

Applicant: Jin Li ,  Cheng Huang ,  Sudipta Sengupta ,  Christopher Broder Wilson

Inventor： Jin Li ,  Cheng Huang ,  Sudipta Sengupta ,  Christopher Broder Wilson

IPC: G06F9/46

CPC classification number: G06F9/5083

Abstract: 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.

Abstract translation: 描述了一种技术，通过该技术，一致的散列表的哈希表保持代表分布式系统的节点的值。 分配阶段使用一致的散列函数和选择算法来将表示节点的值分配给分组。 在独立的映射阶段，映射机制确定性地将对象标识符/密钥映射到一个存储区，作为映射到bin。

公开(公告)号：US08209577B2

公开(公告)日：2012-06-26

申请号：US11961866

申请日：2007-12-20

Applicant: Cheng Huang ,  Jin Li ,  Minghua Chen

Inventor： Cheng Huang ,  Jin Li ,  Minghua Chen

IPC: H03M13/00

CPC classification number: H03M13/033 ,  H03M13/1515 ,  H03M13/373 ,  H03M13/611 ,  H03M13/6502

Abstract: A “code optimizer” provides various techniques for optimizing arbitrary XOR-based codes for encoding and/or decoding of data. Further, the optimization techniques enabled by the code optimizer do not depend on any underlining code structure. Therefore, the optimization techniques provided by the code optimizer are applicable to arbitrary codes with arbitrary redundancy. As such, the optimized XOR-based codes generated by the code optimizer are more flexible than specially designed codes, and allow for any desired level of fault tolerance. Typical uses of XOR-based codes include, for example, encoding and/or decoding data using redundant data packets for data transmission real-time communications systems, encoding and/or decoding operations for storage systems such as RAID arrays, etc.

Abstract translation: “代码优化器”提供了用于优化用于对数据进行编码和/或解码的任意基于XOR的代码的各种技术。 此外，由代码优化器启用的优化技术不依赖于任何下划线的代码结构。 因此，代码优化器提供的优化技术适用于任意冗余的任意代码。 因此，由代码优化器生成的优化的基于XOR的代码比特别设计的代码更灵活，并允许任何期望的容错级别。 基于XOR的代码的典型用途包括例如使用用于数据传输实时通信系统的冗余数据分组来编码和/或解码数据，用于存储系统例如RAID阵列等的编码和/或解码操作。

公开(公告)号：US20120128010A1

公开(公告)日：2012-05-24

申请号：US12951908

申请日：2010-11-22

Applicant: Cheng Huang ,  Jin Li ,  Sanjeev Mehrotra ,  Philip A. Chou ,  Felix Livni ,  Hao Chen ,  Jay Thaler ,  Chao Zhang ,  Keith W. Ross

Inventor： Cheng Huang ,  Jin Li ,  Sanjeev Mehrotra ,  Philip A. Chou ,  Felix Livni ,  Hao Chen ,  Jay Thaler ,  Chao Zhang ,  Keith W. Ross

IPC: H04J3/22

CPC classification number: H04L1/0009 ,  H04L1/1812 ,  H04L1/188

Abstract: A method and system that enhances a user's performance while interacting with an interactive internet application such as a Massively Multiplayer Online (MMO) game is provided. The network latency experienced by users participating in the MMO game is minimized by dynamically determining an optimal transmission action for a message generated by the MMO game. In one embodiment, determining the optimal transmission action for a message includes dynamically determining the optimal number of redundant Forward Error Correction (FEC) packets to add to a message prior to transmitting a message to a receiving device. The optimal number of FEC packets is determined based on a wide range of varying network conditions.

Abstract translation: 提供了一种在与诸如大型多人在线（MMO）游戏之类的交互式互联网应用交互的同时增强用户表现的方法和系统。 通过动态地确定由MMO游戏产生的消息的最佳传输动作，使参与MMO游戏的用户经历的网络延迟最小化。 在一个实施例中，确定消息的最佳传输动作包括在将消息发送到接收设备之前动态地确定要添加到消息的冗余前向纠错（FEC）分组的最佳数量。 基于广泛的变化的网络条件来确定FEC分组的最佳数量。

公开(公告)号：US20100082838A1

公开(公告)日：2010-04-01

申请号：US12242913

申请日：2008-09-30

Applicant: Jiajun Wang ,  Cheng Huang ,  Sudipta Sengupta ,  Jin Li

Inventor： Jiajun Wang ,  Cheng Huang ,  Sudipta Sengupta ,  Jin Li

IPC: G06F15/16

CPC classification number: H04L47/19 ,  H04L47/10 ,  H04L47/12 ,  H04L47/25 ,  H04L67/104

Abstract: 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.

Abstract translation: 一种ISP友好的速率分配系统和方法，可减少对等（P2P）网络中ISP边界的网络流量，系统和方法的实施方案不断解决全局优化问题，并据此规定每个网络上分配多少带宽 连接。 系统和方法的实施例最小化与P2P网络通信的服务器上的负载，从而最小化ISP不友好的业务，同时保持最小服务器负载不受影响，并最大化对等体预取。 使用两种不同的技术来计算速率分配，包括效用函数优化技术和最低成本流量制定技术。 效用函数优化技术构建效用函数并优化该效用函数。 最小成本流量制定技术使用具有顶点集合和边集合的二分图生成最小成本流程公式。 使用拉格朗日乘数解决分布式最小成本流公式。

公开(公告)号：US20070206610A1

公开(公告)日：2007-09-06

申请号：US11275177

申请日：2005-12-16

Applicant: Dan Teodosiu ,  Philip Chou ,  Alexandra Heron ,  Cheng Huang ,  Tom Kleinpeter ,  Jin Li ,  Eyal Schwartz ,  John Spivey ,  David Steere

Inventor： Dan Teodosiu ,  Philip Chou ,  Alexandra Heron ,  Cheng Huang ,  Tom Kleinpeter ,  Jin Li ,  Eyal Schwartz ,  John Spivey ,  David Steere

IPC: H04L12/56 ,  H04J3/06

CPC classification number: H04L67/325 ,  H04L67/06 ,  H04L67/104 ,  H04L67/1044 ,  H04L67/1095 ,  H04W76/14

Abstract: Various embodiments can utilize a distributed solution for scheduling connections between peers in a file sharing environment. In accordance with at least some embodiments, individual nodes in a peer-to-peer system include scheduling software that enables the nodes to make scheduling decisions with regard to how, when and where connections are made with other peers. Scheduling decisions can be based on a number of different parameters. In at least some embodiments, a synchronization negotiation manager is embodied with logic that drives the negotiation and scheduling process. This logic is represented by an innovative state machine that is designed to implement the negotiation and synchronization process.

Abstract translation: 各种实施例可以利用分布式解决方案来调度文件共享环境中的对等体之间的连接。 根据至少一些实施例，对等系统中的单个节点包括调度软件，其使节点能够就如何，何时何地与其他对等体进行连接做出调度决定。 调度决定可以基于许多不同的参数。 在至少一些实施例中，同步协商管理器具有驱动协商和调度过程的逻辑。 该逻辑由创新的状态机表示，旨在实现协商和同步过程。

公开(公告)号：US09059817B2

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

申请号：US12951908

申请日：2010-11-22

Applicant: Cheng Huang ,  Jin Li ,  Sanjeev Mehrotra ,  Philip A. Chou ,  Felix Livni ,  Hao Chen ,  Jay Thaler ,  Chao Zhang ,  Keith W. Ross

Inventor： Cheng Huang ,  Jin Li ,  Sanjeev Mehrotra ,  Philip A. Chou ,  Felix Livni ,  Hao Chen ,  Jay Thaler ,  Chao Zhang ,  Keith W. Ross

IPC: H04J3/16 ,  H04L12/26 ,  H04J3/00 ,  H04L1/00 ,  H04L1/18

CPC classification number: H04L1/0009 ,  H04L1/1812 ,  H04L1/188

Abstract: A method and system that enhances a user's performance while interacting with an interactive internet application such as a Massively Multiplayer Online (MMO) game is provided. The network latency experienced by users participating in the MMO game is minimized by dynamically determining an optimal transmission action for a message generated by the MMO game. In one embodiment, determining the optimal transmission action for a message includes dynamically determining the optimal number of redundant Forward Error Correction (FEC) packets to add to a message prior to transmitting a message to a receiving device. The optimal number of FEC packets is determined based on a wide range of varying network conditions.

Abstract translation: 提供了一种在与诸如大型多人在线（MMO）游戏之类的交互式互联网应用交互的同时增强用户表现的方法和系统。 通过动态地确定由MMO游戏产生的消息的最佳传输动作，使参与MMO游戏的用户经历的网络延迟最小化。 在一个实施例中，确定消息的最佳传输动作包括在将消息发送到接收设备之前动态地确定要添加到消息的冗余前向纠错（FEC）分组的最佳数量。 基于广泛的变化的网络条件来确定FEC分组的最佳数量。