(A) multicast tree to minimize maximum delay in dynamic overlay network

Abstract

Overlay multicast is an emerging technology for next generation Internet service to various groups of multicast members. It will take the place of traditional IP multicast which is not widely deployed due to the complex nature of its technology. The overlay multicast which effectively reduces processing at IP routers can be easily deployed on top of a densely connected IP network. An end-to-end delay problem is considered which is serious in the multicast service when members frequently join and leave their service group. To periodically optimize the route in the overlay network and to minimize the maximum end-to-end delay, overlay multicast tree is investigated with degree bound at each member node. The problem is formulated as a degree-bounded minimum spanning tree, which is known to be NP-hard. A tabu search heuristic is developed based on reconnection and swap moves. Frequency based diversification strategy is also adopted to improve solutions by intensification. Outstanding experimental results are obtained which is comparable to the optimal solution and applicable in real time.