A load-balancing routing mechanism based on BFP-Tree approach is proposed in this paper
which first counts up the use frequency of all the nodes
then chooses the most often used path and performs routing selection for the traffic request according to the principle that the statistical variance of the number of the used wavelengths for each link in the network is the minimum.Simulation results show that this mechanism is superior to the BFP-Tree routing mechanism in both blocking probability and transmission delay.