The Optimal Virtual Path Design of ATM Networks

This paper studies the optimal configuration of virtual paths in ATM networks. A linear model that minimizes the mrximumjow density of links is proposed for the optimal virtual path configuration. The advantage of the modeling is that trafic loads are distributed evenly over entire network. An algorithm based on the multi-commodity approach is proposed to solve the problem. Examples are given to show that this algorithm solves the optimal VP assignment problem very quickly and eficiently. Since only single source-destination linear programming suhproblems need to be solved in our approach, this algorithm can be applied to large-scale networks.

• Type: Conference
• Year: 1997
• Where: LCN
• Authors: Zhigang Qin, Tetiana Lo, Felix F. Wu
• Keywords: Computer Networks, LCN 1997, Optimal Configuration, Optimal Virtual Path, Virtual Path