寬頻網際網路之服務品質確保(III)─子計畫六：寬頻網際網路規劃與容量管理
Date Issued
2001
Date
2001
Author(s)
DOI
892219E002025
Abstract
As 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.
Subjects
network planning
capacity augmentation
QoS routing
Publisher
臺北市：國立臺灣大學資訊管理學系暨研究所
Type
other
File(s)![Thumbnail Image]()
Loading...
Name
892219E002025.pdf
Size
50.78 KB
Format
Adobe PDF
Checksum
(MD5):7ccaf6296c1d2f8f2fe94664ef6f0ee0