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 (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.

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 (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.

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

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…
COMPUTER CONSTRUCTION QUESTION : The routers in the network depicted by the figure above agree to use distance-vector protocol to build their routing tables. If router A just join the network with routing table only showing the cost to reach its immediate neighbors, how would the table of router A looks like after receiving the following tables in sequence: table of router B then table of router F thentable of router E? (the received tables are shown bellow.)
3.1.1 Consider the network shown in the figure 3.1 above with four nodes. Cost links are shown in the diagram. Give the distance-vector routing tables for all the nodes in the network. Let node B to be the first node to broadcast its routing table. 3.1.2 Provide details of how count to infinity problem may occur in this type of routing protocol. 3.1.3 Identify and briefly describe three QoS parameters that are often measured to characterise the behaviour of a network or network connection.
One approach that might be used in a mobile network architecture that would allow a datagram sent by the correspondent to reach a destination mobile device is to allow mobile users to maintain their IP addresses as they moved among foreign networks. The foreign network would advertise a highly specific route to the mobile user and use the existing routing infrastructure to propagate this information throughout the network. Scalability is a concern in this approach. Suppose as the mobile user moves from one network to another, the old foreign network withdraws its route as the new foreign network advertises the specific route to the mobile user. Take into consideration how routing information propagates in a distance-vector algorithm or inter-AS routing protocols like BGP. Also think about interdomain routing among networks that span the globe. Are datagrams routed immediately to the new foreign network as soon as the foreign network begins advertising its route? Would a situation…
Describe the Link State Routing Algorithm and briefly describe how the routingtable updates by using LSR algorithm for the network shown in the figure belowand indicate all the steps taken by node D as a source until it establishes theshortest path route to every other node in the network. Each column should beused to describe one iteration of the protocol.
The following questions related to the given picture 3.1.1 Consider the network shown in the figure 3.1 above with four nodes. Cost links are shown in the diagram. Give the distance-vector routing tables for all the nodes in the network. Let node B to be the first node to broadcast its routing table.
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.
Can someone please explain to me this question? ASAP??!!! 8. Consider the throughput example shown in the lecture.Now suppose that there are M client-server pairs rather than 3. Denote Rs, Rc, 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 M client-server pairs. Derive a general expression for throughput in terms of Rs, Rc, R, and M.
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?
An ISP provider has a network address of 10.10.0.0 with a subnet mask of 255.0.0.0. The company wants to create four sub-networks for the four customers A, B, C and D that would contain A has - 1024 hosts, B has 512 hosts and Chas 256 and D has 128 hosts respectively. Find the following: a. Find CIDR of an ISP provider and Subnet mask of ISP provider b) Find starting address and end address of customer A, Subnet mask and CIDR of A c) Find starting address and end address of Customer B, Subnet mask and CIDR of B d. Find starting address and end address of Customer C, Subnet mask and CIDR of C e. Find starting address and end address of Customer D, Subnet mask and CIDR of C f) Find remaining addresses an ISP provider hold after the allocation.
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?
Consider the 6-node network shown below, with the given link costs. Using Dijkstra's algorithm, find the least cost path from source node u to all other destinations. Fill in the following table using the convention shown the text. I am having trouble identifying the D(u), p(u) of this table. Could you help me, please?