{'fraction_non_alphanumeric': 0.0196078431372549, 'fraction_numerical': 0.0, 'mean_word_length': 6.079207920792079, '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}}
Efficient importance sampling heuristics for the simulation of population overflow in Jackson networks

In this paper, we propose state-dependent importance sampling heuristics to estimate the probability of population overflow in Jackson networks with arbitrary routing. These heuristics approximate the "optimal" state-dependent change of measure without the need for costly optimization involved in other recently proposed adaptive algorithms. Experimental results on tandem, feed-forward and feed-back networks with a moderate number of nodes yield asymptotically efficient estimates (often with bounded relative error) where no other state-independent importance sampling techniques are known to be efficient.