Abstract
The well-known greedy multicast routing algorithm Mamera, proposed in the literature, computes the set of shortest paths from a source to all destinations, and then reduces this set to an efficient set of multicast routes, without compromising the requested level of QoS. In this paper, we propose a taboo search algorithm, named TabooQMR, that is augmented by some meta-heuristics to improve the multicast sub-graph computed by the greedy algorithm Mamera, leading to a considerable improvement, as demonstrated by the simulation results.