A Novel Approach to Quality-of-Service Provisioning in Trusted Relay Quantum Key Distribution Networks

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F20%3A10244746" target="_blank" >RIV/61989100:27240/20:10244746 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61989100:27740/20:10244746

Výsledek na webu

<a href="https://ieeexplore.ieee.org/document/8935373" target="_blank" >https://ieeexplore.ieee.org/document/8935373</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/TNET.2019.2956079" target="_blank" >10.1109/TNET.2019.2956079</a>

Jazyk výsledku

angličtina

Název v původním jazyce

A Novel Approach to Quality-of-Service Provisioning in Trusted Relay Quantum Key Distribution Networks

Popis výsledku v původním jazyce

In recent years, noticeable progress has been made in the development of quantum equipment, reflected through the number of successful demonstrations of Quantum Key Distribution (QKD) technology. Although they showcase the great achievements of QKD, many practical difficulties still need to be resolved. Inspired by the significant similarity between mobile ad-hoc networks and QKD technology, we propose a novel quality of service (QoS) model including new metrics for determining the states of public and quantum channels as well as a comprehensive metric of the QKD link. We also propose a novel routing protocol to achieve high-level scalability and minimize consumption of cryptographic keys. Given the limited mobility of nodes in QKD networks, our routing protocol uses the geographical distance and calculated link states to determine the optimal route. It also benefits from a caching mechanism and detection of returning loops to provide effective forwarding while minimizing key consumption and achieving the desired utilization of network links. Simulation results are presented to demonstrate the validity and accuracy of the proposed solutions.

Název v anglickém jazyce

A Novel Approach to Quality-of-Service Provisioning in Trusted Relay Quantum Key Distribution Networks

Popis výsledku anglicky

In recent years, noticeable progress has been made in the development of quantum equipment, reflected through the number of successful demonstrations of Quantum Key Distribution (QKD) technology. Although they showcase the great achievements of QKD, many practical difficulties still need to be resolved. Inspired by the significant similarity between mobile ad-hoc networks and QKD technology, we propose a novel quality of service (QoS) model including new metrics for determining the states of public and quantum channels as well as a comprehensive metric of the QKD link. We also propose a novel routing protocol to achieve high-level scalability and minimize consumption of cryptographic keys. Given the limited mobility of nodes in QKD networks, our routing protocol uses the geographical distance and calculated link states to determine the optimal route. It also benefits from a caching mechanism and detection of returning loops to provide effective forwarding while minimizing key consumption and achieving the desired utilization of network links. Simulation results are presented to demonstrate the validity and accuracy of the proposed solutions.

Druh

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

CEP obor

—

OECD FORD obor

20203 - Telecommunications

Projekt

<a href="/cs/project/EF16_027%2F0008463" target="_blank" >EF16_027/0008463: Věda bez hranic</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

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

IEEE-ACM TRANSACTIONS ON NETWORKING

ISSN

1063-6692

e-ISSN

—

Svazek periodika

28

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

14

Strana od-do

168-181

Kód UT WoS článku

000519725800013

EID výsledku v databázi Scopus

—