An Algorithm Based on Directed Graph

摘要: Aiming at constructing a delay and variation bounded Steiner tree in the real-time streaming media communication, we discuss this paper multicast routing algorithm based on searching directed graph (MRASDH).In construction of tree, there always exist some nodes links network topology that do not affect outcome constructed. Therefore, principle to shrink search space by deleting these nonrelative edges utmost, utilizing ant algorithm, generates for each destination node sub-graph topology, which owns out-degree, then merges all sub-graphs into new graph, serves as space. After these, applies simulated annealing optimization, can finally obtain satisfying constraints. The performance analysis simulation results have demonstrated effectively construct with constraints while presenting lower time complexity than current ones, means much better result would be achieved when system scale rises greatly.