Assume that we have a packet arrival process characterized by an average arrival rate A. Assume that we also have a packet service process characterized by an average service rate C. That is, we have a queue where packets arrive at an average rate A, and packets are served at an average rate C. After long and careful deliberation, the TAs in this class have derived an important result: the average number of packets waiting in the queue is given by F(A/C) for some function F. 1) While knowing the average queue size is nice, what we really want to know is how long do packets wait in the queue; that is, what is their average queuing time (or, equivalently, waiting time)? Using Little's Law, how can we express this queuing time in terms of F? a) F(A/C) b) F(C/A) c) A F(A/C) d) F(A/C) A e) F(C/A) C 2) Now assume that the arrival process represents N flows, and each flow individually has an arrival process with average A/N. Further assume that each flow gets 1/Nth of the service, with no sharing (that is, we use the equivalent of circuit-switching where each flow has a reserved capacity), so each has an effective service rate of C/N. How does the queuing time for these flows compare to what you computed above? a) We aren't given enough information to know b) It is exactly the same c) It is N times larger d) It is N times smaller

Please choose an answer from the options provided in each question.