cp5601t6 - same time. (b) Discuss the effect of RED on...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CP5610 tutorial 6 (from textbook chapter 7) 53. Suppose that in a packet-by-packet weighted fair-queueing system, a packet with finish tag F enters service at time t. Is it possible for a packet to arrive at the system after time t and have a finish tag less than F? If yes, give an example. If no, explain why. 56. Queue management with random early detection (RED): (a) Explain why RED helps prevent TCP senders from detecting congestion and slowing down their transmission rates at the
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: same time. (b) Discuss the effect of RED on network throughput. (c) Discuss the implementation complexity of the RED algorithm. (d) Discuss what would happen if instantaneous queue length were used instead of average queue length. 59. Explain the difference between the leaky bucket traffic shaper and the token bucket traffic shaper....
View Full Document

This note was uploaded on 04/07/2010 for the course CP 1500 taught by Professor Cue during the Three '09 term at James Cook.

Ask a homework question - tutors are online