Pub. online:1 Jan 1996Type:Research ArticleOpen Access
Volume 7, Issue 4 (1996), pp. 455–468
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 NP-complete. We also show that, a closely related problem, the MINIMUM COST LINK UPGRADE problem is NP-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.