Abstract: A method for transferring digital content items in a peer-to-peer network in which a plurality of nodes participate includes receiving requests for receipt of one or more digital content items from a plurality of requesting nodes belonging to the peer-to-peer network. A capacity of the requesting nodes to upload data is assessed. Network resources available to the peer-to-peer network for delivering the digital content items or chunks thereof to the receiving nodes are allocated based at least in part on the capacity of the requesting nodes to upload data. The digital content items or chunks thereof are sent to the requesting nodes over the peer-to-peer network in accordance with the network resources that are allocated to each of the requesting nodes.

Abstract: Example apparatus and methods facilitate providing an incremental future-proof license to a master stream of content. The master stream may be related to different instances of content (e.g., different versions) for which there is a unified content representation. A request for content available through the master stream may be received from a licensee. The request may include an explicit indication of which stream of frames is to be accessed or may include implicit information from which a stream of frames may be selected. The selected stream may be changed midstream in response to changing conditions (e.g., bandwidth), events (e.g., gesture), devices (e.g., licensee accesses different device) or explicit requests. As the available streams of frames associated with the content changes, the changes may be mapped to the master stream and made available to the licensee. The licensee may pay an incremental license fee for access to updated content.

Abstract: A dataset comprising a plurality of byte ranges is identified. A tree structure is created that represents different subsets of these byte ranges. The tree structure comprises a plurality of nodes that is each associated with a different subset of the byte ranges. These nodes are hierarchically-arranged, such that byte ranges associated with each child node are a subset of byte ranges associated with each parent node. One or more of the byte ranges are identified for each client of a plurality of clients. These are range(s) that the client needs to obtain. Each client is associated with one of the nodes of the tree structure that is, itself, associated with byte ranges that match the byte ranges that the client needs to obtain. Client peers are identified based on based on traversing the tree structure from a node associated with one client to a node associated with a peer.

Abstract: The techniques and systems described herein implement an improved peer matching service by coordinating peer matching requests across multiple peer matching nodes configured within a peer matching unit so that resource consumption can be spread out and resource limitations are not exceeded. Moreover, the peer matching service can determine if a peer matching unit is overloaded (e.g., experiencing an increased number of requests in a given time interval that is causing performance degradation), and the peer matching service can implement an action to scale out the number of requests within the peer matching unit (e.g., re-distribute some peer matching requests to another peer matching unit). In various examples, the peer matching service can determine if peer devices are co-located peer devices based on location information and can generate a list that prioritizes the co-located peer devices.

Abstract: Identifying peers to a client for the client to obtain data. A method includes receiving from the client an identification of a dataset and a specification of one or more byte ranges of the dataset. As a result, the method further includes identifying one or more other clients associated with the one or more byte ranges of the dataset to acts as peers to the client. The method further includes providing an indication of the one or more of the other identified clients as peers to the client.

Abstract: In some embodiments, a peer matching service classifies client devices into a bucket where similar network identification information is received from the client devices and is associated with an access point to which the client devices are connected to transfer content via a peer to peer transfer. The service determines whether to transition the bucket from a first operating mode into a contention management mode based on a status of client devices in the bucket. The status is based on a connection type for the client devices. When the bucket is transitioned into the contention management mode, the service applies instructions associated with the contention management mode to characteristics associated with the client devices to determine a restriction for peer to peer transfer of the content and communicates with the client devices to apply the restriction to the peer to peer transfer of the content through the access point.

Abstract: In some embodiments, a verification service receives a description for a combination of a set of ranges within content available for download. The set of ranges are not sequentially located in the content that a client device has downloaded. The verification service determines if a first portion of the combination of the set of ranges has been received in a prior request. When the first portion has been received, the verification service retrieves a first set of verification values that represent subsets of content corresponding to the first portion. When at least a second portion of the combination of the set of ranges has not been received, the verification service generates a second set of verification values using subsets of content corresponding to the second portion. One or more of the first set of verification values and the second set of verification values are sent to the client device.

Abstract: Example apparatus and methods facilitate providing an incremental future-proof license to a master stream of content. The master stream may be related to different instances of content (e.g., different versions) for which there is a unified content representation. A request for content available through the master stream may be received from a licensee. The request may include an explicit indication of which stream of frames is to be accessed or may include implicit information from which a stream of frames may be selected. The selected stream may be changed midstream in response to changing conditions (e.g., bandwidth), events (e.g., gesture), devices (e.g., licensee accesses different device) or explicit requests. As the available streams of frames associated with the content changes, the changes may be mapped to the master stream and made available to the licensee. The licensee may pay an incremental license fee for access to updated content.

Abstract: A method for transferring digital content items in a peer-to-peer network in which a plurality of nodes participate includes receiving requests for receipt of one or more digital content items from a plurality of requesting nodes belonging to the peer-to-peer network. A capacity of the requesting nodes to upload data is assessed. Network resources available to the peer-to-peer network for delivering the digital content items or chunks thereof to the receiving nodes are allocated based at least in part on the capacity of the requesting nodes to upload data. The digital content items or chunks thereof are sent to the requesting nodes over the peer-to-peer network in accordance with the network resources that are allocated to each of the requesting nodes.

Abstract: Multiple portions of protected content to host on a device are identified by the device, the multiple portions including one or more portions of each of one or more pieces of protected content. The multiple portions are obtained and stored on the device. The device is one of multiple devices in a managed wireless distribution network that allows portions of protected content to be transferred among the multiple devices via multiple wireless networks hosted by various ones of the multiple devices, and the device is configured to store portions of protected content that can be consumed by a user of the device only if the user of the device has permission to consume the protected content. Participation of the device in the managed wireless distribution network can also be identified, and a reward generated based on the participation of the device in the managed wireless distribution network.

