A container scheduling strategy based on neighborhood division in micro service

Micro service has achieved good results in recent years due to the advent of docker container technology. Although micro service architecture can solve the shortcomings of the monolithic architecture, yet it brings more complex problems of virtual machine(VM) scheduling. Many related studies are aimed at reducing network traffic consumption or reducing the amount of traffic between VMs. However, the methods proposed by these studies don't work well in the micro service's scenario because of the micro service's design concept and more complex container relationships. In this paper, a container scheduling strategy based on neighborhood division in micro service (CSBND) is proposed. The algorithm takes system load balancing and system response time into account to optimize system performance. Extensive experiments show that our algorithm can effectively reduce the system load imbalance and improve the overall system performance compared with other related algorithms.