Concurrent multicast in weighted networks

AbstractConcurrent multicast is the problem of information dissemination from a set of source nodes to a set of destination nodes in a network with cost function: Each source node s needs to multicast a block of data B(s) to the set of destinations. We are interested in protocols for this problem which have minimum communication cost. We consider both the usual case in which any transmitted message can consist of an arbitrary number of data blocks and the case in which each message must consist of exactly one block of data. The problem of determining the minimum cost to perform concurrent multicast from a given set of sources to a set of destinations is NP-hard under both assumptions. We give approximation algorithms to efficiently perform concurrent multicast in arbitrary networks. We also analyze the communication time and communication complexity, i.e., the product of the communication cost and time, of our algorithms

Concurrent Multicast in Weighted Networks

Concurrent multicast is the problem of information dissemination from a set of source nodes to a set of destination nodes in a network with cost function: Each source node s needs to multicast a block of data B(s) to the set of destinations. We are interested in protocols for this problem which have minimum communication cost. We consider both the usual case in which any transmitted message can consist of an arbitrary number of data blocks and the case in which each message must consist of exactly one block of data. The problem of determining the minimum cost to perform concurrent multicast from a given set of sources to a set of destinations is NP-hard under both assumptions. We give approximation algorithms to efficiently perform concurrent multicast in arbitrary networks. We also analyze the communication time and communication complexity, i.e., the product of the communication cost and time, of our algorithms. A preliminary version of an extended abstract of this paper was presen..