Consider the scheduling of packets arriving to 2 different connections. They are to be transmitted on a link of 100 Mbps. Each packet is 1000 bits in length. The 2 connections have weights of WA = 1 and WB = 4. Five packets arrive as follows: Packet 1 2 3 Connection A A 4 5 Connection A B B A B Using a weighted fair queuing approach, determine the finishing times of all five packets in (i) the simulated GPS scheme and (ii) the actual scheduling. Packet ID Al A2 Bl A3 B2 Consider the arrivals of packets to a system as shown below. Packets are to be served by the system at a rate of 1 Mbps according to a scheduler and while they wait to be served they are queued. A4 AS Arrival Time (us) 0 5 Arrival Time (ms) 0 10 20 40 4 6 8 10 Packet Length (bits) 1000 2000 4000 2000 1000 2000 1000 (a) Assume that the scheduler uses a Weighted Round Robin approach where the weight of all connections is I and the round robin always begins at connection A. Determine the finishing time of each packet. (b) Assume that the scheduler uses a Weighted Fair Queuing approach where the weight of all connections is 1. Determine the finishing times for each packets in the simulated GPS scheme and the actual finishing times for the WFQ approach. (c) Comment on the fairness and practicality of the WRR vs. the WFQ schemes for this example.