Ring topology narrated tour

Ring topology narrated tour

animation
ring-topology
token-passing

The animation below shows one possible ring implementation: token passing. Token access is a media-access choice, not a requirement of ring topology.

Ring topology narrated tour

Play silently with captions on provisional storyboard timing; narration audio is pending. Production pacing is not sensor, query, or protocol time. Choose Reduced motion for a complete still at each beat.

Trace token permission, a complete frame journey, and a stopped token at a broken link. Token passing is this example’s access method; timings are classroom estimates. Play the tour to open the workbench. Pause, replay a beat, or read the full transcript below. Unsupported situations keep the existing frame and provide captions only.

Full transcript — Ring topology (8 beats)

B1 — Building sensor planning
You are the technician planning a building's connected sensors. A broken connection could leave devices without service. Before choosing a ring for those sensor messages, you need to understand how messages travel around its loop, and what happens when that loop breaks.

Model caption: Imagine planning connected building sensors. Which devices lose service if a connection breaks? Trace the loop and its failure behavior.

B2 — Loop and token permission
A ring topology means devices form a loop of communication paths. Our example uses token passing to decide who may send. A token is permission to transmit. Token passing is one possible access method for a ring; the loop describes the topology.

Model caption: A ring is a loop of communication paths. This example uses a token to grant permission to send; token passing is an access method.

B3 — Token capture and send
Start with six nodes, numbered zero through five. Node one has data for node four. The free token starts at node zero and passes to node one. Node one captures it, then sends a data frame, a message carrying its data. Other nodes forward while the sender transmits.

Model caption: Six nodes: 0–5. Sender 1 waits for the token from 0, captures it, and starts a data frame for destination 4. Other nodes forward.

B4 — Copy, forward, remove
The frame passes through node two and node three before reaching node four. Node four copies the data and forwards the frame. It continues through node five and node zero, returning to node one. The sender removes it and releases a free token.

Model caption: Frame route: 1 → 2 → 3 → 4 → 5 → 0 → 1. Node 4 copies and forwards; Node 1 removes the returning frame and releases a token.

B5 — Other nodes’ holding time
Permission also means waiting. Use a token holding limit of two milliseconds for each of the six nodes. To estimate the longest access wait, first subtract one from six. That leaves five other nodes. Five times two milliseconds gives ten milliseconds of holding time.

Model caption: Six nodes minus the waiting sender leaves five other nodes. 6 − 1 = 5; 5 × 2 ms = 10 ms of holding time.

B6 — Travel allowance
Then include the model's allowance for travel time around the ring. Six times zero point zero eight milliseconds gives zero point four eight milliseconds. Add that to ten milliseconds: the estimated worst access wait is ten point four eight milliseconds. These are simplified classroom timings.

Model caption: Travel allowance: 6 × 0.08 ms = 0.48 ms. Estimated worst access wait: 10 ms + 0.48 ms = 10.48 ms. Simplified classroom estimate.

B7 — Single link break
The misconception is that a loop automatically sends traffic the other way after a break. Try a separate seven node case, with the link between node four and node five broken. The token advances from node one to node four, then stops. The single ring model uses no alternate path. Recovery requires rules that can use another direction.

Model caption: Separate seven-node case. Token: 1 → 2 → 3 → 4, then stopped at the broken 4–5 link. This single-ring model uses no alternate path; another direction requires recovery behavior.

B8 — Recovery takeaway
For your building's sensors, remember: a ring supplies a loop; recovery behavior determines whether traffic can survive a break.

Model caption: A ring supplies a loop; recovery behavior determines whether traffic can survive a break.

Back to the chapter