{'fraction_non_alphanumeric': 0.008064516129032258, 'fraction_numerical': 0.0, 'mean_word_length': 5.583333333333333, '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}}
First Iteration Policies for Admission Control in Multiaccess Networks

This work explores approximate methods to solve Markov decision processes for large systems through Policy iteration.Two methods, one using an embedded discrete time Markov chain and the other using time scale separation, are defined and compared with the solution obtained using traditional Policy iteration. First step solutions are found and compared for a radio resource management problem with two radio access technologies and two service types. The approaches proposed considerably reduce the computational cost while closely approximate the optimal solution. The solutions are extended by increasing the number of steps of policy iteration and results show that it is possible to reach the performance of the optimal policy when several steps are required reducing the computational cost.