par Röder, Martin;Cardinal, Jean ;Hamzaoui, Raouf
Référence Proceedings of the ... IEEE International Conference on Acoustics, Speech and Signal Processing, 5, page (V373-V376), 1661290
Publication Publié, 2006
Article révisé par les pairs
Résumé : Finding adequate packet transmission strategies for media streaming systems is a challenging algorithmic task. Recently, we proposed an efficient dynamic programming algorithm for streams in which the dependencies between packets, such as those prescribed between video frames by video codecs, can be modeled with a tree. In this contribution, we propose a heuristic algorithm for arbitrary dependency graphs. This algorithm consists of first transforming the dependency graph into a tree by adding dependencies, and then applying the dynamic programming algorithm on the tree thus obtained. The algorithm is both simple and efficient, as shown by experimental results on video sequences. © 2006 IEEE.