论文部分内容阅读
求解排队系统的等待时间分布对于系统规划及性能分析具有重要意义 ,在排队系统 (GI/G/1)中这一问题通常难以得到显式的理论解。从该问题的 Wiener- Hopf积分方程出发 ,利用排队系统的固有特征将问题转化为一个线性方程组 ,并讨论了使用迭代法求解该方程组的收敛性和复杂度。文中给出了几种系统模型下的数值实验数据 ,并与已有方法进行了比较 ,结果表明 :该方法在不同模型、不同负载下均能给出精确的计算结果 ,实验中通过合理选择计算参数可将误差控制在 0 .0 5 %以内。该方法易于实现、计算效率高 ,具有较好的实用性。
It is very important to solve the waiting time distribution of queuing system for system planning and performance analysis. It is usually difficult to obtain an explicit theoretical solution in queuing system (GI / G / 1). Starting from the Wiener-Hopf integral equation of the problem, the inherent characteristics of the queuing system are used to transform the problem into a linear system of equations. The convergence and complexity of solving the system using iterative methods are discussed. In the paper, numerical experiment data under several system models are given and compared with the existing methods. The results show that this method can give accurate calculation results under different models and loads. In the experiment, The parameter can control the error within 0. 05%. The method is easy to implement, computationally efficient and has good practicability.