— The configuration of virtual path (VP) connection services is expected to play an important role in the operation of large-scale asynchronous transfer mode (ATM) networks. A major research challenge is to understand the fundamental tradeoff between the network call throughput and the processing load on the signaling system and to provide an algorithm for VP capacity allocation that achieves an optimal network operating point while guaranteeing quality of service (QoS) at the call level and satisfies a priori bounds on the processing load of the call processors. We present a taxonomy of previous approaches to the problem and identify their strengths and weaknesses. Based on these observations, we provide an algorithm for the VP capacity allocation problem that satisfies nodal constraints on the call processing load and blocking constraints for each source–destination (SD) pair. The algorithm maximizes the network revenue under the above set of constraints and is parameterized b...
Nikolaos Anerousis, Aurel A. Lazar