ATM网络最小最大信元丢失率路由规划

Routing program of minimax cell losing rate in ATM networks

本文基于ATM网络交换节点 ,建立其数学模型 ,以链路最大信元丢失率最小为目标 ,对ATM网络路由选择作数学规划 ,并进行计算机模拟。结果表明 ,对于简单的拓扑结构 ,最小最大信元丢失率的路由策略和最短路径策略效果类似 ;对于复杂的拓扑结构 ,由于链路信元丢失率差别较大 ,应先计算出各条链路的最大信元丢失率 。

Based on the switch nodes in ATM networks,this paper discusses its mathematics model For the goal of minimax cell losing rate of links it makes the routing program in ATM networks,and simulates with computers The result shows,that for the simple topology structure the routing strategy of minimax cell losing rate is similar to the strategy of the shortest paths and for the complex topology structure,it should be first counted the maximum cell losing rate of each link,then minimized the cell losing rate over the all route,because the difference of cell losing rate of every path is large