Brief Announcement: A Stabilizing Algorithm for Finding Two Node-Disjoint Paths

被引：0

作者：

Rachid, Hadid ^{[1
]}

Karaata, Mehmet Hakan ^{[2
]}

Villain, Vincent ^{[3
]}

机构：

[1] Istanbul Aydin Univ, Dept Comp Engn, Besyol Mah,Inonu Cad 38 Kucukcekmece, Istanbul, Turkey

[2] Dept Comp Sci, Safat, Kuwait

[3] Univ Picardie Jules Verne, MIS, Amiens, France

来源：

STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, SSS 2014 | 2014年 / 8756卷

关键词：

Two node disjoint paths; distributed systems; stabilization; NETWORKS;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We present the first adaptive stabilizing algorithm for finding two node disjoint paths in anonymous arbitrary networks. Given a graph G = (V, E), two paths from source s epsilon V to target t epsilon V are said to be node disjoint if they do not share any nodes except for the endpoints. The proposed algorithm adapts to topology changes in the form of process/link crashes and additions, i.e., upon a topology change, it finds two disjoint paths from s to t. The algorithm has a wide range of applications in ensuring reliability and security of sensor, mobile and fixed communication networks.

引用

页码：359 / 361

页数：3

共 50 条

[1] A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks
Hadid, Rachid
Karaata, Mehmet Hakan
Villain, Vincent
[J]. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2017, 28 (04) : 411 - 435
[2] Brief Announcement: A Stabilizing Algorithm for Finding Two Disjoint Paths in Arbitrary Networks
Karaata, Mehmet Hakan
Hadid, Rachid
[J]. STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, PROCEEDINGS, 2009, 5873 : 789 - +
[3] An algorithm for finding two node-disjoint paths in arbitrary graphs
Karaata, Mehmet Hakan
[J]. Journal of Computing and Information Technology, 2019, 27 (03) : 1 - 14
[4] Brief Announcement: A Stabilizing Algorithm for Finding Two Edge-Disjoint Paths in Arbitrary Graphs
Al-Azemi, Fawaz M.
Karaata, Mehmet Hakan
[J]. STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, 2011, 6976 : 433 - 434
[5] An algorithm for node-disjoint paths in pancake graphs
Suzuki, Y
Kaneko, K
[J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2003, E86D (03) : 610 - 615
[6] Node-disjoint paths algorithm in a transposition graph
Suzuki, Yasuto
Kaneko, Keiichi
Nakamori, Mario
[J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2006, E89D (10) : 2600 - 2605
[7] Two node-disjoint paths in balanced hypercubes
Cheng, Dongqin
Hao, Rong-Xia
Feng, Yan-Quan
[J]. APPLIED MATHEMATICS AND COMPUTATION, 2014, 242 : 127 - 142
[8] A distributed routing protocol for finding two node-disjoint paths in computer networks
Ishida, K
Kakuda, Y
Kikuno, T
Amano, K
[J]. IEICE TRANSACTIONS ON COMMUNICATIONS, 1999, E82B (06) : 851 - 858
[9] An Inherently Stabilizing Algorithm for Node-To-Node Routing over All Shortest Node-Disjoint Paths in Hypercube Networks
Sinanoglu, Ozgur
Karaata, Mehmet Hakan
AlBdaiwi, Bader
[J]. IEEE TRANSACTIONS ON COMPUTERS, 2010, 59 (07) : 995 - 999
[10] Node-disjoint paths in a transposition graph
Suzuki, Y
Kaneko, K
Nakamori, M
[J]. PDPTA '04: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS 1-3, 2004, : 298 - 304

← 1 2 3 4 5 →