公开(公告)号：WO2007149695A3

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

申请号：PCT/US2007070275

申请日：2007-06-01

Applicant: SONY COMPUTER ENTERTAINMENT INC ,  BERKEY HOWARD ,  WHITE PAYTON R ,  MARR JAMES E ,  DETWILER STEPHEN

Inventor： BERKEY HOWARD ,  WHITE PAYTON R ,  MARR JAMES E ,  DETWILER STEPHEN

IPC: H04N7/173

CPC classification number: H04L47/19 ,  H04L47/29 ,  H04L47/32 ,  H04L65/602 ,  H04N19/132 ,  H04N19/172 ,  H04N19/177 ,  H04N21/23406 ,  H04N21/234381 ,  H04N21/2402 ,  H04N21/64792

Abstract: Methods and apparatus for optimizing quality of streaming data transmitted between a first node and a second node over a network, the streaming data including one or more frame groups is disclosed. A processor-readable medium having embodied therein processor readably instructions for implementing a method for optimizing quality of streaming data transmitted between a first node and a second node over a network is also disclosed.

Abstract translation: 公开了一种用于优化通过网络在第一节点和第二节点之间传输的流数据的质量的方法和装置，包括一个或多个帧组的流数据。 还公开了一种处理器可读介质，其中包括处理器，可读指令，用于实现用于优化网络上在第一节点和第二节点之间传输的流数据的质量的方法的方法。

公开(公告)号：WO2004110019A1

公开(公告)日：2004-12-16

申请号：PCT/US2004/017306

申请日：2004-06-01

Applicant: SONY COMPUTER ENTERTAINMENT INC. ,  BERKEY, Howard

Inventor： BERKEY, Howard ,  VASS, Attila ,  BATES, John, P. ,  WHITE, Payton, R.

IPC: H04L29/06

CPC classification number: H04L67/104 ,  H04L67/1002 ,  H04L67/1008 ,  H04L67/1046 ,  H04L67/1063 ,  H04L67/1068 ,  H04L67/108 ,  H04L67/1089 ,  H04L67/1093 ,  H04L67/34 ,  H04L69/329

Abstract: An interconnectivity framework, method, and system for communicating in a peer-to-peer network is disclosed. A peer of the interconnectivity framework includes a peer library for publishing, messaging and locating component blocks over the peer-to-peer network and a telespace framework for managing component blocks in response to a requirement of an application to be executed at the peer. The component blocks being obtained by the peer library enable execution of the application at the peer in accordance with the requirement. The requirement defines the type of application so that the appropriate component blocks can be obtained from the peer-to-peer network. A networker is further included to enable communication with specific grids of the peer-to-peer network and to enable the publishing, messaging, and locating of objects published by specific peers of a grid of the peer-to-peer network.

Abstract translation: 公开了一种用于在对等网络中通信的互连框架，方法和系统。 互连框架的对等体包括用于在对等网络上发布，消息和定位组件块的对等库，以及用于响应于在对等体上执行的应用的需求来管理组件块的电话空间框架。 由对等库获得的组件块可以根据要求在对等体上执行应用程序。 该要求定义应用程序的类型，以便可以从对等网络获取适当的组件块。 还包括网络器以实现与对等网络的特定网格的通信，并且能够发布，消息传送和定位由对等网络的网格的特定对等体发布的对象。

公开(公告)号：WO2004110018A1

公开(公告)日：2004-12-16

申请号：PCT/US2004/016830

申请日：2004-05-28

Applicant: SONY COMPUTER ENTERTAINMENT, INC. ,  BERKEY, Howard

Inventor： BERKEY, Howard ,  WHITE, Payton, R.

IPC: H04L29/06

CPC classification number: H04L67/104 ,  H04L67/1002 ,  H04L67/1008 ,  H04L67/1046 ,  H04L67/1063 ,  H04L67/1068 ,  H04L67/108 ,  H04L67/1089 ,  H04L67/1093 ,  H04L67/34 ,  H04L69/329

Abstract: A method, system and architecture for operating a content distribution overlay network in conjunction with a peer-to-peer network is provided, The method includes receiving a request for content at a content node from a requesting node of the peer-to-peer network. Then, referring to an overlay network to identify the content node as a head node of the overlay network. The head node has capabilities to transcode the content. The method then identifies a lowest level child node of the head node that has capabilities to transcode the content for the requesting node. The lowest level child node is then assigned to transcode the content for presentation to the requesting node, and each parent in the overlay network is assigned to transcode the content for its child. The lowest level child node receives the content transcoded from its parent in a format of the lowest level child node, and the overlay network is independent of the peer-to-peer network. In accordance with the method, nodes of the overlay network are arranged according to capability, and the head node has a highest capability of the overlay network.

