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. Initially suppose there is no link between AS2 and AS4. Once router 1d learns about destination x, it will need to install a forwarding table entry to x. Indicate which one of the statements below are true. 3b 3c AS 3 3a 4c 1a 4b 21 AS 4 1c AS 1 1d 22 4a 1b X 2a 2c AS 2 2b 1d will forward along z2 since BGP has computed the path to 1c is via z2. 1d will forward along z2 since OSPF has computed the path to 1c is via z2. 1d will forward along z1 since hot potato routing forwards clockwise. 1d will forward along z1 since BGP has computed the path to 1c is via z1. 1d will forward along z1 since OSPF has computed the path to 1c is via z1.
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. Initially suppose there is no link between AS2 and AS4. Once router 1d learns about destination x, it will need to install a forwarding table entry to x. Indicate which one of the statements below are true. 3b 3c AS 3 3a 4c 1a 4b 21 AS 4 1c AS 1 1d 22 4a 1b X 2a 2c AS 2 2b 1d will forward along z2 since BGP has computed the path to 1c is via z2. 1d will forward along z2 since OSPF has computed the path to 1c is via z2. 1d will forward along z1 since hot potato routing forwards clockwise. 1d will forward along z1 since BGP has computed the path to 1c is via z1. 1d will forward along z1 since OSPF has computed the path to 1c is via z1.
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
Related questions
Question
Transcribed Image Text: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. Initially suppose there is no link between AS2 and
AS4. Once router 1d learns about destination x, it will need to install a forwarding
table entry to x. Indicate which one of the statements below are true.
3b
3c
AS 3
3a
4c
1a
4b
21
AS 4
1c
AS 1
1d
22
4a
1b
X
2a
2c
AS 2
2b
1d will forward along z2 since BGP has computed the path to 1c is via z2.
1d will forward along z2 since OSPF has computed the path to 1c is via z2.
1d will forward along z1 since hot potato routing forwards clockwise.
1d will forward along z1 since BGP has computed the path to 1c is via z1.
1d will forward along z1 since OSPF has computed the path to 1c is via z1.
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!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
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.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education