Performance modeling and optimization of networks of bridged LANs

Sanjay Gupta, Keith Ross

    Research output: Contribution to journalArticle

    Abstract

    An internetwork of LANs is modeled as a graph with LAN segments as edges and transparent bridges and repeaters as nodes. The graph model leads to a simple expression for the effective load on an arbitrary LAN segment, which takes into account the overhead traffic due to the learning mechanism of the transparent bridges. Simplifying assumptions for the operation of the MAC layer protocol lead to a simple expression for the average end-to-end delay in terms of the effective loads on the LAN segments. The problem of optimally locating bridges and repeaters on the nodes in order to minimize the average delay is then studied. It is shown that this problem is equivalent to the set partitioning problem, which is NP-complete, but for which good algorithms exist to solve large problems. The related problem of minimizing cost subject to a constraint on average end-to-end delay is also discussed. Finally, the problem of locating bridges and repeaters on a linear topology, as typically found in an office building with a large number of floors, is studied. This special case gives rise to an O(L2) algorithm, where L is the number of floors.

    Original languageEnglish (US)
    Pages (from-to)113-132
    Number of pages20
    JournalQueueing Systems
    Volume9
    Issue number1-2
    DOIs
    StatePublished - Mar 1991

    Fingerprint

    Local area networks
    Telecommunication repeaters
    Office buildings
    Topology
    Network protocols
    Modeling
    Costs
    Node

    Keywords

    • Bridges
    • data networks
    • LANs
    • network design
    • performance modeling

    ASJC Scopus subject areas

    • Management Science and Operations Research
    • Computer Science Applications
    • Computational Theory and Mathematics

    Cite this

    Performance modeling and optimization of networks of bridged LANs. / Gupta, Sanjay; Ross, Keith.

    In: Queueing Systems, Vol. 9, No. 1-2, 03.1991, p. 113-132.

    Research output: Contribution to journalArticle

    Gupta, Sanjay ; Ross, Keith. / Performance modeling and optimization of networks of bridged LANs. In: Queueing Systems. 1991 ; Vol. 9, No. 1-2. pp. 113-132.
    @article{97a6e885f0db45eeb2d989b8edc89e56,
    title = "Performance modeling and optimization of networks of bridged LANs",
    abstract = "An internetwork of LANs is modeled as a graph with LAN segments as edges and transparent bridges and repeaters as nodes. The graph model leads to a simple expression for the effective load on an arbitrary LAN segment, which takes into account the overhead traffic due to the learning mechanism of the transparent bridges. Simplifying assumptions for the operation of the MAC layer protocol lead to a simple expression for the average end-to-end delay in terms of the effective loads on the LAN segments. The problem of optimally locating bridges and repeaters on the nodes in order to minimize the average delay is then studied. It is shown that this problem is equivalent to the set partitioning problem, which is NP-complete, but for which good algorithms exist to solve large problems. The related problem of minimizing cost subject to a constraint on average end-to-end delay is also discussed. Finally, the problem of locating bridges and repeaters on a linear topology, as typically found in an office building with a large number of floors, is studied. This special case gives rise to an O(L2) algorithm, where L is the number of floors.",
    keywords = "Bridges, data networks, LANs, network design, performance modeling",
    author = "Sanjay Gupta and Keith Ross",
    year = "1991",
    month = "3",
    doi = "10.1007/BF01158794",
    language = "English (US)",
    volume = "9",
    pages = "113--132",
    journal = "Queueing Systems",
    issn = "0257-0130",
    publisher = "Springer Netherlands",
    number = "1-2",

    }

    TY - JOUR

    T1 - Performance modeling and optimization of networks of bridged LANs

    AU - Gupta, Sanjay

    AU - Ross, Keith

    PY - 1991/3

    Y1 - 1991/3

    N2 - An internetwork of LANs is modeled as a graph with LAN segments as edges and transparent bridges and repeaters as nodes. The graph model leads to a simple expression for the effective load on an arbitrary LAN segment, which takes into account the overhead traffic due to the learning mechanism of the transparent bridges. Simplifying assumptions for the operation of the MAC layer protocol lead to a simple expression for the average end-to-end delay in terms of the effective loads on the LAN segments. The problem of optimally locating bridges and repeaters on the nodes in order to minimize the average delay is then studied. It is shown that this problem is equivalent to the set partitioning problem, which is NP-complete, but for which good algorithms exist to solve large problems. The related problem of minimizing cost subject to a constraint on average end-to-end delay is also discussed. Finally, the problem of locating bridges and repeaters on a linear topology, as typically found in an office building with a large number of floors, is studied. This special case gives rise to an O(L2) algorithm, where L is the number of floors.

    AB - An internetwork of LANs is modeled as a graph with LAN segments as edges and transparent bridges and repeaters as nodes. The graph model leads to a simple expression for the effective load on an arbitrary LAN segment, which takes into account the overhead traffic due to the learning mechanism of the transparent bridges. Simplifying assumptions for the operation of the MAC layer protocol lead to a simple expression for the average end-to-end delay in terms of the effective loads on the LAN segments. The problem of optimally locating bridges and repeaters on the nodes in order to minimize the average delay is then studied. It is shown that this problem is equivalent to the set partitioning problem, which is NP-complete, but for which good algorithms exist to solve large problems. The related problem of minimizing cost subject to a constraint on average end-to-end delay is also discussed. Finally, the problem of locating bridges and repeaters on a linear topology, as typically found in an office building with a large number of floors, is studied. This special case gives rise to an O(L2) algorithm, where L is the number of floors.

    KW - Bridges

    KW - data networks

    KW - LANs

    KW - network design

    KW - performance modeling

    UR - http://www.scopus.com/inward/record.url?scp=0343165691&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0343165691&partnerID=8YFLogxK

    U2 - 10.1007/BF01158794

    DO - 10.1007/BF01158794

    M3 - Article

    AN - SCOPUS:0343165691

    VL - 9

    SP - 113

    EP - 132

    JO - Queueing Systems

    JF - Queueing Systems

    SN - 0257-0130

    IS - 1-2

    ER -