Polynomial-Time Algorithm for the Regional SRLG-disjoint Paths Problem-Reference-Cited by-同舟云学术

Polynomial-Time Algorithm for the Regional SRLG-disjoint Paths Problem

Published:2022-05-02 Issue: Volume: Page:
ISSN:
Container-title:IEEE INFOCOM 2022 - IEEE Conference on Computer Communications
language:
Short-container-title:

Author:

Vass Balazs¹,Berczi-Kovacs Erika²,Barabas Abel²,Hajdu Zsombor Laszlo¹,Tapolcai Janos¹

Affiliation:

1. Budapest University of Technology and Economics (BME). B.V,MTA-BME Future Internet Research Group and MTA-BME Information Systems Research Group,Department of Telecommunication and Media Informatics, Faculty of Electrical Engineering and Informatics (VIK)

2. Eötvös Loránd University (ELTE),Department of Operations Research,Budapest,Hungary

Funder

Innovation Fund

Publisher

IEEE

Link

http://xplorestaging.ieee.org/ielx7/9796607/9796652/09796870.pdf?arnumber=9796870

Reference47 articles.

1. SRLG-diverse routing with the star property;bermond;Design of Reliable Communication Networks (DRCN 2003),2013

2. Induced Circuits in Planar Graphs

3. Alcatel-Lucent 7705 service aggregation router OS, MPLS guide,2013

4. Huawei NE20E-S Universal Service Router, feature description - MPLS,2018

5. Geographic max-flow and min-cut under a circular disk failure model

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Extension of the k-SPF algorithm for finding SRLG-disjoint primary and backup route pairs in optical networks;Journal of Optical Communications and Networking;2024-08-14

2. Efficient Computing of Disaster-Disjoint Paths: Greedy and Beyond;IEEE INFOCOM 2024 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS);2024-05-20

3. Efficient Algorithm for Region-Disjoint Survivable Routing in Backbone Networks;IEEE INFOCOM 2024 - IEEE Conference on Computer Communications;2024-05-20

4. Finding SRLG-Disjoint Primary and Backup Route Pairs using k-SPF algorithm in Optical Networks;GLOBECOM 2023 - 2023 IEEE Global Communications Conference;2023-12-04

5. A Whirling Dervish: Polynomial-Time Algorithm for the Regional SRLG-Disjoint Paths Problem;IEEE/ACM Transactions on Networking;2023-12