Repair and Version Evidence
Repair and Version Evidence
Repair and Version Evidence
Route repair evidence should explain both the trigger and the result. A parent switch after a restart can be healthy, but it is not automatically proof of resilience. Review the before state, the change event, the after state, and the application outcome.
Before Record DODAG ID, root, parent, rank, route state, and traffic result before the event.
Trigger Record whether the event was a parent loss, root restart, link degradation, prefix change, software update, or intentional repair.
After Record new parent, rank, route state, route direction, packet result, and whether any nodes stayed orphaned or stale.
Decision State which traffic classes recovered, which did not, and what must be retested when the same trigger happens again.
If the DODAG version changed, preserve that record with the reason if known. If only local repair occurred, record which node repaired and which traffic class was affected. Avoid using a single recovered ping or one successful message as proof that all route directions recovered.
RPL local repair narrated tour
Narrated audio tour. The full transcript is below.
Play the tour to open the simulator. Pause, replay a beat, or read the full transcript below.
Some beats explain situations this teaching model cannot show; those beats keep the existing frame and provide captions only.
Full transcript — RPL local repair (8 beats)
B1 — Orchard route
You are the engineer keeping orchard frost readings flowing to a field bridge. A parent link fails, interrupting the route used by a sensor branch. You need the readings back, and you also need to understand whether commands can reach the sensors.
Model caption: Your orchard sensor branch needs readings to reach the root and commands to reach sensors. Follow the parent-link repair to understand the recovered route.
B2 — Preferred parent
The Routing Protocol for Low-Power and Lossy Networks, or RPL, chooses paths through the network. It builds one-way paths toward a root, the destination for upward traffic, without loops. A preferred parent is the neighbor used for upward traffic. Local repair replaces a broken parent path within the affected area.
Model caption: RPL means Routing Protocol for Low-Power and Lossy Networks. Its paths lead toward a root without loops. The preferred parent carries upward traffic; local repair replaces a broken parent path.
B3 — Original upward route
In the teaching example, router E sends through router B toward the root. Sensor H depends on E, so the failure affects their branch. E starts at rank seven hundred sixty-eight. Rank describes position relative to the root and increases as paths move away from it.
Model caption: E sends through B to the root. H depends on E. E starts at rank 768; rank increases away from the root.
B4 — Detach the failed path
When the link between B and E fails, E loses its usable upward path. E detaches and advertises the old route as unusable. The model signals the unusable route with an infinite rank. Sensor H should stop relying on the unusable path through E while repair proceeds.
Model caption: B–E has failed. E detaches and marks the old route unusable. The teaching model uses infinite rank as the warning; H should stop relying on the poisoned route.
B5 — Loop-safe candidates
E compares possible parents. Router C is reachable and has a path to the root at a lower rank. Sensor H is rejected because H already depends on E. If E sends through H, H's route sends the traffic back through E. The traffic would loop.
Model caption: C is reachable and has a lower-rank path to the root. H depends on E, so E choosing H would create a loop. H is rejected.
B6 — Local reattachment
E selects C as its new preferred parent. In the teaching model, start with C's rank of five hundred twelve. Add two hundred fifty-six, the model's rank increase, to get E's rank of seven hundred sixty-eight. E now sends through C toward the root. Rank still increases away from the root.
Model caption: E selects C. C's rank 512 + the teaching rank increase 256 = E's rank 768. The new upward route is E → C → root.
B7 — Upward versus downward
A common mistake is to assume restored sensor readings mean commands can return, but restoring readings repairs the upward path. Commands need a separate route from the root toward the sensors. Upward traffic uses the preferred parent. A recovered upward path alone does not tell you whether a return route exists or whether a command has arrived.
Model caption: Misconception: restored readings prove commands can return. Upward forwarding uses the preferred parent; downward forwarding depends on root-to-destination reachability. Upward recovery alone does not prove command delivery.
B8 — Route refresh
E advertises its repaired rank through routing information messages. If the routing mode maintains downward routes, messages called Destination Advertisement Objects announce reachable destinations upward. The announcements refresh the routing information for downward travel. A new parent restores the way up; refreshed reachability supports the way back.
Model caption: Routing information messages advertise E's repaired rank. Destination Advertisement Objects announce reachable destinations upward when the mode maintains downward routes. A new parent restores the way up; refreshed reachability supports the way back.