Optimal Design of a 2-connected Candidate Set for a Communication Network
DOI:
https://doi.org/10.18486/ijcsnt/1.2.007Keywords:
Candidate Topology, Fault Tolerant, Link FailureAbstract
With the rise in the use of wired and wireless network, the demand to create reliable network is also growing. The necessity of transferring various data, multimedia based crucial information across the world has drawn researchers to perform intense research on different aspect of networking. One of the prime aspects of network design is to choose the correct topology since cost and reliability of a network are mainly determined by its topology. The other network parameters like path rate, path length and load on each link varies with network topology. These factors are very critical for the network performance. Hence constructing a set of topology candidates prior to evaluation is important. To design a network topology satisfying the requisite constraints may be time consuming and as the size of the network grows subsequently the time for designing such candidate set also rises. Hence, computational time of an algorithm should be pragmatic. The paper addresses the problem of designing candidate set for a communication network so that there exists at least one disjoint path between every pair of nodes when a single link fails and the computational time is less than existing algorithms.
References
A. Gersht and R. Weihmayer, “Joint Optimization of Data Network Design and Facility Selection,” IEEE J. Selec. Areas, Commun., 8, 9, pp. 1667–1681, 1990. DOI: https://doi.org/10.1109/49.62854
A. Markopoulou, G. Iannaccone, S. Bhattacharyya, C. Chuah, and C. Diot, “Characterization of Failures in an IP Backbone, IEEE Infocom 2004.
Bin Dai, Huabiao Lu, Zhigang Sun, Ziming Song, Yanpeng Ma and Jinshu Su, “MORT: A Technique to Improve Routing Efficiency in Fault-tolerant Multipath Routing,” Fifth International Conference on Mobile Ad-hoc and Sensor Networks, pp. 430–435, 2009. DOI: https://doi.org/10.1109/MSN.2009.85
B. L. Golden, E.A. Wasil, and P.T. Harker, “The Analytic Hierarchy Process,” Springer-Verlag, pp. 37–58, 1989. DOI: https://doi.org/10.1007/978-3-642-50244-6_3
E. C. G. Wille, M. Mellia, E. Leonardi, and M. A. Marsan, “Topological Design of Survivable IP Networks Using Metaheuristic Approaches,” Lecture Notes in Computer Science, Springer-Verlag, pp. 191–206, 2005. DOI: https://doi.org/10.1007/978-3-540-30573-6_15
K. Cheema, R. Aggarwal, “ Design Scheme and Performance Evaluation of new Fault-Tolerant Multistage Interconnection Network”, IJCSNS International Journal of Computer Science and Network Security, VOL.9 NO.9, September 2009.
K. Steiglitz, P. Weiner, and D. J. Kleitman, “The Design of Minimum-Cost Survivable Networks,” IEEE Trans. Circuit Theory, CT-16, 4, pp.455–460, 1969. DOI: https://doi.org/10.1109/TCT.1969.1083004
M. Ghai, K. Cheema and Vinay Chopra, “Design and Reliability Analysis of New Fault-Tolerant Irregular Multistage Interconnection Network,” International Journal of Computer Applications (0975 – 8887) Volume 10– No.1, pp. 1–5, November 2010. DOI: https://doi.org/10.5120/1449-1959
N. G. Chattopadhyay, T. W. Morgan, and A. Raghuram, “An Innovative Technique for Backbone Network Design, IEEE Trans. System, Man, and Cybernetics, 19, 5, pp. 1122–1132, 1989. DOI: https://doi.org/10.1109/21.44028
N. Kamiyama and D. Satoh, “Network Topology Design using Analytic Hierarchy Process, IEEE ICC 2008. DOI: https://doi.org/10.1109/ICC.2008.393
N. Kamiyama, R. Kawahara, and H. Yoshino, “Network Topology Design Considering Detour Traffic Caused by Link Failure, VDE Networks 2008. DOI: https://doi.org/10.1109/NETWKS.2008.4763724
N. Kamiyama,” Efficiently Constructing Candidate Set for Network Topology Design,” IEEE ICC proceedings, 2009. DOI: https://doi.org/10.1109/ICC.2009.5198981
T. Uno, “Enumeration Algorithms and Speeding up, 11th RAMP symposium, 1999.
P. Gupta and P. R. Kumar. Capacity of wireless networks. IEEE Transactions on Information Theory, 2000. DOI: https://doi.org/10.1109/18.825799
Downloads
Published
Issue
Section
License
Copyright (c) 2026 A. Q. Ansari, Koyel Datta Gupta, Maneesha Dabas
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
