Fast optical layer mesh protection using pre-cross-connected trails
Timothy Y. Chow, Fabian Chudak, Anthony M. Ffrench

TL;DR
This paper introduces pre-cross-connected trails (PXTs), a flexible protection scheme for optical networks that achieves fast restoration times and bandwidth efficiency comparable to shared mesh protection, overcoming limitations of p-cycles.
Contribution
The paper proposes PXTs as a new protection structure that combines the speed of ring-based schemes with the flexibility of mesh protection, suitable for dynamic traffic.
Findings
PXTs enable restoration within 50 ms.
Bandwidth efficiency comparable to shared mesh protection.
Flexible adaptation to static and dynamic traffic.
Abstract
Conventional optical networks are based on SONET rings, but since rings are known to use bandwidth inefficiently, there has been much research into shared mesh protection, which promises significant bandwidth savings. Unfortunately, most shared mesh protection schemes cannot guarantee that failed traffic will be restored within the 50 ms timeframe that SONET standards specify. A notable exception is the p-cycle scheme of Grover and Stamatelakis. We argue, however, that p-cycles have certain limitations, e.g., there is no easy way to adapt p-cycles to a path-based protection scheme, and p-cycles seem more suited to static traffic than to dynamic traffic. In this paper we show that the key to fast restoration times is not a ring-like topology per se, but rather the ability to pre-cross-connect protection paths. This leads to the concept of a pre-cross-connected trail or PXT, which is a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
