The Automatic Self-Allocating System Based On IP

The human society has been entering a network-centered information era, in which users need access faster, more reliable and functional network services. The increasing popularity of the World Wide Web leads to an exponential growth in the Internet usage. More and more network sites have attracted traffic at an unprecedented scale, they often worry about how to scale up their systems over time to meet this increasing demand, and how their systems remain 24x7 available. Future applications will need higher throughput, interaction and security, which requires service platform provide more processing power and higher availability. Therefore, the Internet research community faces a number of challenges at providing a feasible framework and design methodologies for constructing high-performance, highly scalable and highly available network services. The scalable network service addressed in this thesis represents a step towards ameliorating this situation.LVS is a framework to solve the problems all above. We have realized the automatic self-allocating system based on LVS. So it inherited all the traits from LVS. The system contains 3 allocating modes named NAT, DR, TUN and 9 allocating algorithms. There are 8 static algorithms and 1 dynamic algorithm in the paper which we have already gave the process in detail. In order to achieve the best performance, we use the integrated load rule by collecting 5 kinds of data. In the paper, most of problems we met have been analysed and proposed the solutions, especially the ARP problem coped by NDIS. At the end, we created a model to detect the attack of DOS.At last, we concluded that the dynamic algorithm is better than the static algorithm in perfoamce through the test result, because it can allocate the tasks equal to the server's capability. The end of paper is about the further research.