CS4251 Computer Networks II

    HW 3 --- Due Abril 24, In Class


   
 

From the Text Chapter 7 Problems do:

2, 3, 46


Problem A:

WF2Q is a scheduling algorithm that, similar to WFQ tries to
approximate Fluid Fair Queuing. WFQ uses the finish times (or rounds)
in a FFQ system to schedule the packets for service. WF2Q uses
both the start and finish times. In particular in WFQ
the packet with smallest finish round from among all packets currently
in the queue is chosen for service. In WF2Q,
the server only considers the set of packets that have actually started
receiving service in the corresponding FFQ system at time t. The packet
with the samllest finish time from among those packets is chosen.


Show the order of service of packets in WFQ and WF2Q for the following
scenario:

11 connections,

Connection 1 gets 0.5 of the bandwidth while Connections 2-11 each
get 0.05 of the bandwidth.

Connection 1 packets arrive at times 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10

For each of Connections 2-11, one packet arrives at time 0

All packets are of the same length.