林永松2006-07-262018-06-292006-07-262018-06-292001http://ntur.lib.ntu.edu.tw//handle/246246/18816As the traffic demands are increasing over time, the rerouting approach may not be applicable, which results in the necessity of capacity augmentation. Henceforth, we focus on the network servicing of virtual circuit network, that is to jointly consider the link capacity assignment and the routing problem in virtual circuit network where the objective is to minimize the total link installation cost with considering the average and end-to-end delay constraints. The concavity associated with the capacity cost function makes this problem more complicated than rerouting problem. The basic approach to the algorithm development is Lagrangean relaxation in conjunction with optimization-based add drop heuristics. In the computational experiments, it is shown that the proposed algorithm calculates solutions that are reasonably good in an hour of CPU time for networks with up to 26 nodes. And the solution quality is better in small network size and loose delay constraints.application/pdf51995 bytesapplication/pdfzh-TW國立臺灣大學資訊管理學系暨研究所network planningcapacity augmentationQoS routingotherhttp://ntur.lib.ntu.edu.tw/bitstream/246246/18816/1/892219E002025.pdf