GLORIA

GEOMAR Library Ocean Research Information Access

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Auricle Technologies, Pvt., Ltd.  (3)
Material
Publisher
  • Auricle Technologies, Pvt., Ltd.  (3)
Language
Years
  • 1
    Online Resource
    Online Resource
    Auricle Technologies, Pvt., Ltd. ; 2023
    In:  International Journal on Recent and Innovation Trends in Computing and Communication Vol. 11, No. 8s ( 2023-08-18), p. 20-31
    In: International Journal on Recent and Innovation Trends in Computing and Communication, Auricle Technologies, Pvt., Ltd., Vol. 11, No. 8s ( 2023-08-18), p. 20-31
    Abstract: 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.
    Type of Medium: Online Resource
    ISSN: 2321-8169
    Language: Unknown
    Publisher: Auricle Technologies, Pvt., Ltd.
    Publication Date: 2023
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    Auricle Technologies, Pvt., Ltd. ; 2023
    In:  International Journal on Recent and Innovation Trends in Computing and Communication Vol. 11, No. 9s ( 2023-08-31), p. 553-567
    In: International Journal on Recent and Innovation Trends in Computing and Communication, Auricle Technologies, Pvt., Ltd., Vol. 11, No. 9s ( 2023-08-31), p. 553-567
    Abstract: 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.
    Type of Medium: Online Resource
    ISSN: 2321-8169
    Language: Unknown
    Publisher: Auricle Technologies, Pvt., Ltd.
    Publication Date: 2023
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Auricle Technologies, Pvt., Ltd. ; 2021
    In:  INFORMATION TECHNOLOGY IN INDUSTRY Vol. 9, No. 1 ( 2021-03-09), p. 562-568
    In: INFORMATION TECHNOLOGY IN INDUSTRY, Auricle Technologies, Pvt., Ltd., Vol. 9, No. 1 ( 2021-03-09), p. 562-568
    Abstract: In this paper, we evaluate Melin-Barnes integral representation of (p,s,k) Mittag Leffler function. Sumudu transform have been used in the generaliztion of Mittag Leffler function Also we establish some corollary of a special cases. Some new result are our finding.
    Type of Medium: Online Resource
    ISSN: 2203-1731
    Language: Unknown
    Publisher: Auricle Technologies, Pvt., Ltd.
    Publication Date: 2021
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...