ILP Learning Mode — TSN/GCL Solver

3D Shuttle Network Topology

Drag to rotate · Scroll to zoom · Right-click to pan

Auto-solve on edit

Home

Global Parameters

Cycle Time (µs) Must be divisible by all flow periods

Guard Band (µs) Gap after each TSN frame

Processing Delay (µs) Switch forwarding latency per hop

Link Specifications

From	To	Rate (Mbps)	Prop Delay (µs)

Edit link rates and propagation delays, or add/remove links

Flow Specifications

	Flow	Src	Dst	Payload (B)	Period (µs)	Deadline (µs)	Priority	Tx Time	Pkts/Cycle

Edit flow parameters, add/remove flows. Changes auto-solve.

ILP Problem Size

Objective Function

Greedy vs ILP Comparison

Constraint Breakdown

Constraint Examples

Link Contention — Binary Variable Allocation

Link	Packets	Pairs	Binary Vars (y)	Window-Pruned

Per-Packet Scheduling Detail

Network Topology

Per-Switch GCL — Gate Control by Egress Port

Per-Link GCL Timeline (Gantt)

Packet E2E Delay

Link Utilization

Packet Schedule Table

Packet	Flow	Route	Release	End	E2E	Deadline	Slack	Status

Reference — ILP Formulation Basics

Tx Time Formula

Tx = (payload + 38) × 8 / rate
Ethernet overhead = 38 bytes: 7 preamble + 1 SFD + 14 header + 4 FCS + 12 IFG. Result in µs when rate is in Mbps.

Guard Band

Small gap (typically 3µs) after each TSN frame. Prevents frame interference from clock jitter. Gate closes: gate_mask = 00000000.

Priority & Gate Mask

8 traffic classes (TC0–TC7). LiDAR = P7, Radar = P6. Gate mask = 8-bit string, one per TC. 10000000 = only TC7 open.

Big-M Method

Disjunctive "A before B or B before A" requires binary y ∈ {0,1}:
s_B ≥ s_A + blk_A - M·y
s_A ≥ s_B + blk_B - M(1-y)
Per-pair tight M reduces LP relaxation gap.

Link Utilization

Util = Σ(flow + guard) / cycle × 100%
Remaining time = best-effort (BE). Bottleneck > 80% risks deadline misses.

Objective Function

min Σ s_{p,last_hop} over all TSN packets.
Minimizes total E2E delay sum. ILP = global optimum, Greedy = local heuristic.

▶ Customize Model (JSON)

▶ Raw GCL Output (JSON)