International Journal of Computer Theory and Engineering

Frequency: Quarterly
ISSN: 1793-8201 (Print), 2972-4511 (Online)
Publisher:IACSIT Press

OPEN ACCESS
4.0
CiteScore

IJCTE 2018 Vol.10(3): 101-104
doi: 10.7763/IJCTE.2018.V10.1207

Redundancy Avoiding Algorithm in Network

Sanjeev Gangwar , Santosh Kumar Yadav , Ashok Kumar Yadav

  • Department of Computer Application, VBS Purvanchal University Jaunpur (U.P.), India.

Abstract

Computer connects to the internet with single path, does not more reliable because many problems occur such as cable cutting device fail etc. For finding more reliable, we need two or more paths between switches. Multiple path between two system is insure that more reliable. But occurs a problem that is redundancy problem and creates a cycle. According to switch concept data move between two systems continuously, for this activity switch work very slow or shutdown. We can remove this problem using a bridge protocol data unit concept. In which easily finds the cycle in a network or not. If a cycle between switch devices so need to remove the cycle. We use new spanning tree avoiding algorithms which break the cycle and improve the efficiency of the network.

Keywords

  • Root bridge
  • root port
  • redundant connection between switches
  • BPDU
1207-G1687

How to Cite

Copied

Sanjeev Gangwar, Santosh Kumar Yadav, and Ashok Kumar Yadav, "Redundancy Avoiding Algorithm in Network," International Journal of Computer Theory and Engineering, vol. 10, no. 3, pp. 101-104, 2018. https://doi.org/10.7763/IJCTE.2018.V10.1207

Copyright & License

Copyright © 2018 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Article Metrics in Dimensions

Menu