IWDC 2002: Distributed Computing pp 300-311

# Design of 1-FT Communication Network under Budget Constraint

• Loknath Ghosh
• Amitava Mukherjee
• Debashis Saha
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2571)

## Abstract

This paper considers the design of reliable backbone networks under certain real-life constraints of cost and fault tolerance. The constraints are: keeping the cost of the links with in a predefined budget; and keeping the topology 1-FT (fault-tolerant) to 1-link failure. A network topology is said to be 1-FT iff every pair of nodes is reachable from all other nodes for 1 link failure. i.e., the graph remains connected. Formally, a graph G is 1-FT iff all the graphs, which have one less link than graph G, are connected. That is, 1-FT network can survive 1-link failure in the network. Therefore, the problem is to find a reliable network topology for a set of nodes whose total link cost is minimized subject to constraints that the backbone network can accommodate a 1-link failure under a given budget. The problem is NP-hard i.e. there exists no polynomial time algorithm to solve this problem. In this paper we have proposed an efficient method based on genetic algorithm to solve the problem. In our method we have represented a backbone layout by means of an upper triangular matrix by concatenating a row with its previous rows. The genetic operators iteratively attempt to find a more cost-effective and reliable network layout. Through the extensive simulation we show that our proposed genetic algorithmic approach can efficiently find a sub-optimal solution for most of the cases.

## Keywords

Topological Optimization Budget Constraint Genetic Operator Solution Point Closure Property
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## References

1. 1.
Sheng-Tzong Cheng, “Topological Optimization of a Reliable Communication Network”, IEEE Transactions on Reliability, vol-47, no-3, 1998.Google Scholar
2. 2.
J. E. Baker, “Adaptive selection method for genetic algorithm”, Proc. Int’l Conf. Genetic Algorithm, 1985, pp. 101–111.Google Scholar
3. 3.
D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, 1989; Addison-Wesley.Google Scholar
4. 4.
J. H. Holland, “Adaptation in natural and artificial systems”, 1975, Univ. Michigan Press.Google Scholar
5. 5.
K. K. Aggarwal, et.al., “Topological layout of links for optimization the s-t reliability in a computer communication system”, Microelectronics and Reliability 1982, pp 341–45Google Scholar
6. 6.
K. K. Aggarwal, et.al., “Topological layout of links for optimization the overall reliability in a computer communication system”, Microelectronics and Reliability 1982, pp 347–351Google Scholar
7. 7.
Y. C Chhopra, et. al., “Network topology for maximizing the terminal reliability in a computer communication network”, Microelectronics and Reliability 1984, pp 911–13Google Scholar
8. 8.
S. Klu, D. F. McAllister, “Reliability optimization of computer communication networks”, IEEE Trans Reliability 1988, pp 475–83Google Scholar
9. 9.
IM Soi, KK Aggarwal, “Reliability indices for topological design of computer communication networks”, IEEE Trans Reliability 1981Google Scholar
10. 10.
RH Jan, et. al., “Topological optimization of a communication network subject to a reliability constraint”, IEEE Trans Reliability 1993, pp 63–70Google Scholar
11. 11.
A N Venetsanopoulos, et. al, “Topological optimization of communication networks subject to reliability constraints”, Problem of Control and Information Theory 1986, pp 63–78Google Scholar

## Authors and Affiliations

• Loknath Ghosh
• 1
• Amitava Mukherjee
• 2
• Debashis Saha
• 3
1. 1.Haldia Institute of TechnologyHaldiaIndia
2. 2.IBM Global ServicesCalcuttaIndia
3. 3.Indian Institute of Management CalcuttaCalcuttaIndia