A Center Selection Algorithm with Delay Constrained and Delay-Variation Minimized

Center-based trees are one kind of group-shared trees. Packets are distributed over center-based trees from all sources to all multicast destinations. Because of its simplicity, the idea of center-based trees is used in multicast protocols such as CBT (Core-Based Tree) and PIM (Protocol Independent Multicast). There are two main problems in center-based trees. One is the core selection problem. The other is the routing problem. Since many applications require that the delay and delay-variation are constrained, the delay and delay-variation constrained center-based tree problem is proposed. It is proved that this problem is a NP-complete problem. And a new center selection algorithm DVCT (Delay Variation based Centered Tree) which try to minimized the delay variation with constrained delay. The simulation results show that this algorithm is a delay constrained algorithm with low delay variation and time complexity.