In this paper we consider directed tree networks, for which the reliability of each edge (a real number between 0 and 1) is known. For these networks, we investigate the problem of finding a k-hop multicast strategy of maximum reliability. This problem is equivalent to the k-station placement problem, which was previously solved in polynomial time for trees. We present here O(k·n 2 ) and O(k·n 3 ) dynamic programming algorithms for the problem, which improve upon the previous best known solution, which is O(k·n 2 ·log(n)) and rather complicated to implement. We then extend the algorithms to general directed graphs and also present some new algorithms for this case.
Efficient algorithms for the maximum reliability k-hop multicast strategy in directed trees, as well as exact, exponential algorithms for minimum time multicast in directed graphs have been presented in REF .
Maximum reliability k-hop multicast strategy in tree networks
2008 IEEE International Symposium on Consumer Electronics
2008 IEEE International Symposium on Consumer Electronics
Computer Science