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

Related questions

Q: Consider the datagrams of each layer in the TCP/IP model, e.g., Frame at the Link Layer, Packet at…

A: Note: As you have asked a multipart question, as per our policy, we will solve the first three parts…

Q: . Suppose A is connected to B via an intermediate router R, as in the previous problem. The A-R link…

Q: 2. Packet transmission. a. Consider a packet of length L that begins at end system A and travels…

A: Below is the complete solution with explanation in detail for the given questions about Packet…

Q: Consider a network with 4 links between two hosts where the maximum allowable packet size is 1000…

A: Answers:- 1st method:- To calculate the total time it takes to send 6000 bits from one host to…

Q: The RDT 3.0 protocol (b). Consider the rdt3.0 sender and receiver shown below, with FSM…

A: Transition t1: This transition happens after the receiver has processed the first packet and sends…

Q: Each active interface of Distance vector gets frequent transmissions of the whole routing table that…

A: Introduction: Data transport in packet switched networks uses distance vector and link state routing…

Q: Consider the network shown below, and Dijkstra's link-state algorithm. Suppose that Dijkstra's…

A: The above question is solved in step 2 :-

Question

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
1₁
4b
AS4
1d
AS1
1₂
4a
1b
X
2a
2c
AS2
2b

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: intra-AS routing protocol

VIEW

Step 2: Implementation of the given for the network

VIEW

Solution

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 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

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 a packet of length L that begins at end system A and travels over three links to a destination end system. These three links are connected by two packet switches. Let d, s, and R denotes the length, propagation speed, and the transmission rate of link i, for i=1,2,3 . The packet switch delays each packet by d . Assuming no queuing delays, in terms of d, s , R, (i=1,2,3), and L, what is the total end-to-end delay for the packet? Suppose now the packet is 1,500 bytes, and the propagation speed on all three links are 3125km/sec, 10000 km/sec, and 3333km/sec respectively. The transmission rates of all three links are 2 Mbps, the packet switch processing delay is 3 msec, the length of the first link is 5,000 km, the length of the second link is 4,000 km, and the length of the last link is 1,000 km. For these values, what is the end-to-end delay? In the above problem, suppose R1=R2=R3=R and dproc=0. Further, suppose the packet switch does not store-and-forward packets but…
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? O C O O O LL B A 3 2 B 8 D 10 E 4 2 F
Suppose A is connected to B via an intermediate router R, as in the previous problem. The A-R link is instantaneous, but the R–B link transmits only one packet each second, one at a time (so two packets take 2 seconds). Assume A sends to B using the sliding window protocol with SWS = 4. For Time = 0, 1, 2, 3, 4, state what packets arrive at and are sent from A and B. How large does the queue at R grow?
Each active interface of Distance vector gets frequent transmissions of the whole routing table that Distance vector maintains. The link status protocol broadcasts information about the state of a router's own connections to all other routers in the network. Each statement has two ideal examples that show how the Link state and the Distance vector may be utilized in a number of circumstances.
Suppose A is connected to B via an intermediate router R, as in the previous problem. The A-R link is instantaneous, but the R–B link transmits only one packet each second, one at a time (so two packets take 2 seconds). Assume A sends to B using the sliding window protocol with SWS = 4. For Time = 0, 1, 2, 3, 4, state what packets arrive at and are sent from A and B. How large does the queue at R grow?
2. Consider a slotted TDM hierarchical network in which there are 8 computers sharing a 10 Mbps channel to a router R1, sending packets to R1 which must all be forwarded by R1 over an outgoing link (called the MAN link), as shown in Figure 1. Computers A-H always have packets waiting to be sent, so no timeslot on the shared LAN is idle. Ignore the propagation delay on the LAN. The MAN link outgoing from R1 is a 100 Mbps link. The network layer protocol in use has a PDU with exactly 40 bytes of header and exactly 200 bytes of payload (SDU). The DLC layer protocol in use on the LAN has a PDU with exactly 40 bytes of header and 20 bytes of trailer. The DLC layer protocol in use on the outgoing link from R1 has a PDU with 40 bytes of header and no trailer. The physical layer does not impose any bit overhead in either channel. Use 1 Mbps = 1000000 bps. B D E F G H R1 R2 Figure 1 (a) What is the transmission delay of a bit for Computer A? (b) What is the transmission delay of a DLC PDU for…