Abstract
Given a source node and a set of destination nodes in a communication system in which there is associated with each channel a channel capacity and a channel reliability, an efficient algorithm is developed for computing a multicast tree which maximizes the capacity with reliability not less than a given threshold. The maximum capacity R-reliable path problem to the maximum capacity R-reliable multicast tree problem is generalized.
Original language | English (US) |
---|---|
Pages (from-to) | 662-663 |
Number of pages | 2 |
Journal | IEEE Transactions on Communications |
Volume | 47 |
Issue number | 5 |
DOIs | |
State | Published - 1999 |
Externally published | Yes |
ASJC Scopus subject areas
- Electrical and Electronic Engineering