Comparative Analysis of Routing Schemes Based on Machine Learningopen access
- Authors
- Yang, Shaoyu; Tan, Cong; Madsen, Dag Oivind; Xiang, Haige; Li, Yun; Khan, Imran; Choi, Bong Jun
- Issue Date
- Jun-2022
- Publisher
- HINDAWI LTD
- Citation
- MOBILE INFORMATION SYSTEMS, v.2022
- Journal Title
- MOBILE INFORMATION SYSTEMS
- Volume
- 2022
- URI
- http://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/42588
- DOI
- 10.1155/2022/4560072
- ISSN
- 1574-017X
- Abstract
- Machine learning-based distributed routing algorithms, in contrast to traditional mathematical model-driven distributed routing algorithms, are typically data-driven, allowing them to adapt to dynamically changing network environments and various performance evaluation index optimization requirements. It is quite likely that it will become a key part of the next-generation Internet in the future. However, current intelligent routing research is still in its early stages. This article provides a comprehensive review of the state-of-the-art routing algorithms based on machine learning. First, important research on existing data-driven intelligent routing algorithms is presented with the key concepts and applications of these systems demonstrated. To enable intelligent routing algorithms to be deployed in real scenarios with cheap cost and high reliability, two appropriate training deployment frameworks and intelligent routing algorithm training and deployment strategies are given. Finally, the future development of machine learning-based intelligent routing systems is examined. The opportunities and problems that have been encountered, as well as prospective research directions, are discussed.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Information Technology > School of Computer Science and Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/42588)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.