IDEAS home Printed from https://ideas.repec.org/a/alg/jijdte/v1y2016i1p13-23.html
   My bibliography  Save this article

Achieving Optimal Redundancy in a Small Business Network

Author

Listed:
  • Silvio Papic

    () (University College Algebra)

Abstract

Redundancy is a highly desirable element of the network, but sometimes it is not so easy to find the optimal level of redundancy that will ensure satisfactory performance of the entire network and at the same time being affordable and easy to implement. Redundancy in the network can be performed in several ways, which can be compatible and co-exist in the network, but can also be mutually exclusive. Although at first it seems that the redundancy depends only on the size of the network, this is not entirely true. One of the main factors to take into account is the complexity of the network and the importance of services and applications that serve the company's business and its customers. Network redundancy can be achieved in various ways. STP for example is the most basic mechanism but has several major drawbacks like underutilization of some links. Also link aggregation mechanisms could be used, which usually means investing in optical transcievers which implies a certain cost, and if one is using switch stacking it will further increase costs. For gateway redundancy one of FHRP protocols can be used which is certainly desirable. This paper will describe the redundancy in Small and Medium networks with few hundred clients and one way how to ensure redundancy by using various mechanisms such as the STP protocol, link aggregation, implementation of FHRP for gateway redundancy and using stackable switches with short analysis of recovery times for these mechanisms.

Suggested Citation

  • Silvio Papic, 2016. "Achieving Optimal Redundancy in a Small Business Network," International Journal of Digital Technology and Economy, Algebra University College, vol. 1(1), pages 13-23, June.
  • Handle: RePEc:alg:jijdte:v:1:y:2016:i:1:p:13-23
    as

    Download full text from publisher

    File URL: http://algebra.hr/publications//ijdte/vol1_iss1/IJDTE_01_01_2016_P2.pdf
    Download Restriction: no

    More about this item

    Keywords

    STP; link aggregation; stacking; FHRP;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:alg:jijdte:v:1:y:2016:i:1:p:13-23. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Robert Kopal). General contact details of provider: https://algebra.university/ .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.