{'fraction_non_alphanumeric': 0.025373134328358207, 'fraction_numerical': 0.0, 'mean_word_length': 4.938053097345133, '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}}
Flow scheduling protocols without real-time clocks

The authors propose replacing the real-time clock, used in scheduling protocols to determine the packet's arrival time to the multiplexor, by an event-driven, discrete clock. The multiplexor advances its discrete clock, at the start of serving any packet, by a value equal to the service time needed to serve that packet. The discrete clock is implemented in three different timestamping protocols. They prove that using discrete clock preserves the bounds on delay. They also illustrate the relations between the valve of the time-stamp based on a real-time clock, and the corresponding value based on discrete clock.