Mathematical modeling and solution algorithms for LAN interconnection problems
In this talk, we provide a survey of modeling approaches and solution algorithms for interconnecting local area network (LANS) to support information processing needs of organizations. Different models are shown for using different interconnection technologies such as transparent bridges, source routing bridges, routers, ATM switches, and their combinations. Major concerns in designing a network of LANs (or called an internet) are cost, performability and reliability. That is, the question is how to construct an internet at a minimum cost while delivering to users satisfactory network performance (i.e., response delay), and preventing serious performance degradation in the failure of a LAN, an interconnection device or a long-haul link. These internet design problems are modeled as mixed binary integer programs. Combinatorial optimization techniques are used to solve these problems, including add/drop/exchange heuristics, simulated annealing, tabu search, cutting plane method, Lagrangian relaxation, and embedded Benders enumeration. The internet design problems also require solving multicommodity network flow problems as subproblems to determine routing of messages on the network. These subproblems are solved by the simplex method or by the flow deviation method. We report computational results for a subset of the internet design problems that are discussed.
- OSTI ID:
- 36371
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Tabu search methods for multicommodity capcitated fixed charge network design problem
A decomposition approach based on meta-heuristics and exact methods for solving a two-stage stochastic biofuel hub-and-spoke network problem