TDSR: Transparent Distributed Segment-Based Routing
Juan-Jos\'e Crespo, German Maglione-Mathey, Jos\'e L. S\'anchez,, Francisco J. Alfaro-Cort\'es, Jos\'e Flich
TL;DR
TDSR is a topology-agnostic routing algorithm designed to maintain network connectivity in irregular topologies caused by device degradation and manufacturing variability, demonstrated on mesh networks with defective links.
Contribution
The paper introduces TDSR, a novel distributed segment-based routing algorithm that guarantees connectivity across arbitrary topologies, addressing reliability issues in future scalable interconnection networks.
Findings
Successfully applied to mesh networks with defective links
Guarantees connectivity in irregular topologies
Handles switch discovery in any topology
Abstract
Component reliability and performance pose a great challenge for interconnection networks. Future technology scaling such as transistor integration capacity in VLSI design will result in higher device degradation and manufacture variability. As a consequence, changes in the network arise, often rendering irregular topologies. This paper proposes a topology-agnostic distributed segment-based algorithm able to handle switch discovery in any topology while guaranteeing connectivity among switches. The proposal, known as Transparent Distributed Segment-Based Routing (TDSR), has been applied to meshes with defective link configurations.
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.
Taxonomy
TopicsInterconnection Networks and Systems · VLSI and FPGA Design Techniques · VLSI and Analog Circuit Testing