{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:19:16Z","timestamp":1753885156941,"version":"3.41.2"},"reference-count":41,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,4,15]],"date-time":"2021-04-15T00:00:00Z","timestamp":1618444800000},"content-version":"vor","delay-in-days":104,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["CUC2019B072"],"award-info":[{"award-number":["CUC2019B072"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>The application of machine learning touches all activities of human behavior such as computer network and routing packets in LAN. In the field of our research here, emphasis was placed on extracting weights that would affect the speed of the network\u2032s response and finding the best path, such as the number of nodes in the path and the congestion on each path, in addition to the cache used for each node. Therefore, the use of these elements in building the neural network is worthy, as is the exploitation of the feed forwarding and the backpropagation in the neural network in order to reach the best prediction for the best path. The goal of the proposed neural network is to minimize the network time delay within the optimization of the packet paths being addressed in this study. The shortest path is considered as the key issue in routing algorithm that can be carried out with real time of path computations. Exploiting the gaps in previous studies, which are represented in the lack of training of the system and the inaccurate prediction as a result of not taking into consideration the hidden layers\u2032 feedback, leads to great performance. This study aims to suggest an efficient algorithm that could help in selecting the shortest path to improve the existing methods using weights derived from packet ID and to change neural network iteration simultaneously. In this study, the design of the efficient neural network of appropriate output is discussed in detail including the principles of the network. The findings of the study revealed that exploiting the power of computational system to demonstrate computer simulation is really effective. It is also shown that the system achieved good results when training the neural network system to get 2.4% time delay with 5 nodes in local LAN. Besides, the results showed that the major features of the proposed model will be able to run in real time and are also adaptive to change with path topology.<\/jats:p>","DOI":"10.1155\/2021\/5572881","type":"journal-article","created":{"date-parts":[[2021,4,15]],"date-time":"2021-04-15T22:24:38Z","timestamp":1618525478000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Selecting the Best Routing Traffic for Packets in LAN via Machine Learning to Achieve the Best Strategy"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6173-2668","authenticated-orcid":false,"given":"Bo","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Rongji","family":"Liao","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2021,4,15]]},"reference":[{"key":"e_1_2_9_1_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2019.04.014"},{"key":"e_1_2_9_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.scs.2020.102177"},{"key":"e_1_2_9_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2018.09.013"},{"key":"e_1_2_9_4_2","article-title":"Permuting convergence overcoming of genetic algorithm using arnold cat","volume":"6","author":"Yas R. M.","year":"2017","journal-title":"Map International Journal of Science and Research"},{"key":"e_1_2_9_5_2","doi-asserted-by":"publisher","DOI":"10.3139\/120.111478"},{"key":"e_1_2_9_6_2","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1530\/1\/012076"},{"key":"e_1_2_9_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2019.124895"},{"key":"e_1_2_9_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2016.12.005"},{"key":"e_1_2_9_9_2","doi-asserted-by":"publisher","DOI":"10.14419\/jacst.v4i2.4857"},{"key":"e_1_2_9_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2020.2975985"},{"key":"e_1_2_9_11_2","doi-asserted-by":"publisher","DOI":"10.9790\/0661-16636670"},{"key":"e_1_2_9_12_2","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-5225-0498-6.ch011"},{"key":"e_1_2_9_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-2125-6_10"},{"key":"e_1_2_9_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.osn.2017.12.006"},{"key":"e_1_2_9_15_2","doi-asserted-by":"publisher","DOI":"10.3390\/fi13020054"},{"key":"e_1_2_9_16_2","first-page":"1","article-title":"Multimodal cyberbullying detection using capsule network with dynamic routing and deep convolutional neural network","author":"Kumar A.","year":"2021","journal-title":"Multimedia Systems"},{"key":"e_1_2_9_17_2","doi-asserted-by":"publisher","DOI":"10.1088\/1757-899X\/870\/1\/012037"},{"key":"e_1_2_9_18_2","unstructured":"GuoQ. ZhangZ. andXuY. Path-planning of automated guided vehicle based on improved Dijkstra algorithm Proceedings of the IEEE 2017 29th Chinese Control and Decision Conference (CCDC) May 2017 Chongqing China 7138\u20137143."},{"key":"e_1_2_9_19_2","article-title":"Dijkstra\u2019s-DBSCAN: fast, accurate, and routable density based clustering of traffic incidents on large road network transportation research record:national academy of sciences","volume":"2672","author":"Yang Z.","year":"2018","journal-title":"Transportation Research Board"},{"key":"e_1_2_9_20_2","first-page":"166","article-title":"Network route minimization using time based interface control","volume":"6","author":"Nazmul H.","year":"2018","journal-title":"International Journal on Recent and Innovation Trends in Computing and Communication"},{"key":"e_1_2_9_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/comst.2018.2866942"},{"key":"e_1_2_9_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/jstsp.2018.2794062"},{"key":"e_1_2_9_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2019.102045"},{"key":"e_1_2_9_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2018.2877686"},{"key":"e_1_2_9_25_2","unstructured":"MartinC. H.andMahoneyM. W. Predicting trends in the quality of state-of-the-art neural networks without access to training or testing data 2020 https:\/\/arxiv.org\/abs\/2002.06716."},{"key":"e_1_2_9_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/comst.2017.2727878"},{"key":"e_1_2_9_27_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature14236"},{"key":"e_1_2_9_28_2","doi-asserted-by":"crossref","unstructured":"MartinC. H.andMahoneyM. W. Statistical mechanics methods for discovering knowledge from modern production quality neural networks Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining August 2019 Anchorage AK USA 3239\u20133240.","DOI":"10.1145\/3292500.3332294"},{"key":"e_1_2_9_29_2","unstructured":"MahoneyM.andMartinC. Traditional and heavy tailed self-regularization in neural network models Proceedings of the International Conference on Machine Learning June 2019 Long Beach CA USA 4284\u20134293."},{"key":"e_1_2_9_30_2","first-page":"108","article-title":"Toward generating a new intrusion detection dataset and intrusion traffic characterization","author":"Sharafaldin I.","year":"2018","journal-title":"ICISSP"},{"key":"e_1_2_9_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2019.2924243"},{"key":"e_1_2_9_32_2","unstructured":"YamamotoY. LeleuT. GanguliS. andMabuchiH. Coherent ising machines\u2014quantum optics and neural network perspectives 2020 https:\/\/arxiv.org\/abs\/2006.0564 9."},{"key":"e_1_2_9_33_2","article-title":"Convex optimization: algorithms and complexity","author":"Bubeck S.","year":"2015","journal-title":"Now Foundations and Trends"},{"key":"e_1_2_9_34_2","first-page":"1","article-title":"If deep learning is the answer, what is the question?","author":"Saxe A.","year":"2020","journal-title":"Nature Reviews Neuroscience"},{"key":"e_1_2_9_35_2","doi-asserted-by":"crossref","unstructured":"DoshiR. ApthorpeN. andFeamsterN. Machine learning DDoS detection for the consumer internet of things devices Proceedings of the IEEE Security and Privacy Workshops (SPW) May 2018 San Francisco CA USA 29\u201335.","DOI":"10.1109\/SPW.2018.00013"},{"key":"e_1_2_9_36_2","doi-asserted-by":"crossref","unstructured":"MehtaA. Kaur SandhuJ. andSapraL. Machine learning in wireless sensor networks: a retrospective Proceedings of the 2020 Sixth International Conference on Parallel Distributed and Grid Computing (PDGC) November 2020 Solan India IEEE.","DOI":"10.1109\/PDGC50313.2020.9315775"},{"key":"e_1_2_9_37_2","article-title":"RPRTD: routing protocol based on remaining time to encounter nodes with destination node in delay tolerant network using artificial neural network","volume":"1","author":"Karami A.","year":"2020","journal-title":"Peer-to-Peer Networking and Applications"},{"key":"e_1_2_9_38_2","doi-asserted-by":"crossref","unstructured":"WuDiandGary WangG. Causal artificial neural network and its applications in engineering design Engineering Applications of Artificial Intelligence 97 no. 2021.","DOI":"10.1016\/j.engappai.2020.104089"},{"key":"e_1_2_9_39_2","doi-asserted-by":"publisher","DOI":"10.1111\/coin.12261"},{"key":"e_1_2_9_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2017.1601089"},{"key":"e_1_2_9_41_2","doi-asserted-by":"crossref","unstructured":"O\u2019SheaT. KarraK. andClancyT. C. Learning approximate neural estimators for wireless channel state information Proceedings of the IEEE International Workshop on Machine Learning for Signal Processing (MLSP) September 2017 Tokyo Japan.","DOI":"10.1109\/MLSP.2017.8168144"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/5572881.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/5572881.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/5572881","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T22:32:03Z","timestamp":1723242723000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/5572881"}},"subtitle":[],"editor":[{"given":"M. Irfan","family":"Uddin","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/5572881"],"URL":"https:\/\/doi.org\/10.1155\/2021\/5572881","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"type":"print","value":"1076-2787"},{"type":"electronic","value":"1099-0526"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2021-02-04","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-03-31","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-04-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"5572881"}}