Fabric-Wide, Penalty-Optimized Path Routing Algorithms for Integrated Optical Switches

We propose a generic path routing algorithm that opts for the most favorable switch configuration set by an algorithmically-defined weighting-factor, which optimizes fabric-wide penalties and corrects for fabrication variations. Results demonstrate significant power penalty improvements.

Saved in:
Bibliographic Details
Published in2019 Optical Fiber Communications Conference and Exhibition (OFC) pp. 1 - 3
Main Authors Cheng, Qixiang, Huang, Yishen, Bahadori, Meisam, Zhou, Ji, Glick, Madeleine, Bergman, Keren
Format Conference Proceeding
LanguageEnglish
Published OSA 01.03.2019
Subjects
Crosstalk
Optical switches
Photonics
Routing
Silicon
Tuning
Online AccessGet full text
DOI10.1364/ofc.2019.th3a.4

Cover

More Information
Summary:We propose a generic path routing algorithm that opts for the most favorable switch configuration set by an algorithmically-defined weighting-factor, which optimizes fabric-wide penalties and corrects for fabrication variations. Results demonstrate significant power penalty improvements.
DOI:10.1364/ofc.2019.th3a.4