Abstract translation: 提供了一种与对等网络一起操作内容分发覆盖网络的方法，系统和架构。该方法包括：从对等网络的请求节点在内容节点处接收对内容的请求 。 然后，参考覆盖网络将内容节点标识为覆盖网络的头节点。 头节点具有对内容进行转码的能力。 该方法然后识别具有对请求节点的内容进行转码的能力的头节点的最低级子节点。 然后分配最低级别的子节点对内容进行代码转换以呈现给请求节点，并且分配覆盖网络中的每个父代码对其子代码转码内容。 最底层的子节点以最低级子节点的格式接收从其父代码转码的内容，覆盖网络独立于对等网络。 根据该方法，覆盖网络的节点根据能力进行布置，并且头节点具有覆盖网络的最高能力。

公开(公告)号：WO2008134314A1

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

申请号：PCT/US2008/061156

申请日：2008-04-22

Applicant: SONY COMPUTER ENTERTAINMENT INC. ,  TAKEDA, Yutaka ,  BERKEY, Howard L. ,  WHITE, Payton R. ,  VASS, Atilla

Inventor： TAKEDA, Yutaka ,  BERKEY, Howard L. ,  WHITE, Payton R. ,  VASS, Atilla

IPC: H04L12/28

CPC classification number: H04L61/2575 ,  H04L29/12452 ,  H04L29/12528 ,  H04L29/12537 ,  H04L61/2546 ,  H04L61/2578 ,  H04L67/104 ,  H04L67/1072

Abstract: An overlay network uses flexible neighbor selection based on network address translation (NAT) to define routing between nodes. The NAT type is used as a flexible neighbor selection criteria, either alone or in conjunction with other criteria. A method of selecting a neighboring node for a first node in a distributed hash table network includes determining a desired key value for a node finger table entry and requesting a set of candidate neighboring nodes near this desired key value. The method determines a network address translation type of each of the set of candidate neighboring nodes and ranks the set of candidate neighboring nodes accordingly. The method selects one of the set of candidate neighboring nodes based on the ranking. The NAT types of candidate neighboring nodes are determined by sending probe messages or from data received from a central overlay network server.

Abstract translation: 覆盖网络使用基于网络地址转换（NAT）的灵活的邻居选择来定义节点之间的路由。 NAT类型用作灵活的邻居选择标准，单独或与其他标准结合使用。 在分布式散列表网络中为第一节点选择相邻节点的方法包括：确定节点手指表条目的期望密钥值，并且在该期望密钥值附近请求一组候选相邻节点。 所述方法确定所述一组候选相邻节点中的每一个的网络地址转换类型，并且相应地对所述候选相邻节点的集合进行排序。 该方法基于排名选择一组候选相邻节点中的一个。 通过发送探测消息或从中央覆盖网络服务器接收的数据来确定候选邻居节点的NAT类型。

公开(公告)号：WO2004109514A3

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

申请号：PCT/US2004018013

申请日：2004-06-03

Applicant: SONY COMPUTER ENTERTAINMENT INC ,  BERKEY HOWARD ,  CORSON GREG ,  BATES JOHN PAUL

Inventor： BERKEY HOWARD ,  CORSON GREG ,  BATES JOHN PAUL

IPC: H04L29/06 ,  G06F9/46 ,  G06F15/16 ,  H04L29/08

CPC classification number: H04L67/104 ,  H04L29/08846 ,  H04L67/1068 ,  H04L67/28 ,  H04L67/2876

Abstract: Provided is a method and apparatus for virtualizing access to resources in a distributed peer-to-peer (P2P) network. Specifically, a resource locally managed by a peer in the P2P network can be published such that other peers can identify the peer managing the resource. Any peer requesting access to the resource of another peer establishes communication to the peer managing the resource. After establishing communication, a proxy of the peer managing the resource can establish a proxy interface. The proxy interface, operating on the peer requesting access, permits the peer requesting access to generate command and control data to control the resource. Thus, the peer requesting access believes that it manages the local resource, while in reality, the peer requesting access only has virtualized access to the resource.

