Enhancing fault tolerance capabilities in quorum-based cycle routing
Cory J. Kleinheksel, Arun K. Somani

TL;DR
This paper introduces a generalized R redundancy cycle technique for optical networks that enhances fault tolerance while significantly reducing resource usage by using only single cycles instead of paired cycles.
Contribution
It proposes a novel R redundancy cycle method that nearly halves resource requirements and maintains high fault coverage, improving upon traditional paired cycle approaches.
Findings
Achieves 93.23-99.34% fault coverage with two faults
Reduces resource usage by 38.85-42.39%
Uses only single cycles instead of paired cycles
Abstract
In this paper we propose a generalized R redundancy cycle technique that provides optical networks almost fault-tolerant communications. More importantly, when applied using only single cycles rather than the standard paired cycles, the generalized R redundancy technique is shown to almost halve the necessary light-trail resources in the network while maintaining the fault-tolerance and dependability expected from cycle-based routing. For efficiency and distributed control, it is common in distributed systems and algorithms to group nodes into intersecting sets referred to as quorum sets. Optimal communication quorum sets forming optical cycles based on light-trails have been shown to flexibly and efficiently route both point-to-point and multipoint-to-multipoint traffic requests. Commonly cycle routing techniques will use pairs of cycles to achieve both routing and fault-tolerance,…
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.
