Dynamic Internal Message Routing in Distributed File System

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F15%3A43926862" target="_blank" >RIV/49777513:23520/15:43926862 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Dynamic Internal Message Routing in Distributed File System

Popis výsledku v původním jazyce

We introduce dynamic internal message routing algorithm in overlay network used by distributed file system. Messages containing system requests are usually smaller than messages carrying data, but their number is much higher. Each kind of message has special requirements on quality of service. Messages carrying data require high bandwidth. Messages containing system requests are crucial for system function. They manage system operations, like replication, synchronization, locking, and metadata transferexchange, and consequently, need as low latency as possible. We describe design and implementation of routing algorithm, which takes into account different quality of service requirements based on kind of message. Messages are classified by quality of service requirements. Class of the message determines the chosen route. Proposed concept has been proved on experimental distributed file system developed in the Department. We have verified that optimization of dynamic routing of system re

Název v anglickém jazyce

Dynamic Internal Message Routing in Distributed File System

Popis výsledku anglicky

We introduce dynamic internal message routing algorithm in overlay network used by distributed file system. Messages containing system requests are usually smaller than messages carrying data, but their number is much higher. Each kind of message has special requirements on quality of service. Messages carrying data require high bandwidth. Messages containing system requests are crucial for system function. They manage system operations, like replication, synchronization, locking, and metadata transferexchange, and consequently, need as low latency as possible. We describe design and implementation of routing algorithm, which takes into account different quality of service requirements based on kind of message. Messages are classified by quality of service requirements. Class of the message determines the chosen route. Proposed concept has been proved on experimental distributed file system developed in the Department. We have verified that optimization of dynamic routing of system re

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2015

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 statě ve sborníku

2015 IEEE 13th International Scientific Conference on Informatics, INFORMATICS 2015

ISBN

978-1-4673-9867-1

ISSN

—

e-ISSN

—

Počet stran výsledku

5

Strana od-do

236-240

Název nakladatele

IEEE

Místo vydání

Piscataway

Místo konání akce

Poprad

Datum konání akce

18. 11. 2015

Typ akce podle státní příslušnosti

EUR - Evropská akce

Kód UT WoS článku

—