A simple and effective core placement method for the core based tree multicast routing architecture

Abstract

The Core Base Tree (CBT) multicast routing architecture is a multicast routing protocol for the Internet. The CBT establishes a single shared tree for a multicast connection. The shared tree is rooted at a center node called core. The location of the core may affect the cost and performance of the CBT The core placement method proposed in Lin and Lai (1998) requires the knowledge of the network topology. In this paper we propose a simple and effective method for selecting the core. This method requires only the distance vector information. The performance of this method is compared with several other methods including the one proposed in Lin and Lai (1998) by extensive simulations. Our results show that this simple core placement method for the CBT is very effective. It produces the lowest mean delay, maximum delay, and total cost among the methods studied in this paper.