OPTIMAL-SOLUTIONS FOR A DYNAMIC BANDWIDTH ALLOCATION SCHEME IN HIGH-SPEED NETWORKS

In this paper, we investigate the problem of determining the optimal b andwidth allocation for a Dynamic Bandwidth Allocation Scheme (DBAS). The objective is to minimize the total amount of bandwidth required to satisfy the Quality of Service (QoS) requirements of all traffic stre ams. It is shown that when the performance functions satisfy a certain number of conditions, there exists a unique optimal bandwidth allocat ion such that, for each traffic stream, either its QoS is just satisfi ed or its QoS is over-satisfied and it is allocated zero bandwidth. Su ch an allocation is said to be efficient. It is also shown that there exists a unique efficient allocation in the entire feasible region. An iterative algorithm is developed to compute the efficient allocation employing its special properties. Numerical examples are presented to demonstrate how the algorithm works. Future extensions of this work ar e also discussed.