5.13-1. Using BGP path advertisements to implement routing policy. Consider the network below with interconnected provider networks and customer networks. Assume that provider network D only wants to carry traffic that originates in one of its customer networks (wz) or is destined to one of its customer networks. It specifically does not want to forward datagrams between two other provider networks, since that transit traffic is neither sourced from, nor destined to, a customer network of D. A B W Z y B D legend: C provider network Given these policies, to which other networks will network D advertise the path Dw? customer network: X Y

5.13-1. Using BGP path advertisements to implement routing policy. Consider the network below with interconnected provider networks and customer networks. Assume that provider network D only wants to carry traffic that originates in one of its customer networks (wz) or is destined to one of its customer networks. It specifically does not want to forward datagrams between two other provider networks, since that transit traffic is neither sourced from, nor destined to, a customer network of D. A B W Z y B D legend: C provider network Given these policies, to which other networks will network D advertise the path Dw? customer network: X Y

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

Related questions

Q: Consider the following network diagram: AS1 ja 1b 1c AS2 2b AS1, AS3,X 2a 152 201 263 112 AS3 3a…

A: BGP stands for Boarder Gateway Protocol and there are two types of BGP that are iBGP (internal BGP)…

Q: Suppose most of the Internet used some form of geographical but that a large addressing,…

Q: Provide three instances of routing metrics that routers employ to find the optimal routing path…

Q: ridges are empty. List all ports on which a packet will be forwarded by bridges B1 and B2 for the…

A: We have a connection of multiple nodes with bridges and hubs. Here we need to find the path of ports…

Q: Consider the three-hop scenario shown below, where the first and third links have capacity R, and…

A: in hop-by-hop congnetion control just because of buffer overflow the sender does not perform the…

Q: 5.4-3. Path advertisement and policy (Part 2). Again, suppose a provider network only wants to carry…

A: 5.4.3 Answer: C Explanation: if suppose a provider network only wants to carry traffic to/from its…

Q: Path advertisement and policy (Part 2). Again, suppose a provider network only wants to carry…

A: the answer is given below:-

Q: 4.05-2. Generalized forwarding: specifying a flow table entry (b). Consider the three-node network…

A: Dear Student, As we need to drop each of ip address which has at port 80 of all routers to do so ,…

Q: 1. Consider the network shown in Figure 4.28, in which horizontal lines represent transit providers…

A: Below is the answer to above question. I hope this will be helpful for you..

Q: b) Consider the scenario presented below. Here a Switch is used in the center and node A would be…

A: Explanation: Node A is transmitting a packet to Node A' over here. If the switch knows where A' is…

Q: One of the purposes of TIME_WAIT is to handle the case of a data packet from a first incarnation of…

Q: Imagine two autonomous systems ASX and ASY, and assume all of the following: • ASY has been…

A: In this scenario, we have two autonomous systems (AS), ASX and ASY. An autonomous system is a…

Q: Consider the throughput example. Now suppose that there are 4 client-server pairs. Denote Rs1, Rs2,…

Q: Specifically, it contains four routers. This includes each of the four different router varieties.…

A: When a new connection is established between Routers A and C in a network consisting of four…

Q: We've learned in class about end-to-end and network-assisted congestion control. A third type of…

A: This question asks about hop-by-hop congestion control, which is a type of congestion control used…

Q: Use K-maps to simplify F(A,B,C,D) = 2(0, 1, 2, 3, 4, 6, 9,11) For credit, show all the work, justify…

A: The required expression is F(a, b, c, d) = a'd' + a'c + b'd

Q: One of the purposes of TIME_WAIT is to handle the case of a data packet from a first incarnation of…

A: TIME_WAIT: After getting the end ACK from the distant TCP, the nearby TCP holds back to ensure that…

Q: When we talk about the length of a connection chain containing multiple connections, we use the RTT…

A: RTT is the Round Trip Time , which is the time between the request and response between client and…

Q: Assume that the network in Figure 20.34 uses distance-vector routing with the forwarding table as…

Q: Consider the throughput example presented in the figure below. Now suppose that there are 4 client-…

Q: One of the purposes of TIME_WAIT is to handle the case of a data packet from a first incarnation of…

A: The question has been answered in step2

Q: Every active interface on Distance Vector receives a periodic transmission of its whole routing…

A: The two primary routing protocol types utilised in packet switched networks for data transport are…

Q: 1. Consider the network shown in Figure 4.28, in which horizontal lines represent transit providers…

Q: Question 1 Suppose P packets arrive simultaneously to a link at which three packets are currently…

Q: Think about the count-to-infinity distance vector routing issue. If the cost of a connection is…

A: Count-to-infinity : A routing loop is also known as counting to infinity. Routing loops in distance…

