Please use this identifier to cite or link to this item:
Title: Upgrading links for performance
Authors: Lim, A.
Chee, Y.-M.
Hsu, W. 
Keywords: Computer network
Effective heuristics
Link upgrade problem
NP-complete problem
Issue Date: 1996
Source: Lim, A.,Chee, Y.-M.,Hsu, W. (1996). Upgrading links for performance. Informatica 7 (4) : 455-468. ScholarBank@NUS Repository.
Abstract: The performance of a computer network is commonly measured by the maximum minimum time required to move a certain amount of data between any 2 nodes in the network. Due to the advances in technology, certain links in the network may be upgraded, for instance to optical fibre links, so that better performance can be achieved. In this paper, we study the LINK UPGRADE problem for networks. We first show that the LINK UPGRADE problem is script N sign℘-complete. We also show that, a closely related problem, the MINIMUM COST LINK UPGRADE problem is script N sign℘-complete even if the underlying topology of the network is a linear array. However, for certain classes of networks, the LINK UPGRADE problem can be solved in polynomial time. For general networks, we provide effective heuristics for the above problems.
Source Title: Informatica
ISSN: 08684952
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Feb 16, 2018

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.