9.4 WFQ

3 connections A, B, C send traffic through a Weighted Fair Queueing scheduler, with each connection having equal weight. The scheduler emits information at 1Mb/s. The scheduler receives packets (A,#1,0,1) (B, #1, 0, 1) (C, #1, 1, 2) (A, #2, 1, 2) (B, #2, 2, 1) where each packet is defined by 4 values (connection, sequence number of the packet on that connection, time of arrival in seconds, size of packet in Mb). Assuming that each connection has equal weight, and the round number is 0 at time 0, then determine the finish number for each packet and when each packet would finish being emitted out of the scheduler. If packets have equal finish numbers, then break ties by emitting the tied packets in alphabetical order of their connection identifiers.
    This is a required question
    This is a required question
    This is a required question
    This is a required question
    This is a required question
    This is a required question
    This is a required question
    This is a required question
    This is a required question
    This is a required question