Q: One of the purposes of TIME_WAIT is to handle the case of a data packet from a first incarnation of…

A: A. the first incarnation of the connection must have closed successfully and the second must have…

Q: - Consider below topology. Each link has its own cost, suppose node A sends a packet to node G,…

A: This is the distance vector routing. We take minimum one distance from source to another node.

Q: Referring to the following diagram, if the link cost between router A and B changes from 2 to 25,…

A: Before the link cost change:The routing table of A: Destination Distance Next A 0 A B 2 B C…

Q: Two users, one using Telnet and one sending files with FTP, both send their traffic out via router…

Concept explainers

Network transmission cabling

A network is a collection of devices connected by communication links. A device can be a computer or any instrument capable of sending and receiving data or information formed by other nodes toward the network. A channel that connects people or things is known as a network. It sends the data from one place to another. It is the basic concept of a computer, network, and data communications.

Question

5.13-1. Using BGP path advertisements to implement routing policy. Consider the network below with interconnected provider
networks and customer networks. Assume that provider network Donly wants to carry traffic that originates in one of its customer
networks (w, z) or is destined to one of its customer networks. It specifically does not want to forward datagrams between two
other provider networks, since that transit traffic is neither sourced from, nor destined to, a customer network of D.
A
B
ΘΘΘΘΘΘ
W
y
C
X
A
Z
Given these policies, to which other networks will network D advertise the path Dw?
Z
B
D-
legend:
C
provider
network
customer
network:
X
Y

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1: Introduction :

VIEW

Step 2: Find the networks to which D advertise :

VIEW

Step 3: Find the networks to which D :

VIEW

Solution

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 4 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Consider the following network. A. Display router forwarding table A. such that all traffic for H3 is transmitted through interface 3. b. May you enter a transmission table on router A, in that all traffic from HI to host H3 is transmitted via interface 3, while all traffic from 112 to host H3 is transmitted via interface 42? (Hint: This issue is a trick.)
Distance vector's routing table is regularly sent to each active interface. Link status protocol informs other routers of a router's connection state. Two ideal examples for each claim show how the Link state and Distance vector may be utilized in different scenarios.
Datagram Congestion Control Protocol (DCCP) is a connection-oriented protocol which works as a mechanism for detecting congestion. It provides unreliable flow of datagrams and reliable handshake for connection setup and teardown.Based on the description given above, ELABORATE your answer from the questions below:a) EXPLAIN any FIVE (5) differences of DCCP from Transmission Control Protocol (TCP).b) DESCRIBE the TWO (2) congestion control mechanisms supported by DCCP.
Consider both questions pls....
Question 2 (a) Describe the similarities and differences of transport layer protocols UDP and TCP. Host A sends a file of AB,500 bytes to Host B over a TCP connection. Assume the maximum segment size (MSS) is 128 bytes. The segment has no options field. The transport layer, network layer, and data-link layer add headers of a total size of 66 bytes to each segment before the resulting packet is sent out over a 2CD Mbps link. ABCD are the last 4 digits of your student ID number (in decimal). (b) What is the size of the first packet? (c) What is the size of the last packet? (d) What is the sequence number of the last segment (in decimal)? (e) Assume no congestion, show the calculation and determine the time (in msec, round to 3 decimal places) required to transmit the file. (f) If congestion is possible, suggest and describe two methods that can be used to handle congestion.
7. Consider the below network consisting of 4 routers and 5 links with given edge weights. Show the step-by-step procedure how routing tables are calculated at each router using distance vector routing algorithm. Show all the intermediate routing table and identify all unused links after routing table is stabilized. Explain how Bellman ford algorithm is used by distance vector routing algorithm. D с 1 A 11 7 2 3 B
2
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
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…
59. Consider the network in Figure 3.56, using link-state routing. Suppose the B-F link fails, and the following then occur in sequence: (a) Node H is added to the right side with a connection to G. (b) Node D is added to the left side with a connection to C. (c) A new link D-A is added. The failed B-F link is now restored. Describe what link-state packets will flood back and forth. Assume that the initial sequence number at all nodes is 1, that no packets time out, and that both ends of a link use the same sequence number in their LSP for that link, greater than any sequence number either used before. IFIGURE 3.56 Network for Exercise S9.
Consider the following network. A. Display router forwarding table A. such that all traffic for H3 is transmittedthrough interface 3. b. May you enter a transmission table on router A, in that all traffic from HI to host H3 is transmitted via interface 3, while all traffic from 112 to host H3 is transmitted via interface 42? (Hint: This issue is a trick.)
Distance vector's routing table is regularly sent to each active interface. Link status protocol informs other routers of a router's connection state. Two ideal examples for each claim show how the Link state and Distance vector may be utilized in different scenarios.