排队理论中的数学模型优化仿真分析

Queuing Theory of Mathematical Model Optimization Simulation Analysis

针对排队理论中的数学模型在处理非均匀排队数据时,一旦数据较多,会存在"饿死"问题,在原有模型的基础上设计并实现了一种趋于优先服务的数学模型。该算法根据队列长度和队首信元等待时间的权值修改输入数据,使得权值大的队列趋于优先服务,从而优化了在非均匀数据下的调度性能。以网络资源调度为测试用例进行算法验证测试,仿真结果表明,改进后的数学模型与经典模型相比,在均匀业务下的性能近似,而在非均匀业务下性能有了较大的提升。

According to the mathematical model of the queuing theory in dealing with heterogeneous queue data, once the data is more, there will be ＂starve to death＂, in the original model based on the design and realize a priority service tend to the mathematical model. This algorithm according to the queue length and waiting time, team ShouXin yuan weights modified input data, makes the right value tends to queue priority services, so as to optimize the heterogeneous data of scheduling performance. Take the network resource scheduling algorithm for test cases for testing, the simulation results show that the impro＇ced mathematical model and classical model, compared to the uniform business performance under approximation, and in heterogeneous business performance under a bigger promotion.