By Topic

Link set capacity augmentation algorithms for networks supporting SMDS

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Lin, F.Y.S. ; Bellcore, Piscataway, NJ, USA

To expand the link set capacities for networks supporting the switched multi-megabit data service (SMDS), one must determine how much additional capacity is needed and where it is needed so as to minimize the total capacity augmentation cost. The authors consider two combinatorial optimization problem formulations. These two formulations are compared for their relative applicability and complexity. Solution procedures based upon Lagrangean relaxation are proposed for the formulations. In computational experiments, it is clearly demonstrated that there is a computation-time versus solution-quality trade-off between the algorithms for the two formulations. In addition, to demonstrate the effectiveness of the proposed algorithms, the author compares the proposed algorithms with a most congested first (MCF) heuristic. For the test networks, the proposed algorithms achieve up to 250% (79% on the average) improvement in the total capacity augmentation cost over the MCF heuristic

Published in:

Communications, 1994. ICC '94, SUPERCOMM/ICC '94, Conference Record, 'Serving Humanity Through Communications.' IEEE International Conference on

Date of Conference:

1-5 May 1994