Abstract translation: 提供了一种用于虚拟化分布式对等（P2P）网络中的资源的访问的方法和装置。 具体来说，可以发布由P2P网络中的对等体本地管理的资源，使得其他对等体可以识别管理资源的对等体。 请求访问另一个对等体的资源的任何对等体建立与管理资源的对等体的通信。 建立通信后，管理资源的对等体的代理可以建立代理接口。 在对等体请求访问上操作的代理接口允许对等体请求访问生成命令和控制数据以控制资源。 因此，对等体请求访问认为它管理本地资源，而实际上，对等请求访问仅具有对资源的虚拟访问。

公开(公告)号：WO2007149695A2

公开(公告)日：2007-12-27

申请号：PCT/US2007/070275

申请日：2007-06-01

Applicant: SONY COMPUTER ENTERTAINMENT INC. ,  BERKEY, Howard ,  WHITE, Payton R. ,  MARR, James E. ,  DETWILER, Stephen

Inventor： BERKEY, Howard ,  WHITE, Payton R. ,  MARR, James E. ,  DETWILER, Stephen

IPC: H04N11/02

CPC classification number: H04L47/19 ,  H04L47/29 ,  H04L47/32 ,  H04L65/602 ,  H04N19/132 ,  H04N19/172 ,  H04N19/177 ,  H04N21/23406 ,  H04N21/234381 ,  H04N21/2402 ,  H04N21/64792

Abstract: Methods and apparatus for optimizing quality of streaming data transmitted between a first node and a second node over a network, the streaming data including one or more frame groups is disclosed. A processor-readable medium having embodied therein processor readably instructions for implementing a method for optimizing quality of streaming data transmitted between a first node and a second node over a network is also disclosed.

Abstract translation: 公开了一种用于优化通过网络在第一节点和第二节点之间传输的流数据的质量的方法和装置，包括一个或多个帧组的流数据。 还公开了一种处理器可读介质，其中包括处理器，可读指令，用于实现用于优化网络上在第一节点和第二节点之间传输的流数据的质量的方法的方法。

公开(公告)号：WO2007120213A2

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

申请号：PCT/US2006/044661

申请日：2006-11-17

Applicant: SONY COMPUTER ENTERTAINMENT INC. ,  TAKEDA, Yutaka ,  BERKEY, Howard ,  WHITE, Payton R. ,  VASS, Attila

Inventor： TAKEDA, Yutaka ,  BERKEY, Howard ,  WHITE, Payton R. ,  VASS, Attila

CPC classification number: H04L12/1854

Abstract: Broadcast messages are efficiently directed to nodes of an overlay network. Broadcast messages include an End ID parameter specifying the range of key values for nodes that should receive the broadcast message. Each node of an overlay network maintains a list of finger nodes and their respective key values. Upon receiving a broadcast message, a node assigns a finger node a new End ID value based upon the End ID value of the broadcast message or the key value of an adjacent finger node. The node compares a finger node's new End ID value with the finger node's key value to determine whether to forward the broadcast message to that finger node. A broadcast message forwarded to a finger node includes an End ID parameter equal to the new End ID value determined for the finger node. Nodes can aggregate response messages from its finger nodes.

Abstract translation: 广播消息有效地指向覆盖网络的节点。 广播消息包括指定应该接收广播消息的节点的密钥值的范围的结束ID参数。 覆盖网络的每个节点维护手指节点及其各自的键值的列表。 在接收到广播消息时，节点基于广播消息的结束ID值或相邻手指节点的密钥值来为手指节点分配新的结束ID值。 节点将手指节点的新结束ID值与手指节点的密钥值进行比较，以确定是否将广播消息转发到该手指节点。 转发到手指节点的广播消息包括等于为手指节点确定的新的结束ID值的结束ID参数。 节点可以聚合来自其手指节点的响应消息。

公开(公告)号：WO2007120213A3

公开(公告)日：2007-12-27

申请号：PCT/US2006044661

申请日：2006-11-17

Applicant: SONY COMPUTER ENTERTAINMENT INC ,  TAKEDA YUTAKA ,  BERKEY HOWARD ,  WHITE PAYTON R ,  VASS ATTILA

Inventor： TAKEDA YUTAKA ,  BERKEY HOWARD ,  WHITE PAYTON R ,  VASS ATTILA

IPC: H04L12/18

CPC classification number: H04L12/1854

Abstract: Broadcast messages are efficiently directed to nodes of an overlay network. Broadcast messages include an End ID parameter specifying the range of key values for nodes that should receive the broadcast message. Each node of an overlay network maintains a list of finger nodes and their respective key values. Upon receiving a broadcast message, a node assigns a finger node a new End ID value based upon the End ID value of the broadcast message or the key value of an adjacent finger node. The node compares a finger node's new End ID value with the finger node's key value to determine whether to forward the broadcast message to that finger node. A broadcast message forwarded to a finger node includes an End ID parameter equal to the new End ID value determined for the finger node. Nodes can aggregate response messages from its finger nodes.

