Entropy H = path distribution diversity; Temperature T = hub concentration (Gini-like); Free energy F = mean_cost − λ·H_norm; Loop pressure = fraction of paths touching cycles; Viscosity = (1 − path_diversity)·T.
Path probability = fraction of traceroutes that used this exact path (count/total paths). When each source has one path, equal counts give equal probability.
| # | Path | Probability | Count |
|---|---|---|---|
| 1 | C3->Fz->Pz->F3->P3->T7->F7->P7->O2->Cz->P4->P8->O2 | 0.052632 | 1/19 |
| 2 | C4->F3->Pz->F7->T7->P3->P7->O2->Cz->P4->Fz->O1->T8 | 0.052632 | 1/19 |
| 3 | Cz->O2->P8->P4->F3->Pz->F7->T7->P3->P7->O1->T8->O1 | 0.052632 | 1/19 |
| 4 | F3->Pz->F7->T7->P3->P7->O2->Cz->P4->Fz->C4->F3 | 0.052632 | 1/19 |
| 5 | F4 | 0.052632 | 1/19 |
Hub load = fraction of paths that pass through this node (paths through node / total paths). Differs per node; high load = bottleneck.
| # | Node | Load | Paths through |
|---|---|---|---|
| 1 | Cz | 0.736842 | 14/19 |
| 2 | O2 | 0.736842 | 14/19 |
| 3 | F3 | 0.684211 | 13/19 |
| 4 | F7 | 0.684211 | 13/19 |
| 5 | P3 | 0.684211 | 13/19 |
Path probability = fraction of traceroutes that used this exact path (count/total paths). When each source has one path, equal counts give equal probability.
| # | Path | Probability | Count |
|---|---|---|---|
| 1 | C3->Fz->P3->F8->Pz->Cz->P7->P4->F7->Fp1->T7->O1->F3 | 0.052632 | 1/19 |
| 2 | C4->Cz->P3->F8->Pz->P4->F7->Fp1->T7->O1->F3->P7->P8 | 0.052632 | 1/19 |
| 3 | Cz->P3->F8->Pz->P4->F7->Fp1->T7->O1->F3->P7->P8->T8 | 0.052632 | 1/19 |
| 4 | F3->P7->Pz->Cz->P3->F8->Pz | 0.052632 | 1/19 |
| 5 | F4->P4->Pz->Cz->P3->F8->Pz | 0.052632 | 1/19 |
Hub load = fraction of paths that pass through this node (paths through node / total paths). Differs per node; high load = bottleneck.
| # | Node | Load | Paths through |
|---|---|---|---|
| 1 | Cz | 0.947368 | 18/19 |
| 2 | F8 | 0.947368 | 18/19 |
| 3 | P3 | 0.947368 | 18/19 |
| 4 | Pz | 0.947368 | 18/19 |
| 5 | P7 | 0.578947 | 11/19 |
Path probability = fraction of traceroutes that used this exact path (count/total paths). When each source has one path, equal counts give equal probability.
| # | Path | Probability | Count |
|---|---|---|---|
| 1 | C3 | 0.052632 | 1/19 |
| 2 | C4->F8->Pz->P7->O2->P8->P3->P8 | 0.052632 | 1/19 |
| 3 | Cz->O2->P8->Pz->P7->T7->F3->F7->Fp1->O1->Fp2->C4->F8 | 0.052632 | 1/19 |
| 4 | F3->F7->Fp1->O1->Fp2->C4->F8->Pz->P7->O2->P8->P3->P8 | 0.052632 | 1/19 |
| 5 | F4->Fp2->O1->Fp1->F7->F3->F8->Pz->P7->O2->P8->P3->P8 | 0.052632 | 1/19 |
Hub load = fraction of paths that pass through this node (paths through node / total paths). Differs per node; high load = bottleneck.
| # | Node | Load | Paths through |
|---|---|---|---|
| 1 | O2 | 0.894737 | 17/19 |
| 2 | P7 | 0.894737 | 17/19 |
| 3 | P8 | 0.894737 | 17/19 |
| 4 | Pz | 0.894737 | 17/19 |
| 5 | Fp1 | 0.684211 | 13/19 |
Path probability = fraction of traceroutes that used this exact path (count/total paths). When each source has one path, equal counts give equal probability.
| # | Path | Probability | Count |
|---|---|---|---|
| 1 | C3->F8->P7->O1->F4->Fz->C4->T8->O2->Fp1->F3->T7->F3 | 0.052632 | 1/19 |
| 2 | C4->T8->F8->P7->O1->F4->Fz->F3->T7->Fp1->O1 | 0.052632 | 1/19 |
| 3 | Cz->Pz->F8->P7->O1->F4->Fz->C4->T8->O2->Fp1->F3->T7 | 0.052632 | 1/19 |
| 4 | F3->T7->P7->O1->F4->Fz->C4->T8->F8->P3->Fp1->O1 | 0.052632 | 1/19 |
| 5 | F4->Fz->C4->T8->F8->P7->O1->Cz->Pz->Fp2->F3->T7->Fp1 | 0.052632 | 1/19 |
Hub load = fraction of paths that pass through this node (paths through node / total paths). Differs per node; high load = bottleneck.
| # | Node | Load | Paths through |
|---|---|---|---|
| 1 | C4 | 0.947368 | 18/19 |
| 2 | F4 | 0.947368 | 18/19 |
| 3 | F8 | 0.947368 | 18/19 |
| 4 | Fz | 0.947368 | 18/19 |
| 5 | O1 | 0.947368 | 18/19 |
Path probability = fraction of traceroutes that used this exact path (count/total paths). When each source has one path, equal counts give equal probability.
| # | Path | Probability | Count |
|---|---|---|---|
| 1 | C3->O1->Cz->O2->P7->T8->F8->C4->Fz->P4->Pz->P3->T7 | 0.052632 | 1/19 |
| 2 | C4->O1->Cz->O2->P7->T8->C3->F7->F3->F7 | 0.052632 | 1/19 |
| 3 | Cz->O1->O2->P7->T8->C3->F7->F3->C4->F8->C4 | 0.052632 | 1/19 |
| 4 | F3->F7->C3->O1->Cz->O2->P7->T8->F8->C4->Fz->P4->Pz | 0.052632 | 1/19 |
| 5 | F4->C4->O1->Cz->O2->P7->T8->C3->F7->F3->F7 | 0.052632 | 1/19 |
Hub load = fraction of paths that pass through this node (paths through node / total paths). Differs per node; high load = bottleneck.
| # | Node | Load | Paths through |
|---|---|---|---|
| 1 | C3 | 0.947368 | 18/19 |
| 2 | Cz | 0.947368 | 18/19 |
| 3 | O1 | 0.947368 | 18/19 |
| 4 | O2 | 0.947368 | 18/19 |
| 5 | T8 | 0.947368 | 18/19 |