Open AccessEvaluating on Topology Survivability Based on Largest Number of Node-Disjoint Paths
Author(s) -
Qiurong Chen
Publication year - 2020
Publication title -
journal of networking and telecommunications
Language(s) - English
Resource type - Journals
ISSN - 2661-4065
DOI - 10.18282/jnt.v2i3.1107
Subject(s) - survivability , topology (electrical circuits) , node (physics) , disjoint sets , metric (unit) , computer science , network topology , path (computing) , logical topology , computer network , mathematics , distributed computing , discrete mathematics , engineering , combinatorics , operations management , structural engineering
On the point of view of Largest Number of Node-Disjoint Path (LNNDP for short) between a node pair in a network, this article states the importance of LNNDP to global survivability of topology at first, then proposes an algorithm to compute maximal number of node-disjoint paths between node pairs. A new topology survivability metric based on LNNDP is put forward to evaluate the global survivability of network topology. It can be used to evaluate the survivability of topology provided. This metric can express accurately global topology survivability.