Abstract: A head mounted display device that displays three dimensional images from a mobile device, which includes a strap that secures the head mounted display to the head of a viewer, a viewing assembly connected to the strap, that includes a housing, a mobile device holder, connected to the housing, a reflecting surface, connected to the housing, that reflects images displayed by the mobile device; and an eyepiece onto which the reflecting surface reflects the images.

Abstract: A head mounted display device that displays three dimensional images from a mobile device, which includes a strap that secures the head mounted display to the head of a viewer, a viewing assembly connected to the strap, that includes a housing, a mobile device holder, connected to the housing, a reflecting surface, connected to the housing, that reflects images displayed by the mobile device; and an eyepiece onto which the reflecting surface reflects the images.

Abstract: A device maintains multiple signatures, including at least one signature for each of a plurality of data items. At least corresponding signature for a data item is based at least in part on a given function of at least some of the contents of that data item. The device receives a particular sequence of bits and determines at least one signature for that particular sequence of bits, based at least in part on the given function of at least some of the particular sequence of bits. The device determines, based at least in part on the signature for the particular sequence of bits, and using the multiple signatures, whether the device may access the particular sequence of bits.

Abstract: A first data item is split into one or more parts. A corresponding name is determined for each of the one or more parts, each part name being determined using a message digest function or hash function of all of the data in the corresponding part. A second file is created to include the part names of the one or more parts of the first data item. Each of the one or more parts is caused to be distributed to at least one location in a computer network. In response to a request for the first data item, the second file is provided. The name of the second file may be published as a name for the first data item. The network may be a peer-to-peer network.

Abstract: Access to data items uses names based on the data in the data items; the name of a data item may be based, at least in part, on a function of some or all of the bits that comprise the data item. A data item may comprise an arbitrary sequence of bits. The function may include a hash function or a message digest function. The name of a data item may be compared to a list of names of other data items.

Abstract: A plurality of data items are distributed across a plurality of computers, some of which may form a peer-to-peer network. A first computer receives a request for a data item from a requesting computer. The request includes a True Name of the data item. The first computer causes the requesting computer to obtain the data item from a second computer, distinct from the first computer. The first computer may not have a copy of the requested data item. The first computer may know the location of the data item. The first computer may forward the request for the data item to at least one other computer.

Abstract: A computer-implemented method operable in a computer system comprising a plurality of computers including at least a first computer and at least two second computers, the method includes: obtaining a first identifier from the first computer at the at least two second computers, said first identifier having been determined, at least in part, by applying a first function to the content of the data item, wherein the first function comprises a hash function; and at least one of the at least two second computers using the first identifier to ascertain a storage location for the data item on the computer system. At least one of the at least two second computers may use the first identifier to access the data item on the computer system. The method may include verifying that the content of the data item has not changed since creation of the first identifier.

Abstract: A method of managing information in a content-addressable computer system comprising a plurality of computers including at least a first computer and at least two second computers. The method includes creating a first identifier for a data item, at least in part, by hashing the content of the data item; sending a request including the first identifier from the first computer to the at least two second computers to access the data item, wherein at least one of the at least two second computers uses the first identifier to access the data item; and verifying that the content of the data item has not changed since the creation of the first identifier. 2. The method may include using the first identifier to locate a storage location for the data item on the computer system.

Abstract: A file system includes a plurality of servers to store file data as segments or chunks; and first data that includes file identifiers for files for which the file data are stored as segments; and second data that maps the file identifiers to the segments to which the file identifiers correspond; and location data that identifies which of the plurality of servers stores which of the segments, the location data being keyed on segment identifiers, each segment identifier being based on the data in a corresponding segment.

Abstract: A method, in a system in which a plurality of data items are distributed across a plurality of computers, includes, at a first computer in the network, (a) receiving from a requesting computer in said network, a request, the request including a specific name of a particular data item, wherein the particular data item comprises a particular sequence of bits, and wherein the specific name of the particular data item is based at least in part on the data comprising the particular data item, the specific name of the particular data item having been determined, at least in part, using a given function of the particular sequence of bits, wherein two identical sequences of bits have the same name as determined using the given function; and (b) causing said requesting computer to obtain at least a portion of said particular data item from a second computer in said network, said second computer being distinct from said first computer.

