{'fraction_non_alphanumeric': 0.026726057906458798, 'fraction_numerical': 0.004454342984409799, 'mean_word_length': 4.663865546218488, '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}}
Design of a starvation-free storage system for a multicast video-on-demand system using a double-rate batching policy

Current implementations of video-on-demand (VoD) use a dedicated stream to serve an individual customer. This is not cost-effective. In order to increase the system performance, a multicast transmission technique is used in a VoD system. However, the customers would suffer from a long start-up delay in a multicast system. Thus, the double-rate batching policy was proposed to serve the customers as soon as possible. In this policy, new customers are first served by the dedicated streams by doubling the transmission rate so that they can catch up and join into one of the multicast groups. As the transmission rate is changed, the traditional disk scheduling is not suitable for the double-rate batching policy. In this paper, efficient disk scheduling schemes are developed to provide a starvation-free storage system for the multicast VoD system using double-rate batching. The results show that when the request rate is 0.1 arrivals/s, only 22 disks are sufficient to reduce the waiting time to less than 0.5s. In addition, the memory requirement of the scheduling algorithm in the server is also evaluated. It is shown that the proposed schemes require less memory than the traditional VoD system for the popular movies.