{'fraction_non_alphanumeric': 0.011834319526627219, 'fraction_numerical': 0.0014792899408284023, 'mean_word_length': 5.327102803738318, '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}}
Power law characteristics and loss probability: finite buffer queueing systems

Analytical framework based on maximum Tsallis entropy is proposed for studying finite buffer queueing system when information about fractional moment of queue size and utilization is available. The framework enables us to obtain closed form expressions for queue length distribution and loss probability for generalized M/M/1/N system when input to the system possesses power law characteristics. It is shown that queue length distribution depicts power law as the number of units in the system becomes large. A new result for asymptotic loss probability exhibiting power law behavior is derived.