1-1hit |
Under cutoff and threshold priority policies, we mathematically formulate a prioritized channel allocation problem which is combinatorial in nature. We then reduce that problem using the concept of pattern, and apply a simulated annealing approach to the reduced problem. Computational experiments show that our method works very well and the cutoff priority policy outperforms the non-prioritized complete sharing policy and the threshold priority policy.