A PATH-DRIVEN MULTICAST ROUTING ALGORITHM FOR COMPUTER COMMUNICATION

摘要

SPT (Shortest Path Tree) is a widely-used multicast tree type, which can minimize the end-to-end delay; but it doesn't optimize the overall tree cost. An algorithm LCSPT (the Low-Cost Shortest Path Tree) is proposed in the paper. By using the LCSPT algorithm, a high-performance SPT can be constructed in multicast communication. The main idea is that a computing node can share links with those path nodes which had belonged to the Shortest Path Tree and by this means the algorithm can minimize the total tree cost. The simulation results show that LCSPT algorithm not only produces a SPT tree correctly but also has the best cost performance among all the SPT algorithms.