Virtual Labs

Tools

Aim

Theory

Pretest

Procedure

Simulation

Posttest

References

Contributors

Feedback

Aim

Theory

Pretest

Procedure

Simulation

Posttest

References

Contributors

Feedback

Link State Routing Algorithm

Choose difficulty:

Beginner

Intermediate

Advanced

How often do nodes broadcast Link-State Packets?

a: Only when the network changes Explanation

Explanation

b: At regular intervals or when the network changes Explanation

Explanation

c: Once every second Explanation

Explanation

d: Only when a data packet is received Explanation

Explanation

Which of the following best describes the forwarding table in Link-State Routing?

a: It stores only directly connected neighbors Explanation

Explanation

b: It maps each destination to the next-hop node on the shortest path Explanation

Explanation

c: It contains the entire network topology Explanation

Explanation

d: It lists all possible paths to a destination Explanation

Explanation

What is the primary advantage of Link-State Routing over Distance Vector Routing?

a: Less memory usage Explanation

Explanation

b: Faster convergence and no count-to-infinity problem Explanation

Explanation

c: Lower processing power required Explanation

Explanation

d: Better suited for small networks only Explanation

Explanation

How does a node update D(v) for a neighbor v in the Link-State algorithm?

a: D(v) = max(D(v), D(w) - c(w,v)) Explanation

Explanation

b: D(v) = D(w) / c(w,v) Explanation

Explanation

c: D(v) = min(D(v), D(w) + c(w,v)) Explanation

Explanation

d: D(v) = sum(D(v), c(w,v)) Explanation

Explanation

What is the final output of the Link-State algorithm?

a: A complete routing table containing next-hop nodes Explanation

Explanation

b: A set of shortest paths but no forwarding information Explanation

Explanation

c: A list of all network devices Explanation

Explanation

d: A distance vector for each node Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)