uppose AS3 and for their intra-AS routing protocol. Suppose AS1 is running RIP for its intra-AS routing protocol. 1) Router 1b and Ic 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 l₂? Explain why. 3b 3c 3a AS3 1a 10 1b 2a AS2 2c 2b

uppose AS3 and for their intra-AS routing protocol. Suppose AS1 is running RIP for its intra-AS routing protocol. 1) Router 1b and Ic 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 l₂? Explain why. 3b 3c 3a AS3 1a 10 1b 2a AS2 2c 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: The Routing Information Protocol (RIP) is an intradomain routing based on routing. * link state…

A: According to the guidelines we are supposed to answer only 1 question. So I am going with the first.…

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: AS1 has the following routing table, draw the network of AS’s that these paths imply: Picture below.…

A: In the context of routing and autonomous systems (AS), a routing table contains information about…

Q: Suppose a small ISP X pays a larger ISP A to connect him to the rest of the Internet and also pays…

A: Internet:- Internet (or the Internet) is the globally interconnected IP networking system that…

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: There are 4 routers Router A, B, C and D Router B and D are connected in a network system, RIP is…

A: Routing Information Protocol (RIP) is a distance-vector routing protocol. Routers running the…

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

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

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

Step 2: Answer for 1

Step 3: Answer for 2

Step 4: Answer for 3

Solution

Trending now

This is a popular solution!

Step by step

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

Suppose a small ISP X pays a larger ISP A to connect him to the rest of the Internet and also pays another ISP B to provide a fall-back connection to the Internet in the event that he losses connectivity via ISP A. ISP X learns of a path to some prefix via ISP A, should he advertise that path to ISP B? Why or why not?
Comparison should be made between the routing protocols DSDV, AODV, and DSR with regard to the protocol type, routing methodology, routing structure, route selection, routing table, and route management. The workings of the protocol, its advantages, and its drawbacks.
Consider the datagrams of each layer in the TCP/IP model, e.g., Frame at the Link Layer, Packet at the Internet Layer. Explain the functioning of the following protocols based on their datagram header fields only. Note: You do not need to describe the header field but based on the header field, explain how the protocol works, e.g., Acknowledgement field in a TCP Header is responsible for providing reliable data transfer and in case of data loss or ACK not received, segment is re-sent. You do not need to consider every field of the headers but wherever there are more than 4 fields, then based on 5 fields, describe its functioning, if less than or equal to 4 fields then consider all the fields. Ethernet Frame 11 Frame IPv4 Packet IPv6 Packet TCP Segment UDP Segment HTTP
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.
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?
Which two statements about routing protocols are true (choose 2). a) OSPF elects designed routers on multi-access links. b) RIP does not support classless routing. c) EIGRP uses broadcast traffic to establish adjacencies with its neighbors. d) RIP does not advertise a route beyond a hop count of 15. e) IBGP is an internal routing protocol.
Consider a reliable data transfer protocol that uses only negative acknowledgements (NAKS). (a) Suppose the sender sends data only infrequently. Would a NAK-only protocol be prefer- able to a protocol that uses ACKS? Explain. (b) Now suppose the sender has a lot of data to send and the end-to-end connection expe- riences few losses. In this case, would a NAK-only protocol be preferable to a protocol that uses ACKS? Explain.
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?