Performance modeling and optimization of interconnected ethernets

Sanjay Gupta, Keith Ross

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    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 medium access control (MAC) layer protocol lead to a simple expression of 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 studied. This problem is equivalent to the set partitioning problem which can be readily solved with state-of-the-art algorithms. Minimizing cost subject to a constraint on average end-to-end delay is discussed. Locating bridges and repeaters on a linear topology, as typically found in an office building with a large number of floors, is also studied.

    Original languageEnglish (US)
    Title of host publicationProceedings - IEEE INFOCOM
    PublisherPubl by IEEE
    Pages1353-1359
    Number of pages7
    Volume3
    StatePublished - 1991
    EventProceedings of the 10th Annual Joint Conference of the IEEE and Communications Societies - IEEE INFOCOM '91 - Bal Harbour, FL, USA
    Duration: Apr 7 1991Apr 11 1991

    Other

    OtherProceedings of the 10th Annual Joint Conference of the IEEE and Communications Societies - IEEE INFOCOM '91
    CityBal Harbour, FL, USA
    Period4/7/914/11/91

    Fingerprint

    Ethernet
    Local area networks
    Telecommunication repeaters
    Office buildings
    Medium access control
    Topology
    Network protocols
    Costs

    ASJC Scopus subject areas

    • Hardware and Architecture
    • Electrical and Electronic Engineering

    Cite this

    Gupta, S., & Ross, K. (1991). Performance modeling and optimization of interconnected ethernets. In Proceedings - IEEE INFOCOM (Vol. 3, pp. 1353-1359). Publ by IEEE.

    Performance modeling and optimization of interconnected ethernets. / Gupta, Sanjay; Ross, Keith.

    Proceedings - IEEE INFOCOM. Vol. 3 Publ by IEEE, 1991. p. 1353-1359.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Gupta, S & Ross, K 1991, Performance modeling and optimization of interconnected ethernets. in Proceedings - IEEE INFOCOM. vol. 3, Publ by IEEE, pp. 1353-1359, Proceedings of the 10th Annual Joint Conference of the IEEE and Communications Societies - IEEE INFOCOM '91, Bal Harbour, FL, USA, 4/7/91.
    Gupta S, Ross K. Performance modeling and optimization of interconnected ethernets. In Proceedings - IEEE INFOCOM. Vol. 3. Publ by IEEE. 1991. p. 1353-1359
    Gupta, Sanjay ; Ross, Keith. / Performance modeling and optimization of interconnected ethernets. Proceedings - IEEE INFOCOM. Vol. 3 Publ by IEEE, 1991. pp. 1353-1359
    @inproceedings{2fd9dcef0be3485a9d299c324334925d,
    title = "Performance modeling and optimization of interconnected ethernets",
    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 medium access control (MAC) layer protocol lead to a simple expression of 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 studied. This problem is equivalent to the set partitioning problem which can be readily solved with state-of-the-art algorithms. Minimizing cost subject to a constraint on average end-to-end delay is discussed. Locating bridges and repeaters on a linear topology, as typically found in an office building with a large number of floors, is also studied.",
    author = "Sanjay Gupta and Keith Ross",
    year = "1991",
    language = "English (US)",
    volume = "3",
    pages = "1353--1359",
    booktitle = "Proceedings - IEEE INFOCOM",
    publisher = "Publ by IEEE",

    }

    TY - GEN

    T1 - Performance modeling and optimization of interconnected ethernets

    AU - Gupta, Sanjay

    AU - Ross, Keith

    PY - 1991

    Y1 - 1991

    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 medium access control (MAC) layer protocol lead to a simple expression of 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 studied. This problem is equivalent to the set partitioning problem which can be readily solved with state-of-the-art algorithms. Minimizing cost subject to a constraint on average end-to-end delay is discussed. Locating bridges and repeaters on a linear topology, as typically found in an office building with a large number of floors, is also studied.

    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 medium access control (MAC) layer protocol lead to a simple expression of 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 studied. This problem is equivalent to the set partitioning problem which can be readily solved with state-of-the-art algorithms. Minimizing cost subject to a constraint on average end-to-end delay is discussed. Locating bridges and repeaters on a linear topology, as typically found in an office building with a large number of floors, is also studied.

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

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

    M3 - Conference contribution

    VL - 3

    SP - 1353

    EP - 1359

    BT - Proceedings - IEEE INFOCOM

    PB - Publ by IEEE

    ER -