Queueing Systems

, Volume 9, Issue 1–2, pp 113–132 | Cite as

Performance modeling and optimization of networks of bridged LANs

  • Sanjay Gupta
  • Keith W. Ross
Article
Received:
Revised:

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 anO(L2) algorithm, whereL is the number of floors.

Keywords

Bridges LANs data networks network design performance modeling 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    F. Backes, Transparent bridges for interconection of IEEE 802 LANs, IEEE Network 2 (1988) 5–9.Google Scholar
  2. [2]
    E. Benhamou, Integerating bridges and routers in a large internetwork, IEEE Network 2 (1988) 65–71.Google Scholar
  3. [3]
    D. Bertsekas and R. Gallager,Data Networks (Prentice-Hall, Englewood Cliffs, NJ, 1987).Google Scholar
  4. [4]
    W. Bux, Local Area Networks: A performance comparison, IEEE Trans. Comm., COM-29 (1981) 1465–1473.Google Scholar
  5. [5]
    E.V. Denardo,Dynamic Programming: Models and Applications (Prentice-Hall, Englewood Cliffs, NJ, 1982).Google Scholar
  6. [6]
    M.L. Fisher and P. Kedia, Optimal solution of set covering/partitioning problems with dual heuristics, to appear in Manag. Sci. (1988).Google Scholar
  7. [7]
    M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, 1979).Google Scholar
  8. [8]
    M. Gondran and M. Minoux,Graphs and Algorithms (Wiley, Chichester, 1984).Google Scholar
  9. [9]
    S. Gupta, Performance modeling and optimization of interconnected Ethernets, Master's thesis, University of Pennsylvania, Dept. of Electrical Engineering (1989).Google Scholar
  10. [10]
    S.S. Lam, A carrier sense multiple access protocol for local networks, Computer Networks 4 (1980) 21–32.Google Scholar
  11. [11]
    M. Minoux, A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations, RAIRO Oper. Res. 21 (1988) 105–134.Google Scholar
  12. [12]
    G.L. Nemhauser and L.A. Wolsey,Integer and Combinatorial Optimization (Wiley, New York, 1988).Google Scholar
  13. [13]
    H. Salwen, R. Boule and J.N. Chiappa, Examination of the applicability of router and bridging techniques, IEEE Network 2 (1988) 77–80.Google Scholar
  14. [14]
    M. Schwartz,Telecommunication Networks: Protocols, Modeling and Analysis (Addison-Wesley, Reading, MA, 1987).Google Scholar
  15. [15]
    A.S. Tanenbaum,Computer Networks (Wiley, Chichester, 1988).Google Scholar

Copyright information

© J.C. Baltzer A.G. Scientific Publishing Company 1991

Authors and Affiliations

  • Sanjay Gupta
    • 1
  • Keith W. Ross
    • 1
  1. 1.Department of SystemsUniversity of PennsylvaniaPhiladelphiaUSA

Personalised recommendations