Intelligent routing based on reinforcement learning for software-defined networking

DM Casas-Velasco, OMC Rendon… - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
Traditional routing protocols employ limited information to make routing decisions, which
can lead to a slow adaptation to traffic variability, as well as restricted support to the Quality …

Comparison of routing algorithms with static and dynamic link cost in software defined networking (SDN)

E Akin, T Korkmaz - IEEE Access, 2019 - ieeexplore.ieee.org
In this paper, we compared the existing routing algorithms in the context of Software Defined
Networking (SDN), where a logically centralized controller acquires the global view of the …

The minimum interference p-cycle algorithm for protection of space division multiplexing elastic optical networks

HMNS Oliveira, NLS da Fonseca - 2016 8th IEEE Latin …, 2016 - ieeexplore.ieee.org
In optical networks, failures can imply in great loss of data due to high transmission rates,
leading to the need of employment of protection mechanisms. This paper introduces a novel …

Comparison of routing algorithms with static and dynamic link cost in SDN

E Akin, T Korkmaz - 2019 16th IEEE Annual Consumer …, 2019 - ieeexplore.ieee.org
There are several routing algorithms that can be used in the context of Software Defined
Networking (SDN), where a logically centralized controller obtains the global view of the …

An exploration of aggregation convergecast scheduling

E De Souza, I Nikolaidis - Ad Hoc Networks, 2013 - Elsevier
We consider the problem of aggregation convergecast scheduling as it applies to wireless
networks. The solution to aggregation convergecast satisfies the aggregation process …

The minimum interference p-cycle algorithm for protection of space division multiplexing elastic optical networks

HMN da Silva Oliveira… - IEEE Latin America …, 2017 - ieeexplore.ieee.org
In optical networks, failures can imply in great loss of data due to high transmission rates,
leading to the need of employment of protection mechanisms. This paper introduces a novel …

Обзор технологических и теоретических решений в области маршрутизации на основе качества обслуживания

ОЮ Евсеева, СВ Гаркуша - 2012 - dspace.puet.edu.ua
Проведен обзор решений задач маршру-тизации на основе качества обслуживания,
включаю-щий как протокольные варианты, так и теоретиче-ские решения, которые …

Temporal routing metrics for networks with advance reservations

C Barz, M Pilz, A Wichmann - 2008 Eighth IEEE International …, 2008 - ieeexplore.ieee.org
Usually, dynamic routing metrics consider the instantaneous load and the static structure of
a network to determine an optimal path. This paper proposes an extension of the path …

Using link-level latency analysis for path selection for real-time communication on NoCs

H Kashif, HD Patel… - 17th Asia and South Pacific …, 2012 - ieeexplore.ieee.org
We present a path selection algorithm that is used when deploying hard real-time traffic
flows onto a chip-multiprocessor system. This chip-multiprocessor system uses a priority …

[PDF][PDF] FMIRA: a fast and efficient traffic engineering method for transport networks

P Fodor, G Enyedi, T Cinkler - MPLS/GMPLS Workshop, 2006 - researchgate.net
Link weight setting methods are well recognized to increase the throughput of routing in
modern transport networks. Minimum interference routing algorithms provide better …