Learning-based network path planning for traffic engineering
Open accessThe DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
Recent advances in traffic engineering offer a series of techniques to address the network problems due to the explosive growth of Internet traffic. In traffic engineering, dynamic path planning is essential for prevalent applications, e.g., load balancing, traffic monitoring and firewall. Application-specific methods can indeed improve the network performance but can hardly be extended to general scenarios. Meanwhile, massive data generated in the current Internet has not been fully exploited, which may convey much valuable knowledge and information to facilitate traffic engineering. In this paper, we propose a learning-based network path planning method under forwarding constraints for finer-grained and effective traffic engineering. We form the path planning problem as the problem of inferring a sequence of nodes in a network path and adapt a sequence-to-sequence model to learn implicit forwarding paths based on empirical network traffic data. To boost the model performance, attention mechanism and beam search are adapted to capture the essential sequential features of the nodes in a path and guarantee the path connectivity. To validate the effectiveness of the derived model, we implement it in Mininet emulator environment and leverage the traffic data generated by both a real-world GEANT network topology and a grid network topology to train and evaluate the model. Experiment results exhibit a high testing accuracy and imply the superiority of our proposal.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
LeCun, Y., Bengio, Y., & Hinton, G. (2015) · Nature · doi:10.1038/nature14539 · Cited by 84,126
McKeown (2008) · doi:10.1145/1355734.1355746 · Cited by 8,513 · cited 1×
“The emerging Software Defined Networking (SDN) paradigm [11, 12] has gained its popularity and drawn considerable attentions for smooth and rapid development of new TE algorithms, due to its capability of decoupling the control plane from the data plane.”
BackgroundEffective Approaches to Attention-based Neural Machine Translation
Luong, T., Pham, H., & Manning, C. D. (2015) · Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d15-1166 · Cited by 8,382
Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translation
Cho, K., van Merrienboer, B., Gulcehre, C., Bahdanau, D., Bougares, F., Schwenk, H., & Bengio, Y. (2014) · arXiv · doi:10.48550/arxiv.1406.1078 · Cited by 3,317
Fadlullah, Z. M., Tang, F., Mao, B., Kato, N., Akashi, O., Inoue, T., & Mizutani, K. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2707140 · Cited by 810 · cited 3×
“The hidden information behind the data implies important knowledge [15] for efficient TE [3].”
BackgroundThe role of big data analytics in Internet of Things
Ahmed, E., Yaqoob, I., Hashem, I. A. T., Khan, I., Ahmed, A. I. A., Imran, M., & Vasilakos, A. V. (2017) · Computer Networks · doi:10.1016/j.comnet.2017.06.013 · Cited by 629 · cited 5×
“Very recently, in [5], the authors aimed to schedule conventional dynamic traffic and Internet of Things (IoT) with flexible time.”
BackgroundInfluentialCellular Network Traffic Scheduling With Deep Reinforcement Learning
Chinchali, S., Hu, P., Chu, T., Sharma, M., Bansal, M., Misra, R., Pavone, M., & Katti, S. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11339 · Cited by 218 · cited 4×
“It has been a hot topic in recent research trend [1, 2, 3, 4, 5], due to the increasing demands on dynamic network maintenance, management and Quality-of-Service (QoS) guarantee [2].”
BackgroundInfluential
Cited by
A review on the long short-term memory model
Van Houdt, G., Mosquera, C., & Nápoles, G. (2020) · Artificial Intelligence Review · doi:10.1007/s10462-020-09838-1 · Cited by 1,991
A Data-Driven Auto-CNN-LSTM Prediction Model for Lithium-Ion Battery Remaining Useful Life
Ren, L., Dong, J., Wang, X., Meng, Z., Zhao, L., & Deen, M. J. (2021) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2020.3008223 · Cited by 690
Variational LSTM Enhanced Anomaly Detection for Industrial Big Data
Zhou, X., Hu, Y., Liang, W., Ma, J., & Jin, Q. (2021) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2020.3022432 · Cited by 402
Hussain, F., Hassan, S. A., Hussain, R., & Hossain, E. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2964534 · Cited by 395
Graph Neural Networks for Anomaly Detection in Industrial Internet of Things
Wu, Y., Dai, H.-N., & Tang, H. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3094295 · Cited by 338
Self-citation
Metadata
- Authors
- Zuo, Y., Wu, Y., Min, G., & Cui, L.
- Venue
- Future Generation Computer Systems
- Publisher
- Elsevier BV
- Published
- 2019-03
- Volume
- 92
- Pages
- 59-67
- ISSN
- 0167-739X (ISSN-L)
- OpenAlex
- W2893647509
- Cited by
- 73
- References
- 9
- FWCI
- 6.69
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.