Fault tolerant queries in computer networks

1988 ◽  
pp. 30-40
Author(s):  
Alan Baratz ◽  
Inder Gopal ◽  
Adrian Segall
Keyword(s):  
Computer Networks ◽  
Fault Tolerant

Fault tolerant queries in computer networks

1994 ◽  
Vol 42 (1) ◽  
pp. 100-109 ◽  
Author(s):  
A. Baratz ◽  
I. Gopal ◽  
A. Segall
Keyword(s):  
Computer Networks ◽  
Fault Tolerant

scholarly journals On Fault-Tolerant Resolving Sets of Some Families of Ladder Networks

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-6
Author(s):  
Hua Wang ◽  
Muhammad Azeem ◽  
Muhammad Faisal Nadeem ◽  
Ata Ur-Rehman ◽  
Adnan Aslam
Keyword(s):  
Computer Networks ◽  
Computer Network ◽  
Fault Tolerant ◽  
Metric Dimension ◽  
Resolving Set ◽  
Arbitrary Vertex

In computer networks, vertices represent hosts or servers, and edges represent as the connecting medium between them. In localization, some special vertices (resolving sets) are selected to locate the position of all vertices in a computer network. If an arbitrary vertex stopped working and selected vertices still remain the resolving set, then the chosen set is called as the fault-tolerant resolving set. The least number of vertices in such resolving sets is called the fault-tolerant metric dimension of the network. Because of the variety of applications of the metric dimension in different areas of sciences, many generalizations were proposed, and fault tolerant is one of them. In this paper, we computed the fault-tolerant metric dimension of triangular snake, ladder, Mobius ladder, and hexagonal ladder networks. It is important to observe that, in all these classes of networks, the fault-tolerant metric dimension and metric dimension differ by 1.

Sign in / Sign up

Export Citation Format

Share Document