Efficient Algorithm for Region-Disjoint Survivable Routing in Backbone Networks

Erika R. Bérczi‐Kovács; Péter Gyimesi; Balázs Vass; János Tapolcai

doi:10.1109/infocom52122.2024.10621256

ScienceGate Book Chapters

JOURNAL ARTICLE

Efficient Algorithm for Region-Disjoint Survivable Routing in Backbone Networks

Erika R. Bérczi‐Kovács Péter Gyimesi Balázs Vass János Tapolcai

Year: 2024 Pages: 951-960

DOI: 10.1109/infocom52122.2024.10621256

Get Full-Text PDF Get Analytical Report

Keywords:

Computer science Disjoint sets Routing (electronic design automation) Computer network Algorithm design Distributed computing Routing algorithm Network routing Algorithm Routing protocol Mathematics Combinatorics

Metrics

Cited By

1.11

FWCI (Field Weighted Citation Impact)

Refs

0.72

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Optical Network Technologies

Physical Sciences → Engineering → Electrical and Electronic Engineering

Interconnection Networks and Systems

Physical Sciences → Computer Science → Computer Networks and Communications

Software-Defined Networks and 5G

Physical Sciences → Computer Science → Computer Networks and Communications

Efficient Algorithm for Region-Disjoint Survivable Routing in Backbone Networks

Metrics

Citation History

Topics

Related Documents

Efficient algorithms for physically-disjoint routing in survivable GMPLS/ASTN networks

DateLine: Efficient Algorithm for Computing Region Disjoint Paths in Backbone Networks

Survivable Node-Disjoint Routing in Multi-Domain Networks

RLDP: A novel risk-level disjoint protection routing algorithm with shared backup resources for survivable backbone optical transport networks

Survivable Routing with Risk-Level Disjoint in WDM Optical Networks