{'fraction_non_alphanumeric': 0.02420135527589545, 'fraction_numerical': 0.0, 'mean_word_length': 5.628205128205129, '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}}
Controllability of switched server systems with service-time and queue constraints on buffers

The service-time-limited (STL) scheduling policy with lower and upper service-time adjustable factors, admits service-time constraints on buffers, but does not bring queue constraints on buffers. However, the buffer capacity is finite for most of real-world problems. Motivated by this problem, this paper considers the execution of the STL scheduling policy with finite buffer capacity. First, the notion of controllability of the state in safety region is introduced, meaning that the solution to switched server systems with controllable initial state remains in safety region forever, and asymptotically converges to a periodic solution. Furthermore, a sufficient condition for determining factors ensuring the state is controllable, is presented, which establishes the relation between controllability of the state and upper service-time adjustable factors in the STL scheduling policy. The simulation results illustrate our results.