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... View More