MATEC Web Conf.
Volume 232, 20182018 2nd International Conference on Electronic Information Technology and Computer Engineering (EITCE 2018)
|Number of page(s)||5|
|Section||Network Security System, Neural Network and Data Information|
|Published online||19 November 2018|
Design on routing optimization algorithm based on complex network
(school of Informations Communication Engineering, Beijing Information Science and Technilogy University, Beijing 100101, China )
a Corresponding author: email@example.com
In order to solve the problem of information flow network transmission and congestion control in complex internet networks, A new and complicated routing network algorithm based on network evolution simulation model is proposed, An improved method is proposed for a typical static local routing algorithm in an SRTD network. This method adds a node message queue length as a main parameter. The variable parameters can be used to adjust the node processing capacity and the weight of node packet queue length in the routing policy. And to a certain extent, the efficiency of simulation is improved and the purpose of network optimization is achieved.
© The Authors, published by EDP Sciences, 2018
This is an open access article distributed under the terms of the Creative Commons Attribution License 4.0 (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.