Imagine you are at a party and you want to share your toys with your friends. You have a toy basket that you want to send to all your friends who are standing far away from you. You can either send the basket one by one to your friends, or you can send the basket to everyone at the same time.
Nack-oriented reliable multicast is like sending the toy basket to everyone at the same time, but making sure that everyone gets the basket without dropping any toys. The word "nack" stands for negative acknowledgement. It means that if one of your friends does not get the toy basket, they will wave their hand and let you know that they did not receive it.
Now imagine that you are sending the toy basket via a magic machine. This machine checks if everyone has received the basket by asking them. If someone did not get the basket, the machine will send the basket again to only the person who did not receive it. This way, everyone now has the basket without you having to send it to each friend one by one.
In the digital world, nack-oriented reliable multicast is like the magic machine that sends information or data to multiple receivers at the same time, while making sure that everyone gets the data without dropping any pieces. If some data is lost along the way, receivers will send a wave to the sender to let them know, and the machine will send that piece of data again. This saves time and is more efficient than sending data one by one.