Enhanced Depth-First Search Algorithm for Improving the Efficiency of Route Construction in Data Center Networks
Received: 21 December 2024 | Revised: 8 February 2025 and 22 February 2025 | Accepted: 24 February 2025 | Online: 13 March 2025
Corresponding author: Ayam Mohsen Abbass
Abstract
Data transmission is a critical component of data center networks, ensuring efficient and reliable data transfer between nodes. Using the shortest path for data transmission is a common approach in data center networks, as it helps minim. Nevertheless, this methodology may also give rise to some challenges, including those related to network congestion and heightened susceptibility to node failures. In light of the inherent self-similarity and multipath routing characteristics shown by the Fat Tree topology, this work proposed a modified search method aimed to enhance the efficiency of the depth-first search (DFS) method. The comparison is made between the modified algorithm and the original algorithm operating on the conventional network architecture seen in data centers. The findings highlight the distinctive advantages of the modified DFS method, demonstrating its enhanced scalability and effectiveness in minimizing latency. The modified DFS technique consistently excels in reducing energy usage under various network load circumstances.
Keywords:
data center network, fat-tree topology, depth-first search, uninformed search algorithmDownloads
References
P. J. Roig, S. Alcaraz, K. Gilly, C. Bernad, and C. Juiz, "Arithmetic Study about Efficiency in Network Topologies for Data Centers," Network, vol. 3, no. 3, pp. 298–325, Sep. 2023.
B. E. Sabir, M. Youssfi, O. Bouattane, and H. Allali, "Towards a New Model to Secure IoT-based Smart Home Mobile Agents using Blockchain Technology," Engineering, Technology & Applied Science Research, vol. 10, no. 2, pp. 5441–5447, Apr. 2020.
S. M. Altowaijri and Y. E. Touati, "Securing Cloud Computing Services with an Intelligent Preventive Approach," Engineering, Technology & Applied Science Research, vol. 14, no. 3, pp. 13998–14005, Jun. 2024.
A. Sunyaev, Internet Computing: Principles of Distributed Systems and Emerging Internet-Based Technologies, 2nd ed. Cham, Switzerland: Springer, 2024.
N. Chen, T. Qiu, X. Zhou, K. Li, and M. Atiquzzaman, "An Intelligent Robust Networking Mechanism for the Internet of Things," IEEE Communications Magazine, vol. 57, no. 11, pp. 91–95, Nov. 2019.
M. Humayun, N. Tariq, M. Alfayad, M. Zakwan, G. Alwakid, and M. Assiri, "Securing the Internet of Things in Artificial Intelligence Era: A Comprehensive Survey," IEEE Access, vol. 12, pp. 25469–25490, 2024.
M. Hayamizu and K. Makino, "Ranking Top-k Trees in Tree-Based Phylogenetic Networks," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 20, no. 3, pp. 2349–2355, May 2023.
W. Yang, C. Chen, and J. Yu, "Topology-Aware Node Allocation on Supercomputers with Hierarchical Network," in 2022 IEEE 24th Int Conf on High Performance Computing & Communications; 8th Int Conf on Data Science & Systems; 20th Int Conf on Smart City; 8th Int Conf on Dependability in Sensor, Cloud & Big Data Systems & Application, Hainan, China, 2022, pp. 1095–1100.
A. C. Castillo, "Various Network Topologies and an Analysis Comparative Between Fat-Tree and BCube for a Data Center Network: An Overview," in 2022 IEEE Cloud Summit, Fairfax, VA, USA, 2022, pp. 1–8.
E. Jo, D. Pan, J. Liu, and L. Butler, "A simulation and emulation study of SDN-based multipath routing for fat-tree data center networks," in Proceedings of the Winter Simulation Conference 2014, Savannah, GA, USA, 2014, pp. 3072–3083.
X. Zhang and B. Hu, "A Power-Aware Routing Algorithm in Fat-tree Date Center Networks," in 2019 IEEE 20th International Conference on High Performance Switching and Routing, Xi’an, China, 2019, pp. 1–6.
A. Hammadi and L. Mhamdi, "A survey on architectures and energy efficiency in Data Center Networks," Computer Communications, vol. 40, pp. 1–21, Mar. 2014.
K. Siva Tharun and K. Kottilingam, "Optimization Load Balancing over Imbalance Datacenter Topology," in New Trends in Computational Vision and Bio-inspired Computing, S. Smys, A. M. Iliyasu, R. Bestak, and F. Shi, Eds. Cham, Switzerland: Springer, 2020, pp. 397–407.
J. J. Wilke and J. P. Kenny, "Opportunities and limitations of Quality-of-Service in Message Passing applications on adaptively routed Dragonfly and Fat Tree networks," in 2020 IEEE International Conference on Cluster Computing, Kobe, Japan, 2020, pp. 109–118.
W.-H. Liang et al., "Dynamic Flow Scheduling Technique for Load Balancing in Fat-Tree Data Center Networks," International Journal of Performability Engineering, vol. 17, no. 6, pp. 491–593, Jun. 2021.
H. Abdulrab, F. A. Hussin, A. Abd Aziz, A. Awang, I. Ismail, and P. A. M. Devan, "Reliable Fault Tolerant-Based Multipath Routing Model for Industrial Wireless Control Systems," Applied Sciences, vol. 12, no. 2, Jan. 2022, Art. no. 544.
S. Liu, H. Xu, and Z. Cai, "Low Latency Datacenter Networking: A Short Survey." arXiv, Jul. 31, 2014.
S. Supittayapornpong, P. Namyar, M. Zhang, M. Yu, and R. Govindan, "Optimal Oblivious Routing for Structured Networks," in IEEE INFOCOM 2022 - IEEE Conference on Computer Communications, London, United Kingdom, 2022, pp. 1988–1997.
Y. Kulakov, S. Kopychko, and V. Gromova, "Organization of Network Data Centers Based on Software-Defined Networking," in 1st International Conference on Computer Science, Engineering and Education Applications, Kiev, Ukraine, 2018, pp. 447–455.
Y. Satotani and N. Takahashi, "Depth-First Search Algorithms for Finding a Generalized Moore Graph," in TENCON 2018 - 2018 IEEE Region 10 Conference, Jeju, South Korea, 2018, pp. 0832–0837.
L. Liu, L. Gong, S. Yang, J. Xu, and L. Fortnow, "Best First Fit (BFF): An Approach to Partially Reconfigurable Hybrid Circuit and Packet Switching," in 2018 IEEE 11th International Conference on Cloud Computing, San Francisco, CA, USA, 2018, pp. 426–433.
J. Duan and Y. Yang, "Fitted Fat-Tree for Localized Traffic in Data Center Networks," in 2018 IEEE International Conference on Communications, Kansas City, MO, USA, 2018, pp. 1–6.
P. Isaia and L. Guan, "Distributed Mininet placement algorithm for fat-tree topologies," in 2017 IEEE 25th International Conference on Network Protocols, Toronto, Canada, 2017, pp. 1–6.
A. Biswas and A. Hussain, "Design and Analysis of a New Reduced Switch Scalable MIN Fat Tree Topology," Computación y Sistemas, vol. 26, no. 2, pp. 949–962, Jun. 2022.
M. Aliyan et al., "Analysis and Performance Evaluation of Various Shortest Path Algorithms," in 2024 3rd International Conference for Innovation in Technology, Bangalore, India, 2024, pp. 1–16.
C. Ulloa, J. Baier, W. Yeoh, V. Bulitko, and S. Koenig, "A Learning-Based Framework for Memory-Bounded Heuristic Search: First Results," Proceedings of the International Symposium on Combinatorial Search, vol. 10, no. 1, pp. 178–179, 2019.
A. K. Mishra and P. C. Siddalingaswamy, "Analysis of tree based search techniques for solving 8-puzzle problem," in 2017 Innovations in Power and Advanced Computing Technologies, Vellore, India, 2017, pp. 1–5.
Y. Sun, X. Yi, and H. Liu, "The Communication Analysis of Implementation in Breadth First Search Algorithm," in 2016 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData), Chengdu, China, 2016, pp. 754–759.
F. Zhang et al., "An adaptive breadth-first search algorithm on integrated architectures," The Journal of Supercomputing, vol. 74, no. 11, pp. 6135–6155, Nov. 2018.
R. Kanniga Devi, M. Gurusamy, and P. Vijayakumar, "An Efficient Cloud Data Center Allocation to the Source of Requests," Journal of Organizational and End User Computing (JOEUC), vol. 32, no. 3, pp. 23–36, 2020.
O. A. Rotimi, A. O. Olowoye, R. A. Ganiyu, S. O. Olabiyisi, and O. T. Amumeji, "An Exploratory study of Critical Factors Affecting the Efficiency of Uninformed Tree based Search Algorithms," IOSR Journal of Mathematics, vol. 14, no. 3, pp. 6–11, Jun. 2018.
T. A. Akanmu, S. O. Olabiyisi, E. O. Omidiora, C. A. Oyeleye, M. A. Mabayoje, and A. O. Babatunde, "Comparative Study of Complexities of Breadth – First Search and Depth-First Search Algorithms, using Software Complexity Measures," in Proceedings of the World Congress on Engineering, London, United Kingdom, 2010, vol. 1.
B. J. Saleh, A. Y. F. Saedi, A. T. Q. Al-Aqbi, and L. Abdalhasan Salman, "Optimum Median Filter Based on Crow Optimization Algorithm," Baghdad Science Journal, vol. 18, no. 3, Sep. 2021, Art. no. 8.
X. Ying, "Design of the Data Center Network Architecture under the Background of Cloud Computing: A Review," World Journal of Innovation and Modern Technology, vol. 7, no. 4, pp. 55–61, Jul. 2024.
S. Maudet, G. Andrieux, R. Chevillon, and J.-F. Diouris, "Refined Node Energy Consumption Modeling in a LoRaWAN Network," Sensors, vol. 21, no. 19, Oct. 2021, Art. no. 6398.
Downloads
How to Cite
License
Copyright (c) 2025 Ayam Mohsen Abbass, Ahmed Yousif Falih Saedi, Jaafar Qassim Kadhim
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain the copyright and grant the journal the right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) after its publication in ETASR with an acknowledgement of its initial publication in this journal.
