Abstract: Retrieving erasure-coded fragments associated with approximately sequential segments, including the steps of requesting a first set of the fragments, using a fragment pull protocol, by an assembling device from a plurality of fractional-storage servers, and requesting a second set of erasure-coded fragments, using the fragment pull protocol, to compensate for the fragments of the first set that failed to arrive at the assembling device. And wherein while requesting the first-set fragments associated with a certain segment, at least one compensation request is made for a second-set fragment associated with a prior segment.

Abstract: Adaptation of data centers' bandwidth contribution to distributed streaming operations, including data centers comprising fractional-storage CDN servers storing erasure-coded fragments encoded with a redundancy factor R greater than one, assembling devices obtaining the fragments from subsets of the servers, and measuring fragment delivery parameters, and at least one decision component that occasionally changes at least some of the servers of the subsets to generally improve the measured parameters. Wherein the smaller the number of subsets in which the servers of a data center participate, the lower the center's fragment delivery throughput, the higher the center's cost of delivering a fragment, and the higher the likelihood of reducing the amount of bandwidth acquired from that data center by the operator of the system.

Abstract: Source-selection based Internet backbone traffic shaping, including the steps of assessing a large number of network paths through which erasure-coded fragments usually flow when transmitted from a large number of relevant fractional-storage CDN servers to an assembling device; accessing preferences for fragment delivery via many of the paths; and selecting the servers whose assessed paths fit well the preferences for fragment delivery to the assembling device. Wherein the servers are accessed via the Internet, not all servers are connected to the Internet via the same networks, and the erasure-coded fragments are encoded with a redundancy factor greater than one from contents.

Abstract: Latency based selection of fractional-storage servers, including the steps of identifying a first group of fractional-storage servers estimated to have low response latencies in relation to an assembling device. Retrieving, by the assembling device from a second group of fractional-storage servers, enough erasure-coded fragments for reconstructing approximately sequential segments of streaming content. While retrieving the fragments, identifying at least one server from the second group having latency higher than a certain threshold in response to a fragment pull protocol request. And using the fragment pull protocol to replace the identified server with at least one server selected from the first group.

Abstract: Fault tolerance in a distributed streaming system including fractional-storage CDN servers storing erasure-coded fragments encoded with a redundancy factor greater than one from segments of streaming contents. Each server delivers fragments, at a certain fragment delivery throughput, to multiple assembling devices using a fragment pull protocol, wherein a reduction in the fragment delivery throughput of one of the servers triggers a process in which at least some of the other servers approximately immediately increase their fragment delivery throughput as a reaction to the fragment pull protocol, to compensate for the reduced throughput.

Abstract: Using a distributed storage to its maximum bandwidth including the following steps: for each group of at least one assembling device, selecting a subgroup of fractional-storage CDN servers according to at least one criterion, whereby a plurality of server subgroups are selected for a plurality of assembling device groups. And retrieving, using a pull protocol, by the assembling devices from the subgroups of servers, erasure-coded fragments associated with multiple segments of contents, until the aggregated bandwidth used for retrieving the fragments approaches the aggregated bandwidth of the servers included in the subgroups, and as long as the aggregated bandwidth used for delivering each segment does not exceed the aggregated bandwidth of the servers storing the fragments generated from the segment.

Abstract: Methods and systems for erasure-coded content assembly and retransmission, including assembling servers located at or close to edges of the Internet and spread over a wide area, fractional-storage CDN servers located close to or on the Internet backbone, and client devices spread over a wide area. Each assembling server obtains from the CDN servers erasure-coded fragments associated with segments of streaming content according to an order that enables the assembling server to start streaming the content to its associated clients shortly after reconstructing the first segment.

Abstract: A distributed storage system including fractional-storage servers storing erasure-coded fragments associated with approximately sequential segments of streaming content, and an assembling device issuing aggregated fragment requests, each approximately per short portion of content, approximately according to the order of processing of the content, by using a data structure describing multiple fragment requests; wherein the number of aggregated fragment requests is significantly smaller than the number of the fragments received form the servers in response to the requests.

