基于离散消失排队的网络最大流计算方法

Calculation method of network maximum flow based on discrete dropping queue

为有效描述计算机网络中的最大流问题,基于离散消失排队和三维元胞自动机提出一种计算方法。利用线性分形稳定运动降低数据包突发性,利用离散消失排队和元胞自动机刻画系统最大流状态以及数据包传输过程。通过仿真实验,研究影响该算法的关键因素,对比分析该算法与网络单纯形法、最短增载轨法之间的性能状态,其结果表明该算法具有较好的适应性。

To mitigate the maximum flow in the computer network,a calculation method（queuing and cellular automata,QCA）was proposed based on discrete dropping queue and three-dimension cellular automata.The burst of packets was cut down using linear fractional stable motion.The maximum flow states of the system and packet transmission process were depicted using discrete dropping queue and cellular automata.The simulation was conducted to study the key factors of QCA.The results show that,compared to simplex algorithm and distance-directed augmenting path algorithm,QCA has better adaptability.