Multicasting in Heterogeneous Networks

In heterogeneousnetworks sending messagesmay incur different delayson different edges,and eachprocessormay havea different switching timebetweenmessages.Thewell studiedTelephonemodelis obtainedwhenall edgedelaysandswitching times areequalto oneunit. We investigatethe problem of finding the minimum time required to multicast a messagefrom one sourceto a subsetof the processorsof size k. The problem is NP-hardevenin the basic Telephonemodel.Wepresentapolynomial timealgorithmthatapproximatestheminimummulticasttimewithin afactorof O(log k). Ouralgorithmimprovesonthebestknownapproximationfactorfor theTelephonemodelby afactorof 0 (e). No approximation algorithmswere known for the generalmodel consideredin this paper.

• Type: Conference
• Year: 1998
• Where: STOC
• Authors: Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber
• Keywords: Algorithms, And, Heterogeneousnetworks Sending Messagesmay, Processorsof Size K, STOC 1998