A Minimum Cost Application-Level Multicast Tree for Concerning Delay and Loss Rate
Nan Hongzhen · Xi'an Jiaotong Daxue xuebao · 2011
It is not efficient for the approach of constraining outdegree to enhance delay and loss rate synthetically for an application-level multicast tree.This paper proposes an application-level multicast tree which achieves minimum cost in terms of delay and loss rate.A cost function which consists of delay and loss rate is given to compute transmission cost of the multicast tree,and the problem model about how to construct the minimum multiplex-cost multicast tree is also given.Unlike existing problem models,this model abandons the approach of constraining outdegree.Furthermore,a variation of the maximal delay path greed algorithm is proposed to address the problem model.This variation algorithm optimizes total cost of a multicast tree.Finally,our extensive experimental results help to give the concrete suggestion about the parameters which the cost function involves,and demonstrate that the proposed application-level multicast tree construction algorithm has higher efficiency in total cost of the multicast tree than another related algorithm has.