Beyond Data Points: Regionalizing Crowdsourced Latency Measurements

• URL: http://arxiv.org/abs/2405.11138v4
• Date: Sat, 26 Oct 2024 13:36:57 GMT
• Title: Beyond Data Points: Regionalizing Crowdsourced Latency Measurements
• Authors: Taveesh Sharma, Paul Schmitt, Francesco Bronzino, Nick Feamster, Nicole Marwell,
• Abstract summary: We present a spatial analysis on crowdsourced datasets for constructing stable boundaries for sampling Internet performance. Greater stability in sampling boundaries will reflect the true nature of Internet performance disparities. These findings underscore the important role of spatial modeling in accurately assessing and optimizing the distribution of Internet performance.
• Score: 6.921364920053057
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Despite significant investments in access network infrastructure, universal access to high-quality Internet connectivity remains a challenge. Policymakers often rely on large-scale, crowdsourced measurement datasets to assess the distribution of access network performance across geographic areas. These decisions typically rest on the assumption that Internet performance is uniformly distributed within predefined social boundaries. However, this assumption may not be valid for two reasons: crowdsourced measurements often exhibit non-uniform sampling densities within geographic areas; and predefined social boundaries may not align with the actual boundaries of Internet infrastructure. In this paper, we present a spatial analysis on crowdsourced datasets for constructing stable boundaries for sampling Internet performance. We hypothesize that greater stability in sampling boundaries will reflect the true nature of Internet performance disparities than misleading patterns observed as a result of data sampling variations. We apply and evaluate a series of statistical techniques to: aggregate Internet performance over geographic regions; overlay interpolated maps with various sampling unit choices; and spatially cluster boundary units to identify contiguous areas with similar performance characteristics. We assess the effectiveness of the techniques we apply by comparing the similarity of the resulting boundaries for monthly samples drawn from the dataset. Our evaluation shows that the combination of techniques we apply achieves higher similarity compared to directly calculating central measures of network metrics over census tracts or neighborhood boundaries. These findings underscore the important role of spatial modeling in accurately assessing and optimizing the distribution of Internet performance, to inform policy, network operations, and long-term planning decisions.

Related papers

• Cross-Domain Conditional Diffusion Models for Time Series Imputation [34.400748070956006]
  Cross-domain time series imputation is an underexplored data-centric research task.<n>Existing approaches primarily focus on the single-domain setting.<n>Our proposed solution integrates shared spectral components from both domains while retaining domain-specific temporal structures.
  arXiv  Detail & Related papers  (2025-06-14T09:09:07Z)
• Exploiting Aggregation and Segregation of Representations for Domain Adaptive Human Pose Estimation [50.31351006532924]
  Human pose estimation (HPE) has received increasing attention recently due to its wide application in motion analysis, virtual reality, healthcare, etc. It suffers from the lack of labeled diverse real-world datasets due to the time- and labor-intensive annotation. We introduce a novel framework that capitalizes on both representation aggregation and segregation for domain adaptive human pose estimation.
  arXiv  Detail & Related papers  (2024-12-29T17:59:45Z)
• Semi-decentralized Training of Spatio-Temporal Graph Neural Networks for Traffic Prediction [0.15978270011184256]
  We explore and adapt semi-decentralized training techniques for Spatiotemporal Graph-Temporal Neural Networks (ST-GNNs) in smart mobility domain. We implement a simulation framework where sensors are grouped by proximity into multiple cloudlets. We show that semi-decentralized setups are comparable to centralized approaches in performance metrics.
  arXiv  Detail & Related papers  (2024-12-04T10:20:21Z)
• Dual Latent State Learning: Exploiting Regional Network Similarities for QoS Prediction [5.090646311505991]
  We introduce the regional-based dual latent state learning network(R2SL), a novel deep learning framework. R2SL captures the nuances of regional network behavior by deriving two distinct regional network latent states. Our R2SL approach ushers in an innovative avenue for precise predictions by fully harnessing the regional network similarities inherent in objects.
  arXiv  Detail & Related papers  (2023-10-07T19:35:07Z)
• Adaptive Hierarchical SpatioTemporal Network for Traffic Forecasting [70.66710698485745]
  We propose an Adaptive Hierarchical SpatioTemporal Network (AHSTN) to promote traffic forecasting. AHSTN exploits the spatial hierarchy and modeling multi-scale spatial correlations. Experiments on two real-world datasets show that AHSTN achieves better performance over several strong baselines.
  arXiv  Detail & Related papers  (2023-06-15T14:50:27Z)
