Using GANs for Sharing Networked Time Series Data
Authors:
Open Access
- 27 October 2020
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 464-483
Abstract
Limited data access is a longstanding barrier to data-driven research and development in the networked systems community. In this work, we explore if and how generative adversarial networks (GANs) can be used to incentivize data sharing by enabling a generic framework for sharing synthetic datasets with minimal expert knowledge. As a specific target, our focus in this paper is on time series datasets with metadata (e.g., packet loss rate measurements with corresponding ISPs). We identify key challenges of existing GAN approaches for such workloads with respect to fidelity (e.g., long-term dependencies, complex multidimensional relationships, mode collapse) and privacy (i.e., existing guarantees are poorly understood and can sacrifice fidelity). To improve fidelity, we design a custom workflow called DoppelGANger (DG) and demonstrate that across diverse real-world datasets (e.g., bandwidth measurements, cluster requests, web sessions) and use cases (e.g., structural characterization, predictive modeling, algorithm comparison), DG achieves up to 43% better fidelity than baseline models. Although we do not resolve the privacy problem in this work, we identify fundamental challenges with both classical notions of privacy and recent advances to improve the privacy properties of GANs, and suggest a potential roadmap for addressing these challenges. By shedding light on the promise and challenges, we hope our work can rekindle the conversation on workflows for data sharing.Keywords
All Related Versions
Funding Information
- Army Research Laboratory (W911NF-13-2-0045)
- National Science Foundation (2040675)
This publication has 59 references indexed in Scilit:
- Characterizing and modeling cloud applications/jobs on a Google data centerThe Journal of Supercomputing, 2014
- Analysis, Modeling and Simulation of Workload Patterns in a Large-Scale Utility CloudIEEE Transactions on Cloud Computing, 2014
- Effective page recommendation algorithms based on distributed learning automata and weighted association rulesExpert Systems with Applications, 2010
- The RIPE NCC Internet Measurement Data Repository2010
- Physical Layer Attacks on Unlinkability in Wireless LANs2009
- TmixACM SIGCOMM Computer Communication Review, 2006
- Modeling and Forecasting Electricity Prices with Input/Output Hidden Markov ModelsIEEE Transactions on Power Systems, 2005
- k-ANONYMITY: A MODEL FOR PROTECTING PRIVACYInternational Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2002
- Web usage miningACM SIGKDD Explorations Newsletter, 2000
- Modeling full-length VBR video using Markov-renewal-modulated TES modelsIEEE Journal on Selected Areas in Communications, 1998