{'fraction_non_alphanumeric': 0.01694915254237288, 'fraction_numerical': 0.0, 'mean_word_length': 4.7771739130434785, '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}}
Age-of-Information Aware Scheduling

We study the task of scheduling in a multi-source system where sources report their time-varying information to a central monitoring station via multiple orthogonal channels. The Age-of-Information of a source is defined as the amount of time elapsed since the latest update from that source was received at the monitoring station. At each time instant, the system pays a cost that is a function of the current Ages-of-Information of the sources. Our goal is to design scheduling policies to minimize this cost. We draw a novel parallel between our scheduling problem and the minimum mean cost cycle problem in weighted graphs and use this insight to design optimal scheduling policies for a very general class of cost functions. In addition, we compare the performance of our policy with naive greedy policies. We show that while greedy policies can be optimal if the cost function is symmetric with respect to the sources, our policy strictly outperforms greedy policies when the cost function is asymmetric across sources.