基于布尔函数的网络可达性验证方法

Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2022-05-10 Cooperative journals: 《计算机应用研究》

张立群 林海涛 沈钊

Abstract： Aiming at the data plane configuration problem caused by overlapping forwarding paths of different applications in SDN network, this paper proposes a Boolean function-based network reachability verification method. First, it abstracts the network topology into port topology and calculates the port adjacency matrix; then generates the path space of the network and the forwarding function of each port, and calculates the path function of each path; finally, it judges the accessibility of path from the satisfiability of path function. Through simulation experiments, this paper studies the influence of factors such as network topology and flow rule scale on the algorithm verification efficiency, and the performance of the proposed method is compared with APV and DASDA. Experimental results show that the proposed method can effectively detect flow rule configuration problems in SDN networks. As the number of loops in the network increases and the size of the flow rules grows, the time overhead required to verify the network gradually increases. Among them, the network topology has a great influence on the path generation time, and the generation time of the forwarding function is mainly affected by the scale of the flow rule. Compared with APV and DASDA, the time to verify is shortened by an average of about 53.76% and 27.74%, respectively.

YES

 Hits 1067  Downloads 477  Comment 0