TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Hybrid ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Open Access Research Article

Spectral graph theory for large-scale network topology optimization in cloud computing

* , , , , ,

* Corresponding author · click or hover a name for details

pp. 2899–2906Vol. 28Issue 7October 2025DOI: 10.47974/JDMSC-2560 Crossmark XML
Received:
08 Jul 2025
Published Online:
31 Oct 2025
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-2560
Pages:
2899–2906

Abstract

Spectral Graph Theory is a strict mathematical approach for looking at and improving the layout of very big cloud networks.  Using the Laplacian matrix to examine eigenvalues gives us useful information on how linked, stable, and grouped cloud systems are when we represent them as weighted graphs. This paper examines algebraic connections, spectral gaps, and eigenvalue-driven optimisation strategies to enhance scalability, load balancing, and fault tolerance. Throughput, lag reduction, and robustness all improve significantly in experimental tests that cover a wide range of layouts. When we combine spectral methods with cloud management frameworks, we can make network change strategies that are flexible, efficient, and based on math. 

Keywords

Subject Classifications

20F3805C10

References

[1] I. Cameron, T. Tomesh, Z. Sasycamorem, and I. Safro, “Scaling Up the Quantum Divide and Conquer Algorithm for Combinatorial Optimization,” arXiv, arXiv:2405.00861 (2024). 
[2] S. K. Deb and W. D. Pan, “Quantum Image Compression: Fundamentals, Algorithms, and Advances,” Computers, vol. 13, pp. 185 (2024). 
[3] M. Casals, V. Belis, E. F. Combarro, E. Alarcón, S. Vallecorsa, and M. Grossi, “Guided Graph Compression for Quantum Graph Neural Networks,” arXiv, arXiv:2506.09862 (2025). 
[4] C. Liu, W. B. Lee, and A. G. Constantinides, “Quantum Testing of Recommender Algorithms on GPU-Based Quantum Simulators,” Computers, vol. 14, pp. 137 (2025). 
[5] R. Lewis, “Algorithms for finding shortest paths in networks with vertex transfer penalties,” Algorithms, vol. 13, pp. 269 (2020). 
[6] F. N. Jardow and M. Jameel, “Modified Barzilai-Borwein (MBB) gradient method for solving fuzzy nonlinear equations,” Journal of Information and Optimization Sciences, vol. 46, no. 5, pp. 1559–1568 (2025), doi: 10.47974/JIOS-1805. 
[7] D. S. Lakew, U. Sa’ad, N. N. Dao, W. Na, and S. Cho, “Routing in flying ad hoc networks: A comprehensive survey,” IEEE Commun. Surv. Tutorials, vol. 22, pp. 1071–1120 (2020). 
[8] M. M. Alam and S. Moh, “Survey on Q-Learning-Based Position-Aware Routing Protocols in Flying Ad Hoc Networks,” Electronics, vol. 11, pp. 1099 (2022). 
[9] W. Jiang, “Software defined satellite networks: A survey,” Digit. Commun. Netw., vol. 9, pp. 1243–1264 (2023). 
[10] S. Yang, C. Tan, D. Ø. Madsen, H. Xiang, Y. Li, I. Khan, and B. J. Choi, “Comparative Analysis of Routing Schemes Based on Machine Learning,” Mob. Inf. Syst., vol. 2022, pp. 4560072 (2022). 
[11] W. Jiang, “Applications of deep learning in stock market prediction: Recent progress,” Expert Syst. Appl., vol. 184, pp. 115537 (2021). 
[12] S. S. More and P. R. Birmule, “The Psychology of Successful Sports: Improving Health and Performance,” Int. J. Res. Dev. Manag. Rev., vol. 14, no. 1, pp. 55–57 (May 2025). 

Views: 253Downloads: 86Citations: 0