4. An 8-node IP network routes packets based upon OSPF. At t=0, node F has the following information residing within its routing cache. Node A BUDEE C B(5) A(5) B(6) A(3) F G H D(3) C(6) F(2) E(2) D(2) E(4) E(3) G(6) B(5) C(2) D(4) F(7) Determine the routing table associated with node F. E(5) G(4) F(4) H(7) H(6) G(3)

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
icon
Related questions
Question

Y5

4. An 8-node IP network routes packets based upon OSPF. At t=0, node F has the following information residing
within its routing cache.
Node
A
BUD
C
E
F
G
H
B(5)
A(5)
B(6)
A(3)
B(5)
C(2)
D(4)
F(7)
D(3)
C(6)
F(2)
E(2)
D(2)
E(4)
E(3)
G(6)
E(5)
G(4)
F(4)
H(7)
H(6)
G(3)
Determine the routing table associated with node F.
Node F then intends to broadcast its own connectivity table to all other known and (as yet) unknown nodes on
the network. To do this, packets are broadcast with a hop count set to the known-network diameter plus 1.
What is the minimum number of packets that can be carried by the network in successfully passing Node F's
status to all other nodes? What is the maximum number?
If reverse path forwarding is used to broadcast these upgrade packets, how many packets does the network
now carry? Comment upon the answer obtained.
Repeat all previous parts of the question for node E and comment upon the answers obtained.
Transcribed Image Text:4. An 8-node IP network routes packets based upon OSPF. At t=0, node F has the following information residing within its routing cache. Node A BUD C E F G H B(5) A(5) B(6) A(3) B(5) C(2) D(4) F(7) D(3) C(6) F(2) E(2) D(2) E(4) E(3) G(6) E(5) G(4) F(4) H(7) H(6) G(3) Determine the routing table associated with node F. Node F then intends to broadcast its own connectivity table to all other known and (as yet) unknown nodes on the network. To do this, packets are broadcast with a hop count set to the known-network diameter plus 1. What is the minimum number of packets that can be carried by the network in successfully passing Node F's status to all other nodes? What is the maximum number? If reverse path forwarding is used to broadcast these upgrade packets, how many packets does the network now carry? Comment upon the answer obtained. Repeat all previous parts of the question for node E and comment upon the answers obtained.
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Hyperlinks
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
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education