公开(公告)号：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不友好的业务，同时保持最小服务器负载不受影响，并最大化对等体预取。 使用两种不同的技术来计算速率分配，包括效用函数优化技术和最低成本流量制定技术。 效用函数优化技术构建效用函数并优化该效用函数。 最小成本流量制定技术使用具有顶点集合和边集合的二分图生成最小成本流程公式。 使用拉格朗日乘数解决分布式最小成本流公式。

公开(公告)号：US20110134909A1

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

申请号：US12632834

申请日：2009-12-08

申请人： Cheng Huang ,  Manish Jain ,  Jin Li ,  Amit Kumar Mondal ,  Aleksandar Kuzmanovic

发明人： Cheng Huang ,  Manish Jain ,  Jin Li ,  Amit Kumar Mondal ,  Aleksandar Kuzmanovic

IPC分类号： H04L12/66

CPC分类号： H04L47/14 ,  H04L1/0009 ,  H04L1/0018 ,  H04L1/0057 ,  H04L1/08 ,  H04L47/2416 ,  H04L47/26 ,  H04L47/38 ,  H04L2001/0097

摘要： 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.

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

公开(公告)号：US20100153822A1

公开(公告)日：2010-06-17

申请号：US12335496

申请日：2008-12-15

申请人： Cheng Huang ,  Sanjeev Mehrotra ,  Jin Li ,  Xiping Zuo ,  Walid S.I. Ali ,  Regis J. Crinon ,  Ruchir Astavans

发明人： Cheng Huang ,  Sanjeev Mehrotra ,  Jin Li ,  Xiping Zuo ,  Walid S.I. Ali ,  Regis J. Crinon ,  Ruchir Astavans

IPC分类号： H03M13/05 ,  G06F11/10

CPC分类号： H03M13/134 ,  H03M13/373 ,  H04L1/0057

摘要： Construction and use of forward error correction codes is provided. A systematic MDS FEC code is obtained having a property wherein any set of contiguous or non-contiguous r packets can be lost during a data transmission of k data packets and r encoded packets and the original k packets can be recovered unambiguously. The systematic MDS FEC code is transformed into a (k+r, k) systematic MDS FEC code that guarantees at least one of the encoded packets is a parity packet. The starting systematic MDS FEC code may be Cauchy-based, and the transformation code derived from the starting Cauchy-based MDS FEC code allows for very efficient initialization, encoding and decoding operations.

摘要翻译： 提供前向纠错码的构造和使用。 获得具有属性的系统MDS FEC代码，其中在k个数据分组和r个编码分组的数据传输期间可能丢失任何一组连续的或不连续的r分组，并且可以明确地恢复原始k个分组。 系统MDS FEC码被变换为（k + r，k）系统MDS FEC码，其保证编码分组中的至少一个是奇偶校验分组。 起始的系统MDS FEC码可以是基于Cauchy的，并且从起始的基于Cauchy的MDS FEC码导出的变换码允许非常有效的初始化，编码和解码操作。

公开(公告)号：US20090164762A1

公开(公告)日：2009-06-25

申请号：US11961866

申请日：2007-12-20

申请人： Cheng Huang ,  Jin Li ,  Minghua Chen

发明人： Cheng Huang ,  Jin Li ,  Minghua Chen

IPC分类号： G06F9/305

CPC分类号： H03M13/033 ,  H03M13/1515 ,  H03M13/373 ,  H03M13/611 ,  H03M13/6502

摘要： 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.

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

公开(公告)号：US20080301214A1

公开(公告)日：2008-12-04

申请号：US11757987

申请日：2007-06-04

申请人： Jin Li ,  Cheng Huang

发明人： Jin Li ,  Cheng Huang

IPC分类号： G06F15/16

CPC分类号： H04L67/1021 ,  H04L67/1002 ,  H04L67/104 ,  H04L67/108 ,  H04L67/1089

摘要： An Internet Service Provider (ISP)-aware peer-to-peer (P2P) content exchange system and method for exchanging content over a P2P network using the Internet. The system and method accounts for the type of relationship between peers and classifies and groups each peer according to these relationships. A peer overlay is constructed such that peers within a peer's neighborhood are favored over those peers outside of the neighborhood. Peer scheduling is utilized to exchange information about the availability of blocks of content. This block availability information can be exchanged differently and its frequency changed depending on a peer's classification. Peers are selected for block exchange based on their classification. A peer selection proportion may be defined that dynamically changes depending on contents of a peer's download buffer. The blocks to be exchanged then are selected based on the block availability information, such that the rarest blocks are exchanged before the more common blocks.

摘要翻译： 互联网服务提供商（ISP） - 通过使用互联网的P2P网络交换内容的对等（P2P）内容交换系统和方法。 系统和方法考虑到对等体之间的关系类型，并根据这些关系对每个对等体进行分类和分组。 构建对等体覆盖层，使得对等体邻域内的对等体比在邻域外的那些对等体有利。 使用对等调度来交换关于内容块的可用性的信息。 该块可用性信息可以不同地交换，并且其频率根据对等体的分类而改变。 根据其分类，选择对等体进行块交换。 可以定义对等体选择比例，其根据对等体的下载缓冲器的内容动态地改变。 然后，基于块可用性信息来选择要交换的块，使得在更常见的块之前交换最少块。

公开(公告)号：US08996723B2

公开(公告)日：2015-03-31

申请号：US11757987

申请日：2007-06-04

申请人： Jin Li ,  Cheng Huang

发明人： Jin Li ,  Cheng Huang

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

CPC分类号： H04L67/1021 ,  H04L67/1002 ,  H04L67/104 ,  H04L67/108 ,  H04L67/1089

摘要： An Internet Service Provider (ISP)-aware peer-to-peer (P2P) content exchange system and method for exchanging content over a P2P network using the Internet. The system and method accounts for the type of relationship between peers and classifies and groups each peer according to these relationships. A peer overlay is constructed such that peers within a peer's neighborhood are favored over those peers outside of the neighborhood. Peer scheduling is utilized to exchange information about the availability of blocks of content. This block availability information can be exchanged differently and its frequency changed depending on a peer's classification. Peers are selected for block exchange based on their classification. A peer selection proportion may be defined that dynamically changes depending on contents of a peer's download buffer. The blocks to be exchanged then are selected based on the block availability information, such that the rarest blocks are exchanged before the more common blocks.

摘要翻译： 互联网服务提供商（ISP） - 通过使用互联网的P2P网络交换内容的对等（P2P）内容交换系统和方法。 系统和方法考虑到对等体之间的关系类型，并根据这些关系对每个对等体进行分类和分组。 构建对等层覆盖层，使得对等体邻域内的对等体比邻居外的那些对等体有利。 使用对等调度来交换关于内容块的可用性的信息。 该块可用性信息可以不同地交换，并且其频率根据对等体的分类而改变。 根据其分类，选择对等体进行块交换。 可以定义对等体选择比例，其根据对等体的下载缓冲器的内容动态地改变。 然后，基于块可用性信息来选择要交换的块，使得在更常见的块之前交换最少块。

公开(公告)号：US08832290B2

公开(公告)日：2014-09-09

申请号：US11678268

申请日：2007-02-23

申请人： Jin Li ,  Cheng Huang ,  Keith W. Ross

发明人： Jin Li ,  Cheng Huang ,  Keith W. Ross

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

CPC分类号： H04L65/60 ,  H04L47/70 ,  H04L47/722 ,  H04L47/805 ,  H04L65/4084 ,  H04L67/104 ,  H04L67/108 ,  H04L67/1091 ,  H04L67/28 ,  H04L67/2847

摘要： A “Media Sharer” operates within peer-to-peer (P2P) networks to provide a dynamic peer-driven system for streaming high quality multimedia content, such as a video-on-demand (VoD) service, to participating peers while minimizing server bandwidth requirements. In general, the Media Sharer provides a peer-assisted framework wherein participating peers assist the server in delivering on-demand media content to other peers. Participating peers cooperate to provide at least the same quality media delivery service as a pure server-client media distribution. However, given this peer cooperation, many more peers can be served with relatively little increase in server bandwidth requirements. Further, each peer limits its assistance to redistributing only portions of the media content that it also receiving. Peer upload bandwidth for redistribution is determined as a function of surplus peer upload capacity and content need of neighboring peers, with earlier arriving peers uploading content to later arriving peers.

摘要翻译： “媒体分享器”在对等（P2P）网络中运行，以提供动态的对等驱动系统，用于将诸如视频点播（VoD）服务的高质量多媒体内容流向参与对等体，同时最小化服务器 带宽要求。 通常，Media Sharer提供对等辅助框架，其中参与的对等体协助服务器向其他对等体传送点播媒体内容。 参与对方合作，提供与纯服务器 - 客户端媒体分发至少相同质量的媒体传送服务。 然而，鉴于这种对等合作，服务器带宽需求相对较少的许多对等体可以得到满足。 此外，每个对等体限制其援助以仅重新分配它也接收的媒体内容的部分。 用于再分配的同步上传带宽被确定为相邻对等体的剩余对等体上传容量和内容需求的函数，早期到达的对等体将内容上传到稍后到达的对等体。

公开(公告)号：US20110096675A1

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

申请号：US12606882

申请日：2009-10-27

申请人： Jin Li ,  Cheng Huang ,  Ye Wang ,  Richard R. Yang

发明人： Jin Li ,  Cheng Huang ,  Ye Wang ,  Richard R. Yang

IPC分类号： H04L12/26

CPC分类号： H04L43/12 ,  H04B17/24 ,  H04B17/309 ,  H04B17/382 ,  H04L43/10

摘要： 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.

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

公开(公告)号：US07904782B2

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

申请号：US11684589

申请日：2007-03-09

申请人： Cheng Huang ,  Minghua Chen ,  Jin Li

发明人： Cheng Huang ,  Minghua Chen ,  Jin Li

IPC分类号： H03M13/00

CPC分类号： H03M13/2921 ,  H03M13/1191 ,  H03M13/15 ,  H03M13/1515 ,  H03M13/2703 ,  H03M13/2906 ,  H03M13/2909 ,  H03M13/2918

摘要： 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.

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

公开(公告)号：US20100088405A1

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

申请号：US12247394

申请日：2008-10-08

申请人： Cheng Huang ,  Jin Li ,  Angela Wang ,  Keith Wimberly Ross

发明人： Cheng Huang ,  Jin Li ,  Angela Wang ,  Keith Wimberly Ross

IPC分类号： G06F15/16

CPC分类号： H04L43/0864 ,  H04L41/12 ,  H04L47/10

摘要： Charting a content distribution system (CDN) involves identifying a set of DNS servers that may be used as vantage points to test delay performance to a CDNs content server. As provided herein, to identify potential vantage point DNS servers, a set of authoritative name servers is identified and, from that set, those authoritative name servers that respond to a DNS query are identified as responsive authoritative name servers. Identifying a CDN content server that serves a particular vantage point DNS server involves retrieving an IP address for the CDN content server from a DNS query to the DNS server corresponding to the vantage point. The delay performance between the vantage point DNS server and the CDN content server can then be determined. Further, one can determine locations to deploy new data centers for a CDN based on delay performance, A delay from one or more vantage points to an existing CDN's DNS servers can be measured, and desired rank of locations can be generated. A location of a new data center can be selected based on a desired delay performance ranking.

摘要翻译： 制定内容分发系统（CDN）涉及识别可用作有利位置的一组DNS服务器，以测试CDN内容服务器的延迟性能。 如本文所提供的，为了识别潜在的有利位置的DNS服务器，识别了一组权威的名称服务器，并且从该集合中，响应于DNS查询的那些权威名称服务器被识别为响应权威的名称服务器。 识别服务于特定有利位置的DNS服务器DNS服务器涉及将CDN内容服务器的IP地址从DNS查询检索到对应于有利位置的DNS服务器。 然后可以确定有利位置DNS服务器和CDN内容服务器之间的延迟性能。 此外，可以基于延迟性能来确定部署用于CDN的新数据中心的位置，可以测量从一个或多个有利位置到现有CDN的DNS服务器的延迟，并且可以生成期望的位置等级。 可以基于期望的延迟性能排序来选择新数据中心的位置。