Method for finding protected links to keep small diameter against failures Online publication date: Sat, 23-Aug-2014
by Koji Imagawa; Takeshi Fujimura; Hiroyoshi Miwa
International Journal of Space-Based and Situated Computing (IJSSC), Vol. 3, No. 2, 2013
Abstract: The diameter of a network, one of measures of network performance, must be small to make network delay small even after a link failure occurs. Therefore, the critical links whose failures degrade the performance must be protected by rapid recovery. In addition, the number of these protected links must be small to reduce the cost. Consequently, it is important to find the smallest number of the links to be protected so that the diameter of the network resulting from failures of non-protected links is not more than a threshold. First, we prove that the problem is generally NP-hard and present a polynomial-time algorithm when a failure pattern is restricted to a single link failure. Moreover, we present approximation algorithms with the approximation ratio of a fixed constant. In addition, we evaluate the number of protected links needed to keep the diameter of the networks small for actual network topology.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Space-Based and Situated Computing (IJSSC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook