With the rapid growth of the scale of the data center networks, the low network bandwidth utilization has posed a problem due to network congestion. How to improve data center network link bandwidth utilization and throughput by load balancing has become a research focus. How to reasonably schedule flow by making use of traffic characteristics, link state and application requirements is the key to realize the network link load balancing. Aiming at scheduling problem of elephant flow that bursts and highly occupies bandwidth in the data center, this paper proposes a maximum probability path scheduling algorithm (MPP_SA) for SDN data center network. The algorithm firstly computes all paths that can meet the scheduled flow's demand, and then calculates bandwidth ration between flow bandwidth and minimum link bandwidth combining with all the bandwidth ratio to compute path probability for each path. Finally, the path of largest path probability will be likely selected. The algorithm does not only consider flow's bandwidth and usage of link bandwidth, but also the global flow scheduling and bandwidth fragmentation. The experimental results show that the MPP_SA algorithm can effectively alleviate network congestion, improve the bandwidth utilization and throughput, and reduce network delay, so as to improve the overall network performance and quality of service.