Adjacency List Based Multicast QoS Routing Problem Optimization with Advanced Immune Algorithm

QoS problem of multicast with uncertain parameters constrained is a challenging problem for the prevalent multimedia communications in Internet. In this paper the advanced bionic immune algorithm is used to solve the problem. Every node's priority based adjacency list is designed which guarantees the higher performance path has greater probability to be chosen. Immune algorithm's personal characteristic such as antibody and antigen considered it has ability to seek some information features or knowledge to optimize the process and restrain the compute evolutionary degradation. The solutions' fitness is obtained by the concentration mechanism and affinity function of immune algorithm. The immune operator and immune adjust strategy is helpful to the solution evolutionary process. With test on simulation multiple constraints QoS routing problem the advanced algorithm is proved to have high performance and efficiency.