A Two-Stage Heuristic for Designing Data Communication Networks

Sridharan R

IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department

Abstract: In this paper, we present a two-stage heuristic which identifies the most economical way to connect the nodes of a date communication network. We formulate this network design problem as a star-star concentrator location problem. To solve this problem, a Lagrangin relaxation procedure is proposed. The first stage of the procedure, namely the solution to the relaxed problem, identifies the optimal locations of the transit nodes. Then a greedy type heuristic, as well as an optimal procedure are used to identify the linkage of these transit nodes to the other nodes. Computational results are provided and the results are also compared with another method.

Date: 1990-08-01
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:iim:iimawp:wp00961

Access Statistics for this paper

More papers in IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department Contact information at EDIRC.
Bibliographic data for series maintained by ().