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?

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?

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

It contains four routers in total. Every one of the four main types of routers Is it necessary for router A to recompute its distance vector as a consequence of the addition of routers B and D to the network due to the building of a new connection between routers A and C? The DV (distance vector) algorithm is the routing technique used by the RIP protocol, which runs on routers.
1) Write a method in java that performs the union operation on two integer arrays, i.e. it will createa new array that has the values from the two input arrays but with no duplicates.• The method must have the following signature:public static int[] union(int[] a1, int[] a2)• You can assume that no input array element will have a value less than 1.• Your method can return an array that is the same size as the two input arrays puttogether. This will mean, in general, the returned array will have too many elements.This is fine. Any elements you don’t need, you simply set to zero.• Implement this method using Java primitives only. You may use the array lengthproperty.• If you want to implement other methods to help you, you may do so. You must writethe method specified above, but you may write other methods to help you if you wantto. You must show the full implementation of any methods you create, however.
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 losses connectivity via ISP A. 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 network depicted in the below figure. Suppose that router R1 receives a packet Pktl from host PC1. The length of packet Pktl is L = 25 Mbit. Router R1 takes 0.4 msec to determine the output link of packet Pktl. Packet Pktl is to be forwarded. through the output link to router R2. Packet Pktl waits 136 ms at the output link for transmission. The transmission link of the link between router R1 and router R2 is R = 5 Mbps. The distance between router R1 and router R2 is 400 Km and the propagation speed over the link is 2*108 m/s. PC1 a. b router R2. R1 R2 R3 Find the queuing delay of packet Pktl at router R1. Find the propagation delay of packet Pktl over the link from router R1 to
Host A initiates a TCP connection with host B by sending a SYN packet, and B responds with a SYN-ACK packet. Upon receiving the SYN-ACK packet, A responds with an ACK packet. What is the earliest time that B can start sending data to A? Immediately after receiving the ACK packet from A After specific delay from receiving the SYN-ACK packet from B O Immediately after sending the SYN-ACK packet to A O After receiving data from A O Immediately after sending the SYN packet to B
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.
It contains four routers in total. Every one of the four main types of routers Is it necessary for router A to recompute its distance vector as a result of the addition of routers B and D to the network due to the building of a new connection between routers A and C? The DV (distance vector) algorithm is the routing technique used by the RIP protocol, which runs on routers.
2
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?
Urgent
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
Assuming that all routers and hosts are working properly and that all software in both is free of all errors, is there any chance, however small, that a packet will be delivered to the wrong destination?