Abstract translation: 广播消息被有效地引导到覆盖网络的节点。 广播消息包括一个End ID参数，用于指定应接收广播消息的节点的键值范围。 覆盖网络的每个节点维护一个手指节点列表及其各自的键值。 在接收到广播消息时，节点基于广播消息的结束ID值或相邻手指节点的密钥值为节点分配新的结束ID值。 该节点将手指节点的新的结束ID值与手指节点的键值进行比较，以确定是否将广播消息转发到该手指节点。 被转发到指状节点的广播消息包括等于为该指状节点确定的新的结束ID值的结束ID参数。 节点可以聚合来自其手指节点的响应消息。

公开(公告)号：WO2007038457A1

公开(公告)日：2007-04-05

申请号：PCT/US2006/037338

申请日：2006-09-25

Applicant: SONY COMPUTER ENTERTAINMENT INC. ,  BATES, John, P. ,  WHITE, Payton, R. ,  STENSON, Richard, B. ,  BERKEY, Howard ,  VASS, Attila ,  CERNY, Mark ,  MORGAN, John

Inventor： BATES, John, P. ,  WHITE, Payton, R. ,  STENSON, Richard, B. ,  BERKEY, Howard ,  VASS, Attila ,  CERNY, Mark ,  MORGAN, John

IPC: G06F9/50

CPC classification number: G06F9/5027 ,  G06F9/4881 ,  G06F9/5033 ,  G06F2209/483 ,  G06F2212/251 ,  G06F2212/253

Abstract: Cell processor task management in a cell processor having a main memory, one or more power processor units (PPU) and one or more synergistic processing units (SPU), each SPU having a processor and a local memory is described. An SPU task manager (STM) running on one or more of the SPUs reads one or more task definitions stored in the main memory into the local memory of a selected SPU. Based on information contained in the task definitions the SPU loads code and/or data related to the task definitions from the main memory into the local memory associated with the selected SPU. The selected SPU then performs one or more tasks using the code and/or data.

Abstract translation: 描述了具有主存储器，一个或多个功率处理器单元（PPU）和一个或多个协同处理单元（SPU）的单元处理器中的单元处理器任务管理，每个SPU具有处理器和本地存储器。 在一个或多个SPU上运行的SPU任务管理器（STM）将存储在主存储器中的一个或多个任务定义读取到所选择的SPU的本地存储器中。 基于任务定义中包含的信息，SPU将与主存储器相关的任务定义的代码和/或数据加载到与所选SPU相关联的本地存储器中。 所选择的SPU然后使用代码和/或数据执行一个或多个任务。

公开(公告)号：WO2004110024A1

公开(公告)日：2004-12-16

申请号：PCT/US2004/017594

申请日：2004-06-02

Applicant: SONY COMPUTER ENTERTAINMENT INC. ,  BATES, John, P. ,  BERKEY, Howard

Inventor： BATES, John, P. ,  BERKEY, Howard

IPC: H04L29/06

CPC classification number: H04L67/1008 ,  H04L67/1002 ,  H04L67/1012 ,  H04L67/1023 ,  H04L67/104 ,  H04L67/1048 ,  H04L67/1059 ,  H04L67/107

Abstract: A method of dynamically balancing a load on a fully connected grid (FCG) in a peer-to-peer environment includes determining if a first number of peers connected in a first FCG is greater than a preselected limit. If the first number of peers connected to the first FCG is greater than the preselected limit, then partitioning the first FCG into two or more subdivided FCGs, wherein each of the subdivided FCGs includes at least one peer connection that was previously connected in the first FCG. A subdivided location identifier can also be published for each respective resource included in each peer connection. A system for dynamically balancing a load on a fully connected grid (FCG) in a peer-to-peer environment is also described.

Abstract translation: 在对等环境中动态平衡完全连接的网格（FCG）上的负载的方法包括确定在第一FCG中连接的第一数量的对等体是否大于预选极限。 如果连接到第一FCG的第一数量的对等体大于预先选择的限制，则将第一FCG划分成两个或更多个细分FCG，其中每个细分FCG包括先前连接在第一FCG中的至少一个对等连接 。 还可以为包括在每个对等连接中的每个相应的资源公布细分位置标识符。 还描述了用于在对等环境中动态平衡完全连接网格（FCG）上的负载的系统。