The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Routing or Computing? The Paradigm Shift Towards Intelligent Computer Network Packet Transmission Based on Deep Learning
Abstract
Recent years, Software Defined Routers (SDRs) (programmable routers) have emerged as a viable solution to provide a cost-effective packet processing platform with easy extensibility and programmability. Multi-core platforms significantly promote SDRs' parallel computing capacities, enabling them to adopt artificial intelligent techniques, i.e., deep learning, to manage routing paths. In this paper, we explore new opportunities in packet processing with deep learning to inexpensively shift the computing needs from rule-based route computation to deep learning based route estimation for high-throughput packet processing. Even though deep learning techniques have been extensively exploited in various computing areas, researchers have, to date, not been able to effectively utilize deep learning based route computation for high-speed core networks. We envision a supervised deep learning system to construct the routing tables and show how the proposed method can be integrated with programmable routers using both Central Processing Units (CPUs) and Graphics Processing Units (GPUs). We demonstrate how our uniquely characterized input and output traffic patterns can enhance the route computation of the deep learning based SDRs through both analysis and extensive computer simulations. In particular, the simulation results demonstrate that our proposal outperforms the benchmark method in terms of delay, throughput, and signaling overhead.
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
LeCun, Y., Bengio, Y., & Hinton, G. (2015) · Nature · doi:10.1038/nature14539 · Cited by 84,126
A fast learning algorithm for deep belief nets
Hinton, G. E., Osindero, S., & Teh, Y.-W. (2006) · Neural Computation · doi:10.1162/neco.2006.18.7.1527 · Cited by 16,336
Training Products of Experts by Minimizing Contrastive Divergence
Hinton, G. E. (2002) · Neural Computation · doi:10.1162/089976602760128018 · Cited by 4,879 · cited 2×
“The detailed procedures of CD are omitted in the paper, and can be found in [30].”
MethodA Practical Guide to Training Restricted Boltzmann Machines
Hinton, G. E. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-35289-8_32 · Cited by 2,852 · cited 1×
“Since the values of the DBA’s input units representing the numbers of inbound packets are continuous and affected by many factors, we use the Gaussian probability distribution to model the traffic patterns [31].”
MethodDeep Architecture for Traffic Flow Prediction: Deep Belief Networks With Multitask Learning
Huang, W., Song, G., Hong, H., & Xie, K. (2014) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2014.2311123 · Cited by 1,139
Deep convolutional neural networks for LVCSR
Sainath, T. N., Mohamed, A.-R., Kingsbury, B., & Ramabhadran, B. (2013) · 2013 IEEE International Conference on Acoustics, Speech and Signal Processing · doi:10.1109/icassp.2013.6639347 · Cited by 1,053
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
Self-citationAn Introduction to Restricted Boltzmann Machines
Fischer, A., & Igel, C. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33275-3_2 · Cited by 569
Kato, N., Fadlullah, Z. M., Mao, B., Tang, F., Akashi, O., Inoue, T., & Mizutani, K. (2017) · IEEE Wireless Communications · doi:10.1109/mwc.2016.1600317wc · Cited by 400
Self-citationPrivacy Preserving Deep Computation Model on Cloud for Big Data Feature Learning
Zhang, Q., Yang, L. T., & Chen, Z. (2016) · IEEE Transactions on Computers · doi:10.1109/tc.2015.2470255 · Cited by 286
Programmable Packet Scheduling at Line Rate
Sivaraman, A., Subramanian, S., Alizadeh, M., Chole, S., Chuang, S.-T., Agrawal, A., Balakrishnan, H., Edsall, T., Katti, S., & McKeown, N. (2016) · Proceedings of the 2016 ACM SIGCOMM Conference · doi:10.1145/2934872.2934899 · Cited by 276
Kato, N., Suzuki, M., Omachi, S., Aso, H., & Nemoto, Y. (1999) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.754617 · Cited by 191
Self-citationWhat kind of a graphical model is the brain
Hinton, G. E. (2005) · Cited by 52
Evaluation of a wireless enterprise backbone network architecture
Raniwala, A., & Chiueh, T. (2005) · IEEE Symposium on High-Performance Interconnects (HOTI) · doi:10.1109/conect.2004.1375211 · Cited by 46
Top-Down Regularization of Deep Belief Networks
Goh, H., Thome, N., Cord, M., & Lim, J. (2013) · Cited by 20
Building a single-box 100 Gbps software router
Han, S., Jang, K., Park, K., & Moon, S. B. (2010) · IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN) · doi:10.1109/lanman.2010.5507157 · Cited by 15
Supervised Learning in Sensor Networks: New Approaches with Routing, Reliability Optimizations
Wang, Y., Martonosi, M., & Peh, L.-S. (2006) · IEEE International Conference on Sensing, Communication, and Networking (SECON) · doi:10.1109/sahcn.2006.288430 · Cited by 7
Cited by
Deep Learning in Mobile and Wireless Networking: A Survey
Zhang, C., Patras, P., & Haddadi, H. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2904897 · Cited by 1,768
Deep Learning for Super-Resolution Channel Estimation and DOA Estimation Based Massive MIMO System
Huang, H., Yang, J., Huang, H., Song, Y., & Gui, G. (2018) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2018.2851783 · Cited by 818
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
Self-citationDeep Learning for Intelligent Wireless Networks: A Comprehensive Survey
Mao, Q., Hu, F., & Hao, Q. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2846401 · Cited by 789
Xu, Y., Gui, G., Gacanin, H., & Adachi, F. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3059896 · Cited by 648
Metadata
- Authors
- Mao, B., Fadlullah, Z. M., Tang, F., Kato, N., Akashi, O., Inoue, T., & Mizutani, K.
- Venue
- IEEE Transactions on Computers
- Published
- 2017-11-01
- Volume
- 66
- Issue
- 11
- Pages
- 1946-1960
- ISSN
- 0018-9340 (ISSN-L)
- OpenAlex
- W2620303912
- Cited by
- 350
- References
- 17
- FWCI
- 32.65
- Type
- journal article
- Language
- en
- Open access
- closed
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.