On Dynamic Capacity Management in Voice/Frame Relaying Networks

We consider call admission and capacity management in a dynamically reconfigurable network that carries a multitude of traffics. Our approach is a heuristic capacity as- signment algorithm designed to maximise an arbitrary profit function. The algorithm is based on the concept of equivalent circuits, i.e. a given relationship between transmis- sion capacities and call handling capabilities expressed as effective numbers of circuits. Such relationships are examined for the two traffics of our application, voice and frame relaying. Methods and results are independent of the transfer mode used.This article is written under the Project "VP and VC Assignment and Routing