Abstract
A path computation method is described for optical networks in which adjacent nodes are joined by two or more parallel fiber pairs, called rails. Parallel rails are collapsed into an aggregate edge only where a node connectivity matrix certifies that the grouped rails are interchangeable for the ingress to egress transition at issue. Routing runs on the collapsed graph, and the aggregate is expanded into constraint-consistent subsets only along selected candidate routes and only at constrained nodes, partial connectivity being one such constraint. The resulting section path is feasible by construction, is validated for optical feasibility once per section rather than once per rail combination, and is back-mapped to individual rails so that spectrum shared by overlapping candidates is credited once. Frequency slot assignment propagates per-slot rail reachability across section boundaries. Routing cost is independent of rail count, and overall cost is polynomial rather than exponential in it.
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Recommended Citation
Anonymous, "Constraint-Preserving Rail Aggregation for Routing and Spectrum Assignment in Multi-Fiber Optical Networks", Technical Disclosure Commons, (October 21, 2026)
https://www.tdcommons.org/dpubs_series/12363