A practical method to optimize negotiable call accesses for broadband communication networks

The optimization problem for negotiable admission control is formalized as a special version of the knapsack problem, called the flexible knapsack problem. The new flexible knapsack model expands the conventional knapsack model by allowing different bandwidth allocations for calls from the same class. The conventional knapsack approach, a model often used in resource allocation problems, can only deal with allocating a fixed bandwidth for a particular class of calls. For the new flexible knapsack problem the authors outline two exact solutions and give details for a fast, practical heuristic solution. In addition, some performance results are discussed.