Multicasting is an information dissemination problem which consists, for a processor of a distributed memory parallel computer, to send a same message to a subset of processors. In this study, we propose two new multicast algorithms for a mesh network using wormhole routing with the path-based facility. The main feature of the proposed algorithms is its ability to handle multicast operations with a fixed number of message-passing steps irrespective of the network size. Results from extensive comparative analysis reveal that our algorithms exhibit superior performance characteristics over the well-known GTDMPM algorithm.