Optimization Of Linear Network Coding Problems Based On General Network

In the information society,the rapid development of computer networks and people’s extensive demand for information exchange,the requirements of network transmission are also getting higher and higher.In the traditional information and communication transmission network,routing operation means the intermediate node only copying and then forwarding information for the transmission of data information.It is not satisfactory that only the routing operation is difficult to ensure the maximum network throughput which is defined by the maximum flow and the minimum cut theorem.With the gradual application of the proposed network coding,the transmission efficiency in the network is greatly improved.The network can achieve the required rate and the network load can be balanced at the same time.But the resource consumption problem follows for the network.For example,the increase of network coding operations increases the computational complexity and information caching of intermediate nodes in the network.While achieving the required throughput,the study on the optimization of network coding has a very important significance.In order to make the network coding more practical,this paper tries to make new research direction on the existing research issues and expands on a single source network and multi-sources network.Due to the complexity of multi-sources network,the problem of network coding is still in its infancy.This paper only optimizes the selection of new problems on simple multi-sources network.In order to solve the problem of network coding optimization,this paper provides a heuristic method to get the best result and the optimal path in the link selection problem.The innovation of this paper is to consider both the encoding and non-encoding resource consumption.The only objective function is defined by the total value of the link cost and encoding cost,and at the same time the relationship between the two costs can be distinguished in the objective function.The cost of coding link is "α"times the cost of link which is only transmitting information.The value of a determines the importance of the encoding link.When the value of a is very large,it means that more resources are consumed by the encoding link.The objective function obtained in this paper is based on an improved ant colony algorithm.The algorithm adds two mechanisms of multi-dimensional pheromone maintenance and tabu list method based on path construction,and then speed up the search for the result of minimizing the objective function.For the single source multicast,the result obtained is the same as the previous link optimization problem.For multi-sources(multiple sources)situations,different sink nodes receive the messages only from the required source nodes and the obtained routes are also more ideal in simulation results.