In order to ease the problem of business processing speed of large Internet nodes, the business processing logic and architecture of the current mainstream Clos [1] structure of the Internet are first described, and then the business path is modeled to establish a matrix model. The existing ring algorithm is improved by using the bipartite graph coloring principle, the Bidirectional exchange scheduling algorithm and the same exchange scheduling algorithms are designed to search businesses from the rows and columns of the matrix, so as to quickly achieve business load balancing. Finally, the algorithm was loaded onto FPGA to demonstrate the effectiveness of both algorithms in improving business processing speed.