Cycle checking algorithm for verifying the connectivity of a fault tolerant network structure

 
 
 
  • Abstract
  • Keywords
  • References
  • PDF
  • Abstract


    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.

     


  • Keywords


    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 pe

  • References


      [1] Edward Guillén, Jeisson Sánchez, Carlos O. Ramos , “A Model to Evaluate the Performance of IoT Applications” Proceedings of the International Multi Conference of Engineers and Computer Scientists, Vol I, IMECS 2017, March 15 - 17, 2017, Hong Kong.

      [2] Jose A. Peralta, Vladimir Sanchez Padilla, and Jessica Rodriguez Espinoza, “high availability WAN Implimentation with MPLS to improve Network Connectivity in a Financial Institution” Proceedings of the World Congress on Engineering and Computer Science, Vol I WCECS 2017, October 25-27, 2017, San Francisco, USA.

      [3] Kamalesh V. N. and Srivatsa S. K., “On the assignment of node number in a computer communication network”, Proc. Of World Congress on Engineering and Computers Science, IAENG, U.C. Berkley, USA, 2008, pp. 375-378.

      [4] JunmingXu: “Topological Structure and Analysis of Interconnection Networks”, Kluwer Academic Publishers (2002).

      [5] Douglas B. West: “Introduction to Graph Theory”, Pearson Education, Inc 2nd Edition, (2001).

      [6] SantanuSaha Ray,” Graph Theory with algorithms and its applications”, First Edition, 2013, Springer Publishers.

      [7] A. Avizienis, J.-c. J. Laprie, B. Randell, C. Landwehr, S. Member, "Basic Concepts and Taxonomy of Dependable and Secure Computing", IEEE Transactions on Dependable and Secure Computing, 2004.https://doi.org/10.1109/TDSC.2004.2.

      [8] Vijay Ahuja, “DESIGN AND ANALYSIS OF COMPUTER COMMUNICATION NETWORKS”, McGraw-Hill computer science series, 1987.

      [9] Nethravathi B. &Kamalesh, V. N. “On Survivability Testing and Computing the Node Connectivity of a Topological Structure of a Interconnection Network Graph”. Int. J. Adv. Net. Apl.,2016, Special Issue, pp 164-166

      [10] Nethravathi B. &Kamalesh, V. N. “Topological Design of Computer Communication Network Structures: A Comprehensive Review”. Ind. J. Sci. and Tech., 2016, vol 9(7), https://doi.org/10.17485/ijst/2016/v9i7/85211.

      [11] Nethravathi B, Kamalesh V.N, Nidhi H Kulakarni, and Apsara, M. B. “Analysis of Techniques for Isolation of Faults in Survivable Computer Networks”, at IEEE Xplore on 26th June 2017, https://doi.org/10.1109/ICEECCOT.2016.7955235.

      [12] Nethravathi B, Kamalesh V.N “Bisection Logic based Symmetric Algorithm for the Design of Fault Tolerance Survivable Wireless Communication Networks” at Intelligent Communication and Computational Technologies. Lecture Notes in Networks and Systems, vol 19.2018, Springer, Singapore. https://doi.org/10.1007/978-981-10-5523-2_19.

      [13] Kamalesh V.N, Srivatsa S.K. “On the design of minimum cost survivable network topologies”.15th National conferences on communication, IIT; Guwahati: India; 2009. p. 394–97.

      [14] Kamalesh V. N. and Srivatsa S. K., “Adjacency matrix based method to compute the node connectivity of a computer communication network”, Int. Journal of Computer Science, 2010, Issues, vol. 7, pp. 62-67.

      [15] David Tipper, Resilient network design: challenges and future directions, Telecommunications Systems, v.56 n.1, p.5-16, May 2014https://doi.org/10.1007/s11235-013-9815-x.

      [16] AbdulazizAlashaikh, Teresa Gomes, David Tipper, “The Spine concept for improving network availability”, Elsevier, Computer Networks, Volume 82, 8 May 2015, Pages 4-19.https://doi.org/10.1016/j.comnet.2015.02.020.

      [17] Nethravathi B, Kamalesh V.N, “Graph Theoretical Model and Algorithm to Compute Maximum Connectivity for Fault Tolerance” accepted for publish in International Journal of Engineering and Technology (UAE).


 

View

Download

Article ID: 16282
 
DOI: 10.14419/ijet.v7i4.16282




Copyright © 2012-2015 Science Publishing Corporation Inc. All rights reserved.