Skip to content

ROUTE_INFO_TABLE.md

Latest commit

 

History

History
102 lines (80 loc) · 3.48 KB

ROUTE_INFO_TABLE.md

File metadata and controls

102 lines (80 loc) · 3.48 KB
Raw

Complete Route Info Table

Overview

This document describes the complete routing table for the network. Each node maintains route_info entries that specify how traffic from different source nodes reaches it.

Network Topology

       fireapp-VirtualBox
          /          \
       usb0          eth0
        /              \
     1576  --------  f453
       |      eth1
     usb1
       |
      14cd

Route Info by Node

fireapp-VirtualBox

Routes showing how traffic from other nodes reaches fireapp-VirtualBox:

Source Node Incoming Interface Next Hop (iif_neigh_node) Path
1576 usb0 1576 Direct neighbor
14cd usb0 1576 14cd → 1576 → fireapp-VirtualBox
f453 eth0 f453 Direct neighbor

1576

Routes showing how traffic from other nodes reaches 1576:

Source Node Incoming Interface Next Hop (iif_neigh_node) Path
fireapp-VirtualBox usb0 fireapp-VirtualBox Direct neighbor
f453 eth1 f453 Direct neighbor
14cd usb1 14cd Direct neighbor

f453

Routes showing how traffic from other nodes reaches f453:

Source Node Incoming Interface Next Hop (iif_neigh_node) Path
fireapp-VirtualBox eth0 fireapp-VirtualBox Direct neighbor
1576 eth1 1576 Direct neighbor
14cd eth1 1576 14cd → 1576 → f453

14cd

Routes showing how traffic from other nodes reaches 14cd:

Source Node Incoming Interface Next Hop (iif_neigh_node) Path
1576 usb0 1576 Direct neighbor
fireapp-VirtualBox usb0 1576 fireapp-VirtualBox → 1576 → 14cd
f453 usb0 1576 f453 → 1576 → 14cd

Pathfinding Test Results

All paths now work bidirectionally:

Direct Connections (Single Hop)

  • ✅ 1576 ↔ fireapp-VirtualBox
  • ✅ f453 ↔ fireapp-VirtualBox
  • ✅ 14cd ↔ 1576
  • ✅ f453 ↔ 1576

Multi-Hop Paths (2 Hops)

  • ✅ 14cd → 1576 → fireapp-VirtualBox
  • ✅ fireapp-VirtualBox → 1576 → 14cd
  • ✅ f453 → 1576 → 14cd
  • ✅ 14cd → 1576 → f453

Route Info Format

Each route entry contains:

{
  "incoming_interface": "interface_name",
  "iif_neigh_node": "next_hop_node_id",
  "source_node": "source_node_id"
}
  • incoming_interface: The interface on the current node where traffic arrives
  • iif_neigh_node: The immediate neighbor from which traffic arrives (next hop in reverse)
  • source_node: The ultimate source of the traffic

How the Pathfinding Algorithm Uses This Data

  1. Direct neighbors: If source and target are directly connected, return single-hop path
  2. Forward direction: Look up target's route_info for an entry matching the source
  3. Trace backwards: Follow the next_hop chain from target back to source
  4. Reverse direction: If forward fails, try finding path from target to source and reverse it
  5. Build path: Construct the node sequence and edge IDs for visualization

Benefits

✅ Complete routing information: All possible paths are defined
✅ Bidirectional support: Paths work in both directions
✅ Multi-hop support: Handles paths through intermediate nodes
✅ Realistic routing: Based on actual network routing tables
✅ No graph search needed: Uses actual routing configuration