公开(公告)号：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置换代码。 最后，解释了最佳修复策略，其涉及下载最有效的可用奇偶校验数据，更新剩余奇偶校验数据的成本并重复直到数据恢复的迭代过程。

公开(公告)号：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置换代码。 最后，解释了最佳修复策略，其涉及下载最有效的可用奇偶校验数据，更新剩余奇偶校验数据的成本并重复直到数据恢复的迭代过程。

公开(公告)号：US08732268B2

公开(公告)日：2014-05-20

申请号：US13090022

申请日：2011-04-19

Applicant: Cheng Huang ,  Ivan Ivanov Batanov ,  Jin Li

Inventor： Cheng Huang ,  Ivan Ivanov Batanov ,  Jin Li

IPC: G06F15/16

CPC classification number: H04L61/609 ,  H04L47/12 ,  H04L61/1511 ,  H04L61/301 ,  H04L61/305 ,  H04L67/1002

Abstract: A particular method includes receiving a request from a client at a server and sending a global traffic management identifier in response to the request from the client. The global traffic management identifier is determined based on an attribute of the client. In response to the client requesting access to a service based on a modified hostname of the service, a data center associated with the service is identified based on the modified hostname of the service. The modified hostname identifies the global traffic management identifier, and the identified data center is useable by the client to access the service.

Abstract translation: 特定方法包括从服务器的客户端接收请求，并响应于来自客户端的请求发送全局流量管理标识符。 基于客户端的属性来确定全局流量管理标识符。 响应于客户端基于服务的修改的主机名请求对服务的访问，基于服务的修改的主机名来识别与该服务相关联的数据中心。 修改的主机名标识全局流量管理标识符，并且所识别的数据中心可由客户端访问该服务。

公开(公告)号：US20130054782A1

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

申请号：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

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服务相关联的一个或多个网络位置指示符。 基于包括在第一部分中的一个或多个网络地址获得测试内容。 确定所获得的测试内容是否包括未授权的内容。

公开(公告)号：US20120271909A1

公开(公告)日：2012-10-25

申请号：US13090022

申请日：2011-04-19

Applicant: Cheng Huang ,  Ivan Ivanov Batanov ,  Jin Li

Inventor： Cheng Huang ,  Ivan Ivanov Batanov ,  Jin Li

IPC: G06F15/16

CPC classification number: H04L61/609 ,  H04L47/12 ,  H04L61/1511 ,  H04L61/301 ,  H04L61/305 ,  H04L67/1002

Abstract: A particular method includes receiving a request from a client at a server and sending a global traffic management identifier in response to the request from the client. The global traffic management identifier is determined based on an attribute of the client. In response to the client requesting access to a service based on a modified hostname of the service, a data center associated with the service is identified based on the modified hostname of the service. The modified hostname identifies the global traffic management identifier, and the identified data center is useable by the client to access the service.

Abstract translation: 特定方法包括从服务器的客户端接收请求，并响应于来自客户端的请求发送全局流量管理标识符。 基于客户端的属性来确定全局流量管理标识符。 响应于客户端基于服务的修改的主机名请求对服务的访问，基于服务的修改的主机名来识别与该服务相关联的数据中心。 修改的主机名标识全局流量管理标识符，并且所识别的数据中心可由客户端访问该服务。

公开(公告)号：US20110119370A1

公开(公告)日：2011-05-19

申请号：US12619711

申请日：2009-11-17

Applicant: Cheng Huang ,  Jin Li ,  Felix D. Livni ,  Gary W. Hall ,  Yunxian A. Wang ,  Keith Wimberly Ross

Inventor： Cheng Huang ,  Jin Li ,  Felix D. Livni ,  Gary W. Hall ,  Yunxian A. Wang ,  Keith Wimberly Ross

IPC: G06F15/173 ,  G21C17/00

CPC classification number: H04L43/14 ,  H04L43/0829 ,  H04L43/0864 ,  H04L43/0888

Abstract: Described is a technology by which a content server downloads an active content measuring tool object to a client request for a page. When loaded, the measuring tool object makes network measurements, including by direct socket access, and return measurement results. As part of its operations, the measuring tool object may request measurement assignments from a central controller, and/or return those results to the central controller. Measurement assignments may be directed towards determining a round trip time/latency, measuring throughput, packet loss rate, detecting in-fight modification of content and/or detecting the presence of a middle box, including the presence of a caching proxy server middle box. The measurement results may be used to evaluate hypothetical deployment of a number of servers and/or geographic locations for those servers.

Abstract translation: 描述了内容服务器将活动内容测量工具对象下载到客户端对页面的请求的技术。 加载时，测量工具对象进行网络测量，包括通过直接插座访问，并返回测量结果。 作为其操作的一部分，测量工具对象可以请求来自中央控制器的测量分配，和/或将这些结果返回给中央控制器。 测量分配可以用于确定往返时间/等待时间，测量吞吐量，丢包率，检测内容的修改和/或检测中间盒的存在，包括高速缓存代理服务器中间盒的存在。 测量结果可用于评估这些服务器的若干服务器和/或地理位置的假设部署。

