The degree-constrained multicasting algorithm using ant algorithm

We deal with obtaining multicast trees in packet-switched networks, such as ATM networks, when there exist constraints on the packet replication capabilities of the individual switching nodes. This problem can be formulated as the Steiner tree problem with degree constraints on the nodes, so we call it the degree constrained Steiner tree (DCST) problem. An ant heuristic algorithm is proposed to solve this DCST problem. We compare our algorithm with the previous ones experimentally. The results show that the proposed approach can find an optimal solution satisfying the degree constraints.