Abstract
This paper considers the problem of disseminating messages from a source to multiple destinations in an overlay network in which nodal delays for processing messages are taken into account in addition to communication delays. The objective is to find a multicast tree to deliver a message from a source to multiple destinations in the minimum delay time. This problem is referred to as the minimum-delay multicast problem with nodal processing delays.