{'fraction_non_alphanumeric': 0.016408386508659983, 'fraction_numerical': 0.0, 'mean_word_length': 5.574850299401198, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Service aggregation through rate adaptation using a single storage format

Service aggregation schemes like batching, caching and rate adaptation can enable large scale interactive multimedia services, such as movies-on-demand and popular television programming. These applications are characterized by a large user population and a high density of access. Rate adaptation is a dynamic service aggregation technique that can merge streams and reclaim resources at run-time. Existing schemes for rate adaptation are expensive since they require multiple content storage formats or special hardware, therefore, this technique has not been exploited so far. We propose a novel data placement and disk scheduling strategy which supports two different content progression rates originating from a single storage format, and that is applicable to single-disk architectures as well as to multi-disk architectures with large or small stripe-sets. The proposal leads to a feasible solution for dynamic service aggregation via rate adaptation, thereby making large scale multimedia services more economical.