This paper introduces the concept of main tree based on shortest path algorithm, and by applying the concept of the multicast tree cost and delay-limiting, it maces a presentation of the distributed heuristic routing algorithm which can optimize the cost of multicast tree under the condition of delay-limiting. Finally, it states the validity of the method in this text.