Link Capacity Assignment in Packet-Switched Network with Existing Network Consideration

Suwan RUNGGERATIGUL  Weiping ZHAO  Yusheng JI  Akiko AIZAWA  Shoichiro ASANO  

IEICE TRANSACTIONS on Communications   Vol.E78-B   No.5   pp.709-719
Publication Date: 1995/05/25
Online ISSN: 
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Communication Networks and Service
communication networks and services,  packet-switched networks,  network design,  link capacity assignment,  non-linear programming,  algorithm,  

Full Text: PDF>>
Buy this Article

When communication network planning-design is performed, especially in a short-term case, it is important to utilize existing facilities in the construction of the new network. In this paper, link capacity assignment problem (CA problem) for packet-switched networks is investigated with the consideration of the existing network. To deal with this, per-unit cost of existing link capacity is thought to be less than that of newly installed capacity and a link cost function is modeled by a non-linear, non-differentiable one which is composed of two portions of capacity cost. After formulating the CA problem, two optimum algorithms derived from Lagrange multiplier method are presented and a modified algorithm is used for solving the CA problem in order to reduce the computation time. Some numerical results show that according to the values of link traffic flows, there will be links whose capacities must be set equally to the existing values. Moreover, when link cost difference is introduced in the CA problem, the number of links that the capacities of which have to be changed from existing values is less than that of linear cost function case, i.e., the case without consideration of the cost difference in link capacity.