{'fraction_non_alphanumeric': 0.012567324955116697, 'fraction_numerical': 0.0, 'mean_word_length': 5.564705882352941, '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}}
Performance Bounds and Differential Cost Approximations for Queueing Networks

A new bound is proposed relating the average cost sub-optimality of a myopic policy to its differential cost error. The bound is an expectation over the stationary distribution for this policy. For small queueing networks, we compute or approximate the distribution using the matrix analytic method and numerically test the bound. Product form approximations to the stationary distribution are also considered. Applications to approximate dynamic programming are also discussed.