Premium
Design of Interconnection of Local Area Networks
Author(s) -
Filho V.J.M.F.,
Galvão R.D.
Publication year - 1998
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/j.1475-3995.1998.tb00116.x
Subject(s) - interconnection , tabu search , computer science , heuristics , mathematical optimization , network topology , steiner tree problem , metaheuristic , network planning and design , local search (optimization) , relaxation (psychology) , local area network , tree network , tree (set theory) , topology (electrical circuits) , distributed computing , mathematics , algorithm , computer network , time complexity , psychology , social psychology , combinatorics , mathematical analysis
This paper addresses the interconnection of local area networks (LANs) using bridges. The interconnection problem is difficult to solve and feasible solutions are usually obtained through heuristics. The description of a simplified approach to solve the problem of interconnecting LANs is followed by the formulation of the problem and the development of a Lagrangean relaxation. A Tabu search metaheuristic for designing minimum cost spanning tree topologies is also presented. Computational results are given for the interconnection of up to ten local area networks.