摘要
为了解决现有算法无法根据不同节点对网络流量传输具有不同重要性选择流量测量点的问题,提出了一种基于节点加权的网络流量测量点选择算法。该算法首先通过节点关键度对节点进行权重分配,之后使用节点加权的关联矩阵近似算法计算初始解,最后通过对基本蚁群算法中的信息素初始化以及期望启发信息值计算进行改进形成基于节点加权的蚁群算法,并以此计算问题最终解。实验结果表明,基于节点加权的网络流量测量点选择算法能够在保证链路覆盖率的前提下,优先选择关键度更高的节点。
In order to solve the problem that the existing algorithms cannot select the traffic measurement nodes according to the importance of different nodes to the network traffic transmission,this paper proposes a network traffic measurement nodes selection algorithm based on weighted nodes.It firstly assigns weight to nodes by node criticality,then uses correlation matrix approximation algorithm based on weighted nodes to calculate the initial solution,and finally,the algorithm is improved by pheromone initialization and expected heuristic information value calculation in the basic ant colony algorithm,forming the ant colony algorithm based on weighted nodes to calculate final solution of the problem.The experimental results show that the network traffic measurement nodes selection algorithm based on weighted nodes can prioritize the nodes with higher criticality on the premise of ensuring the link coverage.
作者
翟羽娟
罗浩
吴志刚
张树壮
ZHAI Yujuan;LUO Hao;WU Zhigang;ZHANG Shuzhuang(Institute of Network technology,Beijing University of Posts and Telecommunications,Beijing 100876,China)
出处
《应用科技》
CAS
2019年第3期86-92,共7页
Applied Science and Technology
基金
国家重点研发计划项目(2016YFB0801200)
关键词
网络测量
测量点
网络流量
蚁群算法
关键度
节点加权
近似算法
网络和信息安全
network measurement
measurement nodes
network traffic
ant colony algorithm
criticality
weighted nodes
approximation algorithm
network and information security