Name
Abstract | ||
|---|---|---|
We consider the problem of rate-distortion optimized streaming of packetized multimedia data over a single quality-of-service network using feedback and retransmissions. For a single data unit, we prove that the problem is NP-hard and provide efficient branch and bound algorithms that are much faster than the previously best solution based on dynamic programming. For a group of interdependent data units, we show how to compute optimal solutions with branch and bound algorithms. The branch and bound algorithms for a group of data units are much slower than the current state of the art, a heuristic technique known as sensitivity adaptation. However, in many real-world situations, they provide a significantly better rate-distortion performance. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/TMM.2005.861281 | IEEE Transactions on Multimedia |
Keywords | Field | DocType |
— streaming media,single data unit,best solution,rate-distortion performance,efficient branch,rate-distortion optimized media,branch and bound algorithms.,packetized multimedia data,single quality-of-service network,data unit,interdependent data unit,computational com- plexity,bound algorithm,current state,quality of service,rate distortion optimization,branch and bound algorithm,computational complexity,branch and bound | Dynamic programming,Mathematical optimization,Heuristic,Branch and bound,Service quality,Computer science,Quality of service,Algorithm,Rate–distortion theory,Computational complexity theory,Data flow diagram | Journal |
Volume | Issue | ISSN |
8 | 1 | 1520-9210 |
Citations | PageRank | References |
10 | 0.65 | 9 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roder, M. | 1 | 10 | 0.65 |
| Cardinal, J. | 2 | 10 | 0.65 |
| Hamzaoui, R. | 3 | 10 | 0.99 |