Sony Corporation

Pivotal Software, Inc.

Other

Sudhir Menon

Michael D Hudson

Glen Curtis Shipley

Mark W Goschie

Brian L Windheim

Darin L Stewart

Bruce Schuchardt

Anilkumar M Gingade

Jagannathan Ramnarayanan

Darren L Stewart

Darrel Scott Schneider

Hitesh Khamesra

Asif Hussain Shahid

Kirk Van Lund

Lynn Gallinat

A multi-source peer content distribution system transfers content files from multiple, distributed peer computers to any requesting computer. The content distribution network coordinates file transfers through a mediation system including a content catalog and a host broker system. The content catalog contains an identification of each content file, the segmented subunits of each file, and the peer caches to which the subunits have been distributed. The host broker system receives content file requests issued over a network from requesting computers. In response, manifest files identifying the request corresponding content subunits and distributed cache locations are returned. The requesting computers can then retrieve and assemble the corresponding content subunits from the peer computers to obtain the requested content file.

Centralized selection of peers as media data sources in a dispersed peer network

A distributed parallel processing database that processes data in a Java environment allocates memory both on a Java heap and off a Java heap. The distributed parallel processing database includes multiple servers. Each server executes a Java virtual machine (JVM) in which data allocated to the server is processed. When a JVM of a server starts, the JVM can specify an off-heap memory size, based on a JVM start parameter. The server can designate memory of the specified size that is off JVM memory heap as off-heap memory. The off-heap memory is different from heap memory in the Java environment, and is managed by a garbage collector that is outside of the Java environment. The server can process data designated as off-heap memory eligible in the off-heap memory. The off-heap memory can improve database operations that create a large number of similar-sized objects in memory by reducing Java memory management overhead.

Off-heap memory management

Event routing in a distributed computing system with distributed data management is optimized by communicating events a datum only to either backup server processes or server processes respectively associated with an application process having an interest in an event affecting the datum.

Optimized event routing in distributed data management

A hierarchical content distribution system includes a seeding server, a plurality of geographically distributed content platforms, and a distribution controller, all interconnected by a communications network. The seeding server initially receives content files for distribution to various content platforms that provide for the persistent storage of the content files. Each content platform includes a content file server responsive on-demand to requests for the transfer of content files. The distribution controller autonomously monitors the transfers of content files and selectively issues transfer directives to the content platforms to modify the distribution of content files among the content platforms. The content file servers respond to received transfer directives by issuing requests for the transfer of the directive identified content files, thereby conforming the specific distribution of content files to an optimal distribution pattern as determined by the distribution controller based on usage patterns.

Event routing in a distributed computing system with distributed data management is optimized by communicating an event affecting a datum only to either backup server processes or server processes respectively associated with an application process having an interest in an event affecting the datum.

Media content, including content suitable for streaming, is distributed to and accessible over a communications network by computer nodes within a peer storage network of computer nodes hosting respective content stores. Discrete portions of a content file are multiply distributed to and persisted in a distributed set of the content stores existing within the storage network such that various content stores persist subsets of the content file portions. A computer node retrieves the discrete portions of the content file from the various distributed content stores, depending on node availability, the particular discrete portions there available, and node and network performance factors sufficient to maintain a minimum quality of service, thereby enabling streaming presentation of the content file on the requesting computer node.

System and methods of streamlining media files from a dispersed peer network to maintain quality of service

System and methods of streaming media files from a dispersed peer network to maintain quality of service

A multi-source peer content distribution system transfers content files from multiple, distributed peer computers to any requesting computer. The content distribution network coordinates file transfers through a mediation system including s content catalog and a host broker system. The content catalog contains an identification of each content file, the segmented subunits of each file, and the peer caches to which the subunits have been distributed. The host broker system receives content file requests issued over a network from requesting computers. In response, manifest files identifying the request corresponding content subunits and distributed cache locations are returned. The requesting computers can then retrieve and assemble the corresponding content subunits from the peer computers to obtain the requested content file.

Growing community of inventors

Portland, OR, United States of America

Sudhir Menon