Neural Quantile Optimization for Edge-Cloud Computing

We seek the best traffic allocation scheme for the edge-cloud computing network that satisfies constraints and minimizes the cost based on burstable billing. First, for a fixed network topology, we formulate a family of integer programming problems with random parameters describing the various traffic demands. Then, to overcome the difficulty caused by the discrete feature of the problem, we generalize the Gumbel-softmax reparameterization method to induce an unconstrained continuous optimization problem as a regularized continuation of the discrete problem. Finally, we introduce the Gumbel-softmax sampling network to solve the optimization problems via unsupervised learning. The network structure reflects the edge-cloud computing topology and is trained to minimize the expectation of the cost function for unconstrained continuous optimization problems. The trained network works as an efficient traffic allocation scheme sampler, remarkably outperforming the random strategy in feasibility and cost function value. Besides testing the quality of the output allocation scheme, we examine the generalization property of the network by increasing the time steps and the number of users. We also feed the solution to existing integer optimization solvers as initial conditions and verify the warm-starts can accelerate the short-time iteration process. The framework is general with solid performance, and the decoupled feature of the random neural networks is adequate for practical implementations.

[1]  Bradley Dirks,et al.  The minimal exponent and k-rationality for local complete intersections , 2022, Journal de l’École polytechnique — Mathématiques.

[2]  Mathematics of Data Networking , 2021, Mathematics for Future Computing and Communications.

[3]  Iris A. M. Huijben,et al.  A Review of the Gumbel-max Trick and its Extensions for Discrete Stochasticity in Machine Learning , 2021, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  P. V. Hentenryck,et al.  Learning Hard Optimization Problems: A Data Generation Perspective , 2021, NeurIPS.

[5]  David Rolnick,et al.  DC3: A learning method for optimization with hard constraints , 2021, ICLR.

[6]  Sharad Agarwal,et al.  Cost-effective Cloud Edge Traffic Engineering with Cascara , 2021, NSDI.

[7]  Elias Boutros Khalil,et al.  Learning to Schedule Heuristics in Branch-and-Bound , 2021, NeurIPS.

[8]  G. Nemhauser,et al.  Integer Programming , 2020 .

[9]  Albert Y. Zomaya,et al.  Safeguard Network Slicing in 5G: A Learning Augmented Optimization Approach , 2020, IEEE Journal on Selected Areas in Communications.

[10]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[11]  Taewoo Lee,et al.  Quantile Inverse Optimization: Improving Stability in Inverse Linear Programming , 2019, Oper. Res..

[12]  Wazir Zada Khan,et al.  Edge computing: A survey , 2019, Future Gener. Comput. Syst..

[13]  Chao Xu,et al.  Dedas: Online Task Dispatching and Scheduling with Bandwidth Constraint in Edge Computing , 2019, IEEE INFOCOM 2019 - IEEE Conference on Computer Communications.

[14]  Kok-Kiong Yap,et al.  Taking the Edge off with Espresso: Scale, Reliability and Programmability for Global Internet Peering , 2017, SIGCOMM.

[15]  Benjamin Müller,et al.  The SCIP Optimization Suite 5.0 , 2017, 2112.08872.

[16]  K. B. Letaief,et al.  A Survey on Mobile Edge Computing: The Communication Perspective , 2017, IEEE Communications Surveys & Tutorials.

[17]  Ben Poole,et al.  Categorical Reparameterization with Gumbel-Softmax , 2016, ICLR.

[18]  Yee Whye Teh,et al.  The Concrete Distribution: A Continuous Relaxation of Discrete Random Variables , 2016, ICLR.

[19]  Srikanth Kandula,et al.  Dynamic Pricing and Traffic Engineering for Timely Inter-Datacenter Transfers , 2016, SIGCOMM.

[20]  Jimmy Ba,et al.  Adam: A Method for Stochastic Optimization , 2014, ICLR.

[21]  Arkady B. Zaslavsky,et al.  Context Aware Computing for The Internet of Things: A Survey , 2013, IEEE Communications Surveys & Tutorials.

[22]  Laurence A. Wolsey,et al.  Production Planning by Mixed Integer Programming , 2010 .

[23]  Timo Berthold Primal Heuristics for Mixed Integer Programs , 2006 .

[24]  E. Mannie Generalized Multi-Protocol Label Switching (GMPLS) Architecture , 2004, RFC.

[25]  V. V. Shenmaier,et al.  A greedy algorithm for some classes of integer programs , 2003, Discret. Appl. Math..

[26]  Kevin Barraclough,et al.  I and i , 2001, BMJ : British Medical Journal.

[27]  James C. Bean,et al.  A Genetic Algorithm for the Multiple-Choice Integer Program , 1997, Oper. Res..

[28]  Christos H. Papadimitriou,et al.  On the complexity of integer programming , 1981, JACM.

[29]  Harvey M. Salkin,et al.  The knapsack problem: A survey , 1975 .

[30]  W. Hager,et al.  and s , 2019, Shallow Water Hydraulics.

[31]  W. Marsden I and J , 2012 .

[32]  Shie Mannor,et al.  Percentile Optimization for Markov Decision Processes with Parameter Uncertainty , 2010, Oper. Res..

[33]  Pankesh Patel,et al.  Service Level Agreement in Cloud Computing , 2009 .

[34]  J. Clausen,et al.  Branch and Bound Algorithms-Principles and Examples , 2003 .