5.4-3. Path advertisement and policy (Part 2). Again, suppose a provider network only wants to carry traffic to/from its customer networks (.e., to provide no transit service), and customer networks only want to carry traffic to/from itself. Suppose C has advertised path Cy to A. To implement this policy, to which of the following networks would network A advertise the path ACy? B Oc W Ox OB A C Ow W C A legend: 5.4-4. Path advertisement and policy (Part 3). Again, suppose a provider network only wants to carry traffic to/from its customer networks (.e.. to provide no transit service), and customer networks only want to carry traffic to/from itself. Suppose C has advertised path Cy to x. To implement this policy, to which of the following networks would network x advertise the path xCy? B C legend: None of these other networks A B provider network customer network: provider network customer network:

5.4-3. Path advertisement and policy (Part 2). Again, suppose a provider network only wants to carry traffic to/from its customer networks (.e., to provide no transit service), and customer networks only want to carry traffic to/from itself. Suppose C has advertised path Cy to A. To implement this policy, to which of the following networks would network A advertise the path ACy? B Oc W Ox OB A C Ow W C A legend: 5.4-4. Path advertisement and policy (Part 3). Again, suppose a provider network only wants to carry traffic to/from its customer networks (.e.. to provide no transit service), and customer networks only want to carry traffic to/from itself. Suppose C has advertised path Cy to x. To implement this policy, to which of the following networks would network x advertise the path xCy? B C legend: None of these other networks A B provider network customer network: provider network customer network:

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

Suppose you have the following sequence of packets (P1, P2. .P13) send from the .... ... sender (S) to the receiver (R). Check the connectivity of the transport link with the following Scenarios: 1) Transmitting segments with flow control, Windowing with size = 3 and p3, p8, p4, p13 lost %3D
3. Compute a minimum cost multicast tree for router F in the network of Fig 2 (take the associated weights of the links into account for this problem) for a group with members at routers A, B, and E. A 4 5 B 2 6 C E 8 F 3 7 D
dont dont post unnecessary answer answer only 100% sure ese skip
One proposed solution that allowed mobile users to maintain their IP addresses as they movedamong foreign networks was to have a foreign network advertise a highly specific route to themobile user and use the existing routing infrastructure to propagate this information throughoutthe network. We identified scalability as one concern. Suppose that when a mobile user movesfrom one network to another, the new foreign network advertises a specific route to the mobileuser, and the old foreign network withdraws its route. Consider how routing informationpropagates in a distance-vector algorithm (particularly for the case of inter-domain routing amongnetworks that span the globe). a) Will other routers be able to route datagrams immediately to the new foreign network assoon as the foreign network begins advertising its route? Why? b) Is it possible for different routers to believe that different foreign networks contain themobile user? Why? c) Discuss the timescale over which other routers in…
Look at this network fragment. w and y are x's only neighbors. W's minimum-cost path to u (not illustrated) is 5, while y's is 6. The pathways from w and y to u and between them are not indicated. All network link costs are positive integers. 2, Give x's distance vector to w, y, and u.
How would you write a system of linear equations based on the given scenario and directions? Scenario You are employed as a network engineer and have been asked to analyze a communication network to determine the current data rates and ensure that the links aren’t at risk of “reaching capacity.” In the following figure of the network, the sender is transmitting data at a total rate of 100+50 = 150 megabits per second (Mbps). The data is transmitted from the sender to the receiver over a network of five different routers. These routers are labeled A, B, C, D, and E. The connections and data rates between the routers are labeled as x1,x2, x3, x4, and x5 . Directions For this assignment, you will analyze the communication network and solve for the unknown data rates using a variety of techniques. The system can be modeled mathematically as a system of linear equations by writing an equation for each node/router in the network. Each of these equations can be written by noting that the sum…
Imagine you are the network administrator of University X having 10 campuses in Towson, Maryland. You want to build a connected network of servers (each server is either a regular or a routing one), one at each campus, and want to choose some of them to be the designated routing servers. A routing server will serve regular servers who connect directly to it via high speed cables, and every regular server must connect to at least one routing server. Your goal is to minimize the total length of high speed cable that you must purchase. Given the locations of the 10 campuses, design a plan that requires (1) the shortest length of cable and (2) the least number of routing servers.
33. In the figure below suppose that there is another stub network V that is a customer of ISP A. Suppose that B and C have a peering relationship, and A is a customer of both B and C. Suppose that A would like to have the traffic destined to W to come from B only, and the traffic destined to V from either B or C. How should A advertise its routes to B and C? What AS routes does C receive? W A B X Key: Provider network Customer network
Question 2 Apply link-state algorithm on the network in the following graph. The cost of each link is given along the link. You are required to give steps for building routing table for node A. 8 B D A 4 5 C 2 3 E
1. Consider the network shown in Figure 4.28, in which horizontal lines represent transit providers and numbered vertical lines are interprovider links. (a) How many routes to P could provider Q's BGP speakers receive? (b) Suppose Q and P adopt the policy that outbound traffic is routed to the closest link to the destination's provider, thus minimizing their own cost. What paths will traffic from host A to host B and from host B to host A take? A 1 Provider Q FIGURE 4.28 Network for Exercise 1. B 2 3 (c) What could Q do to have the B →→ A traffic use the closer link 1? (d) What could Q do to have the B → A traffic pass through R? Provider R
Consider the network shown in the figure below, and assume that each node initially knows the costs to each of its neighbors. If the distance-vector algorithm is used by all the routers, what would be the distance table entries at node E?
There are four routers in all. Each of the four distinct router types With the construction of a new connection connecting routers A and C, must router A recalculate its distance vector to account for the addition of routers B and D? The DV (distance vector) algorithm is the routing mechanism used by RIP, which is implemented on routers.