Abstract
Low transmission delay, high fault tolerance and low design cost are the three main properties of any network which are best described by its topology. Transmission delay can be decreased by restricting the diameter of the network. Very few methods in literature have considered the importance of the diameter of the network to decrease the transmission delay. Fault tolerance in the network depends on the number of disjoint paths between a node pair. Designing a k-connected fault tolerant network subject to connectivity and diameter constraint at minimal cost is a NP hard problem. In this paper, an efficient constructive heuristic algorithm is proposed for designing a k-connected network while optimizing the cost of the network subject to the connectivity and diameter constraints. Diameter of resultant network would be of two links regardless of network size to get the speed comparable to complete connected network at low cost. Effectiveness of the proposed approach is also evaluated using different examples.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Wille, E.C.G., Mellia, M., Leonardi, E., Marsan, M.A.: Topological Design of Survivable IP Networks Using Metaheuristic Approaches, pp. 191–206. Springer, Heidelberg (2005)
Dengiz, B., Altiparmak, F., Smith, A.E.: Local search Genetic Algorithm for optimal design of reliable Networks. IEEE (1997)
Blum, C., Roli, A.: Meta- heuristics in Combinatorial Optimization: Overview and Conceptual Comparison. ACM Computing Survey 35(3) (September 2003)
Szlachcic, E., Mlynek, J.: Efficiency Analysis in Communication Network Topology Design. In: Fourth IEEE International Conference on Dependability of Computer Systems (2009)
Szlachcic, E.: Fault Tolerant Topological Design for Computer Networks. In: Proceeding of the IEEE International Conference on Dependability of Computer Systems (2006)
Kumar, R., Parida, P.P., Gupta, M.: Topological Design of Communication Network using Multiobjective Genetic Optimization. IEEE (2002)
Pierre, S., Hyppolite, M.-A., Bourjolly, J.M., Dioume, O.: Topological Design of Computer Communication Networks using Simulated Annealing. Engineering Applications, Artificial Intelligence 8 (1995)
Zili, D., Nenghai, Y., Zheng, L.: Designing Fault Tolerant Networks Topologies based on Greedy Algorithm. In: IEEE Third International Conference on Dependability of Computer Systems DepCoS-RELCOMEX 2008 (2008)
Kamlesh, K.N., Srivatsa, S.K.: Topological Design of Minimum Cost Survivable Computer Communication Networks: Bipartite Graph Method. (IJCSIS) International Journal of Computer Science and Information Security 3(1) (2009)
Steiglitz, K., Weiner, P., Kleitman, D.J.: The Design of Minimum-Cost Survivable Networks. IEEE Transaction on Circuit Theory Cr-16 (November 1969)
Fencl, T., Burget, P., Bilek, J.: “Network topology design” control engineering practice. Elsevier Ltd. (2011)
EI-Hajj, W., Hajj, H., Trabelsi, Z.: On Fault Tolerant Ad-Hoc Network Design. In: ACM Transaction, IWCMC (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Saxena, P.C., Sabharwal, S., Maneesha (2012). Diameter Restricted Fault Tolerant Network Design. In: Das, V.V., Stephen, J. (eds) Advances in Communication, Network, and Computing. CNC 2012. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35615-5_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-35615-5_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35614-8
Online ISBN: 978-3-642-35615-5
eBook Packages: Computer ScienceComputer Science (R0)