利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

98 条记录 (耗时 0.04 秒)

    Content synchronization in a file sharing environment
    2.
    发明授权
    Content synchronization in a file sharing environment 有权
    文件共享环境中的内容同步

    公开(公告)号：US07953785B2

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

    申请号：US11428270

    申请日：2006-06-30

    申请人： Jin Li ,  Dan Teodosiu ,  Philip A. Chou ,  Cheng Huang ,  Eyal Schwartz ,  John T. Spivey ,  Yunnan Wu ,  Alexandra K. Heron

    发明人： Jin Li ,  Dan Teodosiu ,  Philip A. Chou ,  Cheng Huang ,  Eyal Schwartz ,  John T. Spivey ,  Yunnan Wu ,  Alexandra K. Heron

    IPC分类号： G06F15/16

    CPC分类号： G06F17/30165 ,  G06F17/30174 ,  G06F17/30206

    摘要： Content synchronization in a file sharing environment is described. A node in a circle share maintains a version vector that represents that node's knowledge of file synchronization events. Version vector data may be transmitted between nodes of the circle share via a presence service in the form of short notification messages. The version vector data is compared to identify one or more nodes to be synchronized. A resource-aware overlay representing the circle share is computed, and is used to initiate communication to determine which of the available nodes with which to synchronize will provide the most synchronization value to other nodes in the circle share.

    摘要翻译： 描述文件共享环境中的内容同步。 圆形共享中的节点维护一个版本向量，表示该节点对文件同步事件的了解。 版本矢量数据可以通过存在服务以短通知消息的形式在圆圈的节点之间传送。 将版本矢量数据进行比较，以识别要同步的一个或多个节点。 计算表示圆圈共享的资源感知覆盖，并且用于发起通信以确定哪个与其同步的可用节点将与圆共享中的其他节点提供最大的同步值。

    Content Synchronization in a File Sharing Environment
    3.
    发明申请
    Content Synchronization in a File Sharing Environment 有权
    文件共享环境中的内容同步

    公开(公告)号：US20080005188A1

    公开(公告)日：2008-01-03

    申请号：US11428270

    申请日：2006-06-30

    申请人： Jin Li ,  Dan Teodosiu ,  Philip A. Chou ,  Cheng Huang ,  Eyal Schwartz ,  John T. Spivey ,  Yunnan Wu ,  Alexandra K. Heron

    发明人： Jin Li ,  Dan Teodosiu ,  Philip A. Chou ,  Cheng Huang ,  Eyal Schwartz ,  John T. Spivey ,  Yunnan Wu ,  Alexandra K. Heron

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30165 ,  G06F17/30174 ,  G06F17/30206

    摘要： Content synchronization in a file sharing environment is described. A node in a circle share maintains a version vector that represents that node's knowledge of file synchronization events. Version vector data may be transmitted between nodes of the circle share via a presence service in the form of short notification messages. The version vector data is compared to identify one or more nodes to be synchronized. A resource-aware overlay representing the circle share is computed, and is used to initiate communication to determine which of the available nodes with which to synchronize will provide the most synchronization value to other nodes in the circle share.

    摘要翻译： 描述文件共享环境中的内容同步。 圆形共享中的节点维护一个版本向量，表示该节点对文件同步事件的了解。 版本矢量数据可以通过存在服务以短通知消息的形式在圆圈的节点之间传送。 将版本矢量数据进行比较，以识别要同步的一个或多个节点。 计算表示圆圈共享的资源感知覆盖，并且用于发起通信以确定哪个与其同步的可用节点将与圆共享中的其他节点提供最大的同步值。

    MINIMIZING NETWORK LATENCY IN INTERACTIVE INTERNET APPLICATIONS
    4.
    发明申请
    MINIMIZING NETWORK LATENCY IN INTERACTIVE INTERNET APPLICATIONS 有权
    最小化互联网应用中的网络延迟

    公开(公告)号：US20120128010A1

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

    申请号：US12951908

    申请日：2010-11-22

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

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

    IPC分类号： H04J3/22

    CPC分类号： H04L1/0009 ,  H04L1/1812 ,  H04L1/188

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

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

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

    公开(公告)号：US20080098123A1

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

    申请号：US11552374

    申请日：2006-10-24

    申请人： Cheng Huang ,  Philip A. Chou ,  Jin Li ,  Anders E. Klemets

    发明人： Cheng Huang ,  Philip A. Chou ,  Jin Li ,  Anders E. Klemets

    IPC分类号： G06F15/16

    CPC分类号： H04L67/104 ,  H04L65/4084 ,  H04L67/1091

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

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

    Minimizing network latency in interactive internet applications
    6.
    发明授权
    Minimizing network latency in interactive internet applications 有权
    最大限度地减少交互式互联网应用中的网络延迟

    公开(公告)号：US09059817B2

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

    申请号：US12951908

    申请日：2010-11-22

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

    发明人： 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分类号： H04L1/0009 ,  H04L1/1812 ,  H04L1/188

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

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

    RATE-CONTROLLABLE PEER-TO-PEER DATA STREAM ROUTING
    9.
    发明申请
    RATE-CONTROLLABLE PEER-TO-PEER DATA STREAM ROUTING 有权
    速率可控对等数据流路由

    公开(公告)号：US20100146108A1

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

    申请号：US12612395

    申请日：2009-11-04

    申请人： Jin Li ,  Sudipta Sengupta ,  Miroslav Ponec ,  Minghua Chen ,  Philip A. Chou

    发明人： Jin Li ,  Sudipta Sengupta ,  Miroslav Ponec ,  Minghua Chen ,  Philip A. Chou

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

    CPC分类号： H04L67/104 ,  H04L65/80 ,  H04L67/1085

    摘要： Difficulties associated with choosing advantageous network routes between server and clients are mitigated by a routing system that is devised to use many routing path sets, where respective sets comprise a number of routing paths covering all of the clients, including through other clients. A server may then apportion a data stream among all of the routing path sets. The server may also detect the performance of the computer network while sending the data stream between clients, and may adjust the apportionment of the routing path sets including the route. The clients may also be configured to operate as servers of other data streams, such as in a videoconferencing session, for example, and may be configured to send detected route performance information along with the portions of the various data streams.

    摘要翻译： 通过设计为使用许多路由路径集的路由系统来减轻与服务器和客户端之间选择有利的网络路由相关联的困难，其中相应的集合包括覆盖所有客户端的多个路由路径，包括通过其他客户端。 然后，服务器可以在所有路由路径集之间分配数据流。 服务器还可以在客户端之间发送数据流时检测计算机网络的性能，并且可以调整包括路由的路由路径集合的分配。 客户端还可以被配置为例如在视频会议会话中作为其他数据流的服务器操作，并且可以被配置为发送检测到的路由性能信息以及各种数据流的部分。

    Efficient one-to-many content distribution in a peer-to-peer computer network
    10.
    发明授权
    Efficient one-to-many content distribution in a peer-to-peer computer network 失效
    在对等计算机网络中高效的一对多内容分发

    公开(公告)号：US07593333B2

    公开(公告)日：2009-09-22

    申请号：US10887406

    申请日：2004-07-07

    申请人： Jin Li ,  Philip A. Chou ,  Cha Zhang

    发明人： Jin Li ,  Philip A. Chou ,  Cha Zhang

    IPC分类号： G01R31/08

    CPC分类号： H04L12/1877 ,  H04L12/1854 ,  H04L29/06027 ,  H04L65/607 ,  H04L67/06 ,  H04L67/104 ,  H04L67/1076 ,  H04L67/108 ,  H04L67/34 ,  H04L69/16 ,  H04L69/163 ,  H04L69/165

    摘要： A content distribution method and system for distributing content over a peer-to-peer network such that the full potential throughput of the network is achieved. The content distribution method divides the content to be distributed into many small blocks. Each of the content blocks then is assigned to a node, which can be a content-requesting node, a non-content-requesting node or a source node. Content is assigned based on a capacity of the node, where nodes having a larger capacity are assigned a greater number of content blocks and nodes having a smaller capacity are assigned a fewer content blocks. The capacity generally is defined as the upload bandwidth of the node. Redistribution queues are employed to control the throughput of the distribution. This bandwidth control strategy ensures that upload bandwidths of the peer and source nodes are fully utilized even with network anomalies such as packet losses and delivery jitters.

    摘要翻译： 一种内容分配方法和系统，用于通过对等网络分发内容，从而实现网络的全部潜在吞吐量。 内容分发方法将内容分成许多小块。 然后将每个内容块分配给可以是内容请求节点，非内容请求节点或源节点的节点。 基于节点的容量分配内容，其中具有较大容量的节点被分配更多数量的内容块，并且分配具有较小容量的节点分配较少的内容块。 容量通常定义为节点的上传带宽。 采用重新分配队列来控制分配的吞吐量。 这种带宽控制策略确保即使网络异常（如数据包丢失和传输抖动）也能充分利用对等体和源节点的上传带宽。