Patent application number | Description | Published |
20080201561 | MULTI-THREADED PARALLEL PROCESSOR METHODS AND APPARATUS - A processor system, a processor readable medium and a method for implementing multiple contexts on one or more SPE are disclosed. | 08-21-2008 |
20080214253 | SYSTEM AND METHOD FOR COMMUNICATING WITH A VIRTUAL WORLD - A system and method for communicating with a virtual world are disclosed. The virtual world may comprise a simulated public space configured to facilitate interaction among a plurality of users and one or more private spaces. Each private space may be associated with a particular user of the plurality of users. A particular user's interactions with the virtual world may be represented by one or more corresponding actions of an avatar. A communication device may be simulated in the virtual world. Communication may take place between the simulated communication device and a real communication device. The virtual world may be generated by one or more processors configured to simulate a communication device in the virtual world and communicate between the simulated communication device and a real communication device. | 09-04-2008 |
20080215679 | SYSTEM AND METHOD FOR ROUTING COMMUNICATIONS AMONG REAL AND VIRTUAL COMMUNICATION DEVICES - A system and method for routing communications among real and virtual communication devices are disclosed. The system includes one or more processors configured to generate a virtual world. The one or more processors may be configured to generate a virtual communication device and implement a configurable router adapted to facilitate routing of a communication among one or more real communication devices and the virtual communication device. A user of the virtual world may be associated with a virtual communication device and one or more real communication devices. A routing preference for reception of communications targeted to the user is implemented among the virtual communication device and the one or more real communication devices. | 09-04-2008 |
20080215971 | SYSTEM AND METHOD FOR COMMUNICATING WITH AN AVATAR - A system and method for communicating with a virtual world are disclosed. The virtual world may comprise a simulated public space configured to facilitate interaction among a plurality of users and one or more private spaces. Each private space may be associated with a particular user of the plurality of users. A particular user's interactions with the virtual world may be represented by one or more corresponding actions of an avatar. Communication may take place between the virtual world and a real communication device. The real communication device may be configured to communicate with other real communication devices via one or more communication channels that are independent of the virtual world. | 09-04-2008 |
20080215972 | MAPPING USER EMOTIONAL STATE TO AVATAR IN A VIRTUAL WORLD - A method for user interaction with a three-dimensional virtual world is disclosed. The virtual world may comprise one or more public spaces and one or more private spaces. A user may be represented in the virtual world by an avatar. The user may manipulate the avatar via a user interface. An emotional state of the user may be detected via the interface. The user's emotional state may be mapped to one or more features of the avatar that are perceptible by other users. Thus, other users may perceive the user's emotional state through perception of the avatar. | 09-04-2008 |
20080215973 | AVATAR CUSTOMIZATION - A method for user interaction with a three-dimensional virtual world is disclosed. The virtual world comprises one or more public spaces and one or more private spaces. A user may be represented in the virtual world by an avatar. The user can manipulate the avatar via a user interface. According to the method a custom gesture may be generated for the avatar. The gesture may be associated with one or more user interface signals. | 09-04-2008 |
20080229032 | CELL PROCESSOR ATOMIC OPERATION - A method is disclosed for atomic operation in a processor system comprising a main memory and a power processor element (PPE) including a power processor unit (PPU) and an external cache. A processor system and processor readable medium for implementing the method are also disclosed. | 09-18-2008 |
20080235582 | AVATAR EMAIL AND METHODS FOR COMMUNICATING BETWEEN REAL AND VIRTUAL WORLDS - A method for and system for communicating using a virtual world are disclosed. In the method an avatar may be associated with a source of an email. An email may be generated within the virtual world and one or more images of an avatar may be associated with the email. The email may be sent to a real device and the one or more images may be presented at a destination of the email. The system may comprise one or more processors configured to generate a virtual world; associate an avatar with a source of an email; generate an email within the virtual world; associate one or more images of an avatar with the email; send the email to a real device; and present the one or more images at a destination of the email. | 09-25-2008 |
20080270626 | NETWORK ADDRESS TRANSLATION TYPE FOR FLEXIBLE NEIGHBOR SELECTION IN OVERLAY NETWORKS - 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. | 10-30-2008 |
20080304493 | ADAPTIVE DHT NODE RELAY POLICIES - 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. | 12-11-2008 |
20080307103 | MEDIATION FOR AUXILIARY CONTENT IN AN INTERACTIVE ENVIRONMENT - A client device configured to interact with an interactive environment, a computer implemented method for obtaining auxiliary content in such a device, a mediation server, a computer implemented method for managing distribution of auxiliary content with such a server, an auxiliary content distribution method and an auxiliary content distribution system are disclosed | 12-11-2008 |
20080307412 | CACHED CONTENT CONSISTENCY MANAGEMENT - A method and system for managing consistency of cached content assets are disclosed. A distribution server and client device that may be used in conjunction with such a system and method are also disclosed. | 12-11-2008 |
20080310302 | LOAD BALANCING DISTRIBUTION OF DATA TO MULTIPLE RECIPIENTS ON A PEER-TO-PEER NETWORK - A method and system for load balancing the distribution of a file or block of data to multiple recipients on a peer to peer network is disclosed. | 12-18-2008 |
20090086739 | BROADCAST MESSAGING IN PEER TO PEER OVERLAY NETWORK - 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. | 04-02-2009 |
20090144423 | NETWORK TRAFFIC PRIORITIZATION - Prioritizing network traffic among two or more distinct channels of communication within a single application in a node configured to communicate with one or more other nodes over a network is disclosed. For a particular time quantum, a bandwidth quantum may be distributed amongst two or more communication channels according to priorities associated with those channels. | 06-04-2009 |
20090144424 | NETWORK BANDWIDTH DETECTION AND DISTRIBUTION - In a node configured to communicate with one or more other nodes over a network, available bandwidth for network traffic may be distributed among two or more distinct channels of communication within a single application running on the node. An available bandwidth may be detected for communication between the first node and a second node. A distribution may be determined for the available bandwidth among the two or more communication channels. A sending rate may be adjusted for data sent from the first node to the second node over one or more of the two or more communication channels in response to a detected change in the available bandwidth. | 06-04-2009 |
20090144425 | NETWORK BANDWIDTH DETECTION, DISTRIBUTION AND TRAFFIC PRIORITIZATION - Network bandwidth detection and distribution and prioritizing network traffic among two or more distinct channels of communication within a single application in a node configured to communicate with one or more other nodes over a network is disclosed. For a particular time quantum, a bandwidth quantum may be distributed amongst two or more communication channels according to priorities associated with those channels. | 06-04-2009 |
20090288127 | BROADCAST SEEDING FOR PEER-TO-PEER NETWORKS - The distribution of content over a peer to peer (P2P) network can be improved by utilizing at least one broadcast of the content in order to quickly seed the P2P network. When content is first to be distributed across the network, a broadcast can be scheduled that each peer device with broadcast receiving capability and within range of the broadcast is able to receive. As soon as a peer device receives at least a portion of the broadcast content, that peer can begin redistributing the content across the P2P network. Any errors or missing portions of the received broadcast content can be corrected by requesting a copy of the missing or incorrect portion from another peer on the P2P network. | 11-19-2009 |
20090300144 | HINT-BASED STREAMING OF AUXILIARY CONTENT ASSETS FOR AN INTERACTIVE ENVIRONMENT - Methods for obtaining and distributing auxiliary content assets for an interactive environment and a client device and server that may implement such methods are disclosed. The client device displays a scene of a portion of the simulated environment from a camera point of view (camera POV) on a video display. The client device generates a pre-hint vector based on position of the camera POV, sends the vector to a server and receives auxiliary content information from the server. The server receives the pre-hint vector, determines the future field from the pre-hint vector, identifies one or more auxiliary content targets within the potential future field of view, and sends auxiliary content information for the identified targets to the client device. | 12-03-2009 |
20100050027 | NETWORK COMMUNICATION PROTOCOL FOR LARGE SCALE DISTRIBUTION OF STREAMING CONTENT - Forward error correction may be implemented in a network having first, second, third and fourth nodes. The second node receives streaming media message packets and one or more check packets from an upstream first node. The second node transmits the message packets and check packets to a downstream third node. The second node transmits a second set of one or more check packets to a fourth node that is downstream of the third node. | 02-25-2010 |
20100082951 | MULTI-THREADED PARALLEL PROCESSOR METHODS AND APPARATUS - A processor system may implement multiple contexts on one or more processors having a local memory. Code and/or data for first and second contexts may be respectively stored simultaneously in first and second regions of a processor's local memory, storing code and/or data for a second context in a second region of the local memory, the secondary processor may execute the first context while the second context waits. Code and/or data for the first context may be transferred from the first region to the second and code and/or data for the second context may be transferred from the second region to the first, and the processor may execute the second context during a pause or stoppage of execution of the first context. Alternatively, the code and/or data for the second context may be transferred to another processor's local memory. | 04-01-2010 |
20100195652 | BROADCAST MESSAGING IN PEER TO PEER OVERLAY NETWORK - 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. | 08-05-2010 |
20100205282 | NETWORK ADDRESS TRANSLATION TYPE FOR FLEXIBLE NEIGHBOR SELECTION IN OVERLAY NETWORKS - 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. | 08-12-2010 |
20110047443 | NETWORK COMMUNICATION PROTOCOL FOR LARGE SCALE DISTRIBUTION OF STREAMING CONTENT - Forward error correction may be implemented in a network having first, second and third nodes. The second node receives streaming media message packets and one or more check packets from an upstream first node. The second node transmits the message packets and check packets to a downstream third node. The second node uses the check packets to decode missing message packets and transmits the decoded missing packets to the third node before the missing message packets are to be presented by the third node. The third node may receive message packets and a first set of check packets from the second node and a second set of check packets from the first node. The third node may use check packets from both sets to decode missing message packets. | 02-24-2011 |
20110099278 | NETWORK TRAFFIC PRIORITIZATION - Prioritizing network traffic among two or more distinct channels of communication within a single application in a node configured to communicate with one or more other nodes over a network is disclosed. For a particular time quantum, a bandwidth quantum may be distributed amongst two or more communication channels according to priorities associated with those channels. | 04-28-2011 |
20110252122 | APPLICATION LEVEL BROADCAST IN PEER OVERLAY NETWORK - A broadcast message may be initiated or received at a peer node. The node obtains an uplink bandwidth available for broadcasting the message over the network and a number of copies that can be broadcast based on the available bandwidth. The node determines a range of key values for finger nodes that should receive copies of the broadcast message from a finger table. The finger table entries include references to finger nodes and key values associated with the finger nodes. The node determines which other nodes should receive copies of the broadcast message from range of key values and the number of copies. The node also determines an End ID for each recipient node. A copy of the broadcast message and corresponding End ID is sent to a finger node if the finger node's key value is within a range of key values specified by the End ID. | 10-13-2011 |
20110317697 | BROADCAST MESSAGING IN PEER TO PEER OVERLAY NETWORK - 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. | 12-29-2011 |
20120143392 | METHOD AND APPARATUS TO ADJUST FOR UNDESIRED FORCE INFLUENCING A VEHICLE INPUT CONTROL - An input control signal is adjusted to account for a portion of the input control signal that may be attributable to unintended forces. Such unintended forces may include, but are not limited to, one or more of operator initiated unintended forces, vehicle-generated unintended forces, and extra-vehicular unintended forces. The amount by which the input control signal is adjusted correlates to a determined probability. The probability is an indicator as to how likely the input control value is affected by unintended forces. | 06-07-2012 |
20120213077 | NETWORK BANDWIDTH DETECTION AND DISTRIBUTION - Prioritizing network traffic among two or more distinct channels of communication within a single application in a node configured to communicate with one or more other nodes over a network is disclosed. For a particular time quantum, a bandwidth quantum may be distributed amongst two or more communication channels according to priorities associated with those channels. Ready data for each channel may be transmitted over a network path up to the size of the reserved portion for that channel and not greater than a path maximum transmission unit (MTU) size for a network path. This abstract is provided to comply with the rules requiring an abstract that will allow a searcher or other reader to quickly ascertain the subject matter of the technical disclosure. It is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims. | 08-23-2012 |
20120294148 | LOAD BALANCING DISTRIBUTION OF DATA TO MULTIPLE RECIPIENTS ON A PEER-TO-PEER NETWORK - Each peer node in a plurality has a different corresponding key value. Each of the nodes can broadcast one or more items to a plurality of recipient nodes. The recipient nodes are arranged into a list according to a key value order. The list is divided into two or more parts of approximately equal size, and each part of the list and the one or more items is forwarded to a recipient peer node corresponding to a first key value in that part of the list. It is emphasized that this abstract is provided to comply with the rules requiring an abstract that will allow a searcher or other reader to quickly ascertain the subject matter of the technical disclosure. This abstract is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims. | 11-22-2012 |
20140169254 | APPLICATION LEVEL BROADCAST IN PEER OVERLAY NETWORK - A broadcast message may be initiated or received at a peer node. The node obtains an uplink bandwidth available for broadcasting the message over the network and a number of copies that can be broadcast based on the available bandwidth. The node determines a range of key values for finger nodes that should receive copies of the broadcast message from a finger table. The finger table entries include references to finger nodes and key values associated with the finger nodes. The node determines which other nodes should receive copies of the broadcast message from range of key values and the number of copies. The node also determines an End ID for each recipient node. A copy of the broadcast message and corresponding End ID is sent to a finger node if the finger node's key value is within a range of key values specified by the End ID. | 06-19-2014 |