Abstract: Methods and systems for retrieving content fragments stored in a distributed storage and retrieval system comprising a plurality of storage-and-computing elements. One method comprising, for each content fragment: determining the storage element type that stores the content fragment; determining a first storage-and-computing element physical address from which to retrieve the content fragment; and retrieving the content fragment from the storage-and-computing element located at the first physical address. Then repeating the retrieving of the content fragments, utilizing approximately the maximum available downlink bandwidth, until a minimal streaming buffer required for enabling the playing of a streaming or progressive download content is filled.

Abstract: Methods and systems for streaming from a distributed storage system. One method comprising the steps of receiving a content to be streamed or progressively downloaded; striping the content into small content fragments; distributing the content fragments to storage-and-computing elements according to a fragment distribution information prior to retrieving the content fragments from the storage-and-computing elements; obtaining the fragment distribution information by a retrieving storage-and-computing element; utilizing the fragment distribution information for determining from which of the storage-and-computing elements to retrieve, and retrieving the content fragments from the determined storage-and-computing elements so as to enable approximately instantaneous playing of the streaming content.

Abstract: Methods and systems for distributed storage and retrieval systems comprising a plurality of storage-and-computing elements, each storage-and-computing element storing a plurality of pushed content fragments and able to simultaneously retrieve pushed content fragments from a plurality of storage-and-computing elements. Wherein many storage-and-computing elements, within a short duration of receiving a request, can retrieve and play streaming content.

Abstract: Methods for high bandwidth utilization by a distributed storage system. One method comprising accessing a plurality of storage-and-computing elements distributively storing a plurality of content fragments belonging to ‘N’ contents, wherein at least most of the ‘N’ contents are associated with different retrieving functions and the retrieving functions have low correlations; retrieving the content fragments by assembling storage-and-computing elements, wherein at least most of the assembling storage-and-computing elements assemble different contents; and adding assembling storage-and-computing elements up to a point where the aggregated consumption rate of the contents consumed by the assembling storage-and-computing elements approaches the aggregated uplink throughput of all participating storage-and-computing elements.

Abstract: Methods and systems for fragments retrieval from a type based push to storage system. One method includes the steps of receiving fragment-to-type association information and type-to-physical-address association information of a content comprising a plurality of content fragments distributed among a plurality of storage-and-computing elements; and providing at least one storage-and-computing element physical address for each of the content fragments to be retrieved.

Abstract: Methods and systems for distributed push-to-storage with redundancy. One method includes the steps of setting at least two storage groups according to a required storage redundancy; registering a plurality of peer-to-peer devices; associating the peer-to-peer devices with at least one of the storage groups; receiving a first content having a large size to be stored in the at least two storage groups; fragmenting the first content into a plurality of first content fragments having a small size; and distributing the first content fragments approximately homogenously between the peer-to-peer devices associated with each storage group according to a first distribution function associated with each storage group.

Abstract: Methods and systems for pushing content fragments into a distributed storage system, comprising registering a plurality of storage-and-computing elements that are accessed using Internet protocol; associating the plurality of storage-and-computing elements with a plurality of storage element types; and distributing content fragments to the storage-and-computing elements utilizing a predefined distribution function that maps content fragments to storage element types.

Abstract: A distributed storage system comprising a plurality of storage-and-computing elements, each storing a plurality of small content fragments associated with a plurality of contents, wherein a content retrieval load is shared between the storage-and-computing elements such that approximately the total uplink bandwidth of the distributed storage system can be utilized, on a continuous basis, by virtually any combination of multiple storage-and-computing elements simultaneously retrieving many contents or retrieving the same content with different time shifts.

Abstract: Methods for receiving emotional state indications and identifying a business process problematic part or providing statistical data in correlation with corresponding business process parts or comparing interchangeable business process parts.