Difficulty: Easy
Correct Answer: Mesh
Explanation:
Introduction / Context:
A fundamental topic in computer networking is “topology,” which describes how devices are interconnected. Understanding the difference between ring, star, tree, and mesh topologies helps network engineers reason about redundancy, path diversity, fault tolerance, and cost. This question asks specifically for the topology where each pair of nodes has its own direct, bi-directional link, which is the textbook definition of a full mesh.
Given Data / Assumptions:
Concept / Approach:
In a full mesh with n nodes, each node connects to every other node. The undirected link count is n*(n-1)/2, and the directed (simplex) count is n*(n-1). This provides maximal redundancy and the shortest possible path (one hop) between any two nodes, at the expense of the highest cabling/port cost and complexity. Partial mesh variants reduce the number of links but preserve multiple alternate paths.
Step-by-Step Solution:
Verification / Alternative check:
Full mesh is commonly used in small backbone clusters, data center interconnects, or overlay networks where high availability is critical. Routing tables in full meshes are trivial for reachability because each destination is one hop away, confirming the definition aligns with the description given.
Why Other Options Are Wrong:
Common Pitfalls:
Confusing “mesh” with “partial mesh”; misreading “bi-directional” as two separate simplex links and overlooking the requirement of a dedicated pairwise connection for every node pair; assuming redundancy automatically means mesh when stars can also be made redundant using multiple cores.
Final Answer:
Mesh
Discussion & Comments