• LargeST: A Benchmark Dataset for Large-Scale Traffic Forecasting [65.71129509623587]
  Road traffic forecasting plays a critical role in smart city initiatives and has experienced significant advancements thanks to the power of deep learning. However, the promising results achieved on current public datasets may not be applicable to practical scenarios. We introduce the LargeST benchmark dataset, which includes a total of 8,600 sensors in California with a 5-year time coverage.
  arXiv  Detail & Related papers  (2023-06-14T05:48:36Z)
• Cross-Domain Policy Adaptation via Value-Guided Data Filtering [57.62692881606099]
  Generalizing policies across different domains with dynamics mismatch poses a significant challenge in reinforcement learning. We present the Value-Guided Data Filtering (VGDF) algorithm, which selectively shares transitions from the source domain based on the proximity of paired value targets.
  arXiv  Detail & Related papers  (2023-05-28T04:08:40Z)
• Federated Anomaly Detection over Distributed Data Streams [0.0]
  We propose an approach to building the bridge among anomaly detection, federated learning, and data streams. The overarching goal of the work is to detect anomalies in a federated environment over distributed data streams.
  arXiv  Detail & Related papers  (2022-05-16T17:38:58Z)
• Learning distributed channel access policies for networked estimation: data-driven optimization in the mean-field regime [1.52292571922932]
  The problem of communicating sensor measurements over shared networks is prevalent in many modern large-scale distributed systems. We show that in the mean-field regime, this problem exhibits a structure that enables tractable optimization algorithms. We obtain a data-driven learning scheme that admits a finite sample-complexity guarantee on the performance of the resulting estimation system.
  arXiv  Detail & Related papers  (2021-12-10T21:27:45Z)
• VisDA-2021 Competition Universal Domain Adaptation to Improve Performance on Out-of-Distribution Data [64.91713686654805]
  The Visual Domain Adaptation (VisDA) 2021 competition tests models' ability to adapt to novel test distributions. We will evaluate adaptation to novel viewpoints, backgrounds, modalities and degradation in quality. Performance will be measured using a rigorous protocol, comparing to state-of-the-art domain adaptation methods.
  arXiv  Detail & Related papers  (2021-07-23T03:21:51Z)
• Opportunities and challenges in partitioning the graph measure space of real-world networks [0.0]
  based on a large dataset containing thousands of real-world networks ranging from genetic, protein interaction, and metabolic networks to brain, language, ecology, and social networks we search for defining structural measures of the different complex network domains (CND) We calculate 208 measures for all networks and using a comprehensive and scrupulous workflow of statistical and machine learning methods we investigated the limitations and possibilities of identifying the key graph measures of CNDs. Our approach managed to identify well distinguishable groups of network domains and confer their relevant features.
  arXiv  Detail & Related papers  (2021-06-20T21:22:37Z)
• Domain-Adversarial Training of Self-Attention Based Networks for Land Cover Classification using Multi-temporal Sentinel-2 Satellite Imagery [0.0]
  Most practical applications cannot rely on labeled data, and in the field, surveys are a time consuming solution. In this paper, we investigate adversarial training of deep neural networks to bridge the domain discrepancy between distinct geographical zones.
  arXiv  Detail & Related papers  (2021-04-01T15:45:17Z)
• Anomaly Detection on Attributed Networks via Contrastive Self-Supervised Learning [50.24174211654775]
  We present a novel contrastive self-supervised learning framework for anomaly detection on attributed networks. Our framework fully exploits the local information from network data by sampling a novel type of contrastive instance pair. A graph neural network-based contrastive learning model is proposed to learn informative embedding from high-dimensional attributes and local structure.
  arXiv  Detail & Related papers  (2021-02-27T03:17:20Z)
• Unsupervised Metric Relocalization Using Transform Consistency Loss [66.19479868638925]
  Training networks to perform metric relocalization traditionally requires accurate image correspondences. We propose a self-supervised solution, which exploits a key insight: localizing a query image within a map should yield the same absolute pose, regardless of the reference image used for registration. We evaluate our framework on synthetic and real-world data, showing our approach outperforms other supervised methods when a limited amount of ground-truth information is available.
  arXiv  Detail & Related papers  (2020-11-01T19:24:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.