公开(公告)号：US07930611B2

公开(公告)日：2011-04-19

申请号：US11684584

申请日：2007-03-09

Applicant: Cheng Huang ,  Minghua Chen ,  Jin Li

Inventor： Cheng Huang ,  Minghua Chen ,  Jin Li

IPC: H03M13/00

CPC classification number: H03M13/27 ,  H03M13/1191 ,  H03M13/15 ,  H03M13/1515 ,  H03M13/2906 ,  H03M13/2909 ,  H03M13/2918 ,  H03M13/2921 ,  H03M13/373

Abstract: A multiple protection group (MPG) erasure-resilient coding method for constructing MPG codes for encoding and decoding data. The MPG codes constructed herein protect data chunks of data in multiple protection groups and subgroups. In general, the MPG erasure-resilient codes are constructed by locating data chunks into multiple protection groups and assigning at least one parity chunk to each protection group. Basic MPG codes are constructed from existing Maximum Distance Separable (MDS) codes by splitting at least some of the parity chunks into local parities for each of the multiple protection groups and projecting local parities onto each of the groups. Generalized MPG codes have a Maximally Recoverable property that can be used to determine whether an erasure pattern is recoverable or unrecoverable. Generalized MPG codes can recover any erasure pattern that is recoverable.

Abstract translation: 一种用于构建用于对数据进行编码和解码的MPG代码的多重保护组（MPG）擦除弹性编码方法。 本文构建的MPG代码保护多个保护组和子组中的数据块数据。 通常，通过将数据块定位到多个保护组中并且将至少一个奇偶校验块分配给每个保护组来构建MPG擦除恢复代码。 通过将至少一些奇偶校验块分割成多个保护组中的每一个的本地奇偶校验，并将局部奇偶校验投影到每个组上，从现有的最大距离可分离（MDS）码构建基本MPG码。 广义MPG代码具有最大可恢复属性，可用于确定擦除模式是可恢复还是不可恢复。 广义MPG代码可以恢复可恢复的任何擦除模式。

公开(公告)号：US20080222481A1

公开(公告)日：2008-09-11

申请号：US11684589

申请日：2007-03-09

Applicant: Cheng Huang ,  Minghua Chen ,  Jin Li

Inventor： Cheng Huang ,  Minghua Chen ,  Jin Li

IPC: H03M13/00

CPC classification number: H03M13/2921 ,  H03M13/1191 ,  H03M13/15 ,  H03M13/1515 ,  H03M13/2703 ,  H03M13/2906 ,  H03M13/2909 ,  H03M13/2918

Abstract: A multiple protection group (MPG) erasure-resilient coding method for constructing MPG codes for encoding and decoding data. The MPG codes constructed herein protect data chunks of data in multiple protection groups and subgroups. In general, the MPG erasure-resilient codes are constructed by locating data chunks into multiple protection groups and assigning at least one parity chunk to each protection group. Basic MPG codes are constructed from existing Maximum Distance Separable (MDS) codes by splitting at least some of the parity chunks into local parities for each of the multiple protection groups and projecting local parities onto each of the groups. Generalized MPG codes have a Maximally Recoverable property that can be used to determine whether an erasure pattern is recoverable or unrecoverable. Generalized MPG codes can recover any erasure pattern that is recoverable.

Abstract translation: 一种用于构建用于对数据进行编码和解码的MPG代码的多重保护组（MPG）擦除弹性编码方法。 本文构建的MPG代码保护多个保护组和子组中的数据块数据。 通常，通过将数据块定位到多个保护组中并且将至少一个奇偶校验块分配给每个保护组来构建MPG擦除恢复代码。 通过将至少一些奇偶校验块分割成多个保护组中的每一个的本地奇偶校验，并将局部奇偶校验投影到每个组上，从现有的最大距离可分离（MDS）码构建基本MPG码。 广义MPG代码具有最大可恢复属性，可用于确定擦除模式是可恢复还是不可恢复。 广义MPG代码可以恢复可恢复的任何擦除模式。

公开(公告)号：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分组的最佳数量。

公开(公告)号：US08335163B2

公开(公告)日：2012-12-18

申请号：US12606882

申请日：2009-10-27

Applicant: Jin Li ,  Cheng Huang ,  Ye Wang ,  Richard R Yang

Inventor： Jin Li ,  Cheng Huang ,  Ye Wang ,  Richard R Yang

IPC: H04J1/16

CPC classification number: H04L43/12 ,  H04B17/24 ,  H04B17/309 ,  H04B17/382 ,  H04L43/10

Abstract: Techniques and technologies for routing communications based on Quality of Service (QOS) related information. More particularly, this document discloses techniques and technologies for selecting communications paths which partially overlap other communication paths for which QOS related information has been measured. The techniques and technologies include determining, performance levels for path segments within the communication paths from the measured QOS information.

Abstract translation: 基于服务质量（QOS）相关信息路由通信的技术和技术。 更具体地说，本文件公开了用于选择部分地与已经测量了QOS相关信息的其他通信路径重叠的通信路径的技术和技术。 技术和技术包括从测量的QOS信息确定通信路径内的路径段的性能水平。