Suppose n video streams need to be sent, one after another, over a communication

Question

Suppose n video streams need to be sent, one after another, over a communication link. Stream i consists of a total of b bits to be sent, at a constant rate, over a period of t seconds. Two streams cannot be sent at the same time; instead, a schedule must be determined, i.e., an order in which to send them. No matter the order, there cannot be any delays between the end of one stream and the start of the next. Assume the schedule starts at time zero (and ends at time no matter the schedule), and that all the values b and t are positive integers. In addition, the link imposes the following constraint, using a fixed parameter r: For each natural number t > 0, the total number of bits sent over the time interval from O to t cannot exceed rt. A schedule is valid if it satisfies the constraint imposed by the link. Given a set of n streams, each specified by its number of bits b and its time duration t, as well as the link parameter r, the problem is to determine whether a valid schedule exists. Example: Suppose there are n = 3 streams with (b1, t1) = (2000, 1), (b2, t2) = (6000, 2), and (b3, t3) = (2000, 1), and the link parameter is r = 5000. Then the schedule that runs the streams in the order 1, 2, 3 is valid because the constraint is satisfied: At t = 1: The whole first stream is sent; 2000

Explanation / Answer

SOLUTION:False. for suppose let us consider if r = 1, and we have two streams
(2, 1) and (1, 1000), then the first stream does not satisfy this condition. But we
can build a valid schedule by ordering the second stream before the first stream.
The given inequality means that that the stream cannot be first.
t1=t2=1 then b1=r+1 and b2=r-1 stream 2 will go first followed by stream 1

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

---