Exploring Path Computation Techniques in Software-Defined Networking: A Review and Performance Evaluation of Centralized, Distributed, and Hybrid Approaches

Software-Defined Networking (SDN) is a networking paradigm that allows network administrators to dynamically manage network traffic flows and optimize network performance. One of the key benefits of SDN is the ability to compute and direct traffic along efficient paths through the network. In recent years, researchers have proposed various SDN-based path computation techniques to improve network performance and reduce congestion. This review paper provides a comprehensive overview of SDN-based path computation techniques, including both centralized and distributed approaches. We discuss the advantages and limitations of each approach and provide a critical analysis of the existing literature. In particular, we focus on recent advances in SDN-based path computation techniques, including Dynamic Shortest Path (DSP), Distributed Flow-Aware Path Computation (DFAPC), and Hybrid Path Computation (HPC). We evaluate three SDN-based path computation algorithms: centralized, distributed, and hybrid, focusing on optimal path determination for network nodes. Test scenarios with random graph simulations are used to compare their performance. The centralized algorithm employs global network knowledge, the distributed algorithm relies on local information, and the hybrid approach combines both. Experimental results demonstrate the hybrid algorithm's superiority in minimizing path costs, striking a balance between optimization and efficiency. The centralized algorithm ranks second, while the distributed algorithm incurs higher costs due to limited local knowledge. This research offers insights into efficient path computation and informs future SDN advancements. We also discuss the challenges associated with implementing SDN-based path computation techniques, including scalability, security, and interoperability. Furthermore, we highlight the potential applications of SDN-based path computation techniques in various domains, including data center networks, wireless networks, and the Internet of Things (IoT). Finally, we conclude that SDN-based path computation techniques have the potential to significantly improvement in-order to improve network performance and reduce congestion. However, further research is needed to evaluate the effectiveness of these techniques under different network conditions and traffic patterns. With the rapid growth of SDN technology, we expect to see continued development and refinement of SDN-based path computation techniques in the future

Review of SDN-based load-balancing methods, issues, challenges, and roadmap

The development of the Internet and smart end systems, such as smartphones and portable laptops, along with the emergence of cloud computing, social networks, and the Internet of Things, has brought about new network requirements. To meet these requirements, a new architecture called software-defined network (SDN) has been introduced. However, traffic distribution in SDN has raised challenges, especially in terms of uneven load distribution impacting network performance. To address this issue, several SDN load balancing (LB) techniques have been developed to improve efficiency. This article provides an overview of SDN and its effect on load balancing, highlighting key elements and discussing various load-balancing schemes based on existing solutions and research challenges. Additionally, the article outlines performance metrics used to evaluate these algorithms and suggests possible future research directions

An Optimised Shortest Path Algorithm for Network Rotuting & SDN: Improvement on Bellman-Ford Algorithm

Network routing algorithms form the backbone of data transmission in modern network architectures, with implications for efficiency, speed, and reliability. This research aims to critically investigate and compare three prominent routing algorithms: Bellman-Ford, Shortest Path Faster Algorithm (SPFA), and our novel improved variant of Bellman-Ford, the Space-efficient Cost-Balancing Bellman-Ford (SCBF). We evaluate the performance of these algorithms in terms of time and space complexity, memory utilization, and routing efficacy, within a simulated network environment. Our results indicate that while Bellman-Ford provides consistent performance, both SPFA and SCBF present improvements in specific scenarios with the SCBF showing notable enhancements in space efficiency. The innovative SCBF algorithm provides competitive performance and greater space efficiency, potentially making it a valuable contribution to the development of network routing protocols. Further research is encouraged to optimize and evaluate these algorithms in real-world network conditions. This study underscores the continuous need for algorithmic innovation in response to evolving network demands

Scrub typhus in India: Whether increased reporting or expanding geographies?

Scrub typhus is a potentially fatal disease with serious complications in untreated cases or where there is delay in starting treatment. It has been considered to be limited to certain geographic areas with vegetations and cattle grazing fields like Jammu. Scrub typhus cases/outbreaks have been reported in the recent past from South India, Mumbai, Goa, Himachal Pradesh, and Haryana. Recently, we had a case of scrub typhus in a child residing in Delhi with no history of travel outside. A 10-year-old girl admitted with high-grade fever, abdominal pain, myalgia, and erythematous rash with hepatomegaly but without lymphadenopathy and developed splenomegaly in the 2nd week of illness. She was confirmed to be a case of scrub typhus after immunoglobulin M enzyme-linked immunosorbent assay for the disease. Scrub typhus is a matter of great public health importance that all medical practitioners should be sensitized about this disease and its varying presentations and complications

Colchicine induced polyploidy in coriander (Coriandrum sativum L.)

The aim of this study was to find a suitable treatment combination that would effectively induce polyploidy in Coriander. In this study, colchicine concentrations and treatment durations were examined for improving the induction of polyploidy. The combinations of three colchicine concentrations such as 0.1%, 0.2% and 0.3% for 3 hrs per day for two to three days were tested in coriander. Three tetraploids were obtained in 0.2% colchicine treated population. The treatment of colchicine (cotton swab method) seedling with 0.2% for 3 days was suitable for induction of chromosome doubling. The control plant showed eleven bivalents (2n=2x=22) and polyploid plant showed twenty two bivalents (2n=4x=44) at diakinesis/metaphase-I in most of the PMCs. Anaphase-I distribution of chromosomes was normal (11:11) in control and in tetraploids distribution of chromosomes was (22:22) at each poles. In contrast with the normal plants, those treated by colchicine treatment often showed changes in height and width, in thickness of branches, in size, shape, texture of leaves, flowers, size of fruits and seed setting

Statistical Analysis to Evaluate the Impact of Quality Control and Quality Assurance on the Aircraft Maintenance Turnaround Time

The turnover time for aircraft maintenance is crucial for the operational efficiency and profitability of airlines. Quality assurance (QA) and quality control (QC) procedures play a role in assuring the safe and reliable operation of aircraft. The purpose of this paper is to evaluate the impact of QC and QA on turnover time and to propose strategies for achieving a balance between quality and efficiency. A large-scale survey of airline and aviation maintenance organization maintenance staff was combined with a literature study to form a mixed-methods strategy. The findings indicate that quality control and quality assurance have a substantial impact on the turnaround time for aircraft maintenance. Standardization, automation, collaboration, training, and regulation were identified as obstacles and best practices for enhancing QC and QA. Recognizing the intricate relationship between QC, QA, and turnaround time, the paper concludes by recommending future research and practices to enhance aircraft maintenance quality and efficiency