Neural Quantile Optimization for Edge-Cloud Networking (2307.05170v2)
Abstract: 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.
- K. K. Yap, A. Jain, V. Lin, C. Rice, and A. Narayanan, “Taking the edge off with espresso: Scale, reliability and programmability for global internet peering,” in Conference of the Acm Special Interest Group on Data Communication, 2017.
- R. Singh, S. Agarwal, M. Calder, and P. Bahl, “Cost-effective cloud edge traffic engineering with Cascara,” in 18th USENIX Symposium on Networked Systems Design and Implementation (NSDI 21), 2021, pp. 201–216.
- C. Perera, A. Zaslavsky, P. Christen, and D. Georgakopoulos, “Context aware computing for the internet of things: A survey,” IEEE Communications Surveys & Tutorials, vol. 16, no. 1, pp. 414–454, 2014.
- W. Z. Khan, E. Ahmed, S. Hakak, I. Yaqoob, and A. Ahmed, “Edge computing: A survey,” Future Generation Computer Systems, vol. 97, pp. 219–235, 2019.
- J. Meng, H. Tan, C. Xu, W. Cao, L. Liu, and B. Li, “Dedas: Online task dispatching and scheduling with bandwidth constraint in edge computing,” in IEEE INFOCOM 2019-IEEE Conference on Computer Communications. IEEE, 2019, pp. 2287–2295.
- Y. Mao, C. You, J. Zhang, K. Huang, and K. B. Letaief, “A survey on mobile edge computing: The communication perspective,” IEEE communications surveys & tutorials, vol. 19, no. 4, pp. 2322–2358, 2017.
- X. Cheng, Y. Wu, G. Min, A. Y. Zomaya, and X. Fang, “Safeguard network slicing in 5G: A learning augmented optimization approach,” IEEE Journal on Selected Areas in Communications, vol. PP, no. 99, pp. 1–1, 2020.
- C. H. Papadimitriou, “On the complexity of integer programming,” Journal of the ACM (JACM), vol. 28, no. 4, pp. 765–768, 1981.
- E. Delage and S. Mannor, “Percentile optimization for markov decision processes with parameter uncertainty,” Operations Research, vol. 58, no. 1, pp. 203–213, 2010.
- V. Jalaparti, I. Bliznets, S. Kandula, B. Lucier, and I. Menache, “Dynamic pricing and traffic engineering for timely inter-datacenter transfers,” in Proceedings of the 2016 ACM SIGCOMM Conference, 2016, pp. 73–86.
- J. Kotary, F. Fioretto, and P. Van Hentenryck, “Learning hard optimization problems: A data generation perspective,” Advances in Neural Information Processing Systems, vol. 34, pp. 24 981–24 992, 2021.
- V. Shenmaier, “A greedy algorithm for some classes of integer programs,” Discrete applied mathematics, vol. 133, no. 1-3, pp. 93–101, 2003.
- A. Ben Hadj-Alouane and J. C. Bean, “A genetic algorithm for the multiple-choice integer program,” Operations research, vol. 45, no. 1, pp. 92–101, 1997.
- J. Clausen, “Branch and bound algorithms-principles and examples,” Department of Computer Science, University of Copenhagen, pp. 1–30, 1999.
- K. Bestuzheva, M. Besançon, W.-K. Chen, A. Chmiela, T. Donkiewicz, J. van Doornmalen, L. Eifler, O. Gaul, G. Gamrath, A. Gleixner, L. Gottwald, C. Graczyk, K. Halbig, A. Hoen, C. Hojny, R. van der Hulst, T. Koch, M. Lübbecke, S. J. Maher, F. Matter, E. Mühmer, B. Müller, M. E. Pfetsch, D. Rehfeldt, S. Schlein, F. Schlösser, F. Serrano, Y. Shinano, B. Sofranac, M. Turner, S. Vigerske, F. Wegscheider, P. Wellner, D. Weninger, and J. Witzig, “The SCIP Optimization Suite 8.0,” Optimization Online, Technical Report, December 2021.
- I. I. Cplex, “V12. 1: User’s manual for CPLEX,” International Business Machines Corporation, vol. 46, no. 53, p. 157, 2009.
- Gurobi Optimization, LLC, “Gurobi Optimizer Reference Manual,” 2022. [Online]. Available: https://www.gurobi.com
- T. Berthold, “Primal heuristics for mixed integer programs,” Ph.D. dissertation, Zuse Institute Berlin (ZIB), 2006.
- D. Peering, “95th percentile internet billing method,” [EB/OL], 2023. [Online]. Available: http://drpeering.net/white-papers/Ecosystems/95th-percentile-measurement-Internet-Transit.html
- Z. Shahmoradi and T. Lee, “Quantile inverse optimization: Improving stability in inverse linear programming,” INFORMS, 2021.
- A. Chmiela, E. Khalil, A. Gleixner, A. Lodi, and S. Pokutta, “Learning to schedule heuristics in branch and bound,” in Advances in Neural Information Processing Systems, M. Ranzato, A. Beygelzimer, Y. Dauphin, P. Liang, and J. W. Vaughan, Eds., vol. 34. Curran Associates, Inc., 2021, pp. 24 235–24 246.
- E. Jang, S. Gu, and B. Poole, “Categorical reparameterization with Gumbel-Softmax,” arXiv e-prints arXiv:1611.01144, 2016.
- I. A. Huijben, W. Kool, M. B. Paulus, and R. J. Van Sloun, “A review of the gumbel-max trick and its extensions for discrete stochasticity in machine learning,” IEEE Transactions on Pattern Analysis and Machine Intelligence, pp. 1–1, 2022.
- C. J. Maddison, A. Mnih, and Y. W. Teh, “The concrete distribution: A continuous relaxation of discrete random variables,” CoRR, vol. abs/1611.00712, 2016.
- P. L. Donti, D. Rolnick, and J. Z. Kolter, “DC3: A learning method for optimization with hard constraints,” in International Conference on Learning Representations, 2020.
- H. M. Salkin and C. A. De Kluyver, “The knapsack problem: A survey,” Naval Research Logistics Quarterly, vol. 22, no. 1, pp. 127–144, 1975.
- E. Mannie, “Generalized multi-protocol label switching (GMPLS) architecture,” British Journal of Visual Impairment, vol. 35, no. 24, pp. 2717 – 2724, 2004.
- P. Patel, A. Ranabahu, and A. Sheth, “Service level agreement in cloud computing,” Cloud Sla, 2014.
- D. Kingma and J. Ba, “Adam: A method for stochastic optimization,” Computer Science, 2014.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.