Given n packets, each packet has b(i) bits and takes t(i) seconds to stream. We cannot send 2 packets at the same time. Given r > 0 and for each t > 0, the total number of bits we send from second 0 to t must be <= r*t (bandwith limit).
Given n = 3, (b1,t1)=(2000,1), (b2, t2)=(6000,2), (b3,t3)=(2000,1) and r = 5000
The sequence 1,2,3 is valid.
There is any algorithm for checking if given n, r and the n packets, it exists a valid sequence in O(n) ??