DYNAMIC FIREWALL CONFIGURATION FOR VIRTUAL NETWORKS: A COMPREHENSIVE AUTOMATION FRAMEWORK

In recent years, segment routing has emerged as a revolutionary traffic engineering architecture. Segment routing, however, results in control overheads since more packet headers need to be included. When segment headers get excessively long, the overheads can significantly lower the forwarding efficiency for a big network. We suggest the intelligent routing scheme for traffic engineering (IRTE), which can provide load balancing with minimal control overheads, in order to meet the better of two goals. We first frame the problem as a mapping problem that maps various flows to important diversion sites in order to obtain optimal performance. Second, by reducing the problem to a k-dense subgraph problem, we demonstrate that it is nondeterministic polynomial (NP)-hard. We create improved ant colony optimisation (IACO), a popular ant colony optimisation technique for network optimisation problems, to address this issue. We also develop and examine the theoretical performance of the load balancing algorithm with diversion routing (LBA-DR). Ultimately, we test the IRTE in various real-world topologies, and the findings demonstrate that the IRTE works better than previous algorithms. For example, while testing on Bell Canada topology, the maximum bandwidth is 24.6% less than that of traditional algorithms.