Open AccessCycle checking algorithm for verifying the connectivity of a fault tolerant network structure
Author(s) -
B Nethravathi,
V. N. Kamalesh
Publication year - 2018
Publication title -
international journal of engineering and technology
Language(s) - English
Resource type - Journals
ISSN - 2227-524X
DOI - 10.14419/ijet.v7i4.16282
Subject(s) - computer science , interconnection , network topology , distributed computing , fault tolerance , computer network , network simulation , survivability , network delay , key (lock) , network management station , algorithm , network architecture , computer security , network packet
The key challenges while designing a communication network structures and critical network topologies is to take accounts of aspects related to failures. Over years efforts are being made for constructing quality fault tolerance network structures. The performance of a network application depends on the stability and survivability of underlined interconnection network structure. Node –connectivity of a network graph is a globally accepted deterministic measure for measuring the fault tolerance in a network structure. Once the network is designed and constructed by any one of the existing design algorithm and claimed that the constructed network is k-connected network, this research paper proposes a cute cycle based method to verify the same.