{'fraction_non_alphanumeric': 0.02437106918238994, 'fraction_numerical': 0.0, 'mean_word_length': 5.033175355450237, '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}}
Improved Fair Scheduling Mechanism in Distributed WiMAX Mesh Networks

In Distributed WiMAX Mesh Networks (DWMN), a joint solution with FEBA (Fair End-to-end Bandwidth Allocation) and DRR (Deﬁcit Round Robin) can be used to achieve high end-to-end throughput fairness. Even then, the higher the number of hops a traffic flow traverses, the longer becomes the end-to-end delay of the traffic flow. This will result in serious unfairness of service quality among real-time traffic flows with different path length since they are delay-sensitive. In this paper, an improved fair scheduling mechanism based on the previous joint solution is proposed to deal with the above-mentioned problem by assigning a greater scheduling weight to the relayed traffic flows. Moreover, a new fairness index is defined to evaluate the service quality fairness of traffic flows. The proposed mechanism is compared with the previous joint solution by simulation. The results indicate that our proposed mechanism can provide better service quality fairness among real-time traffic flows without decreasing their throughput fairness. And it is also effective to improve the service quality fairness and throughput fairness of non-real-time traffic flows when the network is under a certain load.