Multicast ω-Trees Based on Statistical Analysis

Lecture Notes in Computer Science, vol. 3982, pp. 1090-1099, May 2006

Moonseong Kim, Young-Cheol Bang, and Hyunseung Choo

Abstract

In this paper, we study the efficient multicast routing tree problem with QoS requirements. The new multicast weight parameter is proposed by efficiently combining two independent measures, the link cost and delay. The weight ω ∈[0,1] plays an important role in combining the two measures. If the ω approaches to 0, then the tree delay is decreasing. On the contrary if it closes to 1, the tree cost is decreasing. Therefore, if the ω is decided, then the efficient multicast tree can be found. A case study shows various multicast trees for each ω. When network users have various QoS requirements, the proposed multicast weight parameter is very informative for them.

Keyword

 

 

View Full Text