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

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 the 3-node network shown below, with the given link costs When the algorithm converges, what are the distance vectors in each of the routers. Show the iterations the distance vector algorithm will go through to build the distance vector at each router..
with the help of a well labelled diagram, design a network system using a combination (at least two ) of the network topologies. Consider the following : (i) Choose a network address for your network system (ii) based on your network address, assign IP addresses to the devices in your network. there should be a server, a switch and router in your network. NB: Discuss the design of your network as part of the answer to this qusetion in yoyr answer booklet. The discussion should include the type of topology used, the network address used,the class of IP address and the general concept of your choice of design
Question 4: The nodes participating in the reliable flooding algorithm in one network are broadcasting the following link state packets. Link state packets have sequence numbers and time to live fields in order to implement reliable flooding protocol. Based on those packets draw the network topology, assign link costs and find shortest paths for node 'C' using the link state routing algorithm. В D E Seq. no time to live 4 Seq. no time to live B Seq. no time to live 3 Seq. no time to live A 3 C F 3 D E 3 F 5 IF 8
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
Routers discover remote networks in two ways: by use of statically configured routes or by use of dynamic routing protocols. i). Explain THREE situations in which it would be ideal to configure static routing. ii). Explain any THREE advantages that dynamic route configuration (i.e. use of routing protocols) has over using static routing.
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.)
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.
Assume that we have a centralized architecture, where all players inform their coordinates to a server. Explain how timeout-based and quorum-based message aggregationswork in such an environment. Assume we have 12 players and their update intervalranges from [0.1, 3] seconds. Which approach would be recommendable?
Scenario and Procedure: 20 R R1 20 R3 R4 10 1 5 10 R6 1 R5 30 5 R8 R 10 5 R 20 R10 30 R9 R 25 R R2 R7 This shows a simple logical topology of nodes located in the cloud. The highlighted green values represent hop costs in which a data packet passes from node to node. A red X mark represents a broken link, a pre-existing connection with physical faults. ● Parameter A: Routers R4, R6, and R9 are having problems with faulty data connection and configuration in which passing data may experience packet loss. ● Parameter B: Routers R3 and R5 have experienced network intrusion due to the security measures not being configured properly. As a NOC engineer of a distinguished company, your supervisor tasked you to route traffic in sending/recieving packets from R1 to R10 nodes (routers) with the following requirements: Determine the fastest path (UDP) and safest path (TCP). Aggregate the nodes (select series of routers) and compute hop costs for each path and give a brief conclusion for each path…
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.