Abstract: In a data processing system, a method includes deleting a particular copy of a data item when at least one other copy of the data item is available. The presence of another copy of the data item is determined, at least in part, based on an identifier for the data item, the identifier having been computed using all of the data in the data item and only the data in the data item, wherein two identical data items in the data processing system will have identical identifiers. The particular copy of the data item may be deleted if another copy of the data is determined to be present on another processor in the system or on the same processor. The identifier of the data item is computed using a function such as a message digest or hash function which may be: MD4, MD5, or SHA.

Abstract: A method of distributing a data item to a plurality of computers in a network of computers. A data item is divided into a plurality of segments. Each segment is stored on at least one computer in said network. A list of computers onto which each of said segments has been stored is maintained. When a data item is requested, its component segments are obtained from at least two computers in the network. Some of the computers may form a peer-to-peer network.

Abstract: Similarity of data items is determined by analyzing corresponding segments of the data items. A function is applied to each segment of a data item and the output of that function is compared to the output of the same function applied to a corresponding segment of another data item. A function may be applied to the output of the functions. The functions may be hash or message digest functions.

Abstract: Access to and delivery of licensed content is controlled using content names that were determined based on the content. A name for a data item is obtained, the name having been determined based at least in part on the data which comprise the contents of the data item. Access to the data item is authorized based at least in part on the name. Once authorized, access may be granted from more than one computer. The name may have been determined using a hash or message digest function such as MD4, MD5 or SHA. The data item may comprise a file, a portion of a file, a page in memory, a digital message, a digital image, a video signal or an audio signal.

Abstract: Data files are distributed across a plurality of computers. The computers may form a network such as a content delivery network (CDN) or a peer-to-peer network. The network may operate as a TCP/IP network such as the Internet. Data files may represent may represent digital messages, images, videos or audio signals. For content—data items or files in the system—a name is obtained (or determined), where the name is based, at least in part, on a given function of the data in a data item or file. The given function may be a message digest or hash function, and it may be MD4, MD5, and SHA. A cony of a requested file is only provided to licensed (or authorized) parties. The system may check one or more computers for unauthorized or unlicensed content. Content is served based on a measure of availability of servers.

Abstract: In a data processing system, a mechanism identifies data items by substantially unique identifiers which depend on all of the data in the data items and only on the data in the data items. Existence means determine whether a particular data item is present in the system, by examining the identifiers of the plurality of data items.

Abstract: A domain name server (DNS) system for processing domain name requests includes a query mechanism constructed and adapted to obtain a user request for response information corresponding to a particular domain name; and provide complete response information in a single response to the user request. The user request may be a domain name resolution request and the query mechanism provides an Internet Protocol (IP) address corresponding to the domain name. A different response may be provided, depending on context information. The system may include an Internet protocol processor and an underlying database repository. The system incorporates a database layout and associated database query strategy that may comprise multiple components which significantly reduces the transaction processing time and overhead as compared to conventional implementations.

Abstract: In a system in which a set of data items are distributed across a network of servers, at least some of the data items being cached versions of data items from a source server, a content delivery method includes determining a data identifier for a particular data item, the data identifier being determined using a given function of the data comprising the particular data item; and responsive to a request for the particular data item, the request including at least the data identifier of the particular data item, providing the particular data item from a given one of the servers of the network of servers. The request for the particular data item may be resolved based on a measure of availability of at least one of the servers, where the measure of availability may be a measurement of bandwidth to the server; a measurement of a cost of a connection to the server, and/or a measurement of a reliability of a connection to the server.

Abstract: In a data processing system, a mechanism identifies data items by substantially unique identifiers which depend on all of the data in the data items and only on the data in the data items. Existence means determine whether a particular data item is present in the system, by examining the identifiers of the plurality of data items.

Abstract: In a data processing system, a mechanism identifies data items by substantially unique identifiers which depend on all of the data in the data items and only on the data in the data items. The system also determines whether a particular data item is present in the database by examining the identifiers of the plurality of data items.