{'fraction_non_alphanumeric': 0.023236514522821577, 'fraction_numerical': 0.004979253112033195, 'mean_word_length': 5.8522727272727275, '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}}
QRP01-5: Quantitative Analysis of Access Strategies to Remote Information in Network Services

Remote access to dynamically changing information elements is a required functionality for various network services, including routing and instances of context-sensitive networking. Three fundamentally different strategies for such access are investigated in this paper: (1) a reactive approach initiated by the requesting entity, and two versions of proactive approaches in which the entity that contains the information element actively propagates its changes to potential requesters, either (2) periodically or triggered by changes of the information element (3). This paper first develops a set of analytic models to compute different performance metrics for these approaches, with special focus on the so-called mismatch probability. The results of the analytic models allow for design decisions on which strategy to implement for specific input parameters (change rate of the information element, network delay characterization) and specific requirements on mismatch probability, traffic overhead, and access delay. Finally, the analysis is applied to the use-case of context-sensitive service discovery.