A path planning method, comprising: acquiring data flow information of a job to be transmitted in a software-defined network SDN, wherein the job to be transmitted comprises at least one target data flow, and the data flow information of the job to be transmitted comprises a source address, a destination address, and a volume of each target data flow; and performing overall path planning on the job to be transmitted according to the source address, the destination address, and the volume of each target data flow in the data flow information of the job to be transmitted, wherein the overall path planning comprises simultaneously planning a transmission path corresponding to each target data flow comprised in the job to be transmitted; and obtaining a job transmission path over which the job to be transmitted is transmitted in the software-defined network in a shortest job transmission time, wherein the job transmission time is a time needed to complete transmission of the job to be transmitted in the software-defined network, and the job transmission path comprises the transmission path corresponding to each target data flow in the job to be transmitted; wherein the step of acquiring data flow information of the job to be transmitted in a software-defined network comprises: for each target data flow to be transmitted in the software-defined network, acquiring data flow information of the target data flow, and employing a clustering algorithm to obtain a job from a job set used to represent all jobs to be transmitted corresponding to the target data flow, according to the data flow information. acquiring data flow information of a job to be transmitted in a software-defined network SDN, wherein the job to be transmitted comprises at least one target data flow, and the data flow information of the job to be transmitted comprises a source address, a destination address, and a volume of each target data flow; and performing overall path planning on the job to be transmitted according to the source address, the destination address, and the volume of each target data flow in the data flow information of the job to be transmitted, wherein the overall path planning comprises simultaneously planning a transmission path corresponding to each target data flow comprised in the job to be transmitted; and obtaining a job transmission path over which the job to be transmitted is transmitted in the software-defined network in a shortest job transmission time, wherein the job transmission time is a time needed to complete transmission of the job to be transmitted in the software-defined network, and the job transmission path comprises the transmission path corresponding to each target data flow in the job to be transmitted; wherein the step of acquiring data flow information of the job to be transmitted in a software-defined network comprises: for each target data flow to be transmitted in the software-defined network, acquiring data flow information of the target data flow, and employing a clustering algorithm to obtain a job from a job set used to represent all jobs to be transmitted corresponding to the target data flow, according to the data flow information.