Optimasi Jaringan dengan Spanning Tree untuk Congestion Management

Authors

  • Mayliana Mayliana Bina Nusantara University

DOI:

https://doi.org/10.21512/comtech.v5i1.2582

Keywords:

network optimization, spanning tree, congestion management

Abstract

A proper network optimization is needed to deal with problems on the network and to minimize latency in the data flow in a dense network. The data stream is directed into the right channels so that the optimal network speed and latency can be minimized. Spanning tree is one of the algorithms that can be used. The purpose of the Spanning tree is to prevent and reduce the loops in the network by negotiating free path and as well as to increase network uptime through redundancy (back-up). To comprehend spanning tree, the first important thing to know is how bridges and switches perform their functions. The more switches used, the use of the spanning tree becomes more important. With the spanning tree protocol, a broadcast storm can be prevented that can achieved network optimization.

Dimensions

Plum Analytics

References

Arora S., Garg M.L. (2013). Neighborhood Search for the Bounded Diameter Minimum Spaning Tree. International Journal of Emerging Technology and Advanced Engineering, 3 (2).

Atif, Syed Muhammad. (2011). RRSTP: A spanning tree protocol for obviating count-to-infinity from switched ethernet networks. International Journal of Computer Networks (IJCN), 3 (1).

Keerthana, L., Sampoomam, K.P. (2012). Improved multispanning tree routing using efficient and reliable routing algorithm for irregular networks. International Journal of Electronics and Computer Science Engineering.

Lammle, Todd. (2002). CCNA: Cisco Certified Network Associate Study Guide (3rd ed.). Alameda: SYBEX.

Downloads

Published

2014-06-30

Issue

Section

Articles
Abstract 422  .
PDF downloaded 486  .