Lower and upper bounds for a two-level hierarchical location problem in computer networks

In this paper a two-level hierarchical model for the location of concentrators and routers in computers networks is presented. Given a set of candidate locations and the capacities of concentrators and routers the problem is to determine how many concentrators and routers should be used, where they...

Full description

Saved in:
Bibliographic Details
Published in:Computers & operations research 2008-06, Vol.35 (6), p.1982-1998
Main Authors: Ignacio, Aníbal Alberto Vilcapoma, Filho, Virgílio José Martins Ferreira, Galvão, Roberto Diéguez
Format: Article
Language:English
Subjects:
Applied sciences
Computer networks
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Design of computer networks
Exact sciences and technology
Flows in networks. Combinatorial problems
Heuristic
Hierarchical location problems
Lagrange multiplier
Lagrangean relaxation
Operational research and scientific management
Operational research. Management science
Optimization algorithms
Routers
Software
Studies
Tabu search
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper a two-level hierarchical model for the location of concentrators and routers in computers networks is presented. Given a set of candidate locations and the capacities of concentrators and routers the problem is to determine how many concentrators and routers should be used, where they should be located and which users to assign to each concentrator and which concentrators to allocate to each router. A Lagrangean relaxation is used to provide lower bounds for this problem, which are tentatively strengthened by incomplete optimization through the use of CPLEX. A tabu search meta-heuristic is then developed. Computational experiments are performed using a set of randomly generated problems.
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2006.10.005