Link Set Sizing for Networks Supporting SMDS [chapter]

Frank Y. S. Lin
1994 Network Management and Control  
Absfruct-To size networks that support Switched Multimegabit Data Service (SMDS), we must determine how much additional capacity is needed and where it is needed so as to minimize the total capacity augmentation cost. We consider two combinatorial optimization problem formulations. These two formulations are compared for their relative applicability and complexity. A solution procedure based upon Lagrangean relaxation is proposed for one of the formulations. In computational experiments, the
more » ... posed algorithm determines solutions that are within a few percent of an optimal solution in minutes of CPU time for networks with 1&26 nodes. In addition, the proposed algorithm is compared with a Most Congested First (MCF) heuristic. For the test networks, the proposed algorithm achieves up to 152% improvement in the total cost over the MCF heuristic.
doi:10.1007/978-1-4899-1298-5_41 fatcat:t44igxr4nnhibkmmqz2olxxteu