32. Consider the network shown below. Suppose AS3 and AS2 are running OSPF for their intra- AS routing protocol. Suppose AS1 and AS4 are running RIP for their intra-AS routing protocol. Suppose eBGP and iBGP are used for the inter- AS routing protocol. Initially suppose there is no physical link between AS2 and AS4. a. Router 3c learns about prefix x from which routing protocol: OSPF, RIP, eBGP, or iBGP? b. Router 3a learns about x from which routing protocol? c. Router 1c learns about x from which routing protocol? d. Router 1d learns about x from which routing protocol? 3b 3c AS3 3a 1a 4c 1c 4₁ 4b AS4 1d AS1 1½/₂2 4a 1b X 2a 2c AS2 2b

32. Consider the network shown below. Suppose AS3 and AS2 are running OSPF for their intra- AS routing protocol. Suppose AS1 and AS4 are running RIP for their intra-AS routing protocol. Suppose eBGP and iBGP are used for the inter- AS routing protocol. Initially suppose there is no physical link between AS2 and AS4. a. Router 3c learns about prefix x from which routing protocol: OSPF, RIP, eBGP, or iBGP? b. Router 3a learns about x from which routing protocol? c. Router 1c learns about x from which routing protocol? d. Router 1d learns about x from which routing protocol? 3b 3c AS3 3a 1a 4c 1c 4₁ 4b AS4 1d AS1 1½/₂2 4a 1b X 2a 2c AS2 2b

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

