A New Algorithm for Minimum Delay Overlay Multicast Tree
Jiang Ai-quan · 2005
This paper studies the problem of degree constrained minimum radius (DCMR) spanning tree in overlay multicast routing. A newheuristic greedy routing algorithm called degree-delay compact tree (DDCT), which is based on both degree constraints-delay integration andapplication layer topology optimum strategies, is proposed. The simulation results show that, comparing with similar algorithm having the samecomputing time complexity, the DDCT algorithm presents better performance all in radius, cost and link’s reduplicate packages of the overlaymulticast tree.