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: 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: Consider the throughput example. Now suppose that there are 4 client-server pairs. Denote Rs1, Rs2,…

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: 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: 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: Question 1 Suppose P packets arrive simultaneously to a link at which three packets are currently…

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: 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

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.
Consider both questions pls....
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
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.
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.
A protocol stack used by many applications is to use TCP at the transport layer and IP at the network layer. The ICMP protocol is also used to report on problems encountered by IP. A) The IP protocol provides a service referred to as "best effort". Describe the services of IP and potentially ICMP protocol, with respect to flow control( ensuring the sender does not overwhelm the receiver). B) Describe the services TCP provides with respect to flow control and explain the mechanisms it uses to overcome the deficiencies of IP.
a) Explain how OSPF routing becomes more scalable in a large network by partitioning it in areas and a backbone area. What is the drawback of breaking a network in smaller areas compared to running OSPF in the original network? b) What is the role of the sequence number in the OSPF LSP?
Two users, one using Telnet and one sending files with FTP, both send their traffic out via router R. The outbound link from R is slow enough that both users keep packets in R's queue at all times. Discuss the relative performance seen by the Telnet user if R's queuing policy for these two flows is (a) Round-robin service. (b) Fair queuing. (c) Modified fair queuing, where we count the cost only of data bytes and not IP or TCP headers. Consider outbound traffic only. Assume Telnet packets have 1 byte of data, FTP packets have 512 bytes of data, and all packets have 40 bytes of headers.
3. Calculating throughput. Given the adjacent diagram illustrating client server pairs with Rs, Rc, and R are the rates for the server links, client links and network link. Assume all other links have abundant capacity and there is no other traffic in the network besides the traffic generated by M client-server pairs. a. If Rs is 35 Mbps and Rc is 25 Mbps, R is 120 Mbps, and there are 5 concurrent users (i.e., M=5), what is the maximum throughput from client to server? Explain your answer. b. If Rs is 15 Mbps and Rc is 25 Mbps and R is 100 Mbps, what is the minimum value for M to make the bottleneck occur at R instead of either R, or Rc? Round M up to the nearest integer. Explain your answer. c. If Rs is 16 Mbps and Rc is 12 Mbps and R is 28 Mbps, what is the minimum value for M to make the bottleneck occur at R instead of either R, or Rc? Round M up to the nearest integer. Explain your answer. R₁ AHL R$ Rc
Consider the throughput example presented in the figure below. Now suppose that there are 4 client-server pairs. Denote Rs1, Rs2, Rs3,Rs4 ,Rc1 ,Rc2 ,Rc3, Rc4 and R for the rates of the server links, client links, and network link. Assume all other links have abundant capacity and that there is no other traffic in the network besides the traffic generated by the 4 client-server pairs. Question:derive a general expression for throughput for the Client Server pair 1, in terms of Rsi, ,Rciand 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?