Network traffic reduction with spatially flexible optical networks using machine learning techniques

被引:0
作者
Wang, Aiqiang [1 ]
机构
[1] Henan Polytech, Coll Modern Informat Technol, Zhengzhou 450046, Henan, Peoples R China
关键词
Network traffic analysis; Resource allocation; Energy optimization; Flexible optical networks; Machine learning; QUANTUM; LEARNABILITY; COMPLEXITY; HARDNESS;
D O I
10.1007/s11082-023-05275-w
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Traffic forecasting and the utilisation of historical data are essential for intelligent and efficient resource management, particularly in optical data centre networks (ODCNs) that serve a wide range of applications. In this research, we investigate the challenge of traffic aggregation in ODCNs by making use of exact or predictable knowledge of application -certain data and demands, such as waiting time, bandwidth, traffic history, and latency. Since ODCNs process a wide range of flows (including long/elephant and short/mice), we employ machine learning (ML) to foresee time -varying traffic and connection blockage. In order to improve energy use and resource distribution in spatially mobile optical networks, this research proposes a novel method of network traffic analysis based on machine learning. Here, we leverage network monitoring to inform resource allocation decisions, with the goal of decreasing traffic levels using short-term space multiplexing multitier reinforcement learning. Then, the energy is optimised by using dynamic gradient descent division multiplexing. Various metrics, including accuracy, NSE (normalised square error), validation loss, mean average error, and probability of bandwidth blockage, are used in the experiment. Finally, using the primal-dual interior -point approach, we investigate how much weight each slice should have depending on the predicted results, which include the traffic of each slice and the distribution of user load.
引用
收藏
页数:16
相关论文
共 48 条
[1]   Improved simulation of stabilizer circuits [J].
Aaronson, S ;
Gottesman, D .
PHYSICAL REVIEW A, 2004, 70 (05) :052328-1
[2]   The learnability of quantum states [J].
Aaronson, Scott .
PROCEEDINGS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 2007, 463 (2088) :3089-3114
[3]   Shadow Tomography of Quantum States [J].
Aaronson, Scott .
STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2018, :325-338
[4]   Ancilla-assisted quantum process tomography [J].
Altepeter, JB ;
Branning, D ;
Jeffrey, E ;
Wei, TC ;
Kwiat, PG ;
Thew, RT ;
O'Brien, JL ;
Nielsen, MA ;
White, AG .
PHYSICAL REVIEW LETTERS, 2003, 90 (19) :4
[5]   Function learning from interpolation [J].
Anthony, M ;
Bartlett, PL .
COMBINATORICS PROBABILITY & COMPUTING, 2000, 9 (03) :213-225
[6]  
Arunachalam Srinivasan, 2017, ACM SIGACT News, V48, P41, DOI 10.1145/3106700.3106710
[7]  
Arunachalam S, 2020, Arxiv, DOI [arXiv:2002.08240, DOI 10.48550/ARXIV.2002.08240, 10.48550/arXiv.2002.08240]
[8]  
Arunachalam S, 2021, SIAM J COMPUT, V50, P972, DOI 10.1137/20M1344202
[9]   Optimal Quantum Sample Complexity of Learning Algorithms [J].
Arunachalam, Srinivasan ;
de Wolf, Ronald .
32ND COMPUTATIONAL COMPLEXITY CONFERENCE (CCC 2017), 2017, 79
[10]  
Arunachalam Srinivasan, 2021, ADV NEUR IN, V34