Abstract: Localizing network traffic using network topology is provided. A request for content is received from a first peer of a peer-to-peer (P2P) network having a plurality of peers. In response to receiving a request for content, one or more peers to receive the requested content in the P2P network are determined. One or more nodes in a trace route from the first peer to a predetermined address that are common to the trace route from the one or more peers to the predetermined address are determined. The one or more common nodes are ordered by hops from the first peer. At least one peer is selected from the ordered one or more common nodes to recommend to the first peer. The selected at least one peer is recommended to the first peer. The first peer then connects with the recommended at least one peer and receive the content.

Abstract: A computer system implements a peer-to-peer network that permits peer-to-peer data transfers with privacy with respect to the identities of requestor peers, provider peers and the requested data. The peer-to-peer network encrypts each communication among peers, and each message, whether a request or response, is transmitted through at least one intermediate peer. Each message received by any peer in the system appears the same to each peer in the sense that the message does not reveal how many intermediate peers have processed or will process the message. Further, a source of content is not revealed as a source; and a requestor of content is not revealed as a requestor.

Abstract: In one example, a catalog service may use a peer-to-peer network to distribute a data content item across multiple associated user devices. The catalog service may maintain a device group list describing a device group and a content catalog for the device group listing a data content set stored in the device group. The catalog service may identify a content change to the data content set listed in the content catalog at a seed device of the device group. The catalog service may send an update alert to a leeching device of the device group of the content change to trigger the leeching device to receive the content change over a peer-to-peer network between the seed device and the leaching device.

Abstract: In one example, a peer-to-peer network may use partial seeding to increase the number of seed devices available to a peer device acting as a leeching device. A catalog service may maintain an active peer list for a peer-to-peer network describing active peer devices. The catalog service may track a data file composed of a set of sub-pieces for the peer-to-peer network. The catalog service may identify a device constraint for a peer device of the peer-to-peer network describing a characteristic of the peer device impacting an ability of the peer device to store a sub-piece of the data file. The catalog service may assign a seed sub-piece of the data file based on the device constraint to the peer device when executing a seed client to provide the seed sub-piece to a leeching client on the peer-to-peer network. The catalog service may direct the peer device to retain a persistent sub-piece on the peer device as the seed sub-piece for the peer device until a release event.

Abstract: Example apparatus facilitate controlling how targeted electronic data is selected and couriered (e.g., physically carried) between a provider in a first physical location and a recipient in a second physical location. An apparatus, method, or service may control the flow of targeted electronic data or metadata concerning the targeted electronic data in a courier network. The service may consider requests for targeted electronic data or information from which targeted electronic data can be identified. The service may also consider predictions about content that a recipient may want. The targeted electronic data may be identified based on a current state of an operating system, an application, or content at the recipient and information about a desired state of the operating system, application, or content. The number and identity of courier devices selected to courier data may be based on a familiarity index between couriers and recipients in the courier network.

Abstract: Each computing device in a peer-to-peer network stores particular digital content. A computing device in the peer-to-peer network includes a peer prediction system that obtains an indication of digital content that has not been downloaded to the computing device but is predicted to be downloaded by the computing device in the future (e.g., in response to a user request for the digital content). The peer prediction system obtains a list of peer computing devices in the peer-to-peer network that have at least part of the digital content, and communicates with those peer computing devices to determine connectivity information for each of those peer computing devices. The computing device maintains a record of this connectivity information, and in response to a subsequent user request to download the digital content, uses the maintained record to determine which peer computing devices to access to obtain the digital content.

Abstract: A computer system implements a peer-to-peer network that permits peer-to-peer data transfers with privacy with respect to the identities of requestor peers, provider peers and the requested data. The peer-to-peer network encrypts each communication among peers, and each message, whether a request or response, is transmitted through at least one intermediate peer. Each message received by any peer in the system appears the same to each peer in the sense that the message does not reveal how many intermediate peers have processed or will process the message. Further, a source of content is not revealed as a source; and a requestor of content is not revealed as a requestor.

Abstract: Identifying peers to a client for the client to obtain data. A method includes receiving from the client an identification of a dataset and a specification of one or more byte ranges of the dataset. As a result, the method further includes identifying one or more other clients associated with the one or more byte ranges of the dataset to acts as peers to the client. The method further includes providing an indication of the one or more of the other identified clients as peers to the client.

Abstract: Each computing device in a peer-to-peer network stores particular digital content. A computing device in the peer-to-peer network includes a peer prediction system that obtains an indication of digital content that has not been downloaded to the computing device but is predicted to be downloaded by the computing device in the future (e.g., in response to a user request for the digital content). The peer prediction system obtains a list of peer computing devices in the peer-to-peer network that have at least part of the digital content, and communicates with those peer computing devices to determine connectivity information for each of those peer computing devices. The computing device maintains a record of this connectivity information, and in response to a subsequent user request to download the digital content, uses the maintained record to determine which peer computing devices to access to obtain the digital content.

Abstract: The techniques and systems described herein implement an improved peer matching service by coordinating peer matching requests across multiple peer matching nodes configured within a peer matching unit so that resource consumption can be spread out and resource limitations are not exceeded. Moreover, the peer matching service can determine if a peer matching unit is overloaded (e.g., experiencing an increased number of requests in a given time interval that is causing performance degradation), and the peer matching service can implement an action to scale out the number of requests within the peer matching unit (e.g., re-distribute some peer matching requests to another peer matching unit). In various examples, the peer matching service can determine if peer devices are co-located peer devices based on location information and can generate a list that prioritizes the co-located peer devices.