Learning Deep Generative Models for Queuing Systems

Modern society is heavily dependent on large scale client-server systems with applications ranging from Internet and Communication Services to sophisticated logistics and deployment of goods. To maintain and improve such a system, a careful study of client and server dynamics is needed – e.g. response/service times, average number of clients at given times, etc. To this end, one traditionally relies, within the queuing theory formalism, on parametric analysis and explicit distribution forms. However, parametric forms limit the model’s expressiveness and could struggle on extensively large

[1]  Michael I. Jordan,et al.  Bayesian inference for queueing networks and modeling of internet services , 2010, 1001.3355.

[2]  Upendra Dave,et al.  Applied Probability and Queues , 1987 .

[3]  A. Goldenshluger,et al.  Nonparametric Estimation of Service Time Characteristics in Infinite-Server Queues with Nonstationary Poisson Input , 2018, Stochastic Systems.

[4]  Sebastian Nowozin,et al.  f-GAN: Training Generative Neural Samplers using Variational Divergence Minimization , 2016, NIPS.

[5]  Esko Valkeila,et al.  An Introduction to the Theory of Point Processes, Volume II: General Theory and Structure, 2nd Edition by Daryl J. Daley, David Vere‐Jones , 2008 .

[6]  Simon Osindero,et al.  Conditional Generative Adversarial Nets , 2014, ArXiv.

[7]  Kevin Lin,et al.  Adversarial Ranking for Language Generation , 2017, NIPS.

[8]  Lingjiong Zhu,et al.  Central Limit Theorem for Nonlinear Hawkes Processes , 2012, Journal of Applied Probability.

[9]  A. K. Erlang The theory of probabilities and telephone conversations , 1909 .

[10]  Léon Bottou,et al.  Wasserstein Generative Adversarial Networks , 2017, ICML.

[11]  Le Song,et al.  Wasserstein Learning of Deep Generative Point Process Models , 2017, NIPS.

[12]  A. Hawkes,et al.  A cluster process representation of a self-exciting process , 1974, Journal of Applied Probability.

[13]  Aaron C. Courville,et al.  Improved Training of Wasserstein GANs , 2017, NIPS.

[14]  Asja Fischer,et al.  On the regularization of Wasserstein GANs , 2017, ICLR.

[15]  G. J. A. Stern,et al.  Queueing Systems, Volume 2: Computer Applications , 1976 .

[16]  Jamol Pender,et al.  Queues Driven by Hawkes Processes , 2017, Stochastic Systems.

[17]  Avishai Mandelbaum,et al.  Strong approximations for Markovian service networks , 1998, Queueing Syst. Theory Appl..

[18]  C. Villani Topics in Optimal Transportation , 2003 .

[19]  D. Kendall Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain , 1953 .

[20]  Clark A. Mount-Campbell,et al.  Process optimization via neural network metamodeling , 2002 .

[21]  Le Song,et al.  Learning Conditional Generative Models for Temporal Point Processes , 2018, AAAI.

[22]  Ruth J. Williams,et al.  Stochastic Processing Networks , 2016 .

[23]  Alexander J. Smola,et al.  Neural Survival Recommender , 2017, WSDM.

[24]  S. Wittevrongel,et al.  Queueing Systems , 2019, Introduction to Stochastic Processes and Simulation.

[25]  Onno Boxma,et al.  Infinite-server systems with Coxian arrivals , 2019, Queueing Syst. Theory Appl..

[26]  Filippo Santambrogio,et al.  Optimal Transport for Applied Mathematicians , 2015 .

[27]  Giuliano Casale,et al.  Approximate Bayesian inference with queueing networks and coupled jump processes , 2018, ArXiv.

[28]  Theodore Kypraios,et al.  Auxiliary variables for Bayesian inference in multi-class queueing networks , 2017, Statistics and Computing.

[29]  Dimitris Bertsimas An Analytic Approach to a General Class of G/G/s Queueing Systems , 1990, Oper. Res..

[30]  Mirco Tribastone,et al.  Learning Queuing Networks by Recurrent Neural Networks , 2020, ICPE.

[31]  R. Syski,et al.  Fundamentals of Queueing Theory , 1999, Technometrics.

[32]  Yoshua Bengio,et al.  Generative Adversarial Nets , 2014, NIPS.

[33]  C. Villani Optimal Transport: Old and New , 2008 .

[34]  Jason Eisner,et al.  The Neural Hawkes Process: A Neurally Self-Modulating Multivariate Point Process , 2016, NIPS.

[35]  Charles A. Sutton,et al.  A Bayesian Approach to Parameter Inference in Queueing Networks , 2016, ACM Trans. Model. Comput. Simul..

[36]  Utkarsh Upadhyay,et al.  Recurrent Marked Temporal Point Processes: Embedding Event History to Vector , 2016, KDD.

[37]  Lawrence Carin,et al.  Adversarial Time-to-Event Modeling , 2018, ICML.

[38]  Yee Whye Teh,et al.  Fast MCMC sampling for Markov jump processes and extensions , 2012, J. Mach. Learn. Res..

[39]  Matthias Weidlich,et al.  Congestion Graphs for Automated Time Predictions , 2019, AAAI.