A deep learning-based constrained intelligent routing method | Peer-to-Peer Networking and Applications Skip to main content

Advertisement

Springer Nature Link
Log in

A deep learning-based constrained intelligent routing method

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

Routing services in next generation networks not only need to provide good transmission quality in heterogeneous network environments, but also need to meet the differentiated performance requirements of different applications. For example, real-time applications require low latency performance guarantees, while low-cost applications pay more attention to strict cost guarantees. Recently, deep learning has been widely applied in the field of network. With the aid of the powerful deep neural networks, the communication network can perform the routing operation intelligently to avoid the possible failure and congestion. However, existing deep learning-based network routing algorithms cannot satisfy the specific performance requirements of users, because this kind of algorithm is an unconstrained feature learning method essentially, while the routing requirements of different applications are really a constrained problem. In order to solve the above problems, we propose a deep learning-based constrained intelligent routing method, which combines the advantages of Lagrange multiplier method for solving constrained problems and the learning ability of deep learning methods, making the routing service can not only learn complex features to adapt to network environments, but also can meet differentiated requirement of users on the performance. To the best of our knowledge, this is the first work to solve the constrained routing problem by using deep learning system. Experimental results prove the effectiveness of the proposed method and show it is a method suitable for providing high-quality routing services for the next generation network.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Nguyen VG, Brunstrom A, Grinnemo KJ, Taheri J (2017) SDN/NFV-based mobile packet core network architectures: a survey[J]. IEEE Commun Surv Tutorials 19(3):1567–1602

    Article  Google Scholar 

  2. Tang F, Mao B, Fadlullah Z M et al (2019) ST-DeLTA: A novel spatial-temporal value network aided deep learning based intelligent network traffic control system[J]. IEEE Trans Sustain Comput 5(4):568–580

  3. Tang F, Mao B, Fadlullah Z M et al (2017) On removing routing protocol from future wireless networks: a real-time deep learning approach for intelligent traffic control[J]. IEEE Wirel Commun 25(1):154–160

  4. Kaiwartya O, Abdullah A H, Cao Y et al (2016) Internet of vehicles: motivation, layered architecture, network model, challenges, and future aspects[J]. IEEE Access 4:5356–5373

  5. Kim HJ, Kim BH (2018) Implementation of young children English education system by AR type based on P2P network service model[J]. Peer-to-Peer Netw Appl 11(6):1252–1264

  6. Wan J, Yi M, Li DI et al (2016) Mobile services for customization manufacturing systems: an example of industry 4.0[J]. IEEE Access 4:8977–8986

    Article  Google Scholar 

  7. Stergiou C, Psannis KE, Kim BG, Gupta B (2018) Secure integration of IoT and cloud computing[J]. Futur Gener Comput Syst 78:964–975

    Article  Google Scholar 

  8. Hodge SL System and method for third party monitoring of voice and video calls: U.S. Patent 10,277,640[P]. 2019-4-30

  9. 2014 What will 5G Be?[J]. IEEE J Sel Areas Commun 32(6)

  10. Yao Q, Liao X, Jin H (2017) Training deep neural network on multiple GPUs with a model averaging method[J]. Peer-to-Peer Netw Appl 11(7):1–10

    Google Scholar 

  11. Sahrish Khan Tayyaba, et al. (2018) Resource allocation in SDN based 5G cellular networks[J]. Peer-to-Peer Netw Appl

  12. Dijkstra EW (1959) A note on two problems in connexion with graphs[J]. Numer Math 1(1):269–271

    Article  MathSciNet  Google Scholar 

  13. Yanjun L, Xiaobo L, Osamu Y (2014) Traffic engineering framework with machine learning based meta-layer in software-defined networks[C]//2014 4th IEEE international conference on network infrastructure and digital content. IEEE: 121–125

  14. Gunes M, Sorges U, Bouazizi I (2002) ARA-the ant-colony based routing algorithm for MANETs[C]//Proceedings. International Conference on Parallel Processing Workshop. IEEE: 79–85

  15. Azzouni A, Boutaba R, Pujolle G (2017) NeuRoute: predictive dynamic routing for software-defined networks[C]//2017 13th international conference on network and service management (CNSM). IEEE: 1–6

  16. Joksch HC (1966) The shortest route problem with constraints[J]. J Math Anal Appl 14(2):191–197

    Article  MathSciNet  Google Scholar 

  17. Widyono R (1994) The design and evaluation of routing algorithms for real-time channels. Int. Comput. Sci. Inst. Berkeley, Berkeley, CA, USA, Tech. Rep. TR-94-024

  18. Lee WC, Hluchyi MG, Humblet PA (1995) Routing subject to quality of service constraints in integrated communication networks[J]. IEEE Netw 9(4):46–55

    Article  Google Scholar 

  19. Jia Z, Varaiya P (2001) Heuristic methods for delay-constrained least cost routing problem using k-shortest-path algorithms[C]//Proc. IEEE INFOCOM: 1–9

  20. Sun Q, Langendörfer H (1998) A new distributed routing algorithm for supporting delay-sensitive applications[J]. Comput Commun 21(6):572–578

    Article  Google Scholar 

  21. Ishida K, Amano K, Kannari N (1998) A delay-constrained least-cost path routing protocol and the synthesis method[C]//proceedings fifth international conference on real-time computing systems and applications (Cat. No. 98EX236). IEEE: 58–65

  22. Juttner A, Szviatovski B, Mécs I, et al (2001) Lagrange relaxation based method for the QoS routing problem[C]//proceedings IEEE INFOCOM 2001. Conference on computer communications. Twentieth annual joint conference of the IEEE computer and communications society (Cat. No. 01CH37213). IEEE 2: 859–868

  23. Guck JW, Van Bemten A, Reisslein M et al (2017) Unicast QoS routing algorithms for SDN: a comprehensive survey and performance evaluation[J]. IEEE Commun Surv Tutorials 20(1):388–415

    Article  Google Scholar 

  24. Kato N, Fadlullah ZM, Mao B et al (2016) The deep learning vision for heterogeneous network traffic control: proposal, challenges, and future perspective[J]. IEEE Wirel Commun 24(3):146–153

    Article  Google Scholar 

  25. Mao B, Fadlullah ZM, Tang F, et al (2017) A tensor based deep learning technique for intelligent packet routing[C]//GLOBECOM 2017-2017 IEEE global communications conference. IEEE: 1–6

  26. Fadlullah Z, Tang F, Mao B et al (2017) State-of-the-art deep learning: evolving machine intelligence toward tomorrow’s intelligent network traffic control systems[J]. IEEE Commun Surv Tutorials 19(4):2432–2455

    Article  Google Scholar 

  27. Mao B, Fadlullah ZM, Tang F, Kato N, Akashi O, Inoue T, Mizutani K (2017) Routing or computing? The paradigm shift towards intelligent computer network packet transmission based on deep learning[J]. IEEE Trans Comput 66(11):1946–1960

    Article  MathSciNet  Google Scholar 

  28. Mao B, Tang F, Fadlullah ZM, Kato N, Akashi O, Inoue T, Mizutani K (2018) A novel non-supervised deep-learning-based network traffic control method for software defined wireless networks[J]. IEEE Wirel Commun 25(4):74–81

    Article  Google Scholar 

  29. Mao Q, Hu F, Hao Q (2018) Deep learning for intelligent wireless networks: a comprehensive survey[J]. IEEE Commun Surv Tutorials 20(4):2595–2621

    Article  Google Scholar 

  30. Feng G, Douligeris C, Makki K et al (2002) Performance evaluation of delay-constrained least-cost QoS routing algorithms based on linear and nonlinear lagrange relaxation[C]//2002 IEEE international conference on communications. Conference proceedings. ICC 2002 (Cat. No. 02CH37333). IEEE 4:2273–2278

    Google Scholar 

  31. Jüttner A, Mécs I Lagrange quality of service routing: U.S. Patent 7,020,086[P]. 2006-3-28

  32. Azzouni A, Pujolle G (2017) A long short-term memory recurrent neural network framework for network traffic matrix prediction[J]. arXiv preprint arXiv:1705.05690

  33. Mikolov T, Karafiát M, Burget L, et al (2010) Recurrent neural network based language model[C]//eleventh annual conference of the international speech communication association

  34. Cho K, Van Merriënboer B, Gulcehre C, et al (2014) Learning phrase representations using RNN encoder-decoder for statistical machine translation[J]. arXiv preprint arXiv:1406.1078

  35. Sak H, Senior A, Beaufays F (2014) Long short-term memory based recurrent neural network architectures for large vocabulary speech recognition[J]. arXiv preprint arXiv:1402.1128

  36. Li S, Li W, Cook C, et al (2018) Independently recurrent neural network (indrnn): building a longer and deeper rnn[C]//proceedings of the IEEE conference on computer vision and pattern recognition: 5457–5466

  37. Azzouni A, Pujolle G (2018) NeuTM: a neural network-based framework for traffic matrix prediction in SDN[C]//NOMS 2018-2018 IEEE/IFIP network operations and management symposium. IEEE: 1–5

  38. Graves A, Schmidhuber J (2005) Framewise phoneme classification with bidirectional LSTM and other neural network architectures[J]. Neural Netw 18(5–6):602–610

    Article  Google Scholar 

  39. Chollet F. Keras (2015)[J]. 2017

  40. Issariyakul T, Hossain E (2012) Introduction to network simulator 2 (NS2)[M]//introduction to network simulator NS2. Springer, Boston, pp 21–40. https://doi.org/10.1007/978-0-387-71760-9_2.pdf

    Book  Google Scholar 

  41. Kingma DP, Ba J (2015) Adam: a method for stochastic optimization, in:proceedings the 3rd international conference for learning representations. Springer Verlag, San Diego, pp 1–15

    Google Scholar 

  42. Rao Z, Xu Y, Pan S (2020) An intelligent routing method based on network partition[J]. Comput Commun 160:25–33

    Article  Google Scholar 

Download references

Acknowledgments

The research is supported by National Key Research and Development Program of China (No. 2017YFB0504202), National Natural Science Foundation of China (No. 91738302, 41571426), and Wuhan Applied Basic Research Program (No. 2017010201010114).

Author information

Authors and Affiliations

  1. State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, Wuhan, People’s Republic of China

    Zheheng Rao, Yanyan Xu & Shaoming Pan

Authors
  1. Zheheng Rao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yanyan Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shaoming Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yanyan Xu.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Rao, Z., Xu, Y. & Pan, S. A deep learning-based constrained intelligent routing method. Peer-to-Peer Netw. Appl. 14, 2224–2235 (2021). https://doi.org/10.1007/s12083-021-01185-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-021-01185-4

Keywords

Search

Navigation