An Incremental Capacity-Allocation Algorithm for Voice/Data Networks

An algorithm is described by which TDM slots in many links of a network can be optimally allocated between voice and data. It is an adaptation of a convex-programming method due to Fox, by which a pool of resources is allocated to minimize a convex separable criterion function such as blocking probability for voice subject to a single convex separable constraint such as specified maximum mean delay to data. In our case the single pool of resources is the total of the available slots. The necessary adaptation of Fox´s algorithm is described for the minimum blocking problem, and for minimum data delay subject to a blocking constraint.