Sony Computer Entertainment Inc.

Sony Interactive Entertainment Inc.

James E Marr

Payton R White

Attila Vass

Stephen Cain Detwiler

Yutaka Takeda

John Paul Bates

Gary M Zalewski

Howard Berkey

Hirotoshi Maegawa

Tatsuya Iwamoto

Shin Iima

David Gaxiola

Vivek Chopra

Traversal of a Network Address Translator (NAT) can be facilitated for a mobile device configured to communicate with one or more other devices over a network via one or more wireless access points.A direction of travel can be estimated for the mobile device.One or more wireless access points the mobile device is likely to encounter can be predicted usingtheanestimated direction of travelfor the mobile device. Information regarding behavior of one or more NATs associated with the predicted wireless access point(s) can be predicted. Such information can be stored in such a way that the information is retrievable by one or more other devices or using the information to traverse one or more of the NATs. Alternatively, information can be retrieved regarding behavior of one or more NATs associated with the predicted wireless access points. This information can be used to traverse one or more of the NATs.

NAT traversal for mobile network devices

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.

Network bandwidth detection and distribution

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.

Load balancing distribution of data to multiple recipients on a peer-to-peer network

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.

Predictive frame dropping to enhance quality of service in streaming data

Traversal of a Network Address Translator (NAT) can be facilitated for a mobile device configured to communicate with one or more other devices over a network via one or more wireless access points. A direction of travel can be estimated for the mobile device. One or more wireless access points the mobile device is likely to encounter can be predicted using the estimated direction of travel. Information regarding behavior of one or more NATs associated with the predicted wireless access point(s) can be predicted. Such information can be stored in such a way that the information is retrievable by one or more other devices or using the information to traverse one or more of the NATs. Alternatively, information can be retrieved regarding behavior of one or more NATs associated with the predicted wireless access points. This information can be used to traverse one or more of the NATs.

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.

Adaptive DHT node relay policies

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.

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.

Network communication protocol for large scale distribution of streaming content

An atomic compare and swap operation that can be implemented in processor system having first and second processors that have different sized memory transfer capabilities. The first processor notifies the second processor to perform a compare and swap operation on an address in main memory. The address has a size less than or equal to a maximum memory transfer size for the second processor and greater than a maximum memory transfer size for the first processor. The second processor atomically performs the compare and swap operation and notifies the first processor of the success or failure of the compare and swap operation.

Atomic compare and swap using dedicated processor

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.

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.

Systems and methods for mediation of content-related services are provided. A client device playing content may send a request for a service related to the content. Configuration information is generated for the client device, reflecting a set of permissions that are determined based on a market segment of the client device. Once the client device is configured according to the set of permissions, the client device can communicate with a service provider of the requested service. Such communication and any further activity regarding the service is governed by the set of permissions, as is reporting regarding such communication and activity

Mediation of content-related services

Atomic operation may be implemented in a processor system comprising a main memory and a power processor element (PPE) including a power processor unit (PPU) coupled to an external cache. The PPE may atomically load data from a lock-line in the main memory into a first location X in the external cache. A size of the data and the lock line may be larger than a data size for the standard atomic operations that may be performed with the PPE. The data may be reserved in a second location Y in the external cache.

Atomic operation on non-standard sized data using external cache

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.

Growing community of inventors

Burlingame, CA, United States of America

James E Marr