{'fraction_non_alphanumeric': 0.0153276955602537, 'fraction_numerical': 0.0, 'mean_word_length': 5.416949152542373, '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}}
ON OPTIMIZING SERVICE AVAILABILITY OF AN INTERNET BASED ARCHITECTURE FOR INFRASTRUCTURE PROTECTION

Modern Infrastructure Protection Systems (IPSs) tend to be geographically distributed as well as Internet based. Geographic distribution has the goal of increasing fault tolerance as well survivability (e.g. against attacks of various kinds). Usage of a public communication infrastructure like Internet has the goal of decreasing costs as well as easying system deployment. During an emergency, computational as well as communication resources tend to be scarce. When there are no resources available a request is not admitted into the systems. As a result emergency requests may get blocked. More specifically, two service classes must be served, a low priority class for maintenance and monitoring and a high priority class for emergency related interventions. A suitable service policy is necessary to guarantee system responsiveness when emergency events occur while keeping the Quality of Service (QoS) of low priority requests at an acceptable level. Unfortunately the above are conflicting requirements since to guarantee system responsiveness upon an emergency (high priority) event we should always have free resources to use in such a situation. In this paper we show how the above admission control policy problem can be modeled as a Semi Markov Decision Process (SMDP). By solving such SMDP we compute a policy that finds a tradeoff solution between minimizing the probability that a critical service request is blocked due to resource unavailability and reserving too much resources to critical events resulting in unacceptable performance of low priority requests. For computational and robustness reasons we also propose some heuristics. Finally, we compare the performance of the computed optimal policy and heuristics by means of simulation and probabilistic model checking.