This paper studies routing methods for the complete broadcast multipoint-to-multipoint communication. For a Z-node (Z-site) of the participants of the connection, each site transmits one signal and receives Z-1 signals. The routing method based on connecting each participant by multiple directed point-to-point circuits uses wasteful bandwidth that the source-to-destination data may be duplicated needlessly. We propose routing methods that the connection approach is based on setting multicast tree routes that each participant (site) has one own multicast tree connecting to the other participants under two constraints: the delay-bounded constraint of source-destination path and the available constrained bandwidth for the service of links. For this routing approach, we propose both heuristic algorithm finding approximate solution and search enumeration based algorithm finding optimal solution, and compare the approximate solution with the optimal solution. This approach can lower costs for the subscribers and conserves bandwidth resources for the network providers.