Low-Cost Routing for Manycast communication
Xuegong Tan · 2013
Manycast is a group communication paradigm in which one client communicates simultaneously with some thresholdnumber of servers from the pre-specified group members. In this paper, we revisit the basic problem of many manycast issues:how to find the spanning tree such that the cost is as small as possible? For this NP-complete problem, we present an efficient and simple heuristics algorithm, based-frequency manycast routing (BFM). In BFM, node's frequency is used as the keyparameter to choose manycast destination nodes. The performance of our algorithm is analyzed through extensive simulation and compared with several other heuristics algorithms. For a manycast request, the simulation result shows BFM builds many cast trees with the least cost than other algorithms.