Dynamic Bandwidth Allocation Scheme In Lr-Pon With Performance Modelling And Analysis

Abstract

We consider models of telecommunication systems that incorporate probability, dense real-time and data. We present a new formal abstraction method for computing minimum and maximum reachability probabilities for such models. Our approach uses strictly local formal abstract steps to reduce both the size of abstract specifications generated and the complexity of operations needed, in comparison to previous approaches of this kind. A selection of large case studies are implemented the techniques and evaluate, which include some infinite-state probabilistic real time models, demonstrating improvements over existing tools in several cases. The capacity of metro and access networks are extended the reach and split ratio of the conventional Long - Reach Passive Optical Networks (LR-PONs). The efficient solutions of LR-PONs are appeared in feeder distances around 100km and high split ratios up to 1000-way . Among many existing approaches, one of the most e ffective options to improve network performance in LR-PONs are the multi-thread based dynamic bandwidth allocation (DBA) scheme where several bandwidth allocation processes are performed in parallel is considered. Without proper intercommunication between the overlapped threads, multi-thread DBA may lose e fficiency and even perform worse than the conventional single thread algorithm. Real Time Probabilistic Systems are used to evaluate a typical PON systems performance. This approach is more convenient, flexible, and lower cost than the former simulation method, which do not need develop special hardware and software tools. Moreover, how changes in performance depend on changes in the particular modes can be easily analysis by supplying ranges for parameter values. The proposed algorithm with traditional DBA is compared, and shows its advantage on average packet delay. The key parameters of the algorithm are analysed and optimized, such as initiating and tuning multiple threads, inter -thread scheduling, and fairness among users. The algorithms advantage in numerical results are decreased the average packet delay and improve network throughput under varying offered loads.