The optimal virtual path design of ATM networks

Author

Qin, Zhigang ; Lo, Tetiana ; Wu, Felix F.

Author_Institution

Optimal Networks, Palo Alto, CA, USA

fYear

35735

fDate

2-5 Nov1997

Firstpage

159

Lastpage

167

Abstract

This paper studies the optimal configuration of virtual paths in ATM networks. A linear model that minimizes the maximum flow density of links is proposed for the optimal virtual path configuration. The advantage of the modeling is that traffic 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 efficiently. Since only single source-destination linear programming subproblems need to be solved in our approach, this algorithm can be applied to large-scale networks

Keywords

asynchronous transfer mode; linear programming; telecommunication network management; telecommunication network routing; ATM networks; large-scale networks; linear model; maximum flow density; optimal configuration; optimal virtual path configuration; optimal virtual path design; source-destination linear programming; traffic loads; Asynchronous transfer mode; Communication system traffic control; Computer networks; Linear programming; Network topology; Quality of service; Routing; Switches; Telecommunication traffic; Virtual colonoscopy;

fLanguage

English

Publisher

ieee

Conference_Titel

Local Computer Networks, 1997. Proceedings., 22nd Annual Conference on

Conference_Location

Minneapolis, MN

ISSN

0742-1303

Print_ISBN

0-8186-8141-1

Type

conf

DOI

10.1109/LCN.1997.630979

Filename

630979