针对多域光网络环境下传统的多点对多点(MP2MP)组播路由和波长分配(RWA)算法未考虑最优化组播域序列选择的问题，以及所导致的网络资源占用量过高和难以满足实时业务服务质量(QoS)要求的问题，提出了一种面向多域光网络、计算可并行化、基于时延和最小代价约束的多核点共享树RWA 启发式算法(MSTDC)。该算法通过构造虚拓扑的方式将多域的问题转化到单域中求解，从而实现了多核点共享树最小化核心点的个数及其所在域的准确计算。在多域间并行地将源和目的节点按照特定的QoS选择策略和算法加入到不同的共享树中。仿真验证了在网络节点数为50个且均匀地分布在9个域内的多域光网络环境下，MSTDC 算法与传统组播树算法相比波长资源占用率降低可达51.1%，路由成功率提高可达24.8%，算法执行时间降低可达64.6%。

In order to solve the problems of the optimal domains sequence choice without considering, overhigh resources occupied ratio and the unappeasable requirements of real- time quality of service (QoS), which cannot be settled by the conventional multipoint to multipoint (MP2MP) routing and wavelength assignment (RWA) algorithms in multi- domain optical networks, a kind of multi- core node shared tree RWA heuristic algorithm (MSTDC) is proposed. The calculation can be parallelized. The delay and minimal cost can be constrained for multi- domain optical networks. The multi- domain problem is transformed into single domain by the algorithm from constructing a virtual topology. So it can realize the accurate calculation of number and the hosted domains of the mininlized cores. The source and destination nodes are added in different shared trees with delay constrained algorithms according to specific QoS selection strategy， respectively. The performance of the algorithm is demonstrated in a multi- domain optical networks topology with fifty routing nodes uniformly distributed in nine domains, and the simulation results show that the wavelength occupied ratio descends 51.1%, the success ratio of the route ascends 24.8% and running time of the algorithm descends 64.6%.