`` Direct Search'' Solution of Numerical and Statistical Problems
Journal of the ACM (JACM)
Hi-index | 0.24 |
The problem of capacity sharing in a demand-assignment multiple-access system is considered. The well established sharing strategies, all possessing the 'convexity property', lead to queueing models with various levels of computational complexity. A conjecture on the global validity of an optimal sharing strategy is made, and an optimization procedure is developed. The procedure is based on multidimensional pattern search. A sensitivity analysis of the optimal parameters obtained is also given.