论文部分内容阅读
Differing from the source oriented algorithms, the Core Based Tree (CBT) multicast routing architecture establishes a single shared tree for multiple connections on a multicast group, which results in higher ratio of network resources utilization. In alluding to the problem of Core Placement, we propose a simple method (QOCP) to locate an optimal core node, which can minimize the multicast delay and inter destination delay variation simultaneously. The simulation results show that our method is very effective, and outperforms the other algorithms studied in this paper.
Differing from the source oriented algorithms, the Core Based Tree (CBT) multicast routing architecture establishment a single shared tree for multiple connections on a multicast group, which results in higher ratio of network resources utilization. In alluding to the problem of Core Placement, we propose a simple method (QOCP) to locate an optimal core node, which can minimize the multicast delay and inter destination delay variation simultaneously. The simulation results show that our method is very effective, and outperforms the other algorithms studied in this paper.