International journal of advanced smart convergence

The Institute of Internet, Broadcasting and Communication (한국인터넷방송통신학회)
권호 표지
DOI QR코드

DOI QR Code

Machine Learning Based Neighbor Path Selection Model in a Communication Network

  • Lee, Yong-Jin (Dept. of Technology Education, Korea National University of Education)
  • Received : 2021.01.02
  • Accepted : 2021.01.11
  • Published : 2021.03.31
Download PDF
⟨ Previous Next ⟩

Abstract

Neighbor path selection is to pre-select alternate routes in case geographically correlated failures occur simultaneously on the communication network. Conventional heuristic-based algorithms no longer improve solutions because they cannot sufficiently utilize historical failure information. We present a novel solution model for neighbor path selection by using machine learning technique. Our proposed machine learning neighbor path selection (ML-NPS) model is composed of five modules- random graph generation, data set creation, machine learning modeling, neighbor path prediction, and path information acquisition. It is implemented by Python with Keras on Tensorflow and executed on the tiny computer, Raspberry PI 4B. Performance evaluations via numerical simulation show that the neighbor path communication success probability of our model is better than that of the conventional heuristic by 26% on the average.

Keywords

References

  1. Z. Zhang and S. Chen, "Capacity-aware multicast algorithm on heterogeneous overlay networks," IEEE Trans. Parallel Distribution System, Vol. 17, No. 2, pp. 135-147, 2006. DOI: http://doi.org/10.1109/TPDS.2006.19
  2. N. Feamster, D. Anderson, H. Balakrishnan, and M. F. Kaasheok, "Measuring the effects of Internet path faults on reactive routing," SIGMETRICS Performance Review, Vol. 31, No. 1, pp. 126-137, 2003. DOI: http://doi.org/10.1145/885651.781043
  3. K. Kim and N.Venkatasubramanian, "Assessing the impact of geographically correlated failures on overlay-based data dissemination," in Proc. of IEEE Global Telecommunications Conference, Miami, USA, pp. 1-5, 2010. DOI: http://doi.org/10.1109/GLOCOM.2010.5685229
  4. Y. Lee, "Neighbor selection considering path latency in overlay network," Journal of Natural Science, KNUE, Vol. 2, pp. 25-32, 2013.
  5. Y. Lee, "A path selection model considering path latency in the communication network with geographically correlated failures," ICIC Express Letters, Vol. 13, No. 9, 2019. DOI: http://doi.org/10.24507/icicel.13.09.789
  6. O. Simeone, "A very brief introduction to machine learning with applications to communication systems," IEEE Trans. on Cognitive Communication and Networking, Vol. 4, No. 4, pp. 648-664, 2018. DOI: http://doi.org/10.1109/tccn.2018.2881442
  7. T. Gruber, S. Cammerer, J. Hoydis, and S. Ten Brink, "On deep learning-based channel decoding," in Proc. of 51st Annual Conference on Information Sciences and Systems(CISS), pp.1-6, 2017. DOI: http://doi.org/10.1109/CISS.2017.7926071
  8. D. Deltesta, M. Danieletto, G. M. Di Nunzio, and M. Zorzi, "Estimating the number of receiving nodes in 802.11 networks via machine learning techniques," in Proc. of IEEE Glob. Commun. Conference. (GLOBECOM), pp. 1-7, 2016. DOI: http://doi.org/10.1109/GLOCOM.2016.7841821
  9. D. K.Bangotra, Y. Singh, and A. Selwal, "Machine learning in wireless sensor networks: challenges and opportunities," in Proc. of Fifth Int. Conf. on Parallel, Distributed and Grid Computing(PDGC), pp. 534-539, 2018. DOI: http://doi.org/10.1109/PDGC.2018.8745845
  10. M. Chen,W.Saad,C. Yin, and M.Debbah,"Echo state networks for proactive caching in cloud-based radio access networks with mobile users," IEEE Trans.Wireless Commun., Vol. 16, No. 6, pp. 3520-3535, 2017. DOI: http://doi.org/10.1109/TWC.2017.2683482
  11. Erdos and Renyl model, https://www.geeksforgeeks.org/erdos-renyl-model-generating-random-graphs/.
  12. E. W. Dijkstra, "A note on two problems in connection with graphs", Numerishe Mathematik, Vol. 1, pp. 269-271, 1959. DOI: http://doi.org/10.1007/BF01386390
  13. T. Kim. Python Deep Learning Keras, Digital Books, pp. 96-111, Jan. 2019.