NEW REDUCED LOAD HEURISTIC FOR COMPUTING BLOCKING IN LARGE MULTIRATE LOSS NETWORKS

Citation
F. Theberge et Rr. Mazumdar, NEW REDUCED LOAD HEURISTIC FOR COMPUTING BLOCKING IN LARGE MULTIRATE LOSS NETWORKS, IEE proceedings. Communications, 143(4), 1996, pp. 206-211
Citations number
14
Categorie Soggetti
Engineering, Eletrical & Electronic
ISSN journal
13502425
Volume
143
Issue
4
Year of publication
1996
Pages
206 - 211
Database
ISI
SICI code
1350-2425(1996)143:4<206:NRLHFC>2.0.ZU;2-B
Abstract
The authors develop an efficient reduced load fixed-point technique to obtain approximations for blocking probabilities in large multirate l oss systems. The point of departure is that for large systems they exp loit a single-link approximation based on large deviation techniques f or which computational complexity does not scale with the size of the system. The explicit characterisation then allows the authors to prove the convergence of the reduced load fixed point algorithm, The accura cy of the approach is demonstrated on several examples. Comparison of the results to those obtained by the Erlang fixed point and stochastic knapsack methods clearly demonstrate the effectiveness of the approac h.