{'fraction_non_alphanumeric': 0.022939068100358423, 'fraction_numerical': 0.002867383512544803, 'mean_word_length': 5.204444444444444, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
VARIANCE REDUCTION TECHNIQUE FOR A CELLULAR SYSTEM WITH DYNAMIC RESOURCE SHARING

A new algorithm is given to improve the simulation of a cellular system with dynamic resource sharing. This technique is based on low discrepancy sequences, used in quasi-Monte Carlo methods and which, combined with Monte Carlo techniques using importance sampling and control variates (already developed for such a system), gives the best known results. INTRODUCTION We consider a cellular system with dynamic resource sharing, used in digital cellular phone networks. The models used to evaluate such systems generally lead to product-form solutions, but analytic computation is intractable due to the size of the state space. An alternative way is the use of probabilistic methods, that is of Monte Carlo methods. Such techniques are commonly used in various research areas. In the same way, deterministic methods, called quasi-Monte Carlo methods uselow discrepancy sequences. Unfortunately, in practice, an error bound for these approaches is uncomputable. We then use low discrepancy sequences as a variance reduction method. In this paper, we first briefly describe the model and the solutions developed in (Fleming and Schaeffer 1995). Next, we develop a new variance reduction technique based on low discrepancy sequences. Finally, we give a numerical illustration of the improvement on a simple example.