This thesis considers three different models of configuring telecommunication networks.
The first model considers a problem of configuring logical networks by employing a self-planning facility in a telecommunication network carrying voice-grade calls to make a least cost configuration where the involved system cost includes hop cost and lost-call traffic cost. The hop cost depends on the number of self-planning facilities included on the routing path connecting the associated node pairs, while the lost-call traffic cost is incurred due to link capacities. The configuration problem is analyzed through dimensioning and routing on a reconfigurable network in a mixed 0/1 non-linear programming approach for which lower bounds are found by Lagrangean relaxation embedded in a hybrid search procedure for the associated dual problem. Heuristic solution procedures are exploited and their efficiencies are tested with various numerical examples.
The second model considers a problem of logical configuration in reconfigurable VCDN (Virtual Circuit Data Networks) which is analyzed through a mimimax approach, and its objective is to minimize the largest delay on any logical link, measured in both queueing delay and propagation delay. The problem is formulated as a 0/1 mixed integer programming and analyzed by decomposing it into two subproblems, called routing and dimensioning problems, for which an efficient heuristic algorithm is proposed in an iterating process made between the two subproblems for solution improvement. The algorithm is tested for its performance evaluation.
The last model is concerned with a base station allocation problem with respect to both interference-to-signal ratio and facility cost in a reconfigurable mobile radio network, where DCS's are incorporated as a backbone. For the allocation problem, a hybrid solution procedure is developed based on Lagrangian relaxation method. The solution procedure is tested with large scale examples for its efficiency and effectiveness.
