What is a shortest path between vertices?
A route with minimal total edge weight.
What does Dijkstra’s algorithm find from one source vertex?
Shortest paths to all destination vertices.
What does a tentative label represent?
An unconfirmed distance estimate.
What does a permanent label represent?
A confirmed shortest distance.
How does Dijkstra's algorithm initialize vertex distances?
The source gets distance 0; every other vertex gets infinity.
How does Dijkstra's algorithm choose its next working vertex?
It selects the vertex with the smallest tentative label.
What does Dijkstra's algorithm do after selecting a working vertex?
It examines adjacent vertices and relaxes their labels.
When does Dijkstra's algorithm make a selected label permanent?
After examining the selected vertex's adjacent vertices.
What is the relaxation rule for updating vertex through vertex ?
How does flooding forward an incoming packet at each router?
On every outgoing line except the arrival line.
What three effects can flooding cause?
Duplicate packets, loops, and increased network traffic.
What does flooding do with incoming packets?
Distributes them across eligible outgoing lines.
What does an edge weight measure in a path?
The edge’s contribution to the path’s total weight.
How many edges can a shortest path contain at most in a graph with vertices?
edges.
Why can a path containing a cycle not be shortest?
Removing the cycle yields a shorter path.
How is the final path reconstructed from destination to source?
Trace predecessor or probe nodes backward from the destination to the source.
What routing approach and knowledge does flooding use at each router?
Static routing and local knowledge.
What happens to a packet when its hop counter reaches zero?
The packet is discarded.
How does a packet’s hop counter change during forwarding?
It is decremented at every hop.
How does sequence-number control identify packets already received?
Routers maintain lists of received packets.
What do routers do with duplicate packets under sequence-number control?
They discard duplicate packets.
Which outgoing lines does selective flooding use?
Lines approximately in the correct direction.
What does Dijkstra mean in the final revision cues?
Shortest route.
What does relaxation mean in the final revision cues?
Updating a shorter distance.
What does tentative mean in the final revision cues?
Not confirmed.
What does flooding do in the final revision cues?
Sends packets through all eligible outgoing lines.
What does a hop counter limit in the final revision cues?
The number of hops.
Answer 9 questions on Dijkstra and Flooding Algorithms.
1. A delivery route between two network vertices is considered a shortest path when what condition is met?
2. What does Dijkstra’s algorithm determine when run from a chosen source vertex?
Go over the full study guide for Dijkstra and Flooding Algorithms.
Read the study guide →Upload your class notes and Revizly writes your flashcards in about a minute.
Flashcard maker