Design of data networks with spanning tree bridges
Peter C. Fetterolf · 2002
The problem of designing LAN-WAN (local-area-network-wide-area-network) computer networks with transparent bridges is addressed. A requirement of transparent bridges is that networks must be configured in a spanning tree topology. Mathematical models of LAN-WAN networks have been developed and an optimization problem formulated. 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 toward the global optimal solution. Experimental results have shown that LAN-WAN designs using simulated annealing are better than 99.99% of all feasible designs.>