Difficulty: Medium
Correct Answer: Hot potato routing
Explanation:
Introduction / Context:
Routing strategies can optimize for path length, delay, or local queueing conditions. The described behavior prefers the least waiting time, pushing packets out of the router as quickly as possible versus calculating global shortest paths.
Given Data / Assumptions:
Concept / Approach:
Hot potato routing (deflection routing) forwards a packet to whatever acceptable outgoing link currently appears best locally (e.g., shortest queue, lowest delay), avoiding buffering. It does not necessarily send the packet along a precomputed shortest path; it 'gets rid of the packet fast.'
Step-by-Step Solution:
Verification / Alternative check:
Architectures for deflection routing in buffer-limited networks prioritize any free output port with minimal contention, consistent with picking the shortest queue.
Why Other Options Are Wrong:
Flooding: Replicates to multiple outputs; not queue-based selection.
Static routing: Fixed next hops; ignores queue lengths.
Delta routing: Uses measured delay deltas across paths, not the simple per-port queue heuristic in the stem.
None of the above: Incorrect because hot potato matches.
Common Pitfalls:
Confusing shortest-path (global) with shortest-queue (local). The stem clearly states a local queue heuristic.
Final Answer:
Hot potato routing
Discussion & Comments