An optimization method for broadband ISDN networks
André Girard, E.B. Gardouh · 2002
Considers the dimensioning and routing optimization of a broadband ISDN network with an arbitrary number of call classes under grade of service constraints expressed as a maximum loss probability for each class. The model applies equally well to a multi-rate circuit-switched network or to an ATM network operating in a virtual circuit mode through the use of equivalent bandwidth. Each traffic class is characterized by its matrix, its bandwidth expressed as a multiple of some convenient unit (typically the bandwidth for a voice call) and a gross revenue produced whenever the call is connected. The authors derive expressions for the induced costs of each class and the corresponding optimality conditions. From these conditions, they present a decomposition method for computing the routing and link sizes that will maximize the value of the network. Because of space limitation, they emphasize the modeling aspects of the problem and only summarize the actual results obtained by the method.>