| Network coding theory was put forward by R.Ahlswede et al in2000. It is different with the store-and-forward information transmission way of traditional multicast routing, it allows network intermediate nodes to participate in coding and decoding, thereby breaking the link bottleneck and achieving the multicast network transmission capacity that decided by max-flow min-cut theorem. Network coding can also efficiently reduce the link resource consumption, improve the link load balance and network robustness. Since network coding has so many characteristics, it becomes the research hot spot in the information transmission field.With the repid development of communication technology, the life of people is becoming more and more information. Many businesses can be easily finished on the Internet. A variety of network applications also affect people’s life. How to effectively and make full use of the limited network resource has been an important research direction in the communication field. Due to traditional multicast communication’s limitation in the transmission capacity, makes the research on the theory and application of network coding have become very important. While data distribution strategy based on network coding is usually divided into two parts. The first is to establish effective routing mechanism, namely, find out the code path group between source node and sink node. The second is to construct coding scheme. By now, the algorithms to construct network coding have been studied extensively, and have achieved significant results, such as exponential time algorithm, linear information flow algorithm and random network coding algorithm, and so on. The random network coding algorithm has been most widely used for simple thought and easily implementation in the actual network. At present, the multicast routing algorithm based network coding still has unified standard, but it is the key of realizing the network coding technology to practical application, so how to study and design efficient network coding routing algorithm has the important meaning.The proposed of network coding is initially to increase the maximum transmission capacity. With the continuous deepening research, it gradually divided into multiple field directions. At present, the widely research directions are secure network coding technology, wireless network coding technology and network coding routing technology and so on. With the continuous development of network coding technology, it has also been applied to many fields, such as mobile communication, quantum communication, distributed storage and so on.Based on deeply research traditional multicast communication technology and network coding theory. This thesis aims to the shortage in performance of resource consumption and load balance of traditional multicast routing, based on the existing algorithms, puts forward two kinds of network coding based multicast routing algorithms. The work that this thesis completed mainly include following aspects:1) Systematic concludes the research development of network coding theory, and the principle of network coding multicast routing algorithms is deeply researched.2) Deeply analyzes the advantages and disadvantages of the existing algorithms proposed in the literature, considering the related factors affecting the link resource consumption, this thesis put forward a kind of shortest path network coding multicast routing algorithm combined with maximum link share ability. Through simulation analysis, it was proved that can further reduce network resource consumption.3) Taking into account the related factors influencing the network link load balance, this thesis put forward the concept of link load factor, the algorithm of network coding multicast routing in a low rate network is improved. By simulation analysis, comparing with traditional multicast routing algorithm and the algorithm of network coding multicast routing in a low rate network, this new algorithm can improve the network load balance significantly. |
PDF Full Text Request