17. Consider the network shown below. Suppose AS3 and AS2 are running OSPF for their intra-AS routing protocol. Suppose AS1 is running RIP for its intra-AS routing protocol. 1) Router 16 and 1c learns about prefix x from which routing protocol: OSPF, RIP, or inter- AS routing protocol? 2) Router la learns about prefix x from which routing protocol: OSPF, RIP, or inter-AS routing protocol? 3) Once router la learns that x is accessible via Ic as well as 1b, it will put an entry (x, 1) in its forwarding table. Will / be set to l₁ or 1₂? Explain why. 3b 3c 3a AS3 1a 1c 1d AS1 1b 2a AS2 2c 2b
Consider a slightly different AS-level topology running BGP routing below. Suppose x starts by announcinga path “x” for destination x to A. Upon receiving the path announcement, A learns a new path to reach x –“Ax”. A updates its routing table and announces the new path “Ax” for destination x to B and C. Uponreceiving the announcement, B learns a new path to reach x – “BAx” and updates its routing table. a. What will C learn as a new path to x upon receiving the announcement from A?b. Suppose B announces the new path for destination x to C. What will C learn as a new path to xupon receiving the announcement from B?c. Continue from (b). If z is C’s customer and forwarding packets for z with shorter delay willsatisfy z better, which path for destination x would C prefer to announce to z? And why?d. Continue from (b). z is C’s customer and C cares less of the customer’s satisfaction. If Bcharges less per unit traffic to forward for C and A charges more, which path would C preferto…
Consider a slightly different AS-level topology running BGP routing below. Suppose x starts by announcinga path “x” for destination x to A. Upon receiving the path announcement, A learns a new path to reach x –“Ax”. A updates its routing table and announces the new path “Ax” for destination x to B and C. Uponreceiving the announcement, B learns a new path to reach x – “BAx” and updates its routing table. a. What will C learn as a new path to x upon receiving the announcement from A?b. Suppose B announces the new path for destination x to C. What will C learn as a newpath to xupon receiving the announcement from B?c. Continue from (b). If z is C’s customer and forwarding packets for z with shorter delay willsatisfy z better, which path for destination x would C prefer to announce to z? And why?d. Continue from (b). z is C’s customer and C cares less of the customer’s satisfaction. If Bcharges less per unit traffic to forward for C and A charges more, which path would C preferto announce…
Question 5: Suppose you attach a network monitor to observe the sequence of frames that travel over a link from sender A to receiver B. The problem is to deduce what protocols, if any, could have generated the observed sequence. The following diagrams depict a flow of frames, with their corresponding sequence numbers, from the sender (A). There may be traffic from B to A, which is not depicted in the diagram. A gap between adjacent frames implies passage of time with no transmission from the sender. Note that the x-axis is time, and not space. Justify your answer. A A A ● ● ● ● 1 5 ● 3 5 0 ● 0 0 1 1 1 ● Go-Back-N ● Selective Repeat 1 0 5 0 c) For Diagram 3, the protocol is not: Stop-and-Wait Time Diagram 1 2 Time a) For Diagram 1, the most likely protocol being used is: Stop-and-Wait ● Go-Back-N (if Go-Back-N, give the window size) Selective Repeat (if Selective Repeat, give the window size) Diagram 2 Time 3 Diagram 3 1 Time b) For Diagram 2, the most likely protocol being used is:…
1. Consider a path from host A to host B through a router X as follows: A- -X-B The capacity of the link AX is denoted Ra, while the capacity of the link XB is denoted Rb in units of [bits/s]. Assume that Ra Ri. Is it possible that the second packet queues at input queue of the second link? Explain. Now suppose that host A sends the second packet T seconds after sending the first packet. How large must T be to ensure no queueing before the second link? Explain.
Consider the network shown below. Suppose AS3 and AS2 are running OSPF for their intra- AS routing protocol. Suppose AS1 is running RIP for its intra-AS routing protocol. 1) Router 16 and 1c learns about prefix x from which routing protocol: OSPF, RIP, or inter- AS routing protocol? 2) Router la learns about prefix x from which routing protocol: OSPF, RIP, or inter-AS routing protocol? 3) Once router la learns that x is accessible via le as well as 1b, it will put an entry (x, 1) in its forwarding table. Will I be set to 11 or 12? Explain why. 3b 3c 3a AS3 1a 12 1c 1d AS1 1b 2a AS2 2c 2b
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?
Below is a nested MPLS network by MTN. With the assumption that Customer 6 (C6) is connected to Router 6 (R6), execute a Dijkstra Algorithm on a Link State routing to determine the shortest path for Customer 6 to transmit packets to every other Customer/Destination connected to the rest of the Routers on the network. Tabulate the executed iteration for the Dijkstra Algorithm using the table below. Iteration Nodes R1 R2 R3 R4 R5 R7 R8 R9 R10 0 [6] 1 [6,3] 2 [6,3,2] 3 [6,3,2,1] 4 [6,3,2,1,4] 5 [6,3,2,1,4,5] 6 [6,3,2,1,4,5,7]…
Below is a nested MPLS network by MTN. With the assumption that Customer 6 (C6) is connected to Router 6 (R6), execute a Dijkstra Algorithm on a Link State routing to determine the shortest path for Customer 6 to transmit packets to every other Customer/Destination connected to the rest of the Routers on the network. Tabulate the executed iteration for the Dijkstra Algorithm using the table below. Iteration Nodes R1 R2 R3 R4 R5 R7 R8 R9 R10 0 [6] 1 [6,3] 2 [6,3,2] 3 [6,3,2,1] 4 [6,3,2,1,4] 5 [6,3,2,1,4,5] 6 [6,3,2,1,4,5,7]…
Suppose two hosts A and B are connected via a router R. The A-R link has infinite bandwidth; the R-B link can send one packet per second. R's queue is infinite. Load is to be measured as the number of packets per second sent from A to B. Sketch the throughput-versus-load and delay-versus-load graphs, or if a graph cannot be drawn, explain why. Would another way to measure load be more appropriate?
5.03-5. Dijkstra's Algorithm (3, part 5). 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? OF (A) 3 2 4 B 8 D 10 4 E 4 2 F
5.09. How to forward to a border router? Consider the network shown below. Suppose AS1, AS2, AS3, and AS4 are running OSPF for their intra-AS routing protocol and that all links have a weight of 1. Now suppose the link between 2a and 4a is up, and that paths to x via AS2 and AS4 are known with AS1. Hot potato routing is used in conjunction with iBGP within an AS for determining the outgoing border router to use. Indicate which one of the statements below are true. 3b 3c AS 3 3a 4c 1a 4b AS 4 4a 1c AS 1 ²1 2₂. 1d 1b AS 2 1d will forward along z2 since 1d has a shorter intra-domain path than border router 1b to border router 1c, and hot potato routing is used. 1d will forward along z1 since OSPF has computed the path to 1c is via z1. 1d will forward along z1 since that was the path used initially. O 1d will forward along 1 or z2, since a hot potato can be thrown in any direction.