Multicasting is an information dissemination problem which consists, for a processor of a distributed memory parallel computer, in sending the same message to a subset of processors. In this paper, we propose new multicasting algorithms for the mesh using wormhole routing with the path-based facility. These new algorithms perform generally faster than algorithms previously described in the literature under the same model. We take, as criteria to compare algorithms, the off-line computation time necessary to prepare the multicast, and the communication time to complete the multicast. Moreover, since it is often not possible to derive useful expression for the communication time, we also simulate the algorithms to derive their behavior experimentally.