Arrival and Departure at a Queue. Consider a FIFO queue at a router with continuous arrival...

 

Transcribed Image Text:

Arrival and Departure at a Queue. Consider a FIFO queue at a router with continuous arrival and service processes. The arrival process is constrained so that in any interval of duration t, no more than o +pt bits can arrive, where o and p are constants. Any arrival process is acceptable so long as it meets the constraint above. The output link operates at a constant rate of c 2p. (a) What is the maximum average rate at which bits can arrive to the FIFO? (b) What is the maximum occupancy of the FIFO? (C) What is the maximum time that a bit can be queued in the FIFO? Arrival and Departure at a Queue. Consider a FIFO queue at a router with continuous arrival and service processes. The arrival process is constrained so that in any interval of duration t, no more than o +pt bits can arrive, where o and p are constants. Any arrival process is acceptable so long as it meets the constraint above. The output link operates at a constant rate of c 2p. (a) What is the maximum average rate at which bits can arrive to the FIFO? (b) What is the maximum occupancy of the FIFO? (C) What is the maximum time that a bit can be queued in the FIFO?