network layer at the destination host. Assume all IP headers are 20 bytes 10. Suppose an IP implementation adheres literally to the following algorithm on receipt of a If( Ethernet address for D is in ARP cache) (Send Pi i send out an ARP query for D Put P into a queue until the response comes back a) If the IP layer receives a burst of packets destined for D, how might this algorithm waste resources unnecessarily? b)Sketch an improved version 11. For the network given in Fig. 1, given global distance-vector tables like those of Tables 4.5 and 4 8 when a) Each node knows only the distances to its immediate neighbors b) Each node has reported the information it had in the preceding step to its immediate c) Step b) happens a second time Suppose the forwarding tables are all established and then the C-E link fails. Give d) The tables of A, B, d and F after C and E have reported the news e) The tables of A and d after their next mutual exchange f The table of C after A exchanges with it 2 12. For the network given in Fig. 1, show how the link-state algorithm builds the routing table for node d 13. USing winpcap(packet capture tool) to send an ARP packet to a destination host and the return result of packet length is 60 bytes. But the real ARP length is 42 bytes according to the ARP format shown in Fig 4.7, including 14-byte Ethernet header. If the ARP packet is sent to a virtual machine(such as VMVaRe)the winpcap return result is also 42 bytes. What is the ARP packet length on earth? Why?network layer at the destination host. Assume all IP headers are 20 bytes. 10. Suppose an IP implementation adheres literally to the following algorithm on receipt of a packet, P, destined for IP address D: If (Ethernet address for D is in ARP cache) {Send P} Else {send out an ARP query for D Put P into a queue until the response comes back} a) If the IP layer receives a burst of packets destined for D, how might this algorithm waste resources unnecessarily? b) Sketch an improved version. 11. For the network given in Fig.1, given global distance-vector tables like those of Tables 4.5 and 4.8 when a) Each node knows only the distances to its immediate neighbors. b) Each node has reported the information it had in the preceding step to its immediate neighbors. c) Step b) happens a second time. Suppose the forwarding tables are all established and then the C-E link fails. Give d) The tables of A, B, D and F after C and E have reported the news. e) The tables of A and D after their next mutual exchange. f) The table of C after A exchanges with it. A B D E C F 3 8 2 2 1 6 Fig.1 12. For the network given in Fig.1, show how the link-state algorithm builds the routing table for node D. 13. Using winpcap (packet capture tool) to send an ARP packet to a destination host and the return result of packet length is 60 bytes. But the real ARP length is 42 bytes according to the ARP format shown in Fig.4.7, including 14-byte Ethernet header. If the ARP packet is sent to a virtual machine (such as VMVARE) the winpcap return result is also 42 bytes. What is the ARP packet length on earth? Why?