Delay Constrained Routing and Link Capacity Assignment in Virtual Circuit Networks

Hong-Hsu YEN
FrankYeong-Sung LIN

Publication
IEICE TRANSACTIONS on Communications   Vol.E88-B    No.5    pp.2004-2014
Publication Date: 2005/05/01
Online ISSN: 
DOI: 10.1093/ietcom/e88-b.5.2004
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Network
Keyword: 
link capacity assignment,  end-to-end QoS,  routing assignment,  optimization,  Lagrangean relaxation,  

Full Text: PDF(359.3KB)>>
Buy this Article


Summary: 
An essential issue in designing, operating and managing a modern network is to assure end-to-end QoS from users perspective, and in the meantime to optimize a certain average performance objective from the systems perspective. So in the first part of this paper, we address the above issue by using the rerouting approach, where the objective is to minimize the average cross-network packet delay in virtual circuit networks with the consideration of an end-to-end delay constraint (DCR) for each O-D pair. The problem is formulated as a multicommodity network flow problem with integer routing decision variables, where additional end-to-end delay constraints are considered. As the traffic demands increases over time, the rerouting approach may not be applicable, which results in the necessity of capacity augmentation. Henceforth, the second part of this paper is to jointly consider the link capacity assignment and the routing problem (JCR) at the same time where the objective is to minimize the total link installation cost with considering the average and end-to-end delay constraints. Unlike previous research tackling this problem with a two-phase approach, we propose an integrated approach to considering the routing and capacity assignment at the same time. The difficulties of DCR and JCR result from the integrality nature and particularly the nonconvexity property associated with the end-to-end delay constraints. We propose novel Lagrangean relaxation based algorithms to solve the DCR and the JCR problems. Through computational experiments, we show that the proposed algorithms calculate near-optimal solutions for the DCR problem and outperform previous two-phase approach for the JCR problem under all tested cases.