EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

A Convergence-Aware Cheetah Chase Algorithm for Dynamic Network Routing with Novel Convergence Time and Rate Formulation

Goudhaman Marimuthu

Journal of Intelligent Decision Making and Information Science · 09.09.2026 · 3 (18s) · 2628-2639

DOI: 10.17762/jidmis.v3.6026 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Intelligent Decision Making and Information Science, online erschienen am 09.09.2026. Verfasst von Goudhaman Marimuthu. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In dynamic network environments, the efficiency of routing algorithms is often determined by their ability to converge quickly and stably to the shortest path. Traditional routing algorithms, such as RIP, OSPF, and BGP, frequently face challenges in achieving consistent convergence, leading to increased latency, routing loops, and suboptimal performance. To address these issues, this research introduces novel metrics for Convergence Time and Convergence Rate aimed at achieving minimum path distance while ensuring a stable and reliable convergence process. The Convergence Time metric quantifies the duration required for an algorithm to identify the shortest path in a network, focusing on minimizing delays caused by topology changes or link failures. The Convergence Rate metric, on the other hand, evaluates the stability and predictability of the convergence process, ensuring that the routing decisions remain consistent and efficient over time. These metrics provide a dual-layered optimization framework, balancing speed and stability in path selection. The proposed methodology integrates these metrics into the design and evaluation of routing algorithms, offering a comprehensive approach to performance enhancement. Through simulations and comparative analysis, the new metrics demonstrate their effectiveness in reducing path costs, improving routing accuracy, and maintaining stability in both static and dynamic network scenarios.

Zitieren

APA

Marimuthu, G. (2026). A Convergence-Aware Cheetah Chase Algorithm for Dynamic Network Routing with Novel Convergence Time and Rate Formulation. Journal of Intelligent Decision Making and Information Science, 3(18s), 2628-2639. https://doi.org/10.17762/jidmis.v3.6026

Vancouver

Marimuthu G. A Convergence-Aware Cheetah Chase Algorithm for Dynamic Network Routing with Novel Convergence Time and Rate Formulation. Journal of Intelligent Decision Making and Information Science. 2026;3(18s):2628-2639. doi:10.17762/jidmis.v3.6026

BibTeX
@article{Marimuthu2026,
  author = {Marimuthu, Goudhaman},
  title = {A Convergence-Aware Cheetah Chase Algorithm for Dynamic Network Routing with Novel Convergence Time and Rate Formulation},
  journal = {Journal of Intelligent Decision Making and Information Science},
  year = {2026},
  volume = {3},
  number = {18s},
  pages = {2628--2639},
  doi = {10.17762/jidmis.v3.6026}
}
Kostenlos starten →