Abstract: Dynamic multicast routing with delay-bandwidth constraints based on popular hierarchical network model PNNI (DB-PHMR) is proposed. Three steps are designed in the join process across domains: routing across domains, routing in middle domains and routing in destination domain. Loop-free nature of the result tree is proved. DB-PHMR can also combine various topology aggregation methods. Simulation results showed that the system achieves large information compression while maintaining an approximate routing efficiency compared with the flat network routing. The scalability of multicast routing in large networks is realized.