Seventh IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'99)
The Design and Management of ATM Virtual Path Connection Networks
College Park, Maryland
March 24-March 28
ISBN: 0-7695-0381-0
Modern communication networks can cross connect traffic flows to form logical end-to-end connections between all origin-destination pairs and thus create fully meshed logical networks upon sparse physical networks. Such logical connections are known as virtual path connections (VPCs) and a logical network formed by VPCs is known as a VPC network (VPCN). We present an efficient algorithm called XFG to compute optimal configurations for VPCNs carrying multi-service traffics. We compare the features of the XFG algorithm and the characteristics of standard nonlinear programming solvers. We present a model where a sequence of busy period multi-service traffics is offered to a network. The XFG algorithm is used to compute an optimal VPCN design for each busy period. We compare the grade of service attained by VPCN redesign, dynamic alternative routing (DAR), and a combination of VPCN redesign, call queuing and DAR.
Index Terms:
ATM networks; call admission control; network resource management; nonlinear optimization; virtual path connection networks
Citation:
A. Arvidsson, S.A. Berezner, A.E. Krzesinski, "The Design and Management of ATM Virtual Path Connection Networks," mascots, pp.2, Seventh IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'99), 1999