Addressing Bandwidth-driven Flow Allocation in RINA

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F20%3APU138648" target="_blank" >RIV/00216305:26230/20:PU138648 - isvavai.cz</a>

Výsledek na webu

<a href="https://www.mdpi.com/2073-431X/9/3/63" target="_blank" >https://www.mdpi.com/2073-431X/9/3/63</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.3390/computers9030063" target="_blank" >10.3390/computers9030063</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Addressing Bandwidth-driven Flow Allocation in RINA

Popis výsledku v původním jazyce

Effective capacity allocation is essential for a network to operate properly, providing predictable quality of service guarantees and avoiding bottlenecks. Achieving capacity allocation fairness is a long-standing problem extensively researched in the frame of transport and network layer protocols such as TCP/IP. The Recursive InterNetwork Architecture offers programmable policies that enable more flexible control on the mechanics of network flow allocation. In this paper, we present our version of one of these policies, which provides flow allocation according to the bandwidth requirements of requesting applications. We implement the bandwidth-aware flow allocation policy by extending rlite, an open source RINA implementation. Our evaluation shows how the policy can prevent links from becoming oversaturated and use alternate paths to achieve high total link data-rate use.

Název v anglickém jazyce

Addressing Bandwidth-driven Flow Allocation in RINA

Popis výsledku anglicky

Effective capacity allocation is essential for a network to operate properly, providing predictable quality of service guarantees and avoiding bottlenecks. Achieving capacity allocation fairness is a long-standing problem extensively researched in the frame of transport and network layer protocols such as TCP/IP. The Recursive InterNetwork Architecture offers programmable policies that enable more flexible control on the mechanics of network flow allocation. In this paper, we present our version of one of these policies, which provides flow allocation according to the bandwidth requirements of requesting applications. We implement the bandwidth-aware flow allocation policy by extending rlite, an open source RINA implementation. Our evaluation shows how the policy can prevent links from becoming oversaturated and use alternate paths to achieve high total link data-rate use.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/LQ1602" target="_blank" >LQ1602: IT4Innovations excellence in science</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2020

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Computers

ISSN

2073-431X

e-ISSN

—

Svazek periodika

9

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

CH - Švýcarská konfederace

Počet stran výsledku

23

Strana od-do

1-23

Kód UT WoS článku

000578133800001

EID výsledku v databázi Scopus

2-s2.0-85090259699