This paper presents a multicast algorithm, called MSM-s, for point-to-multipoint transmissions. The algorithm, which has complexity O(n2) in respect of the number n of nodes, is easy to implement and can actually be applied in other point-to-multipoint systems such as distributed computing. We analyze the algorithm and we provide some upper and lower bounds for the multicast time delay.