Network Topologies

Physical and logical layouts: Bus, Star, Ring, Mesh, Tree, and Full Mesh.

What is a Network Topology?

A network topology is the schematic description of a network's arrangement, connecting various (devices) through (communication lines). It is the blueprint of a network, defining how data flows between devices.

It's important to distinguish between two types of topology:

  • Physical Topology: This refers to the actual physical layout of the devices and cables. It's what you would see if you could look at the network's wiring.
  • Logical Topology: This describes the path that data signals take through the network, which may differ from the physical layout. For example, a network might be physically wired in a star but function logically as a bus.

Full Mesh Topology

In a full mesh topology (also called a fully connected or polygonal topology), every node is directly connected to every other node in the network. This creates a highly resilient and direct communication structure.

Full mesh

Every node has a direct link to every other node

Use the node slider and pick source/destination to inspect redundancy and scaling.

Node count6
123456
Direct pathAlternate bypasses

Physical links

15

Control sessions

15

Two-hop alternatives

4

Degree per node

5

Aligned with RFC 4456 motivation: full mesh offers direct reachability but scales poorly for control plane peering.

1 - 2 - 41 - 3 - 41 - 5 - 41 - 6 - 4

Characteristics

  • Advantages: Its main advantage is extremely high . If any single link fails, the rest of the network can continue to communicate without interruption, simply routing data around the failure. It also offers high performance, as there is no traffic congestion between nodes.
  • Disadvantages: The primary drawback is the immense number of connections required. The number of links grows exponentially with the number of nodes, making it very expensive and complex to cable and manage.
  • Number of Links: For NN nodes, the total number of required links is calculated by the formula: N(N1)2\frac{N(N-1)}{2}.

Partial Mesh Topology

A partial mesh topology is a more practical approach where only some nodes are fully interconnected. Key nodes might be fully connected, while peripheral nodes are connected to only one or two other nodes.

Partial mesh

Core routers stay richly interconnected, while edge nodes keep fewer links to control cost.

Scenario

C1C2C3A1A2A3A4A5
ActiveBackupFailed

Installed links

8 / 28

Link saving vs full mesh

71%

Core resilience

3/3

Example path A1 -> A5

A1 -> C1 -> C2 -> A5

Any one core link can fail and traffic still reroutes through the third core node.

Modeled from RFC 8345 topology abstraction and RFC 4456 scalability tradeoffs between full and reduced peering.

This topology offers a balance between the high cost of a full mesh and the need for redundancy. It provides less redundancy than a full mesh but more than other topologies like star or bus. The internet's backbone is a large-scale example of a partial mesh network.

Ring Topology

In a ring topology, each node is connected to exactly two other nodes, forming a single continuous pathway for signals-a closed loop or ring. Data travels sequentially from node to node, typically in one direction.

Ring topology

Switch between an unprotected ring and ERPS-style protected ring, then inject a single link failure.

Mode

Faulted segmentNo fault
12345678
ActiveBlockedFailed

Forwarding links

8/8

Hops 1 -> 5

4

Service state

Normal

ERPS behavior follows ITU-T G.8032 / Y.1344: one link is blocked in normal state and unblocked after a fault for rapid switchover.

Characteristics

  • Advantages: A simple structure that is easy to install and manages bandwidth well, preventing collisions. It can also combine the benefits of mesh and star topologies when used in more complex configurations like dual-rings.
  • Disadvantages: A significant drawback is its vulnerability. The failure of a single node or a break in the cable can disrupt the entire network. Adding or removing nodes requires breaking the loop, which can cause network downtime.
  • Related Problems: The challenge of finding the shortest path that visits every node in a ring or mesh network exactly once is a famous computational problem known as the or finding a minimal .

Tree Topology

A tree topology combines characteristics of star and bus topologies. It features a hierarchical structure where nodes are organized like branches of a tree, with a single root node at the top. Each node, except the root, has exactly one parent node.

Tree topology

Adjust hierarchy depth and branching. Add a redundant lateral link and see how a spanning-tree style block restores loop-free forwarding.

Hierarchy levels3
Children per parent2
Selected leafL2N0
1121234

Installed links

6

Forwarding links

6

Path root -> leaf

L0N0 -> L1N0 -> L2N0

Tree rule

N - 1 forwarding links maintained

Tree forwarding behavior aligns with IEEE 802.1D / RFC 7727 concept: loop prevention keeps one logical tree while spare links stay blocked until needed.

Characteristics

  • Advantages: This topology is highly scalable, relatively easy to configure, and simple to manage. Fault isolation is straightforward, as a problem in a lower-level branch does not affect the rest of the network.
  • Disadvantages: Its primary weakness is the reliance on higher-level nodes. If a node in the upper hierarchy fails, the entire sub-tree of nodes beneath it can be cut off from the rest of the network.
  • Minimal Connections: In a tree with NN nodes, there are always N1N-1 links. This structure is known as a , which can be found using algorithms like Prim's or Kruskal's to connect all nodes with the lowest total cost.