Modeling adaptive routing system in link-state computer networks

Article Sidebar

PDF
Number of views 5

Published: Feb 28, 2026
Issue
No. 284 (2026): 16th ISPC «International Forum: Problems and Scientific Solutions» (February 26-28, 2026; Melbourne, Australia).
Section
Information and Web technologies
Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Main Article Content

Yaromyr Snaichuk
Rostyslav Liskevych
Kvitoslava Obelovska

Abstract

Routing in link-state computer networks is commonly performed using fixed or slowly varying link weights built on the channel bandwidth, which may be insufficient to represent non-stationary degradations of quality of service (QoS) under dynamic traffic conditions.


Google Scholar


Article Details

How to Cite
Snaichuk, Y., Liskevych, R., & Obelovska, K. (2026). Modeling adaptive routing system in link-state computer networks. Scientific Collection «InterConf», (284), 78–80. Retrieved from https://archive.interconf.center/index.php/conference-proceeding/article/view/7852

References

Liu, Hongyu, Hong Ni, and Rui Han. "A Link Status-Based Multipath Scheduling Scheme on Network Nodes." Electronics 13.3 (2024): 608.

Luo, Yi, and Qiong Li. "Trust-Aware Causal Consistency Routing for Quantum Key Distribution Networks Against Malicious Nodes." Entropy 27.11 (2025): 1100.

Jelassi, Tawfik. "Towards an Internet of Trust—UNESCO’s Guidelines for the Governance of Digital Platforms." LMDE Conference. Cham: Springer Nature Switzerland, 2023.