{'fraction_non_alphanumeric': 0.02410901467505241, 'fraction_numerical': 0.007337526205450734, 'mean_word_length': 5.201298701298701, '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}}
Simulation of lead-time scheduling in PMP FWA networks

The terrestrial point-to-multipoint fixed wireless access (PMP FWA) systems have evolved from their first circuit-switched proprietary implementations in the 1970s into flexible, packet-based solutions available to competitive local exchange carriers (CLEC) for providing POTS and Internet access in WAN and MAN. Examples of such systems can be seen in a number of proprietary technologies, as well as in the commercial implementations of the IEEE 802 families of standards. The purpose of this paper is to evaluate the performance of a PMP FWA system in the context of today's packet based IntServ infrastructure. The evaluation takes into account three scheduling algorithms (FIFO, strict priority, and lead-time) in a number of different configurations. This paper also proposes a set of mechanisms that can be introduced into the IntServ framework to support the lead-time scheduling algorithm.