Patents by Inventor Howard Berkey
Howard Berkey has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 8843979Abstract: 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.Type: GrantFiled: October 19, 2012Date of Patent: September 23, 2014Assignee: Sony Computer Entertainment Inc.Inventors: Howard Berkey, Payton R. White, James E. Marr, Stephen Detwiler
-
Patent number: 8837477Abstract: 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.Type: GrantFiled: June 27, 2011Date of Patent: September 16, 2014Assignee: Sony Computer Entertainment Inc.Inventors: Yutaka Takeda, Howard Berkey, Payton R. White, Attila Vass
-
Publication number: 20130212632Abstract: 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.Type: ApplicationFiled: October 19, 2012Publication date: August 15, 2013Applicant: Sony Computer Entertainment Inc.Inventors: Howard Berkey, Payton R. White, James E. Marr, Stephen Detwiler
-
Patent number: 8374086Abstract: In a distributed hash table overlay network, messages directed to a message ID are relayed to one or more nodes that have published interest in that message ID. Messages are distributed, processed, and/or cached in accordance with relay policies, which enable a wide variety of different applications. Nodes specify relay policies on a per-node, per-message, and/or per-message ID basis. Relay policies can specify any behavior associated with messages, including: message caching, distribution, and processing as well as migration of relay policies when nodes join or leave the network. Intermediate nodes can perform any arbitrary processing of messages based on relay policies. Intermediate nodes can offload processing to other nodes, either by forwarding messages to a different message ID or by enlisting the help of nodes subscribed to the message ID. Messages can include one or more subfields specifying commands and/or data to be evaluated by the intermediate node.Type: GrantFiled: June 6, 2007Date of Patent: February 12, 2013Assignee: Sony Computer Entertainment Inc.Inventors: James E. Marr, Payton White, Howard Berkey, Attila Vass
-
Patent number: 8346882Abstract: A method for structuring a content distribution overlay network for a peer-to-peer network is presented. The method includes receiving a request from a requesting node for content at a content node. The content node has processing capabilities to process the content for presentation to the requesting node. An overlay network, including the requesting node and the content node, is dynamically assembled after receiving the request for content, where the overlay network is self-organized from available nodes of the peer-to-peer network that are available at a time of the request and based on the content requested. Using the assembled overlay network, a head node of the overlay network determines if a child node in the overlay network has processing capabilities to process the content, where the child node is then assigned to process the content for presentation to the requesting node.Type: GrantFiled: July 23, 2010Date of Patent: January 1, 2013Assignee: Sony Computer Entertainment Inc.Inventors: Howard Berkey, Payton R. White
-
Patent number: 8296813Abstract: 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.Type: GrantFiled: June 22, 2006Date of Patent: October 23, 2012Assignee: Sony Computer Entertainment Inc.Inventors: Howard Berkey, Payton R. White, James E. Marr, Stephen Detwiler
-
Patent number: 8161094Abstract: Methods are provided for event notification in a decentralized peer-to-peer (P2P) network. Each node within the P2P network can publish a subscription object for a published resource. Through the use of common identifiers, each subscription object is co-located with a corresponding publish object for the resource. Upon receiving notification of an event associated with the resource, the node responsible for the publish object for the resource distributes the event notification to each node present on the corresponding subscription registry. Therefore, nodes within the P2P network that are interested in a resource are capable of establishing a persistent query for the resource by publishing a subscription object for the resource on the responsible node.Type: GrantFiled: May 27, 2004Date of Patent: April 17, 2012Assignee: Sony Computer Entertainment Inc.Inventors: Payton R. White, John P. Bates, Howard Berkey
-
Publication number: 20110317697Abstract: 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.Type: ApplicationFiled: June 27, 2011Publication date: December 29, 2011Applicant: Sony Computer Entertainment Inc.Inventors: Yutaka Takeda, Howard Berkey, Payton R. White, Attila Vass
-
Patent number: 8037474Abstract: 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.Type: GrantFiled: September 27, 2005Date of Patent: October 11, 2011Assignee: Sony Computer Entertainment Inc.Inventors: John P. Bates, Payton R. White, Richard B. Stenson, Howard Berkey, Atilla Vass, Mark Cerny, John Morgan
-
Patent number: 7969906Abstract: 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.Type: GrantFiled: April 15, 2010Date of Patent: June 28, 2011Assignee: Sony Computer Entertainment Inc.Inventors: Yutaka Takeda, Howard Berkey, Payton R. White, Attila Vass
-
Patent number: 7941482Abstract: 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.Type: GrantFiled: April 26, 2004Date of Patent: May 10, 2011Assignee: Sony Computer Entertainment Inc.Inventors: John P. Bates, Howard Berkey
-
Patent number: 7849203Abstract: 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.Type: GrantFiled: May 12, 2004Date of Patent: December 7, 2010Assignee: Sony Computer Entertainment Inc.Inventors: Howard Berkey, Greg Corson, John Paul Bates
-
Publication number: 20100287272Abstract: A method for structuring a content distribution overlay network for a peer-to-peer network is presented. The method includes receiving a request from a requesting node for content at a content node. The content node has processing capabilities to process the content for presentation to the requesting node. An overlay network, including the requesting node and the content node, is dynamically assembled after receiving the request for content, where the overlay network is self-organized from available nodes of the peer-to-peer network that are available at a time of the request and based on the content requested. Using the assembled overlay network, a head node of the overlay network determines if a child node in the overlay network has processing capabilities to process the content, where the child node is then assigned to process the content for presentation to the requesting node.Type: ApplicationFiled: July 23, 2010Publication date: November 11, 2010Applicant: Sony Computer Entertainment Inc.Inventors: Howard Berkey, Payton R. White
-
Patent number: 7792915Abstract: 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.Type: GrantFiled: May 28, 2004Date of Patent: September 7, 2010Assignee: Sony Computer Entertainment Inc.Inventors: Howard Berkey, Payton R. White
-
Publication number: 20100195652Abstract: 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.Type: ApplicationFiled: April 15, 2010Publication date: August 5, 2010Applicant: Sony Computer Entertainment Inc.Inventors: Yutaka TAKEDA, Howard Berkey, Payton R. White, Attila Vass
-
Patent number: 7729280Abstract: 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.Type: GrantFiled: December 8, 2008Date of Patent: June 1, 2010Assignee: Sony Computer Entertainment Inc.Inventors: Yutaka Takeda, Howard Berkey, Payton R. White, Attila Vass
-
Publication number: 20090086739Abstract: 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.Type: ApplicationFiled: December 8, 2008Publication date: April 2, 2009Applicant: Sony Computer Entertainment Inc.Inventors: Yutaka Takeda, Howard Berkey, Payton R. White, Attila Vass
-
Patent number: 7468952Abstract: 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.Type: GrantFiled: November 29, 2005Date of Patent: December 23, 2008Assignee: Sony Computer Entertainment Inc.Inventors: Yutaka Takeda, Howard Berkey, Payton R. White, Attila Vass
-
Publication number: 20080304493Abstract: In a distributed hash table overlay network, messages directed to a message ID are relayed one or more nodes that have published interest in that message ID. Messages are distributed, processed, and/or cached in accordance with relay policies, which enable a wide variety of different applications. Nodes to specify relay policies on a per-node, per-message, and/or per-message ID basis. Relay policies can specify any behavior associated with messages, including: message caching, distribution, and processing as well as migration of relay policies when nodes join or leave the network. Intermediate nodes can perform any arbitrary processing of message based on relay policies. Intermediate nodes can offload processing to other nodes, either by forwarding messages to a different message ID or by enlisting the help of nodes subscribed to the message ID. Messages can include one or more subfields specifying commands and/or data to be evaluated by the intermediate node.Type: ApplicationFiled: June 6, 2007Publication date: December 11, 2008Applicant: Sony Computer Entertainment Inc.Inventors: James E. MARR, Payton White, Howard Berkey, Attila Vass
-
Patent number: 7421708Abstract: 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.Type: GrantFiled: June 1, 2004Date of Patent: September 2, 2008Assignee: Sony Computer Entertainment Inc.Inventors: Attila Vass, Howard Berkey, John P. Bates, Payton R. White