Vehicle trajectory data is critical for traffic management and location-based services. However, the released trajectories raise serious privacy concerns because they contain sensitive information such as homes and workplaces. Based on differential privacy, this problem can be addressed by generating synthetic trajectories from the original sensitive data while guaranteeing personal privacy. Unfortunately, existing methods focus on synthesizing trajectory datasets that preserve summary-level statistics (e.g., the overall distribution of user movements), making these synthetic trajectories lose individual-level mobility patterns. As shown in our experiment, this results in the low performance of their synthetic datasets in real-world applications. To address these limitations, we propose a novel solution for Synthesizing Private and Realistic Trajectories, namely SPRT, whose key idea is to integrate the public geography structures of the target area into the process of private trajectory synthesis. This enables us to capture more accurate mobility patterns to synthesize realistic trajectories, which can preserve both summary-level statistics and individual-level mobility behaviors. Consequently, the synthetic trajectories generated by SPRT are more similar to real trajectories and therefore more practical. We evaluate the performance of SPRT in real-world applications by applying its synthetic data to a series of trajectory analytic tasks. The results demonstrate that our solution improves data utility by at least 37% over state-of-the-art approaches.
29 August 2022 in IEEE Transactions on Parallel and Distributed Systems
To achieve a high degree of resource utilization, production clusters need to co-schedule diverse workloads – including both batch analytic jobs with short-lived tasks and long-running applications (LRAs) that execute for a long time frame from hours to months – onto the shared resources. Microservice architecture advances the manifestation of distributed LRAs (DLRAs), comprising multiple interconnected microservices that are executed in long-lived distributed containers and serve massive user requests. Detecting and mitigating QoS violation become even more intractable due to the network uncertainties and latency propagation across dependent microservices. However, current resource managers are only responsible for resource allocation among applications/jobs but agnostic to runtime QoS such as latency at application level. The state-of-the-art QoS-aware scheduling approaches are dedicated for monolithic applications, without considering the temporal-spatio performance variability across distributed microservices. In this paper, we present Toposch , a new scheduling and execution framework to prioritize the QoS of DLRAs whilst balancing the performance of batch jobs and maintaining high cluster utilization through harvesting idle resources. Toposch tracks footprints of every single request across microservices and uses critical path analysis, based on the end-to-end latency graph, to identify microservices that have high risk of QoS violation. Based on microservice and node level risk assessment, we intervene the batch scheduling by adaptively reducing the visible resources to batch tasks and thus delaying their execution to give way to DLRAs. We propose a prediction-based vertical resource auto-scaling mechanism, with the aid of resource-performance modeling and fine-grained resource inference and access control, for prompt recovery of QoS violation. A cost-effective task preemption is leveraged to ensure a low-cost task preemption and resource reclamation during the auto-scaling. Toposch is integrated with Apache YARN and experiments show that Toposch outperforms other baselines in terms of performance guarantee of DLRAs, at an acceptable cost of batch job slowdown. The tail latency of DLRAs is merely 1.12x of the case of executing alone on average in Toposch with a 26% JCT increase of Spark analytic jobs.
Detecting time-series anomalies is extremely intricate due to the rarity of anomalies and imbalanced sample categories, which often result in costly and challenging anomaly labeling. Most of the existing approaches largely depend on assumptions of normality, overlooking labeled abnormal samples. While anomaly assumptions based methods can incorporate prior knowledge of anomalies for data augmentation in training classifiers, the adopted random or coarse-grained augmentation approaches solely focus on pointwise anomalies and lack cutting-edge domain knowledge, making them less likely to achieve better performance. This paper introduces CutAddPaste, a novel anomaly assumption-based approach for detecting time-series anomalies. It primarily employs a data augmentation strategy to generate pseudo anomalies, by exploiting prior knowledge of anomalies as much as possible. At the core of CutAddPaste is cutting patches from random positions in temporal subsequence samples, adding linear trend terms, and pasting them into other samples, so that it can well approximate a variety of anomalies, including point and pattern anomalies. Experiments on standard benchmark datasets demonstrate that our method outperforms the state-of-the-art approaches.
21 June 2023 in IEEE Transactions on Knowledge and Data Engineering
Vehicle trajectory data is essential for traffic management and location-based services. However, publishing real-life trajectory data has been challenging because vehicle trajectories contain users’ sensitive information. Differential privacy addresses such problems by publishing a synthetic version of the input dataset, but existing works always assume the real-world data is absolutely accurate. This assumption no longer holds in trajectory data because it typically contains errors due to inaccurate positioning services, which leads to poor performance of data synthesized by such trajectories. Even worse, existing works may generate unrealistic trajectories due to their coarse data synthesis methods, resulting in low practical utility or even inability to handle complex tasks. In this paper, we propose a P rivacy-preserving and U tility-enhancing framework for T rajectory S ynthesization ( PUTS ). Our framework mitigates the impact of data errors in trajectories on differential privacy mechanisms, by exploiting map-matching techniques and real-world road network structure. In PUTS , a two-layer approach from path to trajectory synthesis is proposed to not only guarantee the reality of synthetic trajectories, but also scale up PUTS in real-world applications. Extensive experiments on real-world datasets show that PUTS significantly outperforms existing methods in terms of utility in a range of real-world applications.