Scalable Scheduling Policies for Quantum Satellite Networks

• URL: http://arxiv.org/abs/2405.09464v1
• Date: Wed, 15 May 2024 15:58:12 GMT
• Title: Scalable Scheduling Policies for Quantum Satellite Networks
• Authors: Albert Williams, Nitish K. Panigrahy, Andrew McGregor, Don Towsley,
• Abstract summary: We consider the problem of transmission scheduling in quantum satellite networks subject to resource constraints at the satellites and ground stations. We show that the most general problem of assigning satellites to ground station pairs for entanglement distribution is NP-hard. We propose four scalable algorithms and evaluate their performance for Starlink mega constellation.
• Score: 10.91414940065524
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: As Low Earth Orbit (LEO) satellite mega constellations continue to be deployed for satellite internet and recent successful experiments in satellite-based quantum entanglement distribution emerge, a natural question arises: How should we coordinate transmissions and design scalable scheduling policies for a quantum satellite internet? In this work, we consider the problem of transmission scheduling in quantum satellite networks subject to resource constraints at the satellites and ground stations. We show that the most general problem of assigning satellites to ground station pairs for entanglement distribution is NP-hard. We then propose four heuristic algorithms and evaluate their performance for Starlink mega constellation under various amount of resources and placements of the ground stations. We find that the maximum number of receivers necessary per ground station grows very slowly with the total number of deployed ground stations. Our proposed algorithms, leveraging optimal weighted b-matching and the global greedy heuristic, outperform others in entanglement distribution rate, entanglement fidelity, and handover cost metrics. While we develop these scheduling algorithms, we have also designed a software system to simulate, visualize, and evaluate satellite mega-constellations for entanglement distribution.

Related papers

• A Distance Similarity-based Genetic Optimization Algorithm for Satellite Ground Network Planning Considering Feeding Mode [53.71516191515285]
  The low transmission efficiency of the satellite data relay back mission has become a problem that is currently constraining the construction of the system. We propose a distance similarity-based genetic optimization algorithm (DSGA), which considers the state characteristics between the tasks. The results of simulation experiments show that the DSGA can effectively solve the SGNPFM problem.
  arXiv  Detail & Related papers  (2024-08-29T06:57:45Z)
• Quantum Annealing-Based Algorithm for Efficient Coalition Formation Among LEO Satellites [4.737806718785056]
  As the number of satellites increases, the number of communication links to maintain also rises. This paper formulates the clustering of LEO satellites as a coalition structure generation (CSG) problem. We obtain the optimal partitions using a hybrid quantum-classical algorithm called GCS-Q. Our experiments, conducted using the D-Wave Advantage annealer and the state-of-the-art solver Gurobi, demonstrate that the quantum annealer significantly outperforms classical methods in terms of runtime.
  arXiv  Detail & Related papers  (2024-08-12T08:53:46Z)
• Entanglement Distribution in Satellite-based Dynamic Quantum Networks [10.445684354981847]
  Low Earth Orbit (LEO) satellites present a compelling opportunity for the establishment of a global quantum information network. Existing works often do not account for satellite movement over time when distributing entanglement and/or often do not permit entanglement distribution along inter-satellite links. We first define a system model which considers both satellite movement over time and inter-satellite links.
  arXiv  Detail & Related papers  (2023-06-15T06:56:26Z)
• Optimal Entanglement Distribution using Satellite Based Quantum Networks [16.797145253236607]
  Satellite quantum communication can distribute high quality quantum entanglements among ground stations that are geographically separated at very long distances. This work focuses on optimal distribution of bipartite entanglements to a set of pair of ground stations using a constellation of orbiting satellites.
  arXiv  Detail & Related papers  (2022-05-24T20:32:00Z)
• A CubeSat platform for space based quantum key distribution [62.997667081978825]
  We report on the follow-up mission of SpooQy-1, a 3U CubeSat that successfully demonstrated the generation of polarization-entangled photons in orbit. The next iteration of the mission will showcase satellite-to-ground quantum key distribution based on a compact source of polarization-entangled photon-pairs. We briefly describe the design of the optical ground station that we are currently building in Singapore for receiving the quantum signal.
  arXiv  Detail & Related papers  (2022-04-23T06:28:43Z)
• Learning Emergent Random Access Protocol for LEO Satellite Networks [51.575090080749554]
  We propose a novel grant-free random access solution for LEO SAT networks, dubbed emergent random access channel protocol (eRACH) eRACH is a model-free approach that emerges through interaction with the non-stationary network environment. Compared to RACH, we show from various simulations that our proposed eRACH yields 54.6% higher average network throughput.
  arXiv  Detail & Related papers  (2021-12-03T07:44:45Z)
• Exploiting potentialities for space-based quantum communication network: downlink quantum key distribution modelling and scheduling analysis [8.25191890593706]
  We consider an evolved quantum network from a near-term form, in which a space-based relay, satellite executes a sequence of satellite-based quantum key distribution missions. We develop a comprehensive framework for the dynamic simulation of SatQKD and consider scheduling QKD downlink in future space-based quantum communication network.
  arXiv  Detail & Related papers  (2021-06-02T07:10:08Z)
• Realizing quantum nodes in space for cost-effective, global quantum communication: in-orbit results and next steps [94.08853042978113]
  SpooQy-1 is a satellite developed at the Centre for Quantum Technologies. It has successfully demonstrated the operation of an entangled photon pair source on a resource-constrained CubeSat platform.
  arXiv  Detail & Related papers  (2021-04-22T02:59:23Z)
• Entanglement demonstration on board a nano-satellite [76.84500123816078]
  Quantum networks for secure communication can be realised using large fleets of satellites distributing entangled photon-pairs between ground-based nodes. This paper describes a miniaturised, polarization entangled, photon-pair source operating on board a nano-satellite.
  arXiv  Detail & Related papers  (2020-06-25T14:11:56Z)
• Integrating LEO Satellite and UAV Relaying via Reinforcement Learning for Non-Terrestrial Networks [51.05735925326235]
  A mega-constellation of low-earth orbit (LEO) satellites has the potential to enable long-range communication with low latency. We study the problem of forwarding packets between two faraway ground terminals, through an LEO satellite selected from an orbiting constellation. To maximize the end-to-end data rate, the satellite association and HAP location should be optimized. We tackle this problem using deep reinforcement learning (DRL) with a novel action dimension reduction technique.
  arXiv  Detail & Related papers  (2020-05-26T05:39:27Z)
• Quantum repeaters in space [0.0]
  Long-distance entanglement is a very precious resource, but its distribution is difficult due to the exponential losses of light in optical fibres. We propose to combine quantum repeaters and satellite-based links, into a scheme that allows to achieve entanglement distribution over global distances. The integration of satellite-based links with ground repeater networks can be envisaged to represent the backbone of the future Quantum Internet.
  arXiv  Detail & Related papers  (2020-05-20T15:43:42Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.