Vermilion: A Traffic-Aware Reconfigurable Optical Interconnect with Formal Throughput Guarantees
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909578956898304 |
|---|---|
| author | Addanki, Vamsi Avin, Chen Knabe, Goran Dario Patronas, Giannis Syrivelis, Dimitris Terzenidis, Nikos Bakopoulos, Paraskevas Marinos, Ilias Schmid, Stefan |
| author_facet | Addanki, Vamsi Avin, Chen Knabe, Goran Dario Patronas, Giannis Syrivelis, Dimitris Terzenidis, Nikos Bakopoulos, Paraskevas Marinos, Ilias Schmid, Stefan |
| contents | The increasing gap between datacenter traffic volume and the capacity of electrical switches has driven the development of reconfigurable network designs utilizing optical circuit switching. Recent advancements, particularly those featuring periodic fixed-duration reconfigurations, have achieved practical end-to-end delays of just a few microseconds. However, current designs rely on multi-hop routing to enhance utilization, which can lead to a significant reduction in worst-case throughput and added overhead from congestion control and routing complexity. These factors pose significant operational challenges for the large-scale deployment of these technologies.
We present Vermilion, a reconfigurable optical interconnect that breaks the throughput barrier of existing periodic reconfigurable networks, without the need for multi-hop routing -- thus eliminating congestion control and simplifying routing to direct communication. Vermilion adopts a traffic-aware approach while retaining the simplicity of periodic fixed-duration reconfigurations, similar to RotorNet. We formally establish throughput bounds for Vermilion, demonstrating that it achieves at least $33\%$ more throughput in the worst-case compared to existing designs. The key innovation of Vermilion is its short traffic-aware periodic schedule, derived using a matrix rounding technique. This schedule is then combined with a traffic-oblivious periodic schedule to efficiently manage any residual traffic. Our evaluation results support our theoretical findings, revealing significant performance gains for datacenter workloads. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_09892 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Vermilion: A Traffic-Aware Reconfigurable Optical Interconnect with Formal Throughput Guarantees Addanki, Vamsi Avin, Chen Knabe, Goran Dario Patronas, Giannis Syrivelis, Dimitris Terzenidis, Nikos Bakopoulos, Paraskevas Marinos, Ilias Schmid, Stefan Networking and Internet Architecture Data Structures and Algorithms The increasing gap between datacenter traffic volume and the capacity of electrical switches has driven the development of reconfigurable network designs utilizing optical circuit switching. Recent advancements, particularly those featuring periodic fixed-duration reconfigurations, have achieved practical end-to-end delays of just a few microseconds. However, current designs rely on multi-hop routing to enhance utilization, which can lead to a significant reduction in worst-case throughput and added overhead from congestion control and routing complexity. These factors pose significant operational challenges for the large-scale deployment of these technologies. We present Vermilion, a reconfigurable optical interconnect that breaks the throughput barrier of existing periodic reconfigurable networks, without the need for multi-hop routing -- thus eliminating congestion control and simplifying routing to direct communication. Vermilion adopts a traffic-aware approach while retaining the simplicity of periodic fixed-duration reconfigurations, similar to RotorNet. We formally establish throughput bounds for Vermilion, demonstrating that it achieves at least $33\%$ more throughput in the worst-case compared to existing designs. The key innovation of Vermilion is its short traffic-aware periodic schedule, derived using a matrix rounding technique. This schedule is then combined with a traffic-oblivious periodic schedule to efficiently manage any residual traffic. Our evaluation results support our theoretical findings, revealing significant performance gains for datacenter workloads. |
| title | Vermilion: A Traffic-Aware Reconfigurable Optical Interconnect with Formal Throughput Guarantees |
| topic | Networking and Internet Architecture Data Structures and Algorithms |
| url | https://arxiv.org/abs/2504.09892 |