{'fraction_non_alphanumeric': 0.017993456924754635, 'fraction_numerical': 0.0010905125408942203, 'mean_word_length': 5.371527777777778, '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}}
Performance Modeling and Analysis for Dynamic Bandwidth Distribution Scheme Using Real-Time Probabilistic System

The passive optical network (PON), with its inherent point to multi-point structure, allows for centralized placement of active equipment and possible extension of its boundary towards core networks. This property of the PON can be exploited for node consolidation where multiple central offices are replaced by a single one covering a larger service area. Such node consolidation is being particularly driven by the need for network operational cost saving, and is offering significant challenges to PONs. The degree of node consolidation that can be achieved is limited by the reach of conventional PON systems. In order to achieve a larger degree of node consolidation, an extension of the PON reach, beyond the conventional 20 km, is required. This article addresses the challenges of the dynamic bandwidth allocation (DBA), where increased reach results in a degradation of DBA performance and quality of service support. We use Real Time Probabilistic Systems to evaluate a typical PON systems performance. The approach is more convenient, flexible, and lower cost than the former simulation method which needs develop special hardware and software tools. Moreover, we can easily analysis how changes in performance depend on changes in a particular modes by supplying ranges for parameter values. We compare the proposed algorithm with traditional DBA, and show its advantage on average packet delay. We then analyze and optimize key parameters of the algorithm, such as initiating and tuning multiple threads, inter-thread scheduling, and fairness among users. Numerical results demonstrate the algorithms advantage to decrease the average packet delay and improve network throughput under varying offered loads.