Fair and Efficient Scheduling Strategies for Satellite Assisted Quantum Key Distribution Systems

Satellite-based quantum key distribution (QKD) systems use constellations of satellites to assist secret key generation among ground station pairs that are far away from each other. In this paper, we study satellite scheduling to establish secret keys among ground station pairs in a fair and efficient manner. While satellite scheduling has been considered in the past, existing scheduling algorithms are not for QKD, and have not explicitly accounted for fairness of resource allocation among ground station pairs. We propose three satellite scheduling strategies that have different tradeoffs in fairness and computational overhead. Using extensive simulation, we evaluate these strategies in a wide range of settings, while considering realistic environmental conditions (time-of-day, cloud coverage). Our results demonstrate that they achieve significantly better fairness at the cost of slightly lower overall number of keys when compared to a baseline strategy that has no fairness considerations.

Authors

Institutions

Publication Details

Published
2024-09-15
DOI
https://doi.org/10.1109/qce60285.2024.00208
Citations
4
Primary Topic
Quantum Information and Cryptography
Type
article
Field-Weighted Citation Impact
1.39

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fair and Efficient Scheduling Strategies for Satellite Assisted Quantum Key Distribution Systems

Nitish K. Panigrahy, Walter O. Krawec, Don Towsley, R. William Maule et al.
4 citations
Quantum Information and Cryptography
1.39
article

Fair and Efficient Scheduling Strategies for Satellite Assisted Quantum Key Distribution Systems

Nitish K. Panigrahy, Walter O. Krawec, Don Towsley, R. William Maule, Prajit Dhara, Deirdre Kilbane, Naga Lakshmi Anipeddi, Bing Wang, Md. Zakir Hossain
article en
4 citations

Abstract

Satellite-based quantum key distribution (QKD) systems use constellations of satellites to assist secret key generation among ground station pairs that are far away from each other. In this paper, we study satellite scheduling to establish secret keys among ground station pairs in a fair and efficient manner. While satellite scheduling has been considered in the past, existing scheduling algorithms are not for QKD, and have not explicitly accounted for fairness of resource allocation among ground station pairs. We propose three satellite scheduling strategies that have different tradeoffs in fairness and computational overhead. Using extensive simulation, we evaluate these strategies in a wide range of settings, while considering realistic environmental conditions (time-of-day, cloud coverage). Our results demonstrate that they achieve significantly better fairness at the cost of slightly lower overall number of keys when compared to a baseline strategy that has no fairness considerations.

Binghamton University (US), University of Arizona (US), University of Connecticut (US), University of Massachusetts Amherst (US), South East Technological University (IE), Waterford Institute of Technology (IE)
National Science Foundation
Openalex Percentile: Top 15%
Quantum Information and Cryptography
1.39
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.