Annals of Operations Research

, Volume 36, Issue 1, pp 275–297 | Cite as

Optimal design of LAN-WAN internetworks: An approach using simulated annealing

  • Peter C. Fetterolf
  • G. Anandalingam


This paper addresses the problem of designing LAN-WAN (Local Area Network, Wide Area Network) computer networks with transparent bridges. Bridges are high performance devices that are used to interconnect LANs at the MAC (Medium Access Control) level in the protocol hierarchy. LANs in remote areas are connected by leased telecommunications lines such as T1 and DDS. A requirement of transparent bridges is that networks must be configured in a spanning tree topology. We have developed mathematical models of LAN-WAN networks and formulated an optimization problem. This problem is a nonconvex, nonlinear, mixed integer program. A simulated annealing algorithm is proposed. The algorithm generates sequences of neighboring spanning trees and evaluates design constraints based on maximum flow, bridge capacity, and end-to-end delay. As the annealing temperature parameter is lowered the algorithm moves towards the global optimal solution. Experimental results have shown that LAN-WAN designs using simulated annealing are better than 99.99% of all feasible designs.


Simulated Annealing Access Control Span Tree Medium Access Control Area Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    E. Aarts and J. Korst,Simulated Annealing and Boltzmann Machines (Wiley, 1989).Google Scholar
  2. [2]
    E. Aarts and P.J. Van Laarhoven, Statistical cooling: a general approach to combinatorial optimization problems, Philips J. Res. 40 (1985) 193–226.Google Scholar
  3. [3]
    G. Anandalingam, R. Mathieu, L. Pittard and N. Sinha, Artificial intelligence based methods for solving bi-level linear programming problems, in:Impact of Recent Advances in Computes on Operations Research, ed. R. Sharda (North-Holland, 1988).Google Scholar
  4. [4]
    S. Anily and A. Federgruen, Simulated annealing methods with general acceptance probabilities, J. Appl. Prob. 24 (1987) 657–667.Google Scholar
  5. [5]
    D. Bertsekas and R. Gallager,Data Networks (Prentice-Hall, Englewood Cliffs, NJ, 1987).Google Scholar
  6. [6]
    R.R. Boorstyn and H. Frank, Large-scale network topological optimization, IEEE Trans. Commun. COM-25 (1977) 29–47.Google Scholar
  7. [7]
    U. Faigle and R. Schrader, On the convergence of stationary distributions in simulated annealing algorithms, Info. Proc. Lett. (1988) 189–194.Google Scholar
  8. [8]
    P. Fetterolf, Optimal design of heterogeneous networks with transparent bridges, Ph.D. Dissertation, University of Pennsylvania, Department of Systems (1990).Google Scholar
  9. [9]
    L. Fratta, M. Gerla and L. Kleinrock, The flow deviation algorithm: An approach to store-and-forward computer communication network design, Networks 3 (1973) 97–133.Google Scholar
  10. [10]
    T.L. Friesz, H.J. Cho, N. Mehta, R. Tobin and G. Anandalingam, A simulated annealing approach to the network design problem with variational inequality constraints, Transport. Sci. (1990) forthcoming.Google Scholar
  11. [11]
    B. Gavish, Topological design of centralized computer networks: Formulations and algorithms, Networks 12 (1982) 355–377.Google Scholar
  12. [12]
    B. Gavish, Augmented Lagrangian based algorithms for centralized network design, IEEE Trans. Commun. COM-33 (1985) 1247–1257.Google Scholar
  13. [13]
    B. Gavish and S. Hantler, An algorithm for optimal route selection in SNA networks, IEEE Trans. Commun. COM-31 (1983) 1154–1161.Google Scholar
  14. [14]
    B. Gavish, Capacity and flow assignment in large computer networks,INFOCOM'86 Proc., Miami, FL (1986) pp. 275–284.Google Scholar
  15. [15]
    M. Gerla and L. Kleinrock, On the topological design of distributed computer networks, IEEE Trans. Commun. COM-25 (1977) 48–60.Google Scholar
  16. [16]
    M. Gerla, The design of store and forward networks for computer communication, Ph.D. dissertation, School of Eng. and Appl. Sci., UCLA (Jan. 1973).Google Scholar
  17. [17]
    B. Hajek, Cooling schedules for optimal annealing, Math. Oper. Res. 13 (1988) 311–329.Google Scholar
  18. [18]
    M. Huang, F. Romeo and A.L. Sangiovanni-Vincentelli, An efficient cooling schedule for simulated annealing,Proc. IEEE Int. Conf. on Computer-Aided Design, Santa Clara (Nov. 1986) pp. 381–384.Google Scholar
  19. [19]
    D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, Optimization by simulated annealing: An experimental evaluation, Parts I and II, AT&T Bell Laboratories, preprint (1987).Google Scholar
  20. [20]
    D.S. Johnson, C.R. Aragon and L.A. McGeoch, Optimization by simulated annealing: An experimental evaluation; Part I, Graph partitioning, Oper. Res. 37 (1989).Google Scholar
  21. [21]
    S. Kirkpatrick, C.D. Gelatt and M.P. Vecchi, Optimization by simulated annealing, Science 220 (1983) 671–680.Google Scholar
  22. [22]
    L. Kleinrock,Communication Nets: Stochastic Message Flow and Delay (McGraw-Hill, 1964).Google Scholar
  23. [23]
    L. Kleinrock, Analytic and simulation methods in computer network design,Conf. Rec. Spring Joint Comput. Conf., AFIPS Conf. Proc., vol. 36 (1970) pp. 568–579.Google Scholar
  24. [24]
    L.J. LeBlanc and R.V. Simmons, Continuous models for capacity design of large packetswitched telecommunications networks, ORSA J. Comput. 1 (1989) 271–286.Google Scholar
  25. [25]
    M. Lundy and A. Mees, Convergence of an annealing algorithm, Math. Prog. 34 (1986) 111–124.Google Scholar
  26. [26]
    T.L. Magnanti and R.T. Wong, Network design and transportation planning: Models and algorithms, Transport. Sci. 18 (1984) 1–55.Google Scholar
  27. [27]
    N. Metropolis, A. Rosenbluth, A. Teller and E. Teller, Equation of state calculation by fast computing machines, J. Chem. Phys. 21 (1953) 1087–1091.Google Scholar
  28. [28]
    M. Minoux and M. Gondran,Graphs and Algorithms (Wiley, 1984).Google Scholar
  29. [29]
    C.L. Monma and D.D. Sheng, Backbone network design and performance analysis: A methodology for packet switching networks, IEEE J. Sel. Areas in Comm. SAC-4 (1986) 946–965.Google Scholar
  30. [30]
    M.J.T. Ng and D.B. Hoang, Optimal capacity assignment in packet switching networks, Australian Telecommun. Res. 17, no. 2 (1983) 53–65.Google Scholar
  31. [31]
    M.J.T. Ng and D. Hoang, Joint optimization of capacity and flow assignment in a packet switched communications network, IEEE Trans. Commun. COM-35 (1987) 202–209.Google Scholar
  32. [32]
    R. Otten and L. Van Ginneken, Floorplan design using simulated annealing,Proc. IEEE Conf. on Computer-Aided Design, Santa Clara (1984) pp. 96–98.Google Scholar
  33. [33]
    M.A. Rodrigues and V.R. Saksena, Performance analysis of LAN/WAN bridging architecture,Proc. ICC Conf. (1989) pp. 646–650.Google Scholar
  34. [34]
    F. Romeo and A.L. Sangiovanni, Probabilistic hill climbing algorithms: properties and applications,Proc. Chapel Hill Conf. on VLSI, Chapel Hill, NC (1985) pp. 393–417.Google Scholar
  35. [35]
    J.F. Shoch and J.A. Hupp, Measured performance of an Ethernet local area network, Commun. ACM 23 (1980) 711–720.Google Scholar
  36. [36]
    P.J.M. Van Laarhoven and E.H.L. Aarts,Simulated Annealing: Theory and Applications (D. Reidel, Dordrecht, Holland, 1987).Google Scholar
  37. [37]
    A. Vernekar, G. Anandalingam and C.N. Dorny, Optimization of resource location in hierarchical computer networks, Comput. Oper. Res. (1990) forthcoming.Google Scholar
  38. [38]
    S.W. Wallace and R.J. Wets, Preprocessing in stochastic programming: The case of uncapacitated networks, ORSA J. Comput. 1 (1989).Google Scholar
  39. [39]
    W. Whitt, The queueing network analyser, Bell Sys. Tech. J. 62 (1983) 2779–2815.Google Scholar
  40. [40]
    B. Zell and P. Fetterolf, An accurate method for estimating network traffic statistics, Working Paper, The University of Pennsylvania, Philadelphia, PA (1990).Google Scholar

Copyright information

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

Authors and Affiliations

  • Peter C. Fetterolf
    • 1
  • G. Anandalingam
    • 2
  1. 1.Aurthur D. Little, Inc.CambridgeUSA
  2. 2.Department of SystemsUniversity of PennsylvaniaPhiladelphiaUSA

Personalised recommendations