ISSN:
1572-9397
Keywords:
ATM network management
;
virtual paths
;
circuit-switching
;
multicommodity network optimization
;
add drop heuristic for combinatorial optimization problems
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract This paper addresses the problem of virtual path management in ATM networks, which is the problem of jointly selecting efficient virtual trunk routes and sizing them to meet end-to-end grade-of-service requirements. The problem is posed over capacitated networks and is formulated as a two-level multi-commodity network flow problem with linear side-constraints (physical layer capacity) and non-linear side constraints (end-to-end/link blocking). Through a variety of examples we show the method (i) generates solutions that agree with engineering judgement, (ii) can solve VP layout management for realistic size networks (of up to 200 nodes) in reasonable time and (iii) provides upper bounds on how far the solution strays from the mathematically optimal design.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1009613710108
Permalink
