We consider streaming of pre-encoded and packetized media over best-effort networks in presence of acknowledgment feedback. 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. Our work first reveals the sub-optimality of popular greedy schedulers, which might be strongly penalized by anticipated retransmissions. It then proposes an original scheduling algorithm that avoids premature retransmissions, while preserving the simplicity of the greedy paradigm. The proposed patient greedy (PG) scheduler appears to save up to 50% of rate in comparison with the conventional greedy approach.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    The virtue of patience when scheduling media in presence of feedback


    Contributors:


    Publication date :

    2005-01-01


    Size :

    246710 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    The Virtue of Patience when Scheduling Media in Presence of Feedback

    De Vleeschouwer, C. / Frossard, P. | British Library Conference Proceedings | 2005



    PATIENCE

    Callender, Geoffrey | Taylor & Francis Verlag | 1914


    PATIENCE

    Carr Laughton, L. G. | Taylor & Francis Verlag | 1914


    Counseling patience

    Warner, Debra | Online Contents | 2017