1. (20 marks) [Store-and-Forward in Packet-Switched Networks (Learning Outcome 3)] Consider a packet-switched network. There are two applications in the network running at Host A and Host B, respectively, both sending data to Host C, as illustrated in Figure 1-1. The link capacity between router R1 and router R2 is L bits per time slot and the link capacity between router R2 and Host C is M bits per time slot. We have LL/2 (bits), K1>L (bits per time slot), K2>L (bits per time slot), and N/K1+N/K2=1. Ignore nodal processing delay and propagation delay in this network. Answer the following questions: A K1 M K2 . R1 R2 Figure 1-1 Application 1 ... Application 2 to to+1 to+2 Figure 1-2 (1) What is the queueing delay experienced by the last packet from application 2 at router R1? (2) What is the average throughput of receiving data from both applications at host C, over the span from the start of the first time slot (to) to the time when the last packet from application 2 is entirely received by host C? 1. (20 marks) [Store-and-Forward in Packet-Switched Networks (Learning Outcome 3)] Consider a packet-switched network. There are two applications in the network running at Host A and Host B, respectively, both sending data to Host C, as illustrated in Figure 1-1. The link capacity between router R1 and router R2 is L bits per time slot and the link capacity between router R2 and Host C is M bits per time slot. We have LL/2 (bits), K1>L (bits per time slot), K2>L (bits per time slot), and N/K1+N/K2=1. Ignore nodal processing delay and propagation delay in this network. Answer the following questions: A K1 M K2 . R1 R2 Figure 1-1 Application 1 ... Application 2 to to+1 to+2 Figure 1-2 (1) What is the queueing delay experienced by the last packet from application 2 at router R1? (2) What is the average throughput of receiving data from both applications at host C, over the span from the start of the first time slot (to) to the time when the last packet from application 2 is entirely received by host C