论文部分内容阅读
This paper builds a multi path routing assignment model for multi traffic class data networks. The formulation is aimed at finding an efficient way to split traffic load in real time over multi path to balance the traffic flow and utilize the network infrastructure efficiently. The problem is formulated into a set of linear programming porblems and the solution of it will give every traffic class a union path to minimize the total expected delivery time for the traffic to a specified destination. A label setting algorithm is proposed to solve the problem and some numerical results are obtained by simulation.
The paper builds a multi path routing assignment model for multi traffic class data networks. The formulation is aimed at finding an efficient way to split traffic load in real time over multi path to balance the traffic flow and utilize the network infrastructure efficiently. formulated into a set of linear programming porblems and the solution of it will give every traffic class a union path to minimize the total expected delivery time for the traffic to a specified destination. A label setting algorithm is proposed to solve the problem and some numerical results are obtained by simulation.