Abstract
This paper investigates the maximal achievable multi-rate throughput problem of a layered multicast session at the presence of network coding. Firstly formulated is the maximal achievable throughput problem with the assumption that the data layers are independent and layer rates are static. It is proved that the problem in this case is NP-hard. Meanwhile an upper bound of maximal achievable multi-rate throughput is presented.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
