Performance Analysis of Continuous Time Exhaustive-limited(K=2)Two-level Polling System
To achieve differentiated network priorities,ensure fairness,and improve the performance and efficiency of common sites,a continuous time exhaustive-limited(K=2)two-level polling system is proposed based on the exhaustive-limited(K=1)two-level polling control system model.First,this model uses a limited(K=2)service and an exhaustive service for normal and central sites,respectively.Second,a piggyback inquiry is used when the central site is converted into a common site for service.Finally,the Markov chain and probabilistic generating function establish the polling system model and derive the average queue length and time delay.The simulation experiments are conducted using MATLAB.The experimental results show that the error between the theoretical and simulated values is small and consistent,thereby verifying the correctness of the theoretical analysis.Compared with the gated-exhaustive service model,the length and time delay of the central site of the model are smaller than the length and time delay of the gated-exhaustive service central site,indicating that the model has a higher priority.Additionally,compared with the one-level exhaustive service and the one-level limited(K=2)service models,which differentiate priorities,performance is improved by 11.7%and 14.5%respectively,indicating that the two-level service is far better than the one-level service.Furthermore,compared to the exhaustive-limited(K=1)two-level service model,which increases the data sent,the waiting time is reduced and performance is improved by about 13.04%,optimizing the performance of the common site even more.
prioritycontinuous timeexhaustive-limited(K=2)average queue lengthaverage time delayservice efficiency
国家科技期刊平台
NSTL
万方数据
维普
