{'fraction_non_alphanumeric': 0.013848396501457727, 'fraction_numerical': 0.0014577259475218659, 'mean_word_length': 6.151041666666667, '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': 2, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Passive Network Performance Estimation for Data-intensive Applications

Distributed computing applications are increasingly utilizing distributed data sources. However, the unpredictable cost of data access in large distributed systems can lead to severe performance bottlenecks. Providing predictability in data access is essential to accommodate the large set of newly emerging data-intensive applications. Accurate estimation of data access costs are crucial to meeting the performance goals of such applications. In this paper, we present a framework called OPEN, Overlay Passive Estimation of Network performance, which provides applicationperspective network performance estimation based on past downloading measurements. Unlike previous passive estimation work, OPEN enables nodes to share measures in a scalable system-wide manner without any topological constraints. It uses passive estimation and gossip-based dissemination of measurements to achieve scalability. Using data download traces collected for 10 months in PlanetLab, we show that our framework is widely applicable to selection problems common in distributed computing applications. Results from our simulation study show that OPEN significantly outperforms selection techniques based on statistical pairwise estimations as well as random and latencybased selections in diverse experimental settings.