pith. sign in
Pith Number

pith:TF5OSTMF

pith:2026:TF5OSTMFEJ5GGYZ3VEXVWGTBBJ
not attested not anchored not stored refs resolved

Bridge: Optimizing Collective Communication Schedules in Reconfigurable Networks with Reusable Subrings

Anton Juerss, Stefan Schmid

Bridge reconfigures optical networks with reusable subrings to amortize delays across collective communication steps.

arxiv:2605.12766 v1 · 2026-05-12 · cs.NI

Add to your LaTeX paper
\usepackage{pith}
\pithnumber{TF5OSTMFEJ5GGYZ3VEXVWGTBBJ}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp
2 Internet Archive
3 Author claim open · sign in to claim
4 Citations open
5 Replications open
Portable graph bundle live · download bundle · merged state
The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

Our evaluation shows that Bridge reduces All-to-All completion time by typically 3× to 10× over static baselines even with millisecond-scale reconfiguration delays. For AllReduce, Bridge uniformly outperforms existing reconfiguration strategies, delivers up to 1.5× speedup, and exceeds the bandwidth-optimal Ring algorithm by 1.5× to 6.6× on low to moderate-sized workloads.

C2weakest assumption

That collective communication traffic exactly follows Bruck's pattern structure and that future communication partners can be predicted well enough to set up reusable subrings without frequent extra reconfigurations.

C3one line summary

Bridge reduces All-to-All completion time by typically 3x to 10x and improves AllReduce by up to 6.6x over Ring by reusing optical subrings across multiple steps in reconfigurable networks.

References

35 extracted · 35 resolved · 0 Pith anchors

[1] [n. d.]. ns-3 Network Simulator. https://www.nsnam.org/. Accessed: 2026-03-26 2026
[2] Vamsi Addanki. 2025. When Light Bends to the Collective Will: A The- ory and Vision for Adaptive Photonic Scale-up Domains. InProceedings of the 24th ACM Workshop on Hot Topics in Networks(UMD Campus, 2025 · doi:10.1145/3772356.3772395
[3] Vamsi Addanki, Chen Avin, and Stefan Schmid. 2023. Mars: Near- Optimal Throughput with Shallow Buffers in Reconfigurable Data- center Networks.Proc. ACM Meas. Anal. Comput. Syst.7, 1, Article 2 (March 2023 · doi:10.1145/3579312
[4] Daniel Amir, Nitika Saran, Tegan Wilson, Robert Kleinberg, Vishal Shrivastav, and Hakim Weatherspoon. 2024. Shale: A Practical, Scal- able Oblivious Reconfigurable Network. InProceedings of the ACM SI 2024 · doi:10.1145/3651890.3672248
[5] Chen Avin and Stefan Schmid. 2019. Toward demand-aware network- ing: a theory for self-adjusting networks.SIGCOMM Comput. Commun. Rev.48, 5 (Jan. 2019), 31–40. doi:10.1145/3310165.3310170 2019 · doi:10.1145/3310165.3310170
Receipt and verification
First computed 2026-05-18T03:09:48.243441Z
Builder pith-number-builder-2026-05-17-v1
Signature Pith Ed25519 (pith-v1-2026-05) · public key
Schema pith-number/v1.0

Canonical hash

997ae94d85227a63633ba92f5b1a610a4e31fb95df74aa59cd9de1b3c0d003d4

Aliases

arxiv: 2605.12766 · arxiv_version: 2605.12766v1 · doi: 10.48550/arxiv.2605.12766 · pith_short_12: TF5OSTMFEJ5G · pith_short_16: TF5OSTMFEJ5GGYZ3 · pith_short_8: TF5OSTMF
Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/TF5OSTMFEJ5GGYZ3VEXVWGTBBJ \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: 997ae94d85227a63633ba92f5b1a610a4e31fb95df74aa59cd9de1b3c0d003d4
Canonical record JSON
{
  "metadata": {
    "abstract_canon_sha256": "7e84ed2820587e3d1f6667516adabaa28c70a00c5322dcc8ef9c861c0a1aa317",
    "cross_cats_sorted": [],
    "license": "http://creativecommons.org/licenses/by-nc-nd/4.0/",
    "primary_cat": "cs.NI",
    "submitted_at": "2026-05-12T21:30:46Z",
    "title_canon_sha256": "9ab1bd087ce865a44430de1f297922e98a1e5df9eac366c91df7313f449bad23"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.12766",
    "kind": "arxiv",
    "version": 1
  }
}