Request Scheduling Algorithm Speaker: Yongming Chen Jan. 04, 2007

Scenario bandwidth number of replication chunk allocation pattern goal stable unstable number of replication 1 (minimum requirement) n (number of sources) k ( 1 < k < n) chunk allocation pattern random continuous interleaved goal minimize buffering delay meet play deadline

Scenario bandwidth number of replication chunk allocation pattern goal stable unstable number of replication 1 (minimum requirement) n (number of sources) k ( 1 < k < n) chunk allocation pattern random continuous interleaved goal minimize buffering delay meet play deadline

State of the art scenario 1 scenario n no choice D. Xu, M. Hefeeda, S. Hambrusch, B. Bhargava. On peer-to-peer media streaming. Distributed Computing Systems, 2002. minimize arriving time of each chunk OTSp2p :

Scenario k random allocation known allocation foreach chunk c: foreach source s: if s has c: calculate arriving time t of c request c from s with minimum t known allocation if we know the pattern among sources…

Scenario 3 1 2 3 4 5 6 7 8 S1 1 2 3 4 5 6 7 8 S1 1 5 S2 1 2 3 4 5 6 7 8 S2 3 6 S3 1 2 3 4 5 6 7 8 S3 2 8 S4 1 2 3 4 5 6 7 8 S4 4 7

Scenario 3 if S4 becomes slower… group S4 with S1 1 2 3 4 5 6 7 8 opt.