Hybrid Peer-to-Peer Streaming with Server Assistance
    11.
    发明申请
    Hybrid Peer-to-Peer Streaming with Server Assistance 审中-公开
    混合点对点流服务器协助

    公开(公告)号:US20080098123A1

    公开(公告)日:2008-04-24

    申请号:US11552374

    申请日:2006-10-24

    IPC分类号: G06F15/16

    摘要: Implementation of hybrid peer-to-peer streaming with server assistance is described. In one implementation, a media source is selected from amongst a plurality of media sources for retrieval of streaming media content. The selection might be based, for example, on an amount of the streaming media content received at respective time units. In one scenario, if the amount received at a time unit is less than a target amount, the streaming media content is retrieved from at least one streaming media server. Conversely, if the amount received at a time unit is more than the target amount, the streaming media content is retrieved from at least one peer-to-peer network. In another embodiment, a playback buffer is monitored to determine an amount of streaming media content at the respective time units. The media source is then selected based on the amount of the streaming media content in the playback buffer.

    摘要翻译: 描述了具有服务器帮助的混合对等流的实现。 在一个实现中,从用于检索流媒体内容的多个媒体源中选择媒体源。 该选择可以例如基于在各个时间单位处接收的流媒体内容的量。 在一种情况下,如果在时间单元处接收到的量小于目标量,则从至少一个流媒体服务器检索流媒体内容。 相反,如果在时间单元处接收的量大于目标量,则从至少一个对等网络检索流媒体内容。 在另一个实施例中,监视回放缓冲器以确定各个时间单位处的流媒体内容的数量。 然后基于回放缓冲器中的流媒体内容的数量来选择媒体源。

    Quality of service (QOS) based systems, networks, and advisors
    12.
    发明授权
    Quality of service (QOS) based systems, networks, and advisors 有权
    基于服务质量(QOS)的系统,网络和顾问

    公开(公告)号:US08335163B2

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

    申请号:US12606882

    申请日:2009-10-27

    IPC分类号: H04J1/16

    摘要: 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信息确定通信路径内的路径段的性能水平。

    STORAGE CODES FOR DATA RECOVERY
    13.
    发明申请
    STORAGE CODES FOR DATA RECOVERY 有权
    用于数据恢复的存储代码

    公开(公告)号:US20120173932A1

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

    申请号:US12983225

    申请日:2010-12-31

    IPC分类号: G06F11/34

    CPC分类号: G06F11/1076

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

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

    USING DNS REFLECTION TO MEASURE NETWORK PERFORMANCE
    14.
    发明申请
    USING DNS REFLECTION TO MEASURE NETWORK PERFORMANCE 有权
    使用DNS反射来衡量网络性能

    公开(公告)号:US20110270964A1

    公开(公告)日:2011-11-03

    申请号:US12769270

    申请日:2010-04-28

    IPC分类号: G06F15/173 G06F15/16

    摘要: A top level domain name system (DNS) server receives a DNS query from a local DNS resolver, the DNS query requesting a network address corresponding to a domain name. The top level DNS server reflects the local DNS resolver to a reflector DNS server. The reflector DNS server reflects the local DNS resolver to a collector DNS server, which in turn returns the network address to the local DNS resolver. The reflector DNS server and collector DNS server are both in the same data center, and one or more network performance measurements for communications between the local DNS resolver and the data center are determined based on the communications between the local DNS resolver and both the reflector DNS server and the collector DNS server.

    摘要翻译: 顶级域名系统(DNS)服务器从本地DNS解析器接收DNS查询,DNS查询请求与域名相对应的网络地址。 顶级DNS服务器将本地DNS解析器反映到反射器DNS服务器。 反射器DNS服务器将本地DNS解析器反映到收集器DNS服务器,该服务器又将网络地址返回到本地DNS解析器。 反射器DNS服务器和收集器DNS服务器都在相同的数据中心,并且基于本地DNS解析器与反射器DNS之间的通信来确定本地DNS解析器和数据中心之间的通信的一个或多个网络性能测量 服务器和收集器DNS服务器。

    ERASURE-RESILIENT CODES HAVING MULTIPLE PROTECTION GROUPS
    15.
    发明申请
    ERASURE-RESILIENT CODES HAVING MULTIPLE PROTECTION GROUPS 有权
    具有多个保护组的耐腐蚀编码

    公开(公告)号:US20080222480A1

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

    申请号:US11684584

    申请日:2007-03-09

    IPC分类号: H03M13/00

    摘要: 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代码可以恢复可恢复的任何擦除模式。

    Data communication with compensation for packet loss
    16.
    发明授权
    Data communication with compensation for packet loss 有权
    数据通信与丢包补偿

    公开(公告)号:US09237105B2

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

    申请号:US12632834

    申请日:2009-12-08

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

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

    Storage codes for data recovery
    17.
    发明授权
    Storage codes for data recovery 有权
    用于数据恢复的存储代码

    公开(公告)号:US08645799B2

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

    申请号:US12983225

    申请日:2010-12-31

    IPC分类号: G11C29/00

    CPC分类号: G06F11/1076

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

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

    Consistent Hashing Table for Workload Distribution
    18.
    发明申请
    Consistent Hashing Table for Workload Distribution 审中-公开
    一致的哈希表工作负载分配

    公开(公告)号: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。

    Optimizing XOR-based codes
    19.
    发明授权
    Optimizing XOR-based codes 有权
    优化基于XOR的代码

    公开(公告)号:US08209577B2

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

    申请号:US11961866

    申请日:2007-12-20

    IPC分类号: H03M13/00

    摘要: 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阵列等的编码和/或解码操作。

    ISP-FRIENDLY RATE ALLOCATION FOR P2P APPLICATIONS
    20.
    发明申请
    ISP-FRIENDLY RATE ALLOCATION FOR P2P APPLICATIONS 有权
    ISP适用于P2P应用的速率分配

    公开(公告)号:US20100082838A1

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

    申请号:US12242913

    申请日:2008-09-30

    IPC分类号: G06F15/16

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