Dynamic link bandwidth allocation in an integrated services network

The link bandwidth allocation problem in an integrated services network, where the types of calls are differentiated by the rates at which the requests for service are generated, the mean holding time, and the number of trunks requested, is considered. The decision to accept or reject a call for service may be based on the number of different calls in service to maximise (or minimize) a certain performance measure. This can be the throughput, the maximum blocking probability of any call type, or the revenue when different types have different call charging rates. An efficient and accurate approximation for an integrated services system where a dynamic trunk reservation policy is used is presented. The advantage of the dynamic trunk reservation over the steady trunk reservation is shown by numerical results