Toward a General Theory of Unicast-Based Multicast Communication

Multicast, also known as one-to-many communication, is the problem of sending a message from a single source node to several destination nodes. In this paper, we study the problem of implementing multicasts via a technique called Unicast-Based Multicast (UBM). In particular, we focus on the problem of nding optimal UBM calling schedules for arbitrary topologies using restricted inclusive routing schemes (a natural class of restricted routing schemes which includes most practically implemented restricted routing schemes) given source limited routing information. Previous work has focused on nding optimal UBM calling schedules for arbitrary topologies using free routing schemes given complete routing information and speciic topologies using speciic restricted routing schemes given complete routing information. We rst show that implementing UBM in arbitrary topologies with restricted routing schemes is fundamentally diierent than implementing UBM in arbitrary topologies with free routing schemes. We then develop the Smart Centroid Algorithm, a polynomial time approximation algorithm which produces UBM calling schedules that are at most four times as long as the optimal UBM calling schedule for arbitrary topologies using restricted inclusive routing schemes given source limited routing information. The question of determining the NP-hardness of producing optimal UBM calling schedules for arbitrary topologies using any restricted routing scheme remains open.