提出了一种时延约束的最小代价组播源路由免疫算法.该算法的主要思想是:利用自然免疫系统中抗体和抗原的交互关系来模拟Q oS组播路由中可行解(满足Q oS约束的解)和不可行解(不满足Q oS约束的解)之间协同演化过程,避免了传统的处理约束的方法罚函数方法的局限性.算法的实现借鉴了前人提出的高效的克隆选择算子,可有效地提高算法的搜索性能.仿真实验证明:算法性能要好于被测试的著名路由算法. This paper proposes a delay-constrained minimum-cost multicast source routing immune algorithm.The main idea of ​​this algorithm is to use the interaction between antibodies and antigens in the natural immune system to simulate a feasible solution in Q oS multicast routing that satisfies the Q oS constraint And the unfeasible solution (the solution that does not satisfy the Q oS constraint), which avoids the limitation of the traditional penalty function method of processing constrained methods.The algorithm is based on the efficient clone selection proposed by our predecessors Operator can effectively improve the search performance of the algorithm.The simulation results show that the performance of the algorithm is better than the well-known routing algorithm under test.