Suppose a small ISP X pays a larger ISP A to connect him to the rest of the Internet and also pays another ISP B to provide a fall-back connection to the Internet in the event that he loses connectivity via ISP A. If ISP X learns of a path to some prefix via ISP A, should he advertise that path to ISP B? Why or why not?

Consider the following situation: Source node has packets number 1, 2, 3, 4, 5, 6, 7, and 8 to send to the destination Source starts transmitting and packet 3 is lost on its way to its destination. The rest of ACK and data packets arrive successfully Window size is 5 packets ACKs are packet number-based. Draw a diagram that illustrates what happens in the network during sender’s transmission of packets 1 – 8 when Go-Back-N protocol is used and a diagram that illustrates what happens when Selective Repeat is used. Initial diagrams have been already drawn for you. You need to complete the drawing.

Consider 2 small ISPs Y and Z and two large ISPs A and B. Y pays A (but not B) to connect it to the rest of the Internet, while Z pays B (but not A) for its connectivity If ISP A learns of a path to some prefix via ISP B and ISP Z, should it advertise that path to ISP Y? Why or why not?

Consider the network shown below, and Dijkstra's link-state algorithm. Suppose that Dijkstra's algorithm has been run to compute the least cost paths from node E to all other nodes. Now suppose that source node E has a packet to send to destination node A. What is the first router to which E will forward this packet on its path to A? O C O O O LL B A 3 2 B 8 D 10 E 4 2 F

Suppose A is connected to B via an intermediate router R, as in the previous problem. The A-R link is instantaneous, but the R–B link transmits only one packet each second, one at a time (so two packets take 2 seconds). Assume A sends to B using the sliding window protocol with SWS = 4. For Time = 0, 1, 2, 3, 4, state what packets arrive at and are sent from A and B. How large does the queue at R grow?

Each active interface of Distance vector gets frequent transmissions of the whole routing table that Distance vector maintains. The link status protocol broadcasts information about the state of a router's own connections to all other routers in the network. Each statement has two ideal examples that show how the Link state and the Distance vector may be utilized in a number of circumstances.

Suppose A is connected to B via an intermediate router R, as in the previous problem. The A-R link is instantaneous, but the R–B link transmits only one packet each second, one at a time (so two packets take 2 seconds). Assume A sends to B using the sliding window protocol with SWS = 4. For Time = 0, 1, 2, 3, 4, state what packets arrive at and are sent from A and B. How large does the queue at R grow?

Consider a router with a full finite buffer and a packet arrival rate that exceeds the output link capacity of the router.  When a new packet arrives, what will the router do? .

2. Now suppose there are two links between source and destination, with one router connecting the two links. Each link is 5,000 km long. Again suppose the MP3 file is sent as one packet. Suppose there is no congestion, so that the packet is transmitted onto the second link as soon as the router receives the entire packet. What is the end-to-end delay?

With OSPF, a router broadcasts its link state information to all other routers in the autonomous system to which it belongs. Is this statement true or false? whichalgorithm does it use to determine the least cost paths ?