000087279 001__ 87279
000087279 005__ 20190316233751.0
000087279 037__ $$aARTICLE
000087279 245__ $$aThe virtue of patience in low complexity scheduling of packetized media with feedback
000087279 269__ $$a2007
000087279 260__ $$c2007
000087279 336__ $$aJournal Articles
000087279 520__ $$aWe consider streaming of pre-encoded and packetized media over best-effort networks in presence of acknowledgment feedbacks. We first review the rate-distortion optimization framework in such scenarios. Given an estimation of future transmission resources, and knowing about past transmissions and received acknowledgments, a scheduling algorithm is defined as a mechanism that selects the data to send over the network at any given time, so as to minimize the end-to-end distortion for the given communication resources. Since the computational complexity induced by optimal solution is unacceptable for practical scenarios, we propose to limit the solution search space in using a greedy scheduling strategy. However, our work highlights the rate-distortion sub-optimality of popular greedy schedulers, which are strongly penalized by anticipated retransmissions. We therefore proposes an original scheduling algorithm that avoids premature retransmissions, while preserving the low computational complexity of the greedy paradigm. Such a scheduling strategy allows to adapt to network QoS fluctuations, with close to optimal rate-distortion performance. Our experimental results demonstrate that the proposed patient greedy (PG) scheduler provides a reduction of up to $50
000087279 6531_ $$aLTS4
000087279 700__ $$aDe Vleeschouwer, C.
000087279 700__ $$aChakareski, J.
000087279 700__ $$g101475$$aFrossard, P.$$0241061
000087279 773__ $$j9$$tIEEE Transactions on Multimedia$$k2$$q348-365
000087279 8564_ $$uhttps://infoscience.epfl.ch/record/87279/files/tmm07.pdf$$zn/a$$s925560
000087279 909C0 $$xU10851$$0252393$$pLTS4
000087279 909CO $$qGLOBAL_SET$$pSTI$$ooai:infoscience.tind.io:87279$$particle
000087279 937__ $$aEPFL-ARTICLE-87279
000087279 970__ $$aDeVleeschouwer2005_1325/LTS
000087279 973__ $$rREVIEWED$$sPUBLISHED$$aEPFL
000087279 980